The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for pseudolines with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1980-2009 (15) 2010-2024 (13)
Publication types (Num. hits)
article(18) inproceedings(10)
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
163Luc Habert, Michel Pocchiola Arrangements of double pseudolines: extended abstract. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF double pseudolines, pseudolines, duality, convexity, arrangements, axiomatization
120Stefan Felsner, Klaus Kriegel Triangles in Euclidean Arrangements. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
102Stefan Felsner On the Number of Arrangements of Pseudolines. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
72Jacob E. Goodman Double-permutation sequences and pseudoline transversals. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF double-permutation sequence, pseudoline, convex set, transversal
54Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
31Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces Search on Bibsonomy FOCS The full citation details ... 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
30Sandro Roch Coloring problems on arrangements of pseudolines. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
30Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. Search on Bibsonomy SODA The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
30Yan Alves Radtke, Stefan Felsner, Johannes Obenaus, Sandro Roch, Manfred Scheucher, Birgit Vogtenhuber Flip Graph Connectivity for Arrangements of Pseudolines and Pseudocircles. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
30Sergey Bereg, Mohammadreza Haghpanah New algorithms and bounds for halving pseudolines. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Alan Arroyo, Julien Bensmail, R. Bruce Richter Extending Drawings of Graphs to Arrangements of Pseudolines. Search on Bibsonomy J. Comput. Geom. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
30Sergey Bereg, Mohammadreza Haghpanah New Algorithms and Bounds for Halving Pseudolines. Search on Bibsonomy CALDAM The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30Alan Arroyo, Julien Bensmail, R. Bruce Richter Extending Drawings of Graphs to Arrangements of Pseudolines. Search on Bibsonomy SoCG The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30David Eppstein, Mereke van Garderen, Bettina Speckmann, Torsten Ueckerdt Convex-Arc Drawings of Pseudolines. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
30I. N. Shnurnikov A tk Inequality for Arrangements of Pseudolines. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
30Luc Habert, Michel Pocchiola Arrangements of double pseudolines Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
30Julien Ferté, Vincent Pilaud, Michel Pocchiola On the Number of Simple Arrangements of Five Double Pseudolines. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
30Stefan Felsner, Pavel Valtr 0001 Coding and Counting Arrangements of Pseudolines. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
30Julien Ferté, Vincent Pilaud, Michel Pocchiola On the number of simple arrangements of five double pseudolines Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
30Leah Wrenn Berman Astral (n4) configurations of pseudolines. Search on Bibsonomy Contributions Discret. Math. The full citation details ... 2008 DBLP  BibTeX  RDF
30Jean-Pierre Roudneff The Maximum Number of Triangles in Arrangements of Pseudolines. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
30Stefan Felsner On the Number of Arrangements of Pseudolines. Search on Bibsonomy SCG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
30Peter W. Shor Stretchability of Pseudolines is NP-Hard. Search on Bibsonomy Applied Geometry And Discrete Mathematics The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
30Dragoslav Ljubic, Jean-Pierre Roudneff, Bernd Sturmfels Arrangements of lines and pseudolines without adjacent triangles. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
30Jean-Pierre Roudneff On the number of triangles in simple arrangements of pseudolines in the real projective plane. Search on Bibsonomy Discret. Math. The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
30Jacob E. Goodman, Richard Pollack Proof of Grünbaum's Conjecture on the Stretchability of Certain Arrangements of Pseudolines. Search on Bibsonomy J. Comb. Theory, Ser. A The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
24Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia Simple Euclidean Arrangements with No (>= 5)-Gons. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Daniel Bienstock Some Provably Hard Crossing Number Problems. Search on Bibsonomy SCG The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #28 of 28 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license