×

Found 140 Documents (Results 1–100)

The visibility center of a simple polygon. (English) Zbl 07740920

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 65, 14 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Distant representatives for rectangles in the plane. (English) Zbl 07740872

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 17, 18 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. (English) Zbl 1482.68032

Lecture Notes in Computer Science 12808. Cham: Springer (ISBN 978-3-030-83507-1/pbk; 978-3-030-83508-8/ebook). xvi, 670 p. (2021).
PDFBibTeX XMLCite
Full Text: DOI

Bounded-angle minimum spanning trees. (English) Zbl 07759282

Albers, Susanne (ed.), 17th Scandinavian symposium and workshops on algorithm theory, SWAT 2020, Tórshavn, Faroe Islands, June 22–24, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 162, Article 14, 22 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Maximum matchings and minimum blocking sets in \(\varTheta_6\)-graphs. (English) Zbl 07173305

Sau, Ignasi (ed.) et al., Graph-theoretic concepts in computer science. 45th international workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019. Revised papers. Cham: Springer. Lect. Notes Comput. Sci. 11789, 258-270 (2019).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconfiguring undirected paths. (English) Zbl 07152221

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 353-365 (2019).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Rollercoasters and caterpillars. (English) Zbl 1499.68418

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 18, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Partitioning orthogonal histograms into rectangular boxes. (English) Zbl 1485.68263

Bender, Michael A. (ed.) et al., Latin 2018: theoretical informatics. 13th Latin American symposium, Buenos Aires, Argentina, April 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10807, 146-160 (2018).
MSC:  68U05 68Q17 68W40
PDFBibTeX XMLCite
Full Text: DOI

Improved bounds for drawing trees on fixed points with L-shaped edges. (English) Zbl 1503.68207

Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 305-317 (2018).
MSC:  68R10 05C05 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

The complexity of drawing a graph in a polygonal region. (English) Zbl 1519.68198

Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 387-401 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Recognition and drawing of stick graphs. (English) Zbl 1435.68229

Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 303-316 (2018).
MSC:  68R10 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Construction and local routing for angle-monotone graphs. (English) Zbl 1517.68301

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 356-368 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Convexity-increasing morphs of planar graphs. (English) Zbl 1517.68298

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 44th international workshop, WG 2018, Cottbus, Germany, June 27–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11159, 318-330 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

A proof of the orbit conjecture for flipping edge-labelled triangulations. (English) Zbl 1432.05093

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 49, 15 p. (2017).
MSC:  05C78 52C35 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fractional coverings, greedy coverings, and rectifier networks. (English) Zbl 1402.68086

Vollmer, Heribert (ed.) et al., 34th symposium on theoretical aspects of computer science (STACS 2017), Hannover, Germany, March 8–11, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-028-6). LIPIcs – Leibniz International Proceedings in Informatics 66, Article 23, 14 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Universal hinge patterns for folding strips efficiently into any grid polyhedron. (English) Zbl 1476.68272

Ellen, Faith (ed.) et al., Algorithms and data structures. 15th international symposium, WADS 2017, St. John’s, NL, Canada, July 31 – August 2, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10389, 109-120 (2017).
MSC:  68U05 52C25 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Gabriel triangulations and angle-monotone graphs: local routing and recognition. (English) Zbl 1471.68289

Hu, Yifan (ed.) et al., Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19–21, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9801, 519-531 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. (English) Zbl 1351.68016

LIPIcs – Leibniz International Proceedings in Informatics 51. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). xvii, 72 articles, not consecutively paged, electronic only, open access (2016).
MSC:  68-06 68U05 00B25
PDFBibTeX XMLCite
Full Text: Link Link

On the planar split thickness of graphs. (English) Zbl 1383.68060

Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer (ISBN 978-3-662-49528-5/pbk; 978-3-662-49529-2/ebook). Lecture Notes in Computer Science 9644, 403-415 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Some Counterexamples for Compatible Triangulations. arXiv:1612.04861

Preprint, arXiv:1612.04861 [cs.CG] (2016).
MSC:  68R10
BibTeX Cite
Full Text: arXiv

Rigid flattening of polyhedra with slits. (English) Zbl 1486.52033

Miura, Koryo (ed.) et al., Origami\(^6\). I: Mathematics. II: Technology, art, education. Proceedings of the sixth international meeting of origami science, mathematics, and education (6OSME), Tokyo, Japan, August 10–13, 2014. Providence, RI: American Mathematical Society (AMS). 109-117 (2015).
MSC:  52B70 68U05
PDFBibTeX XMLCite
Full Text: DOI

Star unfolding from a geodesic curve. (English) Zbl 1382.52009

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, 390-404 (2015).
MSC:  52B10
PDFBibTeX XMLCite
Full Text: DOI

Optimal morphs of convex drawings. (English) Zbl 1378.68149

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, 126-140 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. (English) Zbl 1352.68010

Lecture Notes in Computer Science 9411. Cham: Springer (ISBN 978-3-319-27260-3/pbk; 978-3-319-27261-0/ebook). xix, 566 p. (2015).
PDFBibTeX XMLCite
Full Text: DOI

Folding a paper strip to minimize thickness. (English) Zbl 1350.68262

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-15611-8/pbk). Lecture Notes in Computer Science 8973, 113-124 (2015).
MSC:  68U05 52B70 68Q17
PDFBibTeX XMLCite
Full Text: DOI arXiv

Continuously flattening polyhedra using straight skeletons. (English) Zbl 1395.68274

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 396-405 (2014).
MSC:  68U05 52B70 52C25
PDFBibTeX XMLCite
Full Text: DOI Link

Morphing Schnyder drawings of planar triangulations. (English) Zbl 1427.68227

Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8871, 294-305 (2014).
MSC:  68R10 05C10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Flat foldings of plane graphs with prescribed angles and edge lengths. (English) Zbl 1417.68219

Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8871, 272-283 (2014).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Drawing partially embedded and simultaneously planar graphs. (English) Zbl 1427.68233

Duncan, Christian (ed.) et al., Graph drawing. 22nd international symposium, GD 2014, Würzburg, Germany, September 24–26, 2014. Revised selected papers. Berlin: Springer. Lect. Notes Comput. Sci. 8871, 25-39 (2014).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Semantic word cloud representations: hardness and approximation algorithms. (English) Zbl 1405.68236

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 514-525 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Morphing planar graph drawings with a polynomial number of steps. (English) Zbl 1422.68177

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1656-1667 (2013).
PDFBibTeX XMLCite
Full Text: DOI Link

Algorithms for designing pop-up cards. (English) Zbl 1354.68272

Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 269-280 (2013).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Minimum length embedding of planar graphs at fixed vertex locations. (English) Zbl 1406.68069

Wismath, Stephen (ed.) et al., Graph drawing. 21st international symposium, GD 2013, Bordeaux, France, September 23–25, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03840-7/pbk). Lecture Notes in Computer Science 8242, 376-387 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Smart-grid electricity allocation via strip packing with slicing. (English) Zbl 1391.90501

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 25-36 (2013).
MSC:  90C27 68W25 90C59
PDFBibTeX XMLCite
Full Text: DOI

Self-approaching graphs. (English) Zbl 1377.68158

Didimo, Walter (ed.) et al., Graph drawing. 20th international symposium, GD 2012, Redmond, WA, USA, September 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36762-5/pbk). Lecture Notes in Computer Science 7704, 260-271 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Large angle crossing drawings of planar graphs in subquadratic area. (English) Zbl 1374.68348

Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 200-209 (2012).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI

A generalization of the source unfolding of convex polyhedra. (English) Zbl 1374.52019

Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 185-199 (2012).
MSC:  52B70
PDFBibTeX XMLCite
Full Text: DOI Link

Algorithms for solving Rubik’s cubes. (English) Zbl 1346.91022

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 689-700 (2011).
MSC:  91A46 68Q25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Coverage with \(k\)-transmitters in the presence of obstacles. (English) Zbl 1311.90116

Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17460-5/pbk). Lecture Notes in Computer Science 6509, 1-15 (2010).
MSC:  90C27 90B80
PDFBibTeX XMLCite
Full Text: DOI

Testing simultaneous planarity when the common graph is 2-connected. (English) Zbl 1310.68163

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 410-421 (2010).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Simultaneous interval graphs. (English) Zbl 1311.05132

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju Island, Korea, December 15–17, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17516-9/pbk). Lecture Notes in Computer Science 6506, 206-217 (2010).
MSC:  05C62 05C85 92D20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Shortest paths avoiding forbidden subpaths. (English) Zbl 1236.68103

Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26–28, 2009. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPIcs – Leibniz International Proceedings in Informatics 3, 63-74, electronic only (2009).
PDFBibTeX XMLCite
Full Text: DOI Link

The simultaneous representation problem for chordal, comparability and permutation graphs. (English) Zbl 1253.68264

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 387-398 (2009).
MSC:  68R10 05C62
PDFBibTeX XMLCite
Full Text: DOI

Morphing planar graph drawings with bent edges. (English) Zbl 1267.05178

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, 45-48 (2008).
MSC:  05C62 05C85
PDFBibTeX XMLCite
Full Text: DOI

Cauchy’s theorem and edge lengths of convex polyhedra. (English) Zbl 1209.68579

Dehne, Frank (ed.) et al., Algorithms and data structures. 10th international workshop, WADS 2007, Halifax, Canada, August 15–17, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73948-7/pbk). Lecture Notes in Computer Science 4619, 398-409 (2007).
MSC:  68U05 52B55
PDFBibTeX XMLCite
Full Text: DOI

Morphing orthogonal planar graph drawings. (English) Zbl 1192.05103

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). 222-230 (2006).
MSC:  05C62 05C10 68R10
PDFBibTeX XMLCite
Full Text: DOI

Morphing planar graphs while preserving edge directions. (English) Zbl 1171.68592

Healy, Patrick (ed.) et al., Graph drawing. 13th international symposium, GD 2005, Limerick, Ireland, September 12–14, 2005. Revised papers. Berlin: Springer (ISBN 3-540-31425-3/pbk). Lecture Notes in Computer Science 3843, 13-24 (2006).
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

all top 3

Software