|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 12 keywords
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
163 | Luc Habert, Michel Pocchiola |
Arrangements of double pseudolines: extended abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 314-323, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
double pseudolines, pseudolines, duality, convexity, arrangements, axiomatization |
120 | Stefan Felsner, Klaus Kriegel |
Triangles in Euclidean Arrangements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 137-148, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
102 | Stefan Felsner |
On the Number of Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(3), pp. 257-267, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
72 | 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 |
54 | Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz |
Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 34(3), pp. 411-437, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 568-579, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
combinatorial complexity bounds, incidence counting, many-faces problem, pseudolines, unit circles, general circles, pseudocircles, three-dimensional unit-distance problem, upper bounds, surfaces, curves, lines, three dimensions, spheres |
30 | Sandro Roch |
Coloring problems on arrangements of pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.12564, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
30 | Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber |
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 4849-4871, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
30 | Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber |
Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.19711, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
30 | Sergey Bereg, Mohammadreza Haghpanah |
New algorithms and bounds for halving pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 319, pp. 194-206, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
30 | Alan Arroyo, Julien Bensmail, R. Bruce Richter |
Extending Drawings of Graphs to Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Geom. ![In: J. Comput. Geom. 12(2), pp. 3-24, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
30 | Sergey Bereg, Mohammadreza Haghpanah |
New Algorithms and Bounds for Halving Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings, pp. 463-475, 2020, Springer, 978-3-030-39218-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | Alan Arroyo, Julien Bensmail, R. Bruce Richter |
Extending Drawings of Graphs to Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland., pp. 9:1-9:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-143-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
30 | David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt |
Convex-Arc Drawings of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1601.06865, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
30 | I. N. Shnurnikov |
A tk Inequality for Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 55(2), pp. 284-295, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
30 | Luc Habert, Michel Pocchiola |
Arrangements of double pseudolines ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1101.1022, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
30 | Julien Ferté, Vincent Pilaud, Michel Pocchiola |
On the Number of Simple Arrangements of Five Double Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 45(2), pp. 279-302, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Stefan Felsner, Pavel Valtr 0001 |
Coding and Counting Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 46(3), pp. 405-416, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
30 | Julien Ferté, Vincent Pilaud, Michel Pocchiola |
On the number of simple arrangements of five double pseudolines ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1009.1575, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
30 | Leah Wrenn Berman |
Astral (n4) configurations of pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 3(2), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
30 | Jean-Pierre Roudneff |
The Maximum Number of Triangles in Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 66(1), pp. 44-74, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Stefan Felsner |
On the Number of Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Twelfth Annual Symposium on Computational Geometry, Philadelphia, PA, USA, May 24-26, 1996, pp. 30-37, 1996, ACM, 0-89791-804-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
30 | Peter W. Shor |
Stretchability of Pseudolines is NP-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applied Geometry And Discrete Mathematics ![In: Applied Geometry And Discrete Mathematics, Proceedings of a DIMACS Workshop, Providence, Rhode Island, USA, September 18, 1990, pp. 531-554, 1990, DIMACS/AMS, 978-0-8218-6593-4. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
30 | Dragoslav Ljubic, Jean-Pierre Roudneff, Bernd Sturmfels |
Arrangements of lines and pseudolines without adjacent triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 50(1), pp. 24-32, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
30 | Jean-Pierre Roudneff |
On the number of triangles in simple arrangements of pseudolines in the real projective plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 60, pp. 243-251, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
30 | Jacob E. Goodman, Richard Pollack |
Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 29(3), pp. 385-390, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
24 | Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia |
Simple Euclidean Arrangements with No (>= 5)-Gons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 38(3), pp. 595-603, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Daniel Bienstock |
Some Provably Hard Crossing Number Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, June 6-8, 1990, pp. 253-260, 1990, ACM, 0-89791-362-0. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|