×

Found 227 Documents (Results 1–100)

Simplifying activity-on-edge graphs. (English) Zbl 07759292

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 24, 14 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Low-stretch spanning trees of graphs with bounded width. (English) Zbl 07759283

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 15, 19 p. (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tracking paths in planar graphs. (English) Zbl 07650287

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 54, 17 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

New applications of nearest-neighbor chains: Euclidean TSP and motorcycle graphs. (English) Zbl 07650284

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 51, 21 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

C-planarity testing of embedded clustered graphs with bounded dual carving-width. (English) Zbl 1515.68236

Jansen, Bart M. P. (ed.) et al., 14th international symposium on parameterized and exact computation, IPEC 2019, Munich, Germany, September 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 148, Article 9, 17 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI

Counting polygon triangulations is hard. (English) Zbl 07559233

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 33, 17 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Cubic planar graphs that cannot be drawn on few lines. (English) Zbl 07559232

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 32, 15 p. (2019).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Parameterized leaf power recognition via embedding into graph products. (English) Zbl 1520.68121

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 16, 14 p. (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The parameterized complexity of finding point sets with hereditary properties. (English) Zbl 1520.68048

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 11, 14 p. (2019).
MSC:  68Q27 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Homotopy height, grid-major height and graph-drawing height. (English) Zbl 07266137

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, 468-481 (2019).
MSC:  68R10 68U05
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

Finding maximal sets of laminar 3-separators in planar graphs in linear time. (English) Zbl 1431.68092

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 589-605 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Stable-matching Voronoi diagrams: combinatorial complexity and algorithms. (English) Zbl 1473.68200

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 89, 14 p. (2018).
MSC:  68U05 68W05 90C27
PDFBibTeX XMLCite
Full Text: DOI

\(k\)-best solutions of MSO problems on tree-decomposable graphs. (English) Zbl 1443.68127

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 16, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Grid peeling and the affine curve-shortening flow. (English) Zbl 1430.68368

Pagh, Rasmus (ed.) et al., Proceedings of the 20th workshop on algorithm engineering and experiments, ALENEX ’18, New Orleans, LA, January 7–8, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 109-116 (2018).
MSC:  68U05 52C05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Subexponential-time and FPT algorithms for embedded flat clustered planarity. (English) Zbl 1517.68287

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, 111-124 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect. (English) Zbl 1436.68132

Wang, Lusheng (ed.) et al., Computing and combinatorics. 24th international conference, COCOON 2018, Qing Dao, China, July 2–4, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10976, 365-377 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

16th Scandinavian symposium and workshops on algorithm theory. SWAT 2018, June 18–20, 2018, Malmö University, Malmö, Sweden. (English) Zbl 1390.68019

LIPIcs – Leibniz International Proceedings in Informatics 101. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-068-2). vii, 33 articles, not consecutively paged, electronic only, open access (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Algorithms for stable matching and clustering in a grid. (English) Zbl 1486.68211

Brimkov, Valentin E. (ed.) et al., Combinatorial image analysis. 18th international workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19–21, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10256, 117-131 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Maximum plane trees in multipartite geometric graphs. (English) Zbl 1491.68137

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, 193-204 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Models and algorithms for graph watermarking. (English) Zbl 1397.68060

Bishop, Matt (ed.) et al., Information security. 19th international conference, ISC 2016, Honolulu, HI, USA, September 3–6, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-45870-0/pbk; 978-3-319-45871-7/ebook). Lecture Notes in Computer Science 9866, 283-301 (2016).
MSC:  68P25 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Treetopes and their graphs. (English) Zbl 1410.68368

Krauthgamer, Robert (ed.), Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms, SODA 2016, Arlington, VA, USA, January 10–12, 2016. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 969-984 (2016).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Track layout is hard. (English) Zbl 1478.68214

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, 499-510 (2016).
PDFBibTeX XMLCite
Full Text: DOI

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

From discrepancy to majority. (English) Zbl 1386.68112

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, 390-402 (2016).
MSC:  68R05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Finding all maximal subsequences with hereditary properties. (English) Zbl 1378.68154

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, 240-254 (2015).
MSC:  68U05 05C10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Minimum forcing sets for Miura folding patterns. (English) Zbl 1371.52012

Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 136-147 (2015).
MSC:  52B70 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Confluent orthogonal drawings of syntax diagrams. (English) Zbl 1471.68182

Di Giacomo, Emilio (ed.) et al., Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9411, 260-271 (2015).
MSC:  68R10 68Q42 68Q45
PDFBibTeX XMLCite
Full Text: DOI arXiv

Genus, treewidth, and local crossing number. (English) Zbl 1471.68192

Di Giacomo, Emilio (ed.) et al., Graph drawing and network visualization. 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24–26, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9411, 87-98 (2015).
MSC:  68R10 05C10 05C62
PDFBibTeX XMLCite
Full Text: DOI

Contact graphs of circular arcs. (English) Zbl 1444.68131

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9214, 1-13 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Proceedings of the 17th workshop on algorithm engineering and experiments (ALENEX ’15), San Diego, CA, USA, January 5, 2015. (English) Zbl 1308.68016

Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-375-4/ebook). 187 p., electronic only (2015).
MSC:  68-06 00B25
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

Small superpatterns for dominance drawing. (English) Zbl 1429.68169

Drmota, Michael (ed.) et al., Proceedings of the 11th workshop on analytic algorithmics and combinatorics (ANALCO ’14), Portland, OR, USA, January 6, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 92-103 (2014).
MSC:  68R10 05A05
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

Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth. (English) Zbl 1426.68199

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, 210-221 (2014).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

The Galois complexity of graph drawing: why numerical solutions are ubiquitous for force-directed, spectral, and circle packing drawings. (English) Zbl 1426.68198

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, 149-161 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

The graphs of planar soap bubbles. (English) Zbl 1305.68229

Proceedings of the 29th annual symposium on computational geometry, SoCG 2013, Rio de Janeiro, Brazil, June 17–20, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2031-3). 27-36 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Drawing arrangement graphs in small grids, or how to play planarity. (English) Zbl 1406.68074

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, 436-447 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Strict confluent drawing. (English) Zbl 1405.68244

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, 352-363 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Fixed parameter tractability of crossing minimization of almost-trees. (English) Zbl 1406.68061

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, 340-351 (2013).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Superpatterns and universal point sets. (English) Zbl 1406.68060

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, 208-219 (2013).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial pair testing: distinguishing workers from slackers. (English) Zbl 1390.68493

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, 316-327 (2013).
MSC:  68R05 68W05 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Parameterized complexity of 1-planarity. (English) Zbl 1390.68329

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, 97-108 (2013).
MSC:  68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Force-directed graph drawing using social gravity and scaling. (English) Zbl 1377.68162

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, 414-425 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the density of maximal 1-planar graphs. (English) Zbl 1377.68165

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, 327-338 (2013).
MSC:  68R10 05C62
PDFBibTeX XMLCite
Full Text: DOI

Randomized speedup of the Bellman-Ford algorithm. (English) Zbl 1429.68170

Hwang, Hsien-Kuei (ed.) et al., Proceedings of the 9th workshop on analytic algorithmics and combinatorics (ANALCO ’12), Kyoto, Japan, January 16, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 41-47 (2012).
MSC:  68R10 05C38 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Hardness of approximate compaction for nonplanar orthogonal graph drawings. (English) Zbl 1311.68103

van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 367-378 (2012).
MSC:  68R10 68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

Planar and poly-arc Lombardi drawings. (English) Zbl 1311.68168

van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 308-319 (2012).
MSC:  68U05 05C10 68R10
PDFBibTeX XMLCite
Full Text: DOI arXiv

Confluent Hasse diagrams. (English) Zbl 1311.68116

van Kreveld, Marc (ed.) et al., Graph drawing. 19th international symposium, GD 2011, Eindhoven, The Netherlands, September 21–23, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25877-0/pbk). Lecture Notes in Computer Science 7034, 2-13 (2012).
MSC:  68R10 05C20 05C62
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bounds on the complexity of halfspace intersections when the bounded faces have small dimension. (English) Zbl 1283.52033

Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13–15, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0682-9). 361-369 (2011).
MSC:  52C45 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tracking moving objects with few handovers. (English) Zbl 1342.68334

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, 362-373 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Adjacency-preserving spatial treemaps. (English) Zbl 1342.68330

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, 159-170 (2011).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI Link

Optimal 3D angular resolution for low-degree graphs. (English) Zbl 1314.68228

Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 208-219 (2011).
MSC:  68R10 05C62 68U05
PDFBibTeX XMLCite
Full Text: DOI

Lombardi drawings of graphs. (English) Zbl 1314.68227

Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 195-207 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Drawing trees with perfect angular resolution and polynomial area. (English) Zbl 1311.68113

Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 183-194 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Drawing graphs in the plane with a prescribed outer face and polynomial area. (English) Zbl 1314.68221

Brandes, Ulrik (ed.) et al., Graph drawing. 18th international symposium, GD 2010, Konstanz, Germany, September 21–24, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18468-0/pbk). Lecture Notes in Computer Science 6502, 129-140 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Paired approximation problems and incompatible inapproximabilities. (English) Zbl 1288.68263

Charikar, Moses (ed.), Proceedings of the 21st annual ACM-SIAM symposium on discrete algorithms, SODA 2010, Austin, TX, USA, January 17–19, 2010. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-0-89871-698-6/CD-ROM). 1076-1086 (2010).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software