Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Sahni, Sartaj"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Boxicity and poset dimension
Abhijin Adiga
,
Diptendu Bhowmick
,
L. Sunil Chandran
Lecture Notes in Computer Science
6196
, 2010, pp. 3-12
Effect of corner information in simultaneous placement of
k
rectangles and tableaux
Shinya Anzai
,
Jinhee Chun
,
Ryosei Kasai
,
Matias Korman
,
Takeshi Tokuyama
Lecture Notes in Computer Science
6196
, 2010, pp. 235-243
Approximate weighted farthest neighbors and minimum dilation stars
John Augustine
,
David Eppstein
,
Kevin A. Wortman
Lecture Notes in Computer Science
6196
, 2010, pp. 90-99
Computing graph spanners in small memory: Fault-tolerance and streaming
Giorgio Ausiello
,
Paolo G. Franciosa
,
Giuseppe F. Italiano
,
Andrea Ribichini
Lecture Notes in Computer Science
6196
, 2010, pp. 160-172
Triangle-free 2-matchings revisited
Maxim Babenko
,
Alexey Gusakov
,
Ilya Razenshteyn
Lecture Notes in Computer Science
6196
, 2010, pp. 120-129
Threshold rules for online sample selection
Eric Bach
,
Shuchi Chawla
,
Seeun Umboh
Lecture Notes in Computer Science
6196
, 2010, pp. 489-499
Exact and approximation algorithms for geometric and capacitated set cover problems
Piotr Berman
,
Marek Karpinski
,
Andrzej Lingas
Lecture Notes in Computer Science
6196
, 2010, pp. 226-234
Minimum-segment convex drawings of 3-connected cubic plane graphs
Sudip Biswas
,
Debajyoti Mondal
,
Rahnuma Islam Nishat
,
Md. Saidur Rahman
Lecture Notes in Computer Science
6196
, 2010, pp. 182-191
Understanding and inductive inference
Manuel Blum
Lecture Notes in Computer Science
6196
, 2010, pp. 1-1
Factorization of Cartesian products of hypergraphs
Alain Bretto
,
Yannick Silvestre
Lecture Notes in Computer Science
6196
, 2010, pp. 173-181
Tracking a generator by persistence
Oleksiy Busaryev
,
Tamal K. Dey
,
Yusu Wang
Lecture Notes in Computer Science
6196
, 2010, pp. 278-287
The complexity of word circuits
Xue Chen
,
Guangda Hu
,
Xiaoming Sun
Lecture Notes in Computer Science
6196
, 2010, pp. 308-317
A three-string approach to the closest string problem
Zhi-Zhong Chen
,
Bin Ma
,
Lusheng Wang
Lecture Notes in Computer Science
6196
, 2010, pp. 449-458
A
2k
kernel for the cluster editing problem
Jianer Chen
,
Jie Meng
Lecture Notes in Computer Science
6196
, 2010, pp. 459-468
On sorting permutations by double-cut-and-joins
Xin Chen
Lecture Notes in Computer Science
6196
, 2010, pp. 439-448
Zero-knowledge argument for simultaneous discrete logarithms
Sherman S.M. Chow
,
Changshe Ma
,
Jian Weng
Lecture Notes in Computer Science
6196
, 2010, pp. 520-529
Tile-packing tomography is
\mathbb{NP}
-hard
Marek Chrobak
,
Christoph Dürr
,
Flavio Guíñez
,
Antoni Lozano
,
Nguyen Kim Thang
Lecture Notes in Computer Science
6196
, 2010, pp. 254-263
On three parameters of invisibility graphs
Josef Cibulka
,
Jan Kync̑l
,
Viola Mészáros
,
Rudolf Stolaȓ
,
Pavel Valtr
Lecture Notes in Computer Science
6196
, 2010, pp. 192-198
Approximate counting with a floating-point counter
Miklós Csŭrös
Lecture Notes in Computer Science
6196
, 2010, pp. 358-367
Detecting areas visited regularly
Bojan Djordjevic
,
Joachim Gudmundsson
Lecture Notes in Computer Science
6196
, 2010, pp. 244-253
The longest almost-increasing subsequence
Amr Elmasry
Lecture Notes in Computer Science
6196
, 2010, pp. 338-347
The violation heap: A relaxed Fibonacci-like heap
Amr Elmasry
Lecture Notes in Computer Science
6196
, 2010, pp. 479-488
Auspicious tatami mat arrangements
Alejandro Erickson
,
Frank Ruskey
,
Mark Schurch
,
Jennifer Woodcock
Lecture Notes in Computer Science
6196
, 2010, pp. 288-297
The rectilinear
k
-bends TSP
Vladimir Estivill-Castro
,
Apichat Heednacram
,
Francis Suraweera
Lecture Notes in Computer Science
6196
, 2010, pp. 264-277
Contention resolution in multiple-access channels:
k
-selection in radio networks
Antonio Fernández Anta
,
Miguel A. Mosteiro
Lecture Notes in Computer Science
6196
, 2010, pp. 378-388
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>