×

Found 134 Documents (Results 1–100)

WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. (English) Zbl 1490.68024

Lecture Notes in Computer Science 13174. Cham: Springer (ISBN 978-3-030-96730-7/pbk; 978-3-030-96731-4/ebook). xviii, 424 p. (2022).
MSC:  68-06 68Wxx 00B25
PDF BibTeX XML Cite
Full Text: DOI

29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. (English) Zbl 1473.68018

LIPIcs – Leibniz International Proceedings in Informatics 204. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik (ISBN 978-3-95977-204-4). xx, 82 articles, not consecutively paged, electronic only, open access (2021).
MSC:  68-06 68Wxx 00B25
PDF BibTeX XML Cite
Full Text: DOI Link

Shrinking trees not blossoms: a recursive maximum matching approach. (English) Zbl 07302427

Blelloch, Guy (ed.) et al., Proceedings of the 22nd symposium on algorithm engineering and experiments, ALENEX ’20, Salt Lake City, Utah, January 5–6, 2020. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 146-160 (2020).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Algorithmic data science (Invited Talk). (English) Zbl 07559112

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 3, 15 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

10 reasons to get interested in graph drawing. (English) Zbl 1482.68171

Steffen, Bernhard (ed.) et al., Computing and software science. State of the art and perspectives. Cham: Springer. Lect. Notes Comput. Sci. 10000, 85-104 (2019).
MSC:  68R10 68U05 68-02
PDF BibTeX XML Cite
Full Text: DOI

On the enumeration of bicriteria temporal paths. (English) Zbl 07117297

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 15th annual conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11436, 518-535 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

A new integer linear program for the Steiner tree problem with revenues, budget and hop constraints. (English) Zbl 1430.90488

Kobourov, Stephen (ed.) et al., Proceedings of the 21st workshop on algorithm engineering and experiments, ALENEX ’19, San Diego, CA, USA, January 7–8, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 107-116 (2019).
MSC:  90C27 90C10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Largest weight common subtree embeddings with distance penalties. (English) Zbl 1512.68208

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 54, 15 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

New integer linear programming models for the vertex coloring problem. (English) Zbl 1504.68167

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, 640-652 (2018).
MSC:  68R10 05C15 90C10
PDF BibTeX XML Cite
Full Text: DOI arXiv

A flow formulation for horizontal coordinate assignment with prescribed width. (English) Zbl 1519.68193

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, 187-199 (2018).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

The crossing number of seq-shellable drawings of complete graphs. (English) Zbl 1511.68205

Iliopoulos, Costas (ed.) et al., Combinatorial algorithms. 29th international workshop, IWOCA 2018, Singapore, July 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10979, 273-284 (2018).
MSC:  68R10 05C62
PDF BibTeX XML Cite
Full Text: DOI arXiv

A fixed-parameter algorithm for the max-cut problem on embedded 1-planar graphs. (English) Zbl 1511.68200

Iliopoulos, Costas (ed.) et al., Combinatorial algorithms. 29th international workshop, IWOCA 2018, Singapore, July 16–19, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10979, 141-152 (2018).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Crossing number for graphs with bounded pathwidth. (English) Zbl 1457.68204

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 13, 13 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem. (English) Zbl 1485.68301

Poon, Sheung-Hung (ed.) et al., WALCOM: algorithms and computation. 11th international conference and workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10167, 190-203 (2017).
MSC:  68W05 90C29 90C35
PDF BibTeX XML Cite
Full Text: DOI arXiv

Finding largest common substructures of molecules in quadratic time. (English) Zbl 1444.92141

Steffen, Bernhard (ed.) et al., SOFSEM 2017: theory and practice of computer science. 43rd international conference on current trends in theory and practice of computer science, Limerick, Ireland, January 16–20, 2017, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10139, 309-321 (2017).
MSC:  92E10 68W40
PDF BibTeX XML Cite
Full Text: DOI arXiv

A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph. (English) Zbl 1398.05202

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 49, 13 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Faster algorithms for the maximum common subtree isomorphism problem. (English) Zbl 1398.05196

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 33, 14 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Compact layered drawings of general directed graphs. (English) Zbl 1478.68245

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, 209-221 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems. (English) Zbl 1466.90083

Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 288-299 (2015).
MSC:  90C27 68W40 90C29
PDF BibTeX XML Cite
Full Text: DOI

On maximum common subgraph problems in series-parallel graphs. (English) Zbl 1401.05282

Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 200-212 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Practical experience with Hanani-Tutte for testing c-planarity. (English) Zbl 1430.68212

McGeoch, Catherine C. (ed.) et al., Proceedings of the 16th workshop on algorithm engineering and experiments (ALENEX ’14), Portland, OR, USA, January 5, 2014. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 86-97 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Enumeration of maximum common subtree isomorphisms with polynomial-delay. (English) Zbl 1435.05105

Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 81-93 (2014).
MSC:  05C30 05C60
PDF BibTeX XML Cite
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
PDF BibTeX XML Cite
Full Text: DOI arXiv

Finding maximum common biconnected subgraphs in series-parallel graphs. (English) Zbl 1426.68129

Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 505-516 (2014).
PDF BibTeX XML Cite
Full Text: DOI

SAHN clustering in arbitrary metric spaces using heuristic nearest neighbor search. (English) Zbl 1407.68400

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and computation. 8th international workshop, WALCOM 2014, Chennai, India, February 13–15, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8344, 90-101 (2014).
MSC:  68T05 68T20
PDF BibTeX XML Cite
Full Text: DOI

The maximum weight connected subgraph problem. (English) Zbl 1317.90299

Jünger, Michael (ed.) et al., Facets of combinatorial optimization. Festschrift for Martin Grötschel on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-38188-1/hbk; 978-3-642-38189-8/ebook). 245-270 (2013).
MSC:  90C35 90C10
PDF BibTeX XML Cite
Full Text: DOI

The rooted maximum node-weight connected subgraph problem. (English) Zbl 1382.90108

Gomes, Carla (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 10th international conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18–22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38170-6/pbk). Lecture Notes in Computer Science 7874, 300-315 (2013).
PDF BibTeX XML Cite
Full Text: DOI

An SDP approach to multi-level crossing minimization. (English) Zbl 1430.90457

Müller-Hannemann, Matthias (ed.) et al., Proceedings of the 13th workshop on algorithm engineering and experiments (ALENEX ’11), San Francisco, CA, USA, January 22, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 116-126 (2011).
PDF BibTeX XML Cite
Full Text: DOI Link

Improved Steiner tree algorithms for bounded treewidth. (English) Zbl 1349.05322

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 374-386 (2011).
MSC:  05C85 05C05
PDF BibTeX XML Cite
Full Text: DOI

Crossing minimization and layouts of directed hypergraphs with port constraints. (English) Zbl 1314.68223

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, 141-152 (2011).
MSC:  68R10 05C65
PDF BibTeX XML Cite
Full Text: DOI

An experimental evaluation of multilevel layout methods. (English) Zbl 1314.68217

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, 80-91 (2011).
MSC:  68R10
PDF BibTeX XML Cite
Full Text: DOI

Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. (English) Zbl 1311.90085

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, 427-439 (2010).
MSC:  90C15 90C10 90C57
PDF BibTeX XML Cite
Full Text: DOI Link

On open problems in biological network visualization. (English) Zbl 1284.68438

Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22–25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 256-267 (2010).
MSC:  68R10 92C42
PDF BibTeX XML Cite
Full Text: DOI

Upward planarization layout. (English) Zbl 1284.68452

Eppstein, David (ed.) et al., Graph drawing. 17th international symposium, GD 2009, Chicago, IL, USA, September 22–25, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11804-3/pbk). Lecture Notes in Computer Science 5849, 94-106 (2010).
MSC:  68R10 05C62 05C85
PDF BibTeX XML Cite
Full Text: DOI

Inserting a vertex into a planar graph. (English) Zbl 1421.68111

Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 375-383 (2009).
PDF BibTeX XML Cite
Full Text: Link

Planar biconnectivity augmentation with fixed embedding. (English) Zbl 1267.05261

Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 289-300 (2009).
MSC:  05C85 05C10
PDF BibTeX XML Cite
Full Text: DOI

On the hardness and approximability of planar biconnectivity augmentation. (English) Zbl 1248.68381

Ngo, Hung Q. (ed.), Computing and combinatorics. 15th annual international conference, COCOON 2009, Niagara Falls, NY, USA, July 13–15, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02881-6/pbk). Lecture Notes in Computer Science 5609, 249-257 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Approximating the crossing number of apex graphs. (English) Zbl 1213.05050

Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 432-434 (2009).
PDF BibTeX XML Cite
Full Text: DOI

An SPQR-tree approach to decide special cases of simultaneous embedding with fixed edges. (English) Zbl 1213.68447

Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 157-168 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Computing maximum c-planar subgraphs. (English) Zbl 1213.68434

Tollis, Ioannis G. (ed.) et al., Graph drawing. 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21–24, 2008. Revised papers. Berlin: Springer (ISBN 978-3-642-00218-2/pbk). Lecture Notes in Computer Science 5417, 114-120 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Obtaining optimal \(k\)-cardinality trees fast. (English) Zbl 1427.68352

Munro, J. Ian (ed.) et al., Proceedings of the tenth workshop on algorithm engineering and experiments (ALENEX 08), San Francisco, CA, USA, January 19, 2008. Proceedings in Applied Mathematics 129. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 27-36 (2008).
PDF BibTeX XML Cite
Full Text: DOI

Recent advances in exact crossing minimization (extended abstract). (English) Zbl 1267.05094

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, 33-36 (2008).
PDF BibTeX XML Cite
Full Text: DOI

Strong formulations for 2-node-connected Steiner network problems. (English) Zbl 1168.90579

Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 190-200 (2008).
MSC:  90C27 90C10 90C35
PDF BibTeX XML Cite
Full Text: DOI

A new approach to exact crossing minimization. (English) Zbl 1158.90423

Halperin, Dan (ed.) et al., Algorithms – ESA 2008. 16th annual European symposium, Karlsruhe, Germany, September 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87743-1/pbk). Lecture Notes in Computer Science 5193, 284-296 (2008).
MSC:  90C57 05C10 90C35
PDF BibTeX XML Cite
Full Text: DOI

Efficient extraction of multiple Kuratowski subdivisions. (English) Zbl 1137.68474

Hong, Seok-Hee (ed.) et al., Graph drawing. 15th international symposium, GD 2007, Sydney, Australia, September 24–26, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-77536-2/pbk). Lecture Notes in Computer Science 4875, 159-170 (2008).
PDF BibTeX XML Cite
Full Text: DOI

A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks. (English) Zbl 1209.90365

Waldmann, Karl-Heinz (ed.) et al., Operations research proceedings 2006. Selected papers of the annual international conference of the German Operations Research Society (GOR), jointly organized with the Austrian Society of Operations Research (ÖGOR) and the Swiss Society of Operations Research (SVOR), Karlsruhe, Germany, September 6–8, 2006. Berlin: Springer (ISBN 978-3-540-69994-1/pbk). 197-202 (2007).
MSC:  90C90 90C35
PDF BibTeX XML Cite
Full Text: DOI

Colored simultaneous geometric embeddings. (English) Zbl 1206.05036

Lin, Guohui (ed.), Computing and combinatorics. 13th annual international conference, COCOON 2007, Banff, Canada, July 16–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73544-1/pbk). Lecture Notes in Computer Science 4598, 254-263 (2007).
MSC:  05C10 05C85 68R10
PDF BibTeX XML Cite
Full Text: DOI

A new ILP formulation for 2-root-connected prize-collecting Steiner networks. (English) Zbl 1151.90567

Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 681-692 (2007).
MSC:  90C35
PDF BibTeX XML Cite
Full Text: DOI

A new approximation algorithm for bend minimization in the Kandinsky model. (English) Zbl 1185.68846

Kaufmann, Michael (ed.) et al., Graph drawing. 14th international symposium, GD 2006, Karlsruhe, Germany, September 18–20, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-70903-9/pbk). Lecture Notes in Computer Science 4372, 343-354 (2007).
PDF BibTeX XML Cite
Full Text: DOI

Planarity testing and optimal edge insertion with embedding constraints. (English) Zbl 1185.68482

Kaufmann, Michael (ed.) et al., Graph drawing. 14th international symposium, GD 2006, Karlsruhe, Germany, September 18–20, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-70903-9/pbk). Lecture Notes in Computer Science 4372, 126-137 (2007).
PDF BibTeX XML Cite
Full Text: DOI

On the minimum cut of planarizations. (English) Zbl 1291.05045

Hliněný, Petr (ed.) et al., 6th Czech-Slovak international symposium on combinatorics, graph theory, algorithms and applications, DIMATIA Center, Charles University, Prague, Czech Republic, July 10–16, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 28, 177-184 (2007).
MSC:  05C10
PDF BibTeX XML Cite
Full Text: DOI

Experiments on exact crossing minimization using column generation. (English) Zbl 1196.68168

Àlvarez, Carme (ed.) et al., Experimental algorithms. 5th international workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24–27, 2006. Proceedings. Berlin: Springer (ISBN 3-540-34597-3/pbk). Lecture Notes in Computer Science 4007, 303-315 (2006).
MSC:  68R10 05C85 68T20
PDF BibTeX XML Cite
Full Text: DOI

Exact crossing minimization. (English) Zbl 1171.68596

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, 37-48 (2006).
PDF BibTeX XML Cite
Full Text: DOI

Recent advances in graph drawing. (English) Zbl 1117.68461

Vojtáš, Peter (ed.) et al., SOFSEM 2005: Theory and practice of computer science. 31st conference on current trends in theory and practice of computer science, Liptovský Ján, Slovakia, January 22–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-24302-X/pbk). Lecture Notes in Computer Science 3381, 41 (2005).
MSC:  68R10 05C62
PDF BibTeX XML Cite
Full Text: DOI

Selected open problems in graph drawing. (English) Zbl 1215.05113

Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21–24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 515-539 (2004).
MSC:  05C62 05C85 68R10
PDF BibTeX XML Cite
Full Text: DOI

Graph embedding with minimum depth and maximum external face. (Extended abstract). (English) Zbl 1215.05042

Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21–24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 259-272 (2004).
MSC:  05C10 05C85
PDF BibTeX XML Cite
Full Text: DOI

An experimental study of crossing minimization heuristics. (English) Zbl 1215.68183

Liotta, Giuseppe (ed.), Graph drawing. 11th international symposium, GD 2003, Perugia, Italy, September 21–24, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20831-3/pbk). Lect. Notes Comput. Sci. 2912, 13-24 (2004).
MSC:  68R10 05C10 05C85
PDF BibTeX XML Cite
Full Text: DOI

Graph drawing: exact optimization helps! (English) Zbl 1107.90458

Grötschel, Martin (ed.), The sharpest cut. The impact of Manfred Padberg and his work. Papers from the workshop in honor of Manfred Padberg’s 60th birthday, Berlin, Germany, October 11–13, 2001. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). Philadelphia, PA: MPS, Mathematical Programming Society (ISBN 0-89871-552-0/hbk). MPS/SIAM Series on Optimization 4, 327-352 (2004).
PDF BibTeX XML Cite

The fractional prize-collecting Steiner tree problem on trees (extended abstract). (English) Zbl 1266.90188

Di Battista, Giuseppe (ed.) et al., Algorithms – ESA 2003. 11th annual European symposium, Budapest, Hungary, September 16–19, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20064-9/pbk). Lect. Notes Comput. Sci. 2832, 691-702 (2003).
MSC:  90C35 90C59
PDF BibTeX XML Cite
Full Text: DOI

Subgraph induced planar connectivity augmentation (extended abstract). (English) Zbl 1255.68114

Bodlaender, Hans L. (ed.), Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19–21, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20452-0/pbk). Lect. Notes Comput. Sci. 2880, 261-272 (2003).
PDF BibTeX XML Cite
Full Text: DOI

Automatic layout and labelling of state diagrams. (English) Zbl 1044.68131

Jäger, Willi (ed.) et al., Mathematics – key technology for the future. Joint projects between universities and industry. Berlin: Springer (ISBN 3-540-44220-0/hbk). 584-608 (2003).
MSC:  68R10 05C85 90C10
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software