×

Found 47 Documents (Results 1–47)

Reconfiguring Hamiltonian cycles in L-shaped grid graphs. (English) Zbl 07173310

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, 325-337 (2019).
MSC:  68R10
PDFBibTeX XMLCite
Full Text: DOI

Combinatorial properties and recognition of unit square visibility graphs. (English) Zbl 1441.68169

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 30, 15 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Monotone simultaneous embeddings of paths in \(d\) dimensions. (English) Zbl 1478.68220

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, 546-553 (2016).
MSC:  68R10 05C62 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Visibility representations of boxes in 2.5 dimensions. (English) Zbl 1478.68213

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, 251-265 (2016).
MSC:  68R10 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Kinetic and stationary point-set embeddability for plane graphs. (English) Zbl 1377.68186

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

On representing graphs by touching cuboids. (English) Zbl 1377.68166

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

Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\). (English) Zbl 1311.68114

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, 39-51 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Connectivity graphs of uncertainty regions. (English) Zbl 1310.68157

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, 434-445 (2010).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Embeddability problems for upward planar digraphs. (English) Zbl 1213.68450

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, 242-253 (2009).
PDFBibTeX XMLCite
Full Text: DOI

The three dimensional logic engine. (English) Zbl 1111.68588

Pach, János (ed.), Graph drawing. 12th international symposium, GD 2004, New York, NY, September 29–October 2, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-24528-6/pbk). Lecture Notes in Computer Science 3383, 329-339 (2005).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: DOI

Rectangle visibility graphs: Characterization, construction, and compaction. (English) Zbl 1035.68088

Alt, Helmut (ed.) et al., STACS 2003. 20th annual symposium of theoretical aspects on computer science, Berlin, Germany, February 27 – March 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-00623-0/pbk). Lect. Notes Comput. Sci. 2607, 26-37 (2003).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

A fixed-parameter approach to two-layer planarization. (English) Zbl 1054.68576

Mutzel, Petra (ed.) et al., Graph drawing. 9th international symposium, GD 2001, Vienna, Austria, September 23–26, 2001. Revised papers. Berlin: Springer (ISBN 3-540-43309-0). Lect. Notes Comput. Sci. 2265, 1-15 (2002).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. (English) Zbl 1037.68581

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, 118-129 (2002).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

Orthogonal drawings of cycles in 3D space (extended abstract). (English) Zbl 1043.68616

Marks, Joe (ed.), Graph drawing. 8th international symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20–23, 2000. Proceedings. Berlin: Springer (ISBN 3-540-41554-8). Lect. Notes Comput. Sci. 1984, 272-283 (2001).
MSC:  68R10 68U05 05C85
PDFBibTeX XMLCite
Full Text: Link

On the parameterized complexity of layered graph drawing. (English) Zbl 1006.68544

Meyer auf der Heide, Friedhelm (ed.), Algorithms - ESA 2001. 9th annual European symposium, Århus, Denmark, August 28-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2161, 488-499 (2001).
PDFBibTeX XMLCite
Full Text: Link

On validating planar worlds. (English) Zbl 0988.05085

Kosaraju, Deborah, Proceedings of the 12th annual ACM-SIAM symposium on discrete algorithms. Washington, DC, USA, January 7-9, 2001. Philadelphia, PA: SIAM, Society for Industrial and Applied Mathematics. 791-792 (2001).
PDFBibTeX XMLCite

Nearest neighbour graph realizability is NP-hard. (English) Zbl 1495.68166

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, 245-256 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software