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
[1]
Hilfe
Suche: Author="Vrt'O, Imrich"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The same upper bound for both: The 2-page and the rectilinear crossing numbers of the
n
-cube
Luerbio Faria
,
Celina M.H. de Figueiredo
,
R. Bruce Richter
,
Imrich Vrt'o
Lecture Notes in Computer Science
8165
, 2013, pp. 249-260
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
Planar crossing numbers of genus
g
graphs
Hristo Djidjev
,
Imrich Vrt'o
Lecture Notes in Computer Science
4051
, 2006, pp. 419-430
Two trees which are self-intersecting when drawn simultaneously
Markus Geyer
,
Michael Kaufmann
,
Imrich Vrt'o
Lecture Notes in Computer Science
3843
, 2006, pp. 201-210
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
Layout volumes of the hypercube
Lubomir Torok
,
Imrich Vrt'o
Lecture Notes in Computer Science
3383
, 2004, pp. 414-424
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
An improved lower bound for crossing numbers
Hristo Djidjev
,
Imrich Vrt'o
Lecture Notes in Computer Science
2265
, 2002, pp. 96-101
One sided crossing minimization is
NP
-hard for sparse graphs
Xavier Muñoz
,
W. Unger
,
Imrich Vrt'o
Lecture Notes in Computer Science
2265
, 2002, pp. 115-123
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
Optimal broadcasting in even tori with dynamic faults
Stefan Dobrev
,
Imrich Vrt'o
Lecture Notes in Computer Science
1900
, 2000, pp. 927-930
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
On 3-layer crossings and pseudo arrangements
Farhad Shahrokhi
,
Imrich Vrt'o
Lecture Notes in Computer Science
1731
, 1999, pp. 225-231
Bipartite crossing numbers of meshes and hypercubes
Farhad Shahrokhi
,
Ondrej Sýkora
,
Lászlo A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
1353
, 1998, pp. 37-46
Bisection width of transposition graphs
Ladislav Stacho
,
Imrich Vrt'o
Discrete Applied Mathematics
84
(1-3), 1998, pp. 221-235
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'O
Lecture Notes in Computer Science
1272
, 1997, pp. 55-68
Cutwidth of the mesh of
d
-ary trees
Imrich Vrt'o
Lecture Notes in Computer Science
1300
, 1997, pp. 242-245
Crossing numbers of meshes
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
1027
, 1996, pp. 463-471
The book crossing number of a graph
Farhad Shahrokhi
,
László A. Székely
,
Ondrej Sýkora
,
Imrich Vrt'o
Journal of Graph Theory
21
(4), 1996, pp. 413-424
Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
José Rolim
,
Ondrej Sýkora
,
Imrich Vrt'o
Lecture Notes in Computer Science
1017
, 1995, pp. 252-264
Book embeddings and crossing numbers
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt'o
Lecture Notes in Computer Science
903
, 1995, pp. 256-268
Seiten 1
2
>