×

Found 90 Documents (Results 1–90)

The Hamiltonian path graph is connected for simple \(s, t\) paths in rectangular grid graphs. (English) Zbl 07724768

Zhang, Yong (ed.) et al., Computing and combinatorics. 28th international conference, COCOON 2022, Shenzhen, China, October 22–24, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13595, 463-475 (2023).
MSC:  68Rxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids. (English) Zbl 07556561

Mutzel, Petra (ed.) et al., WALCOM: algorithms and computation. 16th international conference and workshops, WALCOM 2022, Jember, Indonesia, March 24–26, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13174, 59-70 (2022).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs. (English) Zbl 07495044

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 501-515 (2021).
MSC:  68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

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

Constrained light deployment for reducing energy consumption in buildings. (English) Zbl 1483.68471

Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 350-364 (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

Kinetic reverse \(k\)-nearest neighbor problem. (English) Zbl 1401.68352

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, 307-317 (2015).
MSC:  68U05 68U10 68W05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Kinetic data structures for all nearest neighbors and closest pair in the plane. (English) Zbl 1305.68070

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). 137-144 (2013).
MSC:  68P05 68Q25 68U05
PDFBibTeX XMLCite
Full Text: DOI

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

Acyclic coloring with few division vertices. (English) Zbl 1293.05372

Arumugam, S. (ed.) et al., Combinatorial algorithms. 23rd international workshop, IWOCA 2012, Tamil Nadu, India, July 19–21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-35925-5/pbk). Lecture Notes in Computer Science 7643, 86-99 (2012).
MSC:  05C85 05C15 68Q17
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

Acyclic colorings of graph subdivisions. (English) Zbl 1314.05075

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, 247-260 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Connecting a set of circles with minimum sum of radii. (English) Zbl 1342.68355

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, 183-194 (2011).
MSC:  68W25 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

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

Milling a graph with turn costs: a parameterized complexity perspective. (English) Zbl 1309.68093

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 123-134 (2010).
MSC:  68Q25 05C12 05C85
PDFBibTeX XMLCite
Full Text: DOI

On the computation of 3D visibility skeletons. (English) Zbl 1286.68105

Thai, My T. (ed.) et al., Computing and combinatorics. 16th annual international conference, COCOON 2010, Nha Trang, Vietnam, July 19–21, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14030-3/pbk). Lecture Notes in Computer Science 6196, 469-478 (2010).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: DOI

Intractability in graph drawing and geometry: FPT approaches. (English) Zbl 1267.68123

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

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

The number of lines tangent to arbitrary convex polyhedra in 3D. (English) Zbl 1374.68645

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 46-55 (2004).
MSC:  68U05 52B05 52B55
PDFBibTeX XMLCite
Full Text: DOI Link

Separating point sets in polygonal environments. (English) Zbl 1374.68656

Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 10-16 (2004).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Experiments with the fixed-parameter approach for two-layer planarization. (English) Zbl 1215.05191

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

Faster fixed-parameter tractable algorithms for matching and packing problems. (English) Zbl 1111.68794

Albers, Susanne (ed.) et al., Algorithms – ESA 2004. 12th annual European symposium, Bergen, Norway, September 14–17, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23025-4/pbk). Lecture Notes in Computer Science 3221, 311-322 (2004).
MSC:  68W40 05C70 05C85
PDFBibTeX XMLCite
Full Text: DOI

The complexity of (un)folding. (English) Zbl 1374.68634

Proceedings of the 19th annual symposium on computational geometry, SCG/SoCG 2003, San Diego, CA, USA, June 8–10, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-663-3). 164-170 (2003).
MSC:  68U05 68Q17
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

Chain reconfiguration. (English) Zbl 1077.68919

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, 1-13 (2001).
MSC:  68U05 68T40 70B15
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

Embedding problems for paths with direction constrained edges. (English) Zbl 0988.68633

Du, D.-Z. (ed.) et al., Computing and combinatorics. 6th annual international conference, COCOON 2000, Sydney, Australia, July 26-28, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1858, 64-73 (2000).
MSC:  68U05 05C85
PDFBibTeX XMLCite

Locked and unlocked polygonal chains in 3D. (English) Zbl 1052.68759

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM (ISBN 0-89871-434-6). 866-867 (1999).
MSC:  68U05
PDFBibTeX XMLCite

Localizing a robot with minimum travel. (English) Zbl 0849.68134

Clarkson, K. (ed.), Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 22-24, 1995. Philadelphia, PA: SIAM. 437-446 (1995).
MSC:  68U99 68U05
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

Algorithms and data structures. 3rd workshop, WADS ’93. Montréal, Canada 11–13, 1993. Proceedings. (English) Zbl 0825.00122

Lecture Notes in Computer Science 709. Berlin: Springer-Verlag. xii, 635 p. (1993).
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