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="S{\'y}kora, Ondrej"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved upper bound on the crossing number of the hypercube
Luerbio Faria
,
Celina Miraglia Herrera de Figueiredo
,
Ondrej Sýkora
,
Imrich Vrt'o
Journal of Graph Theory
59
(2), 2008, pp. 145-161
New exact results and bounds for bipartite crossing numbers of meshes
Matthew C. Newton
,
Ondrej Sýkora
,
Martin Uz̑ovic̑
,
Imrich Vrt'o
Lecture Notes in Computer Science
3383
, 2004, pp. 360-370
Bounds and methods for
k
-planar crossing numbers
Farhad Shahrokhi
,
Ondrej Sýkora
,
Laszlo A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
2912
, 2004, pp. 37-46
An improved upper bound on the crossing number of the hypercube
Luerbio Faria
,
Celina M. Herrera de Figueiredo
,
Ondrej Sýkora
,
Imrich Vrt'o
Lecture Notes in Computer Science
2880
, 2003, pp. 230-236
Bounds for convex crossing numbers
Farhad Shahrokhi
,
Ondrej Sýkora
,
Laszlo A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
2697
, 2003, pp. 487-495
Two new heuristics for two-sided bipartite graph drawing
Matthew Newton
,
Ondrej Sýkora
,
Imrich Vrt'o
Lecture Notes in Computer Science
2528
, 2002, pp. 312-319
Fractional lengths and crossing numbers
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
2528
, 2002, pp. 186-192
Evolutionary graph colouring
Stefan Dobrev
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt'o
Information Processing Letters
76
(1-2), 2000, pp. 91-94
Diameter of the Knödel graph
Guillaume Fertin
,
André Raspaud
,
Heiko Schröder
,
Ondrej Sýkora
,
Imrich Vrt̑o
Lecture Notes in Computer Science
1928
, 2000, pp. 149-160
A new lower bound for the bipartite crossing number with applications
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'o
Theoretical Computer Science
245
(2), 2000, pp. 281-294
Domination and Steiner tree problems on graphs with few
P_4
s
Luitpold Babel
,
Stephan Olariu
Lecture Notes in Computer Science
1517
, 1998, pp. 337-350
Drawing planar partitions II: HH-drawings
Therese Biedl
,
Michael Kaufmann
,
Petra Mutzel
Lecture Notes in Computer Science
1517
, 1998, pp. 124-136
Communication in the two-way listen-in vertex-disjoint paths mode
Hans-Joachim Böckenhauer
Lecture Notes in Computer Science
1517
, 1998, pp. 38-49
A generalization of AT-free graphs and a generic algortihm for solving treewidth, minimum fill-in and vertex ranking
Hajo Broersma
,
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Lecture Notes in Computer Science
1517
, 1998, pp. 88-99
Graphs with bounded induced distance
Serafino Cicerone
,
Gabriele di Stefano
Lecture Notes in Computer Science
1517
, 1998, pp. 177-191
Diameter determination on restricted graph families
Derek G. Corneil
,
Feodor F. Dragan
,
Michel Habib
,
Christophe Paul
Lecture Notes in Computer Science
1517
, 1998, pp. 192-202
Linear time solvable optimization problems on graphs of bounded clique width
B. Courcelle
,
J.A. Makowsky
,
U. Rotics
Lecture Notes in Computer Science
1517
, 1998, pp. 1-16
Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs
Elias Dahlhaus
Lecture Notes in Computer Science
1517
, 1998, pp. 351-358
Minus domination in small-degree graphs
Peter Damaschke
Lecture Notes in Computer Science
1517
, 1998, pp. 17-25
Broadcasting on anonymous unoriented tori
Stefan Dobrev
,
Peter Ruz̑ic̑ka
Lecture Notes in Computer Science
1517
, 1998, pp. 50-62
Splitting number is
NP
-complete
L. Faria
,
C.M.H. de Figueiredo
,
C.F.X. Mendonça
Lecture Notes in Computer Science
1517
, 1998, pp. 285-297
Tree spanners in planar graphs
Sándor P. Fekete
,
Jana Kremer
Lecture Notes in Computer Science
1517
, 1998, pp. 298-309
Triangles in Euclidean arrangements
Stefan Felsner
,
Klaus Kriegel
Lecture Notes in Computer Science
1517
, 1998, pp. 137-148
Families of graphs having broadcasting and gossiping properties
Guillaume Fertin
,
André Raspaud
Lecture Notes in Computer Science
1517
, 1998, pp. 63-77
Interval completion with the smallest max-degree
Fedor V. Fomin
,
Petr A. Golovach
Lecture Notes in Computer Science
1517
, 1998, pp. 359-371
Seiten 1
2
3
>