×

Found 96 Documents (Results 1–96)

The Rique-number of graphs. (English) Zbl 07727774

Angelini, Patrizio (ed.) et al., Graph drawing and network visualization. 30th international symposium, GD 2022, Tokyo, Japan, September 13–16, 2022. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 13764, 371-386 (2023).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

U-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited. (English) Zbl 1518.68271

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 57, 14 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI

The stub resolution of 1-planar graphs. (English) Zbl 07224282

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 14th international conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12049, 170-182 (2020).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On vertex- and empty-ply proximity drawings. (English) Zbl 1503.68202

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, 24-37 (2018).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Bounded stub resolution for some maximal 1-planar graphs. (English) Zbl 1497.68384

Panda, B. S. (ed.) et al., Algorithms and discrete applied mathematics. 4th international conference, CALDAM 2018, Guwahati, India, February 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10743, 214-220 (2018).
MSC:  68R10 05C10 05C85
PDFBibTeX XMLCite
Full Text: DOI

Simultaneous orthogonal planarity. (English) Zbl 1478.68211

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, 532-545 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the hardness of switching to a small number of edges. (English) Zbl 1477.68232

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 159-170 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems (extended abstract). (English) Zbl 1476.68207

Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 67-78 (2016).
MSC:  68R10 05C78 68Q27
PDFBibTeX XMLCite
Full Text: DOI arXiv

2-layer fan-planarity: from caterpillar to stegosaurus. (English) Zbl 1471.68187

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, 281-294 (2015).
MSC:  68R10 05C10 05C62
PDFBibTeX XMLCite
Full Text: DOI Link

Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. (English) Zbl 1318.68027

Lecture Notes in Computer Science 8986. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). xiii, 377 p. (2015).
PDFBibTeX XMLCite
Full Text: DOI

Planar embeddings with small and uniform faces. (English) Zbl 1432.68347

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

Contact representations of planar graphs: extending a partial representation is hard. (English) Zbl 1417.05133

Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 139-151 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Drawing simultaneously embedded graphs with few bends. (English) Zbl 1426.68212

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, 40-51 (2014).
MSC:  68R10 68Q25 68U05
PDFBibTeX XMLCite
Full Text: DOI

Algorithmic aspects of regular graph covers with applications to planar graphs. (English) Zbl 1416.05224

Esparza, Javier (ed.) et al., Automata, languages, and programming. 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014. Proceedings, Part I. Berlin: Springer. Lect. Notes Comput. Sci. 8572, 489-501 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

MSOL restricted contractibility to planar graphs. (English) Zbl 1374.68236

Thilikos, Dimitrios M. (ed.) et al., Parameterized and exact computation. 7th international symposium, IPEC 2012, Ljubljana, Slovenia, September 12–14, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33292-0/pbk). Lecture Notes in Computer Science 7535, 194-205 (2012).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Can they cross? and how? (the hitchhiker’s guide to the universe of geometric intersection graphs). (English) Zbl 1283.68371

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). 75-76 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21–24, 2011. Revised papers. (English) Zbl 1228.68007

Lecture Notes in Computer Science 6986. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). xi, 344 p. (2011).
MSC:  68-06 68R10 00B25
PDFBibTeX XMLCite
Full Text: DOI

On the computational complexity of degenerate unit distance representations of graphs. (English) Zbl 1326.68160

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26–28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 274-285 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Theory and applications of models of computation. 7th annual conference, TAMC 2010, Prague, Czech Republic, June 7–11, 2010. Proceedings. (English) Zbl 1189.68012

Lecture Notes in Computer Science 6108. Berlin: Springer (ISBN 978-3-642-13561-3/pbk). xiv, 480 p. (2010).
MSC:  68-06 68Q05 00B25
PDFBibTeX XMLCite
Full Text: DOI

The planar slope number of planar partial 3-trees of bounded degree. (English) Zbl 1284.68465

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, 304-315 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Faithful representations of graphs by islands in the extended grid. (English) Zbl 1283.68269

López-Ortiz, Alejandro (ed.), LATIN 2010: Theoretical informatics. 9th Latin American symposium, Oaxaca, Mexico, April 19–23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-12199-9/pbk). Lecture Notes in Computer Science 6034, 131-142 (2010).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. (English) Zbl 1177.68008

Lecture Notes in Computer Science 5874. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). xii, 480 p. (2009).
PDFBibTeX XMLCite
Full Text: DOI

Clustered planarity: embedded clustered graphs with two-component clusters (extended abstract). (English) Zbl 1213.68459

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, 121-132 (2009).
MSC:  68R10 05C62 05C85
PDFBibTeX XMLCite
Full Text: DOI

On switching to \(H\)-free graphs. (English) Zbl 1175.68298

Ehrig, Hartmut (ed.) et al., Graph transformations. 4th international conference, ICGT 2008, Leicester, United Kingdom, September 7–13, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87404-1/pbk). Lecture Notes in Computer Science 5214, 379-395 (2008).
MSC:  68R10 05C85 68Q42
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of the distance constrained labeling problem for trees (extended abstract). (English) Zbl 1153.68390

Aceto, Luca (ed.) et al., Automata, languages and programming. 35th international colloquium, ICALP 2008, Reykjavik, Iceland, July 7–11, 2008. Proceedings, Part I. Berlin: Springer (ISBN 978-3-540-70574-1/pbk). Lecture Notes in Computer Science 5125, 294-305 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Generalized domination in degenerate graphs: A complete dichotomy of computational complexity. (English) Zbl 1139.68344

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 182-191 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Distance constrained labelings of trees. (English) Zbl 1139.05341

Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 5th international conference, TAMC 2008, Xi’an, China, April 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79227-7/pbk). Lecture Notes in Computer Science 4978, 125-135 (2008).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of reconstructing \(H\)-free graphs from their star systems. (English) Zbl 1136.68459

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 194-205 (2008).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Clustered planarity: Small clusters in Eulerian graphs. (English) Zbl 1137.68495

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, 303-314 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Moving vertices to make drawings plane. (English) Zbl 1137.68490

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, 101-112 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Geometric intersection graphs: do short cycles help? (Extended abstract). (English) Zbl 1206.05069

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, 118-128 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Computational complexity of generalized domination: A complete dichotomy for chordal graphs. (English) Zbl 1141.68530

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 33rd international workshop, WG 2007, Dornburg, Germany, June 21–23, 2007. Revised papers. Berlin: Springer (ISBN 978-3-540-74838-0/pbk). Lecture Notes in Computer Science 4769, 1-11 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Max-tolerance graphs as intersection graphs: cliques, cycles and recognition. (English) Zbl 1192.05102

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

Locally injective graph homomorphism: Lists guarantee dichotomy. (English) Zbl 1167.68406

Fomin, Fedor V. (ed.), Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22–24, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48381-6/pbk). Lecture Notes in Computer Science 4271, 15-26 (2006).
MSC:  68R10 05C15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On the computational complexity of the \(L_{(2,1)}\)-labeling problem for regular graphs. (English) Zbl 1171.68612

Coppo, Mario (ed.) et al., Theoretical computer science. 9th Italian conference, ICTCS 2005, Siena, Italy, October 12–14, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29106-7/pbk). Lecture Notes in Computer Science 3701, 228-236 (2005).
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of the balanced vertex ordering problem. (English) Zbl 1128.68402

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, 849-858 (2005).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Distance constrained labelings of graphs of bounded treewidth. (English) Zbl 1082.68080

Caires, Luís (ed.) et al., Automata, languages and programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-27580-0/pbk). Lecture Notes in Computer Science 3580, 360-372 (2005).
MSC:  68R10 68Q25 05C78
PDFBibTeX XMLCite
Full Text: DOI

Two results on intersection graphs of polygons. (English) Zbl 1215.05117

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, 59-70 (2004).
PDFBibTeX XMLCite
Full Text: DOI

Elegant distance constrained labelings of trees. (English) Zbl 1112.68419

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Berlin: Springer (ISBN 3-540-24132-9/pbk). Lecture Notes in Computer Science 3353, 58-67 (2004).
MSC:  68R10 05C78
PDFBibTeX XMLCite
Full Text: DOI

Mathematical foundations of computer science 2004. 29th international symposium, MFCS 2004, Prague, Czech Republic, August 22–27, 2004. Proceedings. (English) Zbl 1058.68005

Lecture Notes in Computer Science 3153. Berlin: Springer (ISBN 3-540-22823-3/pbk). xiv, 902 p. (2004).
MSC:  68-06 68Qxx 00B25
PDFBibTeX XMLCite
Full Text: DOI

Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous. (English) Zbl 1078.68673

Penttonen, Martti (ed.) et al., Algorithm theory - SWAT 2002. 8th Scandinavian workshop, Turku, Finland, July 3–5, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43866-1). Lect. Notes Comput. Sci. 2368, 160-169 (2002).
PDFBibTeX XMLCite
Full Text: Link

Geometric systems of disjoint representatives. (English) Zbl 1037.68584

Goodrich, Michael T. (ed.) et al., Graph drawing. 10th international symposium, GD 2002, Irvine, CA, USA, August 26–28, 2002. Revised papers. Berlin: Springer (ISBN 3-540-00158-1/pbk). Lect. Notes Comput. Sci. 2528, 110-117 (2002).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

Complexity of partial covers of graphs. (English) Zbl 1077.68725

Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 537-549 (2001).
PDFBibTeX XMLCite
Full Text: Link

Complexity of coloring graphs without forbidden induced subgraphs. (English) Zbl 1042.68639

Brandstädt, Andreas (ed.) et al., Graph-theoretic concepts in computer science. 27th international workshop, WG 2001, Boltenhagen, Germany, June 14–16, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42707-4). Lect. Notes Comput. Sci. 2204, 254-262 (2001).
MSC:  68R10 05C15 68Q25
PDFBibTeX XMLCite
Full Text: Link

Graph drawing. 7th international symposium, GD ’99, Štiřín Castle, Czech Republic, September 15–19, 1999. Proceedings. (English) Zbl 0931.00046

Lecture Notes in Computer Science. 1731. Berlin: Springer. xiii, 422 p. (1999).
MSC:  00B25 68-06 05-06
PDFBibTeX XMLCite
Full Text: DOI

Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. (English) Zbl 0919.00042

DIMACS. Series in Discrete Mathematics and Theoretical Computer Science. 49. Providence, RI: American Mathematical Society (AMS). xviii, 389 p. (1999).
MSC:  00B25 05-06 68-06
PDFBibTeX XMLCite

Rankings of directed graphs. (Extended abstract). (English) Zbl 0918.68084

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 114-123 (1998).
PDFBibTeX XMLCite

Complexity of colored graph covers. I: Colored directed multigraphs. (English) Zbl 0890.68095

Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 242-257 (1997).
MSC:  68R10 05C15 05C70
PDFBibTeX XMLCite

Compuational complexity of the Krausz dimension of graphs. (English) Zbl 0890.68094

Möhring, Rolf H. (ed.), Graph-theoretic concepts in computer science. 23rd international workshop, WG ’97, Berlin, Germany, June 18–20, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1335, 214-228 (1997).
MSC:  68R10 05C35 05C70
PDFBibTeX XMLCite

Complexity of graph covering problems. (English) Zbl 1528.68306

Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 93-105 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Induced minors and related problems. (English) Zbl 0796.68118

Robertson, Neil (ed.) et al., Graph structure theory. Proceedings of the AMS-IMS-SIAM joint summer research conference on graph minors held June 22 to July 5, 1991 at the University of Washington, Seattle, WA (USA). Providence, RI: American Mathematical Society. Contemp. Math. 147, 179-182 (1993).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software