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="Battista, Giuseppe di"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Turn-regularity and planar orthogonal drawings
Stina S. Bridgeman
,
Giuseppe di Battista
,
Walter Didimo
,
Giuseppe Liotta
,
Roberto Tamassia
,
Luca Vismara
Lecture Notes in Computer Science
1731
, 1999, pp. 8-26
Infinite trees and the future
Camil Demetrescu
,
Giuseppe di Battista
,
Irene Finocchi
,
Giuseppe Liotta
,
Maurizio Patrignani
,
Maurizio Pizzonia
Lecture Notes in Computer Science
1731
, 1999, pp. 379-391
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
Hardness of approximating problems on cubic graphs
Paola Alimonti
,
Viggo Kann
Lecture Notes in Computer Science
1203
, 1997, pp. 288-298
An improved deterministic algorithm for generalized random sampling
Amihood Amir
,
Emanuel Dar
Lecture Notes in Computer Science
1203
, 1997, pp. 159-170
An improved deterministic algorithm for generalized random sampling
Amihood Amir
,
Emanuel Dar
Lecture Notes in Computer Science
1203
, 1997, pp. 159-170
On the complexity of balanced Boolean functions
A. Bernasconi
Lecture Notes in Computer Science
1203
, 1997, pp. 253-263
On the complexity of balanced Boolean functions
A. Bernasconi
Lecture Notes in Computer Science
1203
, 1997, pp. 253-263
Computing orthogonal drawings with the minimum number of bends
Paola Bertolazzi
,
Giuseppe di Battista
,
Walter Didimo
Lecture Notes in Computer Science
1272
, 1997, pp. 331-344
Algorithms and data structures for control dependence and related compiler problems
Gianfranco Bilardi
Lecture Notes in Computer Science
1203
, 1997, pp. 1-2
Algorithms and data structures for control dependence and related compiler problems
Gianfranco Bilardi
Lecture Notes in Computer Science
1203
, 1997, pp. 1-2
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy
Salvatore Caporaso
,
Michele Zito
,
Nicola Galesi
,
Emanuele Covino
Lecture Notes in Computer Science
1203
, 1997, pp. 61-73
Topological chaos for elementary cellular automata
Gianpiero Cattaneo
,
Michele Finelli
,
Luciano Margara
Lecture Notes in Computer Science
1203
, 1997, pp. 241-252
Topological chaos for elementary cellular automata
Gianpiero Cattaneo
,
Michele Finelli
,
Luciano Margara
Lecture Notes in Computer Science
1203
, 1997, pp. 241-252
The algorithmic complexity of chemical threshold testing
Peter Damaschke
Lecture Notes in Computer Science
1203
, 1997, pp. 205-216
The algorithmic complexity of chemical threshold testing
Peter Damaschke
Lecture Notes in Computer Science
1203
, 1997, pp. 205-216
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
An optimal algorithm for one-separation of a set of isothetic polygons
Amitava Datta
,
Kamala Krithivasan
,
Thomas Ottmann
Lecture Notes in Computer Science
1203
, 1997, pp. 110-121
Finding optimum
k
-vertex connected spanning subgraphs: Improved approximation algorithms for
k = 3,4,5
Yefim Dinitz
,
Zeev Nutov
Lecture Notes in Computer Science
1203
, 1997, pp. 13-24
Finding optimum
k
-vertex connected spanning subgraphs: Improved approximation algorithms for
k = 3,4,5
Yefim Dinitz
,
Zeev Nutov
Lecture Notes in Computer Science
1203
, 1997, pp. 13-24
Polynomial time algorithms for some self-duality problems
Carlos Domingo
Lecture Notes in Computer Science
1203
, 1997, pp. 171-180
Polynomial time algorithms for some self-duality problems
Carlos Domingo
Lecture Notes in Computer Science
1203
, 1997, pp. 171-180
Embedding interconnection networks in grids via the layered cross product
Guy Even
,
Shimon Even
Lecture Notes in Computer Science
1203
, 1997, pp. 3-12
Embedding interconnection networks in grids via the layered cross product
Guy Even
,
Shimon Even
Lecture Notes in Computer Science
1203
, 1997, pp. 3-12
Seiten 1
2
3
>