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="Dujmovi{\'c}, Vida"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Robust geometric spanners
Prosenjit Bose
,
Vida Dujmović
,
Pat Morin
,
Michiel Smid
SIAM Journal on Computing
42
(4), 2013, pp. 1720-1736
Robust geometric spanners
Prosenjit Bose
,
Vida Dujmović
,
Pat Morin
,
Michiel Smid
Proceedings of the 29th Annual ACM Symposium on Computional Geometry, SoCG'2013 (Rio de Janeiro, Brazil, June 17-20, 2013)
, 2013, pp. 449-458
A linear-time algorithm for finding a complete graph minor in a dense graph
Vida Dujmović
,
Daniel J. Harvey
,
Gwenaël Joret
,
Bruce Reed
,
David R. Wood
SIAM Journal on Discrete Mathematics
27
(4), 2013, pp. 1770-1774
Layered working-set trees
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
John Howat
Algorithmica
63
(1-2), 2012, pp. 476-489
Biased range trees
Vida Dujmović
,
John Howat
,
Pat Morin
Algorithmica
62
(1-2), 2012, pp. 21-37
An improved bound for first-fit on posets without two long incomparable chains
Vida Dujmović
,
Gwenaël Joret
,
David R. Wood
SIAM Journal on Discrete Mathematics
26
(3), 2012, pp. 1068-1075
Every large point set contains many collinear points or an empty pentagon
Zachary Abel
,
Brad Ballinger
,
Prosenjit Bose
,
Sébastien Collette
,
Vida Dujmović
,
Ferran Hurtado
,
Scott Duke Kominers
,
Stefan Langerman
,
Attila Pór
,
David R. Wood
Graphs and Combinatorics
27
(1), 2011, pp. 47-60
On graphs supported by line sets
Vida Dujmović
,
William Evans
,
Stephen Kobourov
,
Giuseppe Liotta
,
Christophe Weibel
,
Stephen Wismath
Lecture Notes in Computer Science
6502
, 2011, pp. 177-182
An
O(\log \log n)
-competitive binary search tree with optimal worst-case access times
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
Rolf Fagerberg
Lecture Notes in Computer Science
6139
, 2010, pp. 38-49
Layered working-set trees
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
John Howat
Lecture Notes in Computer Science
6034
, 2010, pp. 686-696
On the parameterized complexity of layered graph drawing
Vida Dujmović
,
Michael R. Fellows
,
Matthew Kitching
,
Giuseppe Liotta
,
Catherine McCartin
,
Naomi Nishimura
,
Prabhakar Ragde
,
Frances Rosamond
,
Sue Whitesides
,
David R. Wood
Algorithmica
52
(2), 2008, pp. 267-292
Lines and free line segments tangent to arbitrary three-dimensional convex polyhedra
Hervé Brönnimann
,
Olivier Devillers
,
Vida Dujmović
,
Hazel Everett
,
Marc Glisse
,
Xavier Goaoc
,
Sylvain Lazard
,
Hyeon-Suk Na
,
Sue Whitesides
SIAM Journal on Computing
37
(2), 2007, pp. 522-551
A fixed-parameter approach to 2-layer planarization
Vida Dujmović
,
Michael Fellows
,
Michael Hallett
,
Matthew Kitching
,
Giuseppe Liotta
,
Catherine McCartin
,
Naomi Nishimura
,
Prabhakar Ragde
,
Fran Rosamond
,
Matthew Suderman
,
Sue Whitesides
,
David R. Wood
Algorithmica
45
(2), 2006, pp. 159-182
Graph treewidth and geometric thickness parameters
Vida Dujmović
,
David R. Wood
Lecture Notes in Computer Science
3843
, 2006, pp. 129-140
Induced subgraphs of bounded degree and bounded treewidth
Prosenjit Bose
,
Vida Dujmović
,
David R. Wood
Lecture Notes in Computer Science
3787
, 2005, pp. 175-186
Layout of graphs with bounded tree-width
Vida Dujmović
,
Pat Morin
,
David R. Wood
SIAM Journal on Computing
34
(3), 2005, pp. 553-579
Fixed parameter algorithms for ONE-SIDED CROSSING MINIMIZATION revisited
Vida Dujmović
,
Henning Fernau
,
Michael Kaufmann
Lecture Notes in Computer Science
2912
, 2004, pp. 332-344
Really straight graph drawings
Vida Dujmović
,
Matthew Suderman
,
David R. Wood
Lecture Notes in Computer Science
3383
, 2004, pp. 122-132
An efficient fixed parameter tractable algorithm for 1-sided crossing minimization
Vida Dujmović
,
Sue Whitesides
Algorithmica
40
(1), 2004, pp. 15-31
Three-dimensional grid drawings with sub-quadratic volume
Vida Dujmović
,
David R. Wood
Lecture Notes in Computer Science
2912
, 2004, pp. 190-201
Layouts of graph subdivisions
Vida Dujmović
,
David R. Wood
Lecture Notes in Computer Science
3383
, 2004, pp. 133-143
Tree-partitions of
k
-trees with applications in graph layout
Vida Dujmović
,
David R. Wood
Lecture Notes in Computer Science
2880
, 2003, pp. 205-217
Flat-state connectivity of linkages under dihedral motions
Greg Aloupis
,
Erik D. Demaine
,
Vida Dujmović
,
Jeff Erickson
,
Stefan Langerman
,
Henk Meijer
,
Joseph O'Rourke
,
Mark Overmars
,
Michael Soss
,
Ileana Streinu
,
Godfried T. Toussaint
Lecture Notes in Computer Science
2518
, 2002, pp. 369-380
Path-width and three-dimensional straight-line grid drawings of graphs
Vida Dujmović
,
Pat Morin
,
David R. Wood
Lecture Notes in Computer Science
2528
, 2002, pp. 42-53
An efficient fixed parameter tractable algorithm for 1-sided crossing minimization
Vida Dujmović
,
Sue Whitesides
Lecture Notes in Computer Science
2528
, 2002, pp. 118-129