Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jocg/jocg11.bht:"
download as .bib file
@article{DBLP:journals/jocg/0001KM20,
author = {Michael Hoffmann and
Vincent Kusters and
Tillmann Miltzow},
title = {Halving balls by a hyperplane in deterministic linear time},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {576--614},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a23},
doi = {10.20382/JOCG.V11I1A23},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/0001KM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/00030RJ20,
author = {Jie Xue and
Yuan Li and
Saladi Rahul and
Ravi Janardan},
title = {Searching for the closest-pair in a query translate},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {26--61},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a3},
doi = {10.20382/JOCG.V11I2A3},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/00030RJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AkitayaDEHJL20,
author = {Hugo A. Akitaya and
Vida Dujmovic and
David Eppstein and
Thomas C. Hull and
Kshitij Jain and
Anna Lubiw},
title = {Face flips in origami tessellations},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {397--417},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a15},
doi = {10.20382/JOCG.V11I1A15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/AkitayaDEHJL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/AkitayaDHHKT20,
author = {Hugo Alves Akitaya and
Erik D. Demaine and
Takashi Horiyama and
Thomas C. Hull and
Jason S. Ku and
Tomohiro Tachi},
title = {Rigid foldability is NP-hard},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {93--124},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a4},
doi = {10.20382/JOCG.V11I1A4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/AkitayaDHHKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BanyassadyBM20,
author = {Bahareh Banyassady and
Luis Barba and
Wolfgang Mulzer},
title = {Time-space trade-offs for computing Euclidean minimum spanning trees},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {525--547},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a21},
doi = {10.20382/JOCG.V11I1A21},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BanyassadyBM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BarequetEGM20,
author = {Gill Barequet and
David Eppstein and
Michael T. Goodrich and
Nil Mamano},
title = {Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {26--59},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a2},
doi = {10.20382/JOCG.V11I1A2},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BarequetEGM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BergK20,
author = {Mark de Berg and
Christian Knauer},
title = {Corrigendum to: Approximating minimum-area rectangular and convex
containers for packing convex polygons},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {653--655},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a26},
doi = {10.20382/JOCG.V11I1A26},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BergK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BiniazBCMMS20,
author = {Ahmad Biniaz and
Prosenjit Bose and
Paz Carmi and
Anil Maheshwari and
J. Ian Munro and
Michiel H. M. Smid},
title = {Faster algorithms for some optimization problems on collinear points},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {418--432},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a16},
doi = {10.20382/JOCG.V11I1A16},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BiniazBCMMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BorrazzoF20,
author = {Manuel Borrazzo and
Fabrizio Frati},
title = {On the planar edge-length ratio of planar graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {137--155},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a6},
doi = {10.20382/JOCG.V11I1A6},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BorrazzoF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BoseCD20,
author = {Prosenjit Bose and
Jean{-}Lou De Carufel and
Olivier Devillers},
title = {Expected Complexity of Routing in {\textdollar}{\textbackslash}Theta{\_}6{\textdollar}
and Half-{\textdollar}{\textbackslash}Theta{\_}6{\textdollar} Graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {212--234},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a9},
doi = {10.20382/JOCG.V11I1A9},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BoseCD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BravermanCKY20,
author = {Vladimir Braverman and
Moses Charikar and
William Kuszmaul and
Lin F. Yang},
title = {The one-way communication complexity of dynamic time warping distance},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {62--93},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a4},
doi = {10.20382/JOCG.V11I2A4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BravermanCKY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/BringmannC20,
author = {Karl Bringmann and
Bhaskar Ray Chaudhury},
title = {Polyline simplification has cubic complexity},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {94--130},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a5},
doi = {10.20382/JOCG.V11I2A5},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/BringmannC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/CarufelDMOPTV20,
author = {Jean{-}Lou De Carufel and
Adrian Dumitrescu and
Wouter Meulemans and
Tim Ophelders and
Claire Pennarun and
Csaba D. T{\'{o}}th and
Sander Verdonschot},
title = {Convex polygons in cartesian products},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {205--233},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a9},
doi = {10.20382/JOCG.V11I2A9},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/CarufelDMOPTV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/ChaplickFLRVW20,
author = {Steven Chaplick and
Krzysztof Fleszar and
Fabian Lipp and
Alexander Ravsky and
Oleg Verbitsky and
Alexander Wolff},
title = {Drawing graphs on few lines and few planes},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {433--475},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a17},
doi = {10.20382/JOCG.V11I1A17},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/ChaplickFLRVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/DumitrescuM20,
author = {Adrian Dumitrescu and
Ritankar Mandal},
title = {New lower bounds for the number of pseudoline arrangements},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {60--92},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a3},
doi = {10.20382/JOCG.V11I1A3},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/DumitrescuM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/EdelsbrunnerVW20,
author = {Herbert Edelsbrunner and
Ziga Virk and
Hubert Wagner},
title = {Topological data analysis in information space},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {162--182},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a7},
doi = {10.20382/JOCG.V11I2A7},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/EdelsbrunnerVW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/EppsteinHS20,
author = {David Eppstein and
Sariel Har{-}Peled and
Anastasios Sidiropoulos},
title = {Approximate greedy clustering and distance selection for graph metrics},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {629--652},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a25},
doi = {10.20382/JOCG.V11I1A25},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/EppsteinHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Felsner20,
author = {Stefan Felsner},
title = {4-Connected triangulations on few lines},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {476--492},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a18},
doi = {10.20382/JOCG.V11I1A18},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Felsner20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/FiltserK20,
author = {Omrit Filtser and
Matthew J. Katz},
title = {Algorithms for the discrete Fr{\'{e}}chet distance under translation},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {156--175},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a7},
doi = {10.20382/JOCG.V11I1A7},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/FiltserK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/GoaocHN20,
author = {Xavier Goaoc and
Andreas F. Holmsen and
Cyril Nicaud},
title = {An experimental study of forbidden patterns in geometric permutations
by combinatorial lifting},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {131--161},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a6},
doi = {10.20382/JOCG.V11I2A6},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/GoaocHN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/GraseggerLS20,
author = {Georg Grasegger and
Jan Legersk{\'{y}} and
Josef Schicho},
title = {On the classification of motions of paradoxically movable graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {548--575},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a22},
doi = {10.20382/JOCG.V11I1A22},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/GraseggerLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Haraway20,
author = {Robert Cyrus Haraway III},
title = {Determining hyperbolicity of compact orientable 3-manifolds with torus
boundary},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {125--136},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a5},
doi = {10.20382/JOCG.V11I1A5},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Haraway20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KaufmannBKPRU20,
author = {Michael A. Bekos and
Michael Kaufmann and
Fabian Klute and
Sergey Pupyrev and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
title = {Four Pages Are Indeed Necessary for Planar Graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {332--353},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a12},
doi = {10.20382/JOCG.V11I1A12},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KaufmannBKPRU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KerberLO20,
author = {Michael Kerber and
Michael Lesnick and
Steve Oudot},
title = {Exact computation of the matching distance on 2-parameter persistence
modules},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {4--25},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a2},
doi = {10.20382/JOCG.V11I2A2},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KerberLO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KeszeghP20,
author = {Bal{\'{a}}zs Keszegh and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {354--370},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a13},
doi = {10.20382/JOCG.V11I1A13},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KeszeghP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KhesinNP20,
author = {Andrey Boris Khesin and
Aleksandar Nikolov and
Dmitry Paramonov},
title = {Preconditioning for the Geometric Transportation Problem},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {234--259},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a11},
doi = {10.20382/JOCG.V11I2A11},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KhesinNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/KreveldLW20,
author = {Marc J. van Kreveld and
Maarten L{\"{o}}ffler and
Lionov Wiratma},
title = {On optimal polyline simplification using the Hausdorff and Fr{\'{e}}chet
distance},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {1--25},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a1},
doi = {10.20382/JOCG.V11I1A1},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/KreveldLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/LahnR20,
author = {Nathaniel Lahn and
Sharath Raghvendra},
title = {A weighted approach to the maximum cardinality bipartite matching
problem with applications in geometric settings},
journal = {J. Comput. Geom.},
volume = {11},
number = {2},
pages = {183--204},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i2a8},
doi = {10.20382/JOCG.V11I2A8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/LahnR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/OstingPW20,
author = {Braxton Osting and
Sourabh Palande and
Bei Wang},
title = {Spectral sparsification of simplicial complexes for clustering and
label propagation},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {176--211},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a8},
doi = {10.20382/JOCG.V11I1A8},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/OstingPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Pilatte20,
author = {C{\'{e}}dric Pilatte},
title = {NP-completeness of slope-constrained drawing of complete graphs},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {371--396},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a14},
doi = {10.20382/JOCG.V11I1A14},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Pilatte20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Quintanar20,
author = {Tanessi Quintanar},
title = {An explicit PL-embedding of the square flat torus into {\textdollar}{\textbackslash}mathbb\{E\}3{\textdollar}},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {615--628},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a24},
doi = {10.20382/JOCG.V11I1A24},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Quintanar20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/SmidMM20,
author = {Michiel Smid and
Anil Maheshwari and
Wolfgang Mulzer},
title = {A simple randomized {\textdollar}O(n {\textbackslash}log n){\textdollar}-time
closest-pair algorithm in doubling metrics},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {507--524},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a20},
doi = {10.20382/JOCG.V11I1A20},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/SmidMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/SteinerSFVCS20,
author = {Raphael Steiner and
Manfred Scheucher and
Stefan Felsner and
Pavel Valtr and
Man{-}Kwun Chiu and
Patrick Schnider},
title = {On the Average Complexity of the k-Level},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {493--506},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a19},
doi = {10.20382/JOCG.V11I1A19},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/SteinerSFVCS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/Wang20,
author = {Haitao Wang},
title = {A Divide-and-Conquer Algorithm for Two-Point {L1} Shortest Path Queries
in Polygonal Domains},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {235--282},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a10},
doi = {10.20382/JOCG.V11I1A10},
timestamp = {Mon, 09 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/Wang20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/WangW20,
author = {Dingkang Wang and
Yusu Wang},
title = {An Improved Cost Function for Hierarchical Cluster Trees},
journal = {J. Comput. Geom.},
volume = {11},
number = {1},
pages = {283--331},
year = {2020},
url = {https://doi.org/10.20382/jocg.v11i1a11},
doi = {10.20382/JOCG.V11I1A11},
timestamp = {Mon, 02 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jocg/WangW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-25 06:30 CEST from data curated 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:
