default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVida Dujmovic
Person information
- affiliation: University of Ottawa
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j86]Carla Binucci
, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Graphs Drawn With Some Vertices per Face: Density and Relationships. IEEE Access 12: 68828-68846 (2024)- [j85]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure. Electron. J. Comb. 31(2) (2024) - [j84]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. Comb. Probab. Comput. 33(1): 85-90 (2024) - [j83]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. J. Graph Algorithms Appl. 28(2): 1-35 (2024) - [j82]Marc Distel, Vida Dujmovic, David Eppstein, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, Michal T. Seweryn, David R. Wood:
Product Structure Extension of the Alon-Seymour-Thomas Theorem. SIAM J. Discret. Math. 38(3): 2095-2107 (2024) - [c64]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. GD 2024: 27:1-27:17 - [c63]Vida Dujmovic, Camille La Rose:
Rectilinear Crossing Number of Graphs Excluding a Single-Crossing Graph as a Minor. GD 2024: 37:1-37:18 - [c62]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - [i69]Vida Dujmovic, Pat Morin, David R. Wood, David Worley:
Grid Minors and Products. CoRR abs/2402.14181 (2024) - [i68]Vida Dujmovic, Camille La Rose:
Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors. CoRR abs/2402.15034 (2024) - [i67]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin:
Tight bound for the Erdős-Pósa property of tree minors. CoRR abs/2403.06370 (2024) - [i66]Vida Dujmovic, Pat Morin:
Free Sets in Planar Graphs: History and Applications. CoRR abs/2403.17090 (2024) - [i65]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
Planar graphs in blowups of fans. CoRR abs/2407.05936 (2024) - [i64]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - [i63]Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, János Pach, Henry Förster:
Beyond-Planar Graphs: Models, Structures and Geometric Representations (Dagstuhl Seminar 24062). Dagstuhl Reports 14(2): 71-94 (2024) - 2023
- [j81]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic obstacle representation of graphs. Comput. Geom. 109: 101946 (2023) - [j80]Vida Dujmovic, Pat Morin:
Dual Circumference and Collinear Sets. Discret. Comput. Geom. 69(1): 26-50 (2023) - [j79]Vida Dujmovic, Pat Morin, David R. Wood:
Graph product structure for non-minor-closed classes. J. Comb. Theory B 162: 34-67 (2023) - [c61]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. FOCS 2023: 1921-1930 - [c60]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. GD (1) 2023: 39-52 - [i62]Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood:
The Excluded Tree Minor Theorem Revisited. CoRR abs/2303.14970 (2023) - [i61]Vida Dujmovic, Louis Esperet, Pat Morin, David R. Wood:
Proof of the Clustered Hadwiger Conjecture. CoRR abs/2306.06224 (2023) - [i60]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i59]Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmovic, Seok-Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, Alessandra Tappini:
Min-k-planar Drawings of Graphs. CoRR abs/2308.13401 (2023) - [i58]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Pat Morin, Saeed Odak:
Connected Dominating Sets in Triangulations. CoRR abs/2312.03399 (2023) - 2022
- [j78]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-Number is Not Bounded by Queue-Number. Comb. 42(2): 151-164 (2022) - [j77]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number. Electron. J. Comb. 29(3) (2022) - [j76]Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood:
Clustered 3-colouring graphs of bounded degree. Comb. Probab. Comput. 31(1): 123-135 (2022) - [j75]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [i57]Prosenjit Bose, Vida Dujmovic, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin:
Linear versus centred chromatic numbers. CoRR abs/2205.15096 (2022) - 2021
- [j74]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. Algorithmica 83(5): 1316-1351 (2021) - [j73]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph is Free. Discret. Comput. Geom. 65(4): 999-1027 (2021) - [j72]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). J. ACM 68(6): 42:1-42:33 (2021) - [j71]Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. J. Graph Algorithms Appl. 25(1): 43-57 (2021) - [j70]Jean-Lou De Carufel, Prosenjit Bose, Frédérik Paradis, Vida Dujmovic:
Local routing in WSPD-based spanners. J. Comput. Geom. 12(1): 1-34 (2021) - [j69]Muhammad Jawaherul Alam, Michael A. Bekos, Vida Dujmovic, Martin Gronemann, Michael Kaufmann, Sergey Pupyrev:
On dispersable book embeddings. Theor. Comput. Sci. 861: 1-22 (2021) - [i56]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. CoRR abs/2105.01230 (2021) - [i55]Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
2×n Grids have Unbounded Anagram-Free Chromatic Number. CoRR abs/2105.01916 (2021) - 2020
- [j68]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs Have Bounded Queue-Number. J. ACM 67(4): 22:1-22:38 (2020) - [j67]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. J. Comput. Geom. 11(1): 397-417 (2020) - [j66]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-Closed Graph Classes with Bounded Layered Pathwidth. SIAM J. Discret. Math. 34(3): 1693-1709 (2020) - [c59]Vida Dujmovic, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). FOCS 2020: 577-588 - [i54]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Cyril Gavoille, Piotr Micek, Pat Morin:
Adjacency Labelling for Planar Graphs (and Beyond). CoRR abs/2003.04280 (2020) - [i53]Vida Dujmovic, Pat Morin, Céline Yelle:
Two Results on Layered Pathwidth and Linear Layouts. CoRR abs/2004.03571 (2020) - [i52]Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin:
Asymptotically Optimal Vertex Ranking of Planar Graphs. CoRR abs/2007.06455 (2020) - [i51]Vida Dujmovic, David Eppstein, Robert Hickingbotham, Pat Morin, David R. Wood:
Stack-number is not bounded by queue-number. CoRR abs/2011.04195 (2020)
2010 – 2019
- 2019
- [j65]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layouts, Layered Path Decompositions, and Leveled Planarity. Algorithmica 81(4): 1561-1583 (2019) - [j64]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. Electron. J. Comb. 26(1): 1 (2019) - [j63]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. J. Graph Algorithms Appl. 23(3): 579-602 (2019) - [j62]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on growing a tree in a graph. Random Struct. Algorithms 55(2): 290-312 (2019) - [c58]Vida Dujmovic:
Graph Drawing via Layered Partitions. CCCG 2019: 1 - [c57]Vida Dujmovic, Pat Morin:
Dual Circumference and Collinear Sets. SoCG 2019: 29:1-29:17 - [c56]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. ESA 2019: 3:1-3:14 - [c55]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. FOCS 2019: 862-875 - [c54]Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote:
Every Collinear Set in a Planar Graph Is Free. SODA 2019: 1521-1538 - [i50]Vida Dujmovic, Pat Morin, David R. Wood:
Queue Layouts of Graphs with Bounded Degree and Bounded Genus. CoRR abs/1901.05594 (2019) - [i49]Vida Dujmovic, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, David R. Wood:
Planar Graphs have Bounded Queue-Number. CoRR abs/1904.04791 (2019) - [i48]Vida Dujmovic, Louis Esperet, Gwenaël Joret, Bartosz Walczak, David R. Wood:
Planar graphs have bounded nonrepetitive chromatic number. CoRR abs/1904.05269 (2019) - [i47]Vida Dujmovic, Pat Morin, David R. Wood:
The structure of k-planar graphs. CoRR abs/1907.05168 (2019) - [i46]Hugo A. Akitaya, Esther M. Arkin, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Matias Korman, Belén Palop, Irene Parada, André van Renssen, Vera Sacristán:
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers. CoRR abs/1908.07880 (2019) - [i45]Hugo A. Akitaya, Vida Dujmovic, David Eppstein, Thomas C. Hull, Kshitij Jain, Anna Lubiw:
Face flips in origami tessellations. CoRR abs/1910.05667 (2019) - 2018
- [j61]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. J. Graph Algorithms Appl. 22(1): 89-99 (2018) - [j60]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing planar graphs with many collinear vertices. J. Comput. Geom. 9(1): 94-130 (2018) - [j59]Vida Dujmovic, David R. Wood:
Thickness and antithickness of graphs. J. Comput. Geom. 9(1): 356-386 (2018) - [j58]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(2): 839-863 (2018) - [j57]Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood:
Corrigendum: Orthogonal Tree Decompositions of Graphs. SIAM J. Discret. Math. 32(4): 3003-3004 (2018) - [c53]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - [c52]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. ICALP 2018: 23:1-23:13 - [c51]Paz Carmi, Vida Dujmovic, Pat Morin:
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. WG 2018: 91-99 - [i44]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira:
Geodesic Obstacle Representation of Graphs. CoRR abs/1803.03705 (2018) - [i43]Vida Dujmovic, Djedjiga Outioua:
A note on choosability with defect 1 of graphs on surfaces. CoRR abs/1806.06149 (2018) - [i42]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Tight Upper Bounds on the Crossing Number in a Minor-Closed Class. CoRR abs/1807.11617 (2018) - [i41]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. CoRR abs/1808.10738 (2018) - [i40]Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood:
Minor-closed graph classes with bounded layered pathwidth. CoRR abs/1810.08314 (2018) - [i39]Prosenjit Bose, Paz Carmi, Vida Dujmovic, Pat Morin:
Near-Optimal O(k)-Robust Geometric Spanners. CoRR abs/1812.09913 (2018) - 2017
- [j56]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. Graphs Comb. 33(4): 817-832 (2017) - [j55]Vida Dujmovic, Pat Morin, David R. Wood:
Layered separators in minor-closed graph classes with applications. J. Comb. Theory B 127: 111-147 (2017) - [j54]Vida Dujmovic:
The Utility of Untangling. J. Graph Algorithms Appl. 21(1): 121-134 (2017) - [j53]Vida Dujmovic, David Eppstein, David R. Wood:
Structure of Graphs with Locally Restricted Crossings. SIAM J. Discret. Math. 31(2): 805-824 (2017) - [c50]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with Small Grid-Size. GD 2017: 184-196 - [c49]Prosenjit Bose, Jean-Lou De Carufel, Vida Dujmovic, Frédérik Paradis:
Local Routing in Spanners Based on WSPDs. WADS 2017: 205-216 - [i38]Boris Aronov, Vida Dujmovic, Pat Morin, Aurélien Ooms, Luís Fernando Schultz Xavier da Silveira:
More Turán-Type Theorems for Triangles in Convex Point Sets. CoRR abs/1706.10193 (2017) - [i37]Luc Devroye, Vida Dujmovic, Alan M. Frieze, Abbas Mehrabian, Pat Morin, Bruce A. Reed:
Notes on Growing a Tree in a Graph. CoRR abs/1707.00083 (2017) - [i36]Vida Dujmovic, David R. Wood:
Thickness and Antithickness of Graphs. CoRR abs/1708.04773 (2017) - [i35]Therese Biedl, Martin Derka, Vida Dujmovic, Pat Morin:
EPG-representations with small grid-size. CoRR abs/1708.09749 (2017) - 2016
- [j52]Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
Layouts of Expander Graphs. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j51]Vida Dujmovic, Gwenaël Joret, Jakub Kozik, David R. Wood:
Nonrepetitive colouring via entropy compression. Comb. 36(6): 661-686 (2016) - [c48]Prosenjit Bose, Vida Dujmovic, Pat Morin, Lucas Rioux-Maldague:
New Bounds for Facial Nonrepetitive Colouring. CCCG 2016: 295-302 - [c47]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. GD 2016: 152-165 - [c46]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layout Is Hard. GD 2016: 499-510 - [c45]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. GD 2016: 511-518 - [i34]Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli:
Drawing Planar Graphs with Many Collinear Vertices. CoRR abs/1606.03890 (2016) - [i33]Vida Dujmovic, Fabrizio Frati:
Stack and Queue Layouts via Layered Separators. CoRR abs/1608.06458 (2016) - 2015
- [j50]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-monotonic polygon deflation. Contributions Discret. Math. 10(1) (2015) - [j49]Vida Dujmovic, Pat Morin:
On Obstacle Numbers. Electron. J. Comb. 22(3): 3 (2015) - [j48]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? Discret. Comput. Geom. 53(2): 296-326 (2015) - [j47]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [j46]Vida Dujmovic:
Graph layouts via layered separators. J. Comb. Theory B 110: 79-89 (2015) - [j45]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood:
Empty Pentagons in Point Sets with Collinearities. SIAM J. Discret. Math. 29(1): 198-209 (2015) - [c44]Vida Dujmovic, David Eppstein, David R. Wood:
Genus, Treewidth, and Local Crossing Number. GD 2015: 87-98 - [c43]Vida Dujmovic:
The Utility of Untangling. GD 2015: 321-332 - [c42]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - [i32]Vida Dujmovic, Anastasios Sidiropoulos, David R. Wood:
3-Monotone Expanders. CoRR abs/1501.05020 (2015) - [i31]Vida Dujmovic:
The Utility of Untangling. CoRR abs/1506.04092 (2015) - [i30]Vida Dujmovic, David Eppstein, David R. Wood:
Genus, Treewidth, and Local Crossing Number. CoRR abs/1506.04380 (2015) - [i29]Michael J. Bannister, William E. Devanny, Vida Dujmovic, David Eppstein, David R. Wood:
Track Layouts, Layered Path Decompositions, and Leveled Planarity. CoRR abs/1506.09145 (2015) - 2014
- [j44]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. Electron. J. Comb. 21(1): 1 (2014) - [j43]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and guarding realistic polygons. Comput. Geom. 47(2): 296-306 (2014) - [i28]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - 2013
- [j42]Vida Dujmovic, Gwenaël Joret, Fabrizio Frati, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with O(log n) Colours. Electron. J. Comb. 20(1): 51 (2013) - [j41]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On point-sets that support planar graphs. Comput. Geom. 46(1): 29-50 (2013) - [j40]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. Comput. Geom. 46(2): 181-189 (2013) - [j39]Vida Dujmovic, Stefan Langerman:
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. Discret. Comput. Geom. 49(1): 74-88 (2013) - [j38]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-transmitters in the presence of obstacles. J. Comb. Optim. 25(2): 208-233 (2013) - [j37]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. SIAM J. Comput. 42(4): 1720-1736 (2013) - [j36]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense Graph. SIAM J. Discret. Math. 27(4): 1770-1774 (2013) - [c41]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust geometric spanners. SoCG 2013: 449-458 - [c40]Vida Dujmovic, Pat Morin, David R. Wood:
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring. FOCS 2013: 280-289 - [r1]Vida Dujmovic:
Three-Dimensional Drawings. Handbook of Graph Drawing and Visualization 2013: 455-488 - [i27]Vida Dujmovic, Pat Morin, Adam Sheffer:
Crossings in Grid Drawings. CoRR abs/1301.0303 (2013) - [i26]Vida Dujmovic:
Graph Layouts via Layered Separators. CoRR abs/1302.0304 (2013) - [i25]Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Average Stretch Factor: How Low Does It Go? CoRR abs/1305.4170 (2013) - [i24]Vida Dujmovic, Pat Morin, David R. Wood:
Layered Separators in Minor-Closed Families with Applications. CoRR abs/1306.1595 (2013) - [i23]Vida Dujmovic, Pat Morin:
On Obstacle Numbers. CoRR abs/1308.4321 (2013) - 2012
- [j35]Vida Dujmovic, John Howat, Pat Morin:
Biased Range Trees. Algorithmica 62(1-2): 21-37 (2012) - [j34]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. Algorithmica 63(1-2): 476-489 (2012) - [j33]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless routing in convex subdivisions: Random walks are optimal. Comput. Geom. 45(4): 178-185 (2012) - [j32]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. Int. J. Comput. Geom. Appl. 22(3): 207-214 (2012) - [j31]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood:
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geom. Appl. 22(5): 439-470 (2012) - [j30]Gérard Biau, Luc Devroye, Vida Dujmovic, Adam Krzyzak:
An affine invariant k-nearest neighbor regression estimate. J. Multivar. Anal. 112: 24-34 (2012) - [j29]Vida Dujmovic, Gwenaël Joret, David R. Wood:
An Improved Bound for First-Fit on Posets Without Two Long Incomparable Chains. SIAM J. Discret. Math. 26(3): 1068-1075 (2012) - [j28]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms 8(3): 29:1-29:18 (2012) - [c39]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility Monotonic Polygon Deflation. CCCG 2012: 11-16 - [c38]Gérard Biau, Adam Krzyzak, Luc Devroye, Vida Dujmovic:
An affine invariant k-nearest neighbor regression estimate. ISIT 2012: 1445-1447 - [i22]Vida Dujmovic, Fabrizio Frati, Gwenaël Joret, David R. Wood:
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours. CoRR abs/1202.1569 (2012) - [i21]Vida Dujmovic, Daniel J. Harvey, Gwenaël Joret, Bruce A. Reed, David R. Wood:
A linear-time algorithm for finding a complete graph minor in a dense graph. CoRR abs/1202.2624 (2012) - [i20]Prosenjit Bose, Vida Dujmovic, Pat Morin, Michiel H. M. Smid:
Robust Geometric Spanners. CoRR abs/1204.4679 (2012) - [i19]Prosenjit Bose, Vida Dujmovic, Nima Hoda, Pat Morin:
Visibility-Monotonic Polygon Deflation. CoRR abs/1206.1982 (2012) - [i18]János Barát, Vida Dujmovic, Gwenaël Joret, Michael S. Payne, Ludmila Scharf, Daria Schymura, Pavel Valtr, David R. Wood:
Empty pentagons in point sets with collinearities. CoRR abs/1207.3633 (2012) - 2011
- [j27]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j26]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
A note on the perimeter of fat objects. Comput. Geom. 44(1): 1-8 (2011) - [j25]David R. Wood, Vida Dujmovic:
On the Book Thickness of k-Trees. Discret. Math. Theor. Comput. Sci. 13(3): 39-44 (2011) - [j24]Vida Dujmovic, Gasper Fijavz, Gwenaël Joret, Thom Sulanke, David R. Wood:
On the maximum number of cliques in a graph embedded in a surface. Eur. J. Comb. 32(8): 1244-1252 (2011) - [j23]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs Comb. 27(1): 47-60 (2011) - [c37]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow:
Convexifying Polygons Without Losing Visibilities. CCCG 2011 - [c36]Vida Dujmovic, Stefan Langerman:
A center transversal theorem for hyperplanes and applications to graph drawing. SCG 2011: 117-124 - [c35]Vida Dujmovic, William S. Evans, Sylvain Lazard, William J. Lenhart, Giuseppe Liotta, David Rappaport, Stephen K. Wismath:
On Point-Sets That Support Planar Graphs. GD 2011: 64-74 - [c34]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono:
Meshes Preserving Minimum Feature Size. EGC 2011: 258-273 - [i17]Vida Dujmovic, Gwenaël Joret, David R. Wood:
Nonrepetitive Colouring via Entropy Compression. CoRR abs/1112.5524 (2011) - 2010
- [c33]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. CATS 2010: 19-24 - [c32]David Charlton, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Pat Morin, Ryuhei Uehara:
Ghost chimneys. CCCG 2010: 63-66 - [c31]Prosenjit Bose, Otfried Cheong, Vida Dujmovic:
On the perimeter of fat objects. CCCG 2010: 163-166 - [c30]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. CCCG 2010: 261-264 - [c29]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54 - [c28]Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara:
Coverage with k-Transmitters in the Presence of Obstacles. COCOA (2) 2010: 1-15 - [c27]Vida Dujmovic, William S. Evans, Stephen G. Kobourov, Giuseppe Liotta, Christophe Weibel, Stephen K. Wismath:
On Graphs Supported by Line Sets. GD 2010: 177-182 - [c26]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. LATIN 2010: 686-696 - [c25]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49 - [i16]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i15]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010) - [i14]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. CoRR abs/1003.0139 (2010) - [i13]Vida Dujmovic, Stefan Langerman:
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. CoRR abs/1012.0548 (2010)
2000 – 2009
- 2009
- [j22]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin:
Connectivity-preserving transformations of binary images. Comput. Vis. Image Underst. 113(10): 1027-1038 (2009) - [j21]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Discret. Comput. Geom. 42(4): 570-585 (2009) - [c24]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102 - [c23]Vida Dujmovic, John Howat, Pat Morin:
Biased range trees. SODA 2009: 486-495 - [i12]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009) - [i11]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood:
Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CoRR abs/0904.0262 (2009) - [i10]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. CoRR abs/0907.2071 (2009) - [i9]Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, John Iacono:
Minimum feature size preserving decompositions. CoRR abs/0908.2493 (2009) - [i8]Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on large angle crossing graphs. CoRR abs/0908.3545 (2009) - [i7]Dan Chen, Luc Devroye, Vida Dujmovic, Pat Morin:
Memoryless Routing in Convex Subdivisions: Random Walks are Optimal. CoRR abs/0911.2484 (2009) - 2008
- [j20]Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52(2): 267-292 (2008) - [j19]Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood:
Distinct Distances in Graph Drawings. Electron. J. Comb. 15(1) (2008) - [j18]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Pat Morin, Stefan Langerman, David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs. Electron. Notes Discret. Math. 31: 213-218 (2008) - [j17]Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed parameter algorithms for one-sided crossing minimization revisited. J. Discrete Algorithms 6(2): 313-323 (2008) - [j16]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees. J. Graph Theory 58(3): 191-209 (2008) - [c22]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann:
Triangulating and Guarding Realistic Polygons. CCCG 2008 - [c21]Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood:
Improved upper bounds on the crossing number. SCG 2008: 375-384 - [c20]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921 - [i6]Vida Dujmovic, John Howat, Pat Morin:
Biased Range Trees. CoRR abs/0806.2707 (2008) - 2007
- [j15]Vida Dujmovic, Matthew Suderman, David R. Wood:
Graph drawings with few slopes. Comput. Geom. 38(3): 181-193 (2007) - [j14]Vida Dujmovic, David Eppstein, Matthew Suderman, David R. Wood:
Drawings of planar graphs with few slopes and segments. Comput. Geom. 38(3): 194-212 (2007) - [j13]Vida Dujmovic, David R. Wood:
Graph Treewidth and Geometric Thickness Parameters. Discret. Comput. Geom. 37(4): 641-670 (2007) - [j12]Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. Int. J. Comput. Geom. Appl. 17(4): 297-304 (2007) - [j11]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra. SIAM J. Comput. 37(2): 522-551 (2007) - [c19]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241 - [i5]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood:
A polynomial bound for untangling geometric planar graphs. CoRR abs/0710.1641 (2007) - 2006
- [j10]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45(2): 159-182 (2006) - [j9]Prosenjit Bose, Vida Dujmovic, David R. Wood:
Induced Subgraphs of Bounded Degree and Bounded Treewidth. Contributions Discret. Math. 1(1) (2006) - [j8]Vida Dujmovic, David R. Wood:
Upward Three-Dimensional Grid Drawings of Graphs. Order 23(1): 1-20 (2006) - [c18]Mirela Damian, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Dania El-Khechen, Robin Y. Flatland, John Iacono, Stefan Langerman, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing. CCCG 2006 - [i4]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees. CoRR abs/cs/0605011 (2006) - 2005
- [j7]Vida Dujmovic, David R. Wood:
Stacks, Queues and Tracks: Layouts of Graph Subdivisions. Discret. Math. Theor. Comput. Sci. 7(1): 155-202 (2005) - [j6]Vida Dujmovic, Pat Morin, David R. Wood:
Layout of Graphs with Bounded Tree-Width. SIAM J. Comput. 34(3): 553-579 (2005) - [c17]Olivier Devillers, Vida Dujmovic, Hazel Everett, Samuel Hornus, Sue Whitesides, Stephen K. Wismath:
Maintaining Visibility Information of Planar Point Sets with a Moving Viewpoint. CCCG 2005: 302-305 - [c16]Vida Dujmovic, David R. Wood:
Graph Treewidth and Geometric Thickness Parameters. GD 2005: 129-140 - [c15]Prosenjit Bose, Vida Dujmovic, David R. Wood:
Induced Subgraphs of Bounded Degree and Bounded Treewidth. WG 2005: 175-186 - 2004
- [j5]Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Algorithmica 40(1): 15-31 (2004) - [j4]Vida Dujmovic, David R. Wood:
On Linear Layouts of Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 339-358 (2004) - [j3]Vida Dujmovic, Attila Pór, David R. Wood:
Track Layouts of Graphs. Discret. Math. Theor. Comput. Sci. 6(2): 497-522 (2004) - [c14]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
The number of lines tangent to arbitrary convex polyhedra in 3D. SCG 2004: 46-55 - [c13]Vida Dujmovic, Matthew Suderman, David R. Wood:
Really Straight Graph Drawings. GD 2004: 122-132 - [c12]Vida Dujmovic, David R. Wood:
Layouts of Graph Subdivisions. GD 2004: 133-143 - [i3]Vida Dujmovic, Pat Morin, David R. Wood:
Layout of Graphs with Bounded Tree-Width. CoRR cs.DM/0406024 (2004) - [i2]Vida Dujmovic, Attila Pór, David R. Wood:
Track Layouts of Graphs. CoRR cs.DM/0407033 (2004) - 2003
- [j2]Olivier Devillers, Vida Dujmovic, Hazel Everett, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sylvain Petitjean:
The Expected Number of 3D Visibility Events Is Linear. SIAM J. Comput. 32(6): 1586-1620 (2003) - [c11]Vida Dujmovic, David R. Wood:
Three-Dimensional Grid Drawings with Sub-quadratic Volume. GD 2003: 190-201 - [c10]Vida Dujmovic, Henning Fernau, Michael Kaufmann:
Fixed Parameter Algorithms for one-sided crossing minimization Revisited. GD 2003: 332-344 - [c9]Vida Dujmovic, David R. Wood:
Tree-Partitions of k-Trees with Applications in Graph Layout. WG 2003: 205-217 - 2002
- [j1]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning Polygons. Discret. Comput. Geom. 28(2): 231-253 (2002) - [c8]Hervé Brönnimann, Olivier Devillers, Vida Dujmovic, Hazel Everett, Marc Glisse, Xavier Goaoc, Sylvain Lazard, Hyeon-Suk Na, Sue Whitesides:
On the number of lines tangent to four convex polyhedra. CCCG 2002: 113-117 - [c7]Vida Dujmovic, Pat Morin, David R. Wood:
Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs. GD 2002: 42-53 - [c6]Vida Dujmovic, Sue Whitesides:
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. GD 2002: 118-129 - [c5]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - 2001
- [c4]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
On the Parameterized Complexity of Layered Graph Drawing. ESA 2001: 488-499 - [c3]Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood:
A Fixed-Parameter Approach to Two-Layer Planarization. GD 2001: 1-15 - [c2]Vida Dujmovic, Sue Whitesides:
On validating planar worlds. SODA 2001: 791-792 - 2000
- [i1]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning polygons. CoRR cs.CG/0008010 (2000)
1990 – 1999
- 1999
- [c1]Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek:
Efficient Topological Exploration. ICRA 1999: 676-681
Coauthor Index
[c64] [i64] [j81] [i58] [j75] [i57] [j70] [i56] [i52] [j63] [c53] [c52] [i44] [i41] [i39] [j56] [c49] [c48] [j50] [j43] [j40] [j38] [j37] [c41] [j34] [j31] [c39] [i20] [i19] [j26] [j23] [c31] [c30] [c29] [c28] [c26] [c25] [i16] [i15] [i14] [j22] [j21] [c24] [i11] [i10] [j18] [j16] [c22] [c19] [i5] [j9] [i4] [c15]
[j86] [j85] [j84] [j83] [j82] [c64] [c62] [i69] [i67] [i66] [i65] [i64] [j81] [j80] [j79] [c61] [c60] [i62] [i61] [i60] [i59] [i58] [j78] [j77] [j76] [j75] [i57] [j73] [j72] [j71] [i56] [i55] [j68] [j66] [c59] [i54] [i53] [i52] [i51] [j64] [j62] [c57] [c55] [c54] [i50] [i49] [i47] [j58] [j57] [c52] [c51] [i44] [i40] [i39] [j56] [j55] [c50] [i38] [i37] [i35] [c48] [j50] [j49] [j48] [j47] [c42] [j44] [i28] [j40] [j38] [j37] [c41] [c40] [i27] [i25] [i24] [i23] [j35] [j33] [j32] [j28] [c39] [i20] [i19] [j27] [c33] [c32] [c30] [c29] [c28] [i16] [i15] [j22] [j21] [c23] [i12] [i8] [i7] [j19] [j18] [j16] [c20] [i6] [c19] [i5] [i4] [j6] [i3] [c7]
[j85] [j84] [j82] [c62] [i69] [i65] [j79] [c61] [i62] [i61] [i60] [j78] [j76] [j75] [i56] [j68] [j66] [i51] [j65] [c55] [i50] [i49] [i48] [i47] [j59] [j58] [j57] [i42] [i40] [j55] [j53] [i36] [j52] [j51] [c46] [j45] [c44] [i32] [i30] [i29] [j42] [j36] [c40] [i24] [j31] [j29] [i22] [i21] [i18] [j25] [j24] [j23] [i17] [j21] [c24] [i11] [j20] [j19] [j18] [j16] [c21] [j15] [j14] [j13] [c19] [i5] [j10] [j9] [j8] [i4] [j7] [j6] [c16] [c15] [j4] [j3] [c13] [c12] [i3] [i2] [c11] [c9] [c7] [c4] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
