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="Lucchesi, Cl{\'{a}}udio L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graphs with independent perfect matchings
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Graph Theory
48
(1), 2005, pp. 19-50
Optimal ear decompositions of matching covered graphs and bases for the matching lattice
Marcelo H. de Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Journal of Combinatorial Theory Series B
85
(1), 2002, pp. 59-93
Ear decompositions of matching covered graphs
Marcelo H. Carvalho
,
Cláudio L. Lucchesi
,
U.S.R. Murty
Combinatorica
19
(2), 1999, pp. 151-174
Short and smooth polygonal paths
James Abello
,
Emden Gansner
Lecture Notes in Computer Science
1380
, 1998, pp. 151-162
Spectral techniques in graph algorithms
Noga Alon
Lecture Notes in Computer Science
1380
, 1998, pp. 206-215
Fast two-dimensional approximate pattern matching
Ricardo Baeza-Yates
,
Gonzalo Navarro
Lecture Notes in Computer Science
1380
, 1998, pp. 341-351
Super-state automata and rational trees
Frédérique Bassino
,
Marie-Pierre Béal
,
Dominique Perrin
Lecture Notes in Computer Science
1380
, 1998, pp. 42-52
An Eilenberg theorem for words on countable ordinals
Nicolas Bedon
,
Olivier Carton
Lecture Notes in Computer Science
1380
, 1998, pp. 53-64
The geometry of browsing
Richard Beigel
,
Egemen Tanin
Lecture Notes in Computer Science
1380
, 1998, pp. 331-340
Batch verification with applications to cryptography and checking
Mihir Bellare
,
Juan A. Garay
,
Tal Rabin
Lecture Notes in Computer Science
1380
, 1998, pp. 170-191
Quantum cryptanalysis of hash and claw-free functions
Gilles Brassard
,
Peter Hyer
,
Alain Tapp
Lecture Notes in Computer Science
1380
, 1998, pp. 163-169
Dynamic packet routing on arrays with bounded buffers
Andrei Z. Broder
,
Alan M. Frieze
,
Eli Upfal
Lecture Notes in Computer Science
1380
, 1998, pp. 273-281
A linear time algorithm to recognize clustered planar graphs and its parallelization
Elias Dahlhaus
Lecture Notes in Computer Science
1380
, 1998, pp. 239-248
A chip search problem on binary numbers
Peter Damaschke
Lecture Notes in Computer Science
1380
, 1998, pp. 11-22
Shape reconstruction with Delaunay complex
Herbert Edelsbrunner
Lecture Notes in Computer Science
1380
, 1998, pp. 119-132
The splitting number of the 4-cube
Luerbio Faria
,
Celina Miraglia Herrera de Figueiredo
,
Candido Ferreira Xavier de Mendonça Neto
Lecture Notes in Computer Science
1380
, 1998, pp. 141-150
Faster non-linear parametric search with applications to optimization and dynamic geometry
David Fernández-Baca
Lecture Notes in Computer Science
1380
, 1998, pp. 33-41
Uniform service systems with
k
servers
Esteban Feuerstein
Lecture Notes in Computer Science
1380
, 1998, pp. 23-32
Fundamental structures in well-structured infinite transition systems
Alain Finkel
,
Philippe Schnoebelen
Lecture Notes in Computer Science
1380
, 1998, pp. 102-118
Bases for non-homogeneous polynomial
C_k
splines on the sphere
Anamaria Gomide
,
Jorge Stolfi
Lecture Notes in Computer Science
1380
, 1998, pp. 133-140
On the clique operator
Marisa Gutierrez
,
João Meidanis
Lecture Notes in Computer Science
1380
, 1998, pp. 261-272
Solving equations in strings: On Makanin's algorithm
Claudio Gutiérrez
Lecture Notes in Computer Science
1380
, 1998, pp. 358-373
Strength of two data encryption standard implementations under timing attacks
Alejandro Hevia
,
Marcos Kiwi
Lecture Notes in Computer Science
1380
, 1998, pp. 192-205
A new characterization for parity graphs and a coloring problem with costs
Klaus Jansen
Lecture Notes in Computer Science
1380
, 1998, pp. 249-260
Circuit covers in series-parallel mixed graphs
Orlando Lee
,
Yoshiko Wakabayashi
Lecture Notes in Computer Science
1380
, 1998, pp. 226-238
Seiten 1
2
>