|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 14 occurrences of 14 keywords
|
|
|
Results
Found 24 publication records. Showing 24 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
139 | Jürgen Bokowski, Jean-Pierre Roudneff, T.-K. Strempel |
Cell Decompositions of the Projective Plane with Petrie Polygons of Constant Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 17(4), pp. 377-392, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
59 | Jacob E. Goodman |
Double-permutation sequences and pseudoline transversals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 159, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
double-permutation sequence, pseudoline, convex set, transversal |
56 | Jacob E. Goodman, Richard Pollack |
The combinatorial encoding of disjoint convex sets in the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 28(1), pp. 69-81, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 52A35, 52C30 |
31 | Justin Dallant |
Improved Lower Bound on the Number of Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13923, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
31 | Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher |
An Improved Lower Bound on the Number of Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13107, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
31 | Sandip Das 0001, Siddani Bhaskara Rao, Uma Kant Sahoo |
On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings, pp. 259-271, 2021, Springer, 978-3-030-67898-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
31 | Adrian Dumitrescu, Ritankar Mandal |
New lower bounds for the number of pseudoline arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Geom. ![In: J. Comput. Geom. 11(1), pp. 60-92, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
31 | Adrian Dumitrescu, Ritankar Mandal |
New Lower Bounds for the Number of Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 410-425, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Jinhee Chun, Kenya Kikuchi, Takeshi Tokuyama |
Consistent Digital Curved Rays and Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 32:1-32:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Adrian Dumitrescu, Ritankar Mandal |
New Lower Bounds for the Number of Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.03619, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
31 | Jürgen Bokowski, Piotr Pokora |
On the Sylvester-Gallai and the orchard problem for pseudoline arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Period. Math. Hung. ![In: Period. Math. Hung. 77(2), pp. 164-174, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
31 | Jürgen Bokowski, Piotr Pokora |
On line and pseudoline configurations and ball-quotients. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 13(2), pp. 409-416, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
31 | Ben Lund 0002, George B. Purdy, Justin W. Smith |
A Pseudoline Counterexample to the Strong Dirac Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 21(2), pp. 2, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
31 | Ricky Pollack |
Allowable double-permutation sequences and double pseudoline arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 31, pp. 167-168, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Leah Wrenn Berman |
Symmetric Simplicial Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 15(1), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
31 | Jacob E. Goodman |
Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Discrete and Computational Geometry, 2nd Ed. ![In: Handbook of Discrete and Computational Geometry, Second Edition., pp. 97-128, 2004, Chapman and Hall/CRC, 978-1-58488-301-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
31 | Micha Sharir, Shakhar Smorodinsky |
Extremal Configurations and Levels in Pseudoline Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 127-139, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Rudi Penne |
Moves on Pseudoline Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 17(6), pp. 569-593, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
31 | Jacob E. Goodman, Richard Pollack |
Helly-Type Theorems for Pseudoline Arrangements in P2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 32(1), pp. 1-19, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
28 | Matthew Dickerson, David Eppstein, Kevin A. Wortman |
Planar Voronoi Diagrams for Sums of Convex Functions, Smoothed Distance and Dilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISVD ![In: Seventh International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2010, Quebec, Canada, June 28-30, 2010, pp. 13-22, 2010, IEEE Computer Society, 978-0-7695-4112-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
biotope transform metric, Lloyd's algorithm, pseudocircle, pseudoline, smoothed distance, randomized algorithms, Voronoi diagram, dilation, convex function |
28 | Oswin Aichholzer, Hannes Krasser |
Abstract order type extension and new results on the rectilinear crossing number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 91-98, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
pseudoline arrangement, rectilinear crossing number, complete graph, order type |
28 | Stefan Felsner, Ferran Hurtado, Marc Noy, Ileana Streinu |
Hamiltonicity and colorings of arrangement graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA., pp. 155-164, 2000, ACM/SIAM, 0-89871-453-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
Hamilton decomposition, Hamilton path, circle and pseudocircle arrangement, line and pseudoline arrangement, projective-planar graph, connectivity, coloring, planar graph, Hamilton cycle |
28 | Ileana Streinu |
Stretchability of Star-Like Pseudo-Visibility Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Fifteenth Annual Symposium on Computational Geometry, Miami Beach, Florida, USA, June 13-16, 1999, pp. 274-280, 1999, ACM, 1-58113-068-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
pseudo-polygon, pseudoline arrangement, visibility graph, oriented matroid |
28 | Emeric Gioan |
Complete Graph Drawings Up to Triangle Mutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 139-150, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #24 of 24 (100 per page; Change: )
|
|