×

Found 156 Documents (Results 1–100)

Connectivity of triangulation flip graphs in the plane (Part II: Bistellar Flips). (English) Zbl 07760196

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 67, 16 p. (2020).
MSC:  68U05 68R10 68-06
PDFBibTeX XMLCite
Full Text: DOI

Convex hulls of random order types. (English) Zbl 07760178

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 49, 15 p. (2020).
MSC:  68U05 68U03 68-06
PDFBibTeX XMLCite
Full Text: DOI arXiv

An optimal decentralized \((\Delta+1)\)-coloring algorithm. (English) Zbl 07651156

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 17, 12 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Connectivity of triangulation flip graphs in the plane. I: Edge flips. (English) Zbl 07304196

Chawla, Shuchi (ed.), Proceedings of the 31st annual ACM-SIAM symposium on discrete algorithms, SODA 2020, Salt Lake City, UT, USA, January 5–8, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2823-2841 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Minimal representations of order types by geometric graphs. (English) Zbl 07266109

Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 101-113 (2019).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI Link

Solving and sampling with many solutions: satisfiability and other hard problems. (English) Zbl 1443.68069

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 11, 12 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lower bounds for searching robots, some faulty. (English) Zbl 1428.68165

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 447-453 (2018).
MSC:  68Q17 68M14 68M15
PDFBibTeX XMLCite
Full Text: DOI arXiv

From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices. (English) Zbl 1436.05032

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 54, 16 p. (2017).
MSC:  05C10 52B05
PDFBibTeX XMLCite
Full Text: DOI

Crossing-free perfect matchings in wheel point sets. (English) Zbl 1387.05034

Loebl, Martin (ed.) et al., A journey through discrete mathematics. A tribute to Jiří Matoušek. Cham: Springer (ISBN 978-3-319-44478-9/hbk; 978-3-319-44479-6/ebook). 735-764 (2017).
MSC:  05B25
PDFBibTeX XMLCite
Full Text: DOI

ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\). (English) Zbl 1386.91034

Loebl, Martin (ed.) et al., A journey through discrete mathematics. A tribute to Jiří Matoušek. Cham: Springer (ISBN 978-3-319-44478-9/hbk; 978-3-319-44479-6/ebook). 367-374 (2017).
MSC:  91A43 90B10 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Order on order types. (English) Zbl 1378.68184

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 285-299 (2015).
MSC:  68U05 05C10 05C62
PDFBibTeX XMLCite
Full Text: DOI

Counting plane graphs: flippability and its applications. (English) Zbl 1272.05080

Pach, János (ed.), Thirty essays on geometric graph theory. Berlin: Springer (ISBN 978-1-4614-0109-4/hbk; 978-1-4614-0110-0/ebook). 303-325 (2013).
MSC:  05C30 05C10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn’s technique. (English) Zbl 1293.05307

Proceedings of the 28th annual symposium on computational geometry, SoCG 2012, Chapel Hill, NC, USA, June 17–20, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1299-8). 189-198 (2012).
MSC:  05C70 05C10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the number of upward planar orientations of maximal planar graphs. (English) Zbl 1260.05041

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 413-422 (2012).
MSC:  05C10 05C62 68U05
PDFBibTeX XMLCite
Full Text: DOI

Counting plane graphs: flippability and its applications. (English) Zbl 1342.68257

Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15–17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 524-535 (2011).
MSC:  68R10 05C10 05C30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Combinatorial and computational geometry. Reprint of the 2005 hardback ed. (English) Zbl 1217.51003

Mathematical Sciences Research Institute Publications 52. Cambridge: Cambridge University Press (ISBN 978-0-521-17839-6/pbk). xi, 616 p. (2011).
MSC:  51-06 52-06 00B15
PDFBibTeX XMLCite
Full Text: Link

Counting plane graphs with exponential speed-up. (English) Zbl 1277.05122

Calude, Cristian S. (ed.) et al., Rainbow of computer science. Dedicated to Hermann Maurer on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-19390-3/pbk). Lecture Notes in Computer Science 6570, 36-46 (2011).
PDFBibTeX XMLCite
Full Text: DOI

On degrees in random triangulations of point sets. (English) Zbl 1284.05247

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 297-306 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Number of crossing-free geometric graphs vs. Triangulations. (English) Zbl 1267.05097

Ossona de Mendez, Patrice (ed.) et al., The international conference on topological and geometric graph theory. Papers from the conference (TGGT 2008) held at the École Normale Supérieure, Paris, France, May 19–23, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 31, 195-200 (2008).
MSC:  05C10 05C30
PDFBibTeX XMLCite
Full Text: DOI

Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. (English) Zbl 1130.68001

Lecture Notes in Computer Science 4698. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). xv, 769 p. (2007).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

On the number of crossing-free matchings, (cycles, and partitions). (English) Zbl 1192.05125

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 860-869 (2006).
MSC:  05C70 05C62
PDFBibTeX XMLCite
Full Text: DOI

Random triangulations of planar points sets. (English) Zbl 1161.52305

Martínez Moro, Edgar (ed.), V jornadas de matemática discreta y algorítmica. Valladolid: Universidade de Valladolid, Secretariado de Publicaciones e Intercambio Editorial (ISBN 978-84-8448-380-9/pbk). Ciencias (Valladolid) 23, 41-46 (2006).
MSC:  52B05 05C62
PDFBibTeX XMLCite

Random triangulations of planar point sets. (English) Zbl 1153.68546

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 273-281 (2006).
MSC:  68U05 65D18
PDFBibTeX XMLCite

The number of crossing free configurations on finite point sets in the plane. (English) Zbl 1177.68242

Arun-Kumar, S. (ed.) et al., FSTTCS 2006: Foundations of software technology and theoretical computer science. 26th international conference, Kolkata, India, December 13–15, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49994-7/pbk). Lecture Notes in Computer Science 4337, 20 (2006).
MSC:  68U05 05C62 68R10
PDFBibTeX XMLCite
Full Text: DOI

Online conflict-free coloring for intervals. (English) Zbl 1297.68083

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 545-554 (2005).
PDFBibTeX XMLCite

Interference in cellular networks: The minimum membership set cover problem. (English) Zbl 1128.90319

Wang, Lusheng (ed.), Computing and combinatorics. 11th annual international conference, COCOON 2005, Kunming, China, August 16–29, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28061-8/pbk). Lecture Notes in Computer Science 3595, 188-198 (2005).
MSC:  90B18 90C35
PDFBibTeX XMLCite
Full Text: DOI

Off-line admission control for advance reservations in star networks. (English) Zbl 1124.90301

Persiano, Giuseppe (ed.) et al., Approximation and online algorithms. Second international workshop, WAOA 2004, Bergen, Norway, September 14–16, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24574-X/pbk). Lecture Notes in Computer Science 3351, 211-224 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Algorithms for center and Tverberg points. (English) Zbl 1373.68422

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 61-67 (2004).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

Geometric optimization and unique sink orientations of cubes. (English) Zbl 1097.90569

Fiala, Jiří(ed.) et al., Mathematical foundations of computer Science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22823-3/pbk). Lecture Notes in Computer Science 3153, 176-176 (2004).
MSC:  90C27 05C20 90C35
PDFBibTeX XMLCite
Full Text: DOI

Point-line incidences in space. (English) Zbl 1415.52018

Proceedings of the 18th annual symposium on computational geometry, SCG/SoCG 2002, Barcelona, Spain, June 5–7, 2002. New York, NY: Association for Computing Machinery (ACM). 107-115 (2002).
MSC:  52C35
PDFBibTeX XMLCite
Full Text: DOI

Euler graphs, triangle-free graphs and bipartite graphs in switching classes. (English) Zbl 1028.68101

Corradini, Andrea (ed.) et al., Graph transformation. 1st international conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2505, 148-160 (2002).
MSC:  68R10 68Q42 05C45
PDFBibTeX XMLCite
Full Text: Link

Translating a planar object to maximize point containment. (English) Zbl 1019.68134

Möhring, Rolf (ed.) et al., Algorithms - ESA 2002. 10th annual European symposium, Rome, Italy, September 17-21, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2461, 42-53 (2002).
MSC:  68W25 65C05
PDFBibTeX XMLCite
Full Text: Link

Balanced lines, halving triangles, and the generalized lower bound theorem. (English) Zbl 1376.52032

Souvaine, Diane L. (ed.), Proceedings of the 17th annual symposium on computational geometry, SCG/SoCG 2001, Medford, MA, USA, June 3–5, 2001. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-357-X). 315-318 (2001).
MSC:  52C10
PDFBibTeX XMLCite
Full Text: DOI

One line and \(n\) points. (English) Zbl 1323.90038

Proceedings of the thirty-third annual ACM symposium on theory of computing, STOC 2001. Hersonissos, Crete, Greece, July 6–8, 2001. New York, NY: ACM Press (ISBN 1-581-13349-9). 306-315 (2001).
MSC:  90C08 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI

Random sampling in geometric optimization: new insights and applications. (English) Zbl 1377.68278

Proceedings of the 16th annual symposium on computational geometry, SCG 2000, Hong Kong, China, June 12–14, 2000. New York, NY: ACM, Association for Computing Machinery (ACM). 91-99 (2000).
MSC:  68U05 90C05 90C90
PDFBibTeX XMLCite
Full Text: DOI

Origin-embracing distributions or a continuous analogue of the upper bound theorem. (English) Zbl 1377.68294

Proceedings of the 16th annual symposium on computational geometry, SCG 2000, Hong Kong, China, June 12–14, 2000. New York, NY: ACM, Association for Computing Machinery (ACM). 50-56 (2000).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

On a simple sampling lemma. (English) Zbl 0966.68204

Wolfram, David (ed.), CATS 2000 Computing: the Australasian theory symposium, Canberra, Australia, February 1-2, 2000. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 31,1, 10 p., electronic only (2000).
MSC:  68U05
PDFBibTeX XMLCite

Contour edge analysis for polyhedron projections. (English) Zbl 0898.68095

Straßer, Wolfgang (ed.) et al., Geometric modeling: theory and practice. The state of the art. Based on the international conference held in Blaubeuren, Germany, October 1996. Berlin: Springer. Focus on Computer Graphics. 379-394 (1997).
MSC:  68U05 68U07
PDFBibTeX XMLCite

Linear programming – randomization and abstract frameworks. (English) Zbl 1380.90184

Puech, Claude (ed.) et al., STACS 96. 13th annual symposium on theoretical aspects of computer science. Grenoble, France, February 22–24, 1996. Proceedings. Berlin: Springer-Verlag (ISBN 3-540-60922-9). Lecture Notes in Computer Science 1046, 669-687 (1996).
PDFBibTeX XMLCite
Full Text: DOI

Voronoi diagrams of lines in 3-space under polyhedral convex distance functions. (English) Zbl 0848.68107

Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 197-204 (1995).
MSC:  68U05 68Q25
PDFBibTeX XMLCite

Space filling curves and their use in the design of geometric data structures. (English) Zbl 1495.68236

Baeza-Yates, Ricardo (ed.) et al., LATIN ’95: Theoretical informatics. 2nd Latin American symposium, Valparaíso, Chile, April 3–7, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 911, 36-48 (1995).
MSC:  68U05 68P05 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Improved bounds on weak \({\epsilon}\)-nets for convex sets. (English) Zbl 1310.68201

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 495-504 (1993).
MSC:  68U05 68Q17
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software