×

Found 27 Documents (Results 1–27)

The balanced connected subgraph problem. (English) Zbl 1436.68222

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 201-215 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Symmetric assembly puzzles are hard, beyond a few pieces. (English) Zbl 1482.05034

Akiyama, Jin (ed.) et al., Discrete and computational geometry and graphs. 18th Japan conference, JCDCGG 2015, Kyoto, Japan, September 14–16, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9943, 180-192 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Locating battery charging stations to facilitate almost shortest paths. (English) Zbl 1432.90075

Funke, Stefan (ed.) et al., 14th workshop on algorithmic approaches for transportation modelling, optimization, and systems, ATMOS’14, Wroclaw, Poland, September 11, 2014. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 42, 25-33 (2014).
PDFBibTeX XMLCite
Full Text: DOI

Guarding polyominoes. (English) Zbl 1283.68345

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

A PTAS for TSP with neighborhoods among fat regions in the plane. (English) Zbl 1302.68322

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 11-18 (2007).
PDFBibTeX XMLCite
Full Text: arXiv

Thick non-crossing paths and minimum-cost flows in polygonal domains. (English) Zbl 1221.68277

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 56-65 (2007).
MSC:  68U05 05C62 90B10
PDFBibTeX XMLCite
Full Text: DOI

Two new classes of Hamiltonian graphs. (Extended abstract). (English) Zbl 1341.05140

Márquez, Alberto (ed.) et al., Proceedings of the 4th European conference on combinatorics, graph theory and applications, EuroComb’07, Seville, Spain, September 11–15, 2007. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 29, 565-569 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Matching points with circles and squares. (English) Zbl 1136.52302

Akiyama, Jin (ed.) et al., Discrete and computational geometry. Japanese conference, JCDCG 2004, Tokyo, Japan, October 8–11, 2004. Berlin: Springer (ISBN 978-3-540-30467-8/pbk). Lecture Notes in Computer Science 3742, 1-15 (2005).
MSC:  52B05 05B15
PDFBibTeX XMLCite
Full Text: DOI

On simultaneous planar graph embeddings. (English) Zbl 1278.68229

Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 243-255 (2003).
MSC:  68R10 05C10
PDFBibTeX XMLCite
Full Text: DOI

Two-point Euclidean shortest path queries in the plane (extended abstract). (English) Zbl 0938.68132

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 215-224 (1999).
MSC:  68U05 05C99
PDFBibTeX XMLCite

On the maximum scatter TSP. (English) Zbl 1321.90113

Proceedings of the 8th annual ACM-SIAM symposium on discrete algorithms, SODA ’97, New Orleans, LA, January 5–7, 1997. Philadelphia, PA: SIAM; New York, NY: ACM (ISBN 0-89871-390-0). 211-220 (1997).
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field