×

Found 160 Documents (Results 1–100)

Geometric spanning trees minimizing the Wiener index. (English) Zbl 07789692

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 1-14 (2023).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Planar bichromatic bottleneck spanning trees. (English) Zbl 1507.68315

Grandoni, Fabrizio (ed.) et al., 28th annual European symposium on algorithms. ESA 2020, September 7–9, 2020, Pisa, Italy, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 173, Article 1, 16 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI

Probing a set of trajectories to maximize captured information. (English) Zbl 1515.68283

Faro, Simone (ed.) et al., 18th international symposium on experimental algorithms, SEA 2020, Catania, Italy, June 16–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 160, Article 5, 14 p. (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

New results on a family of geometric hitting set problems in the plane. (English) Zbl 1435.68350

Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 387-399 (2019).
MSC:  68U05 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI

Minimum membership covering and hitting. (English) Zbl 1522.68664

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 394-406 (2019).
MSC:  68U05 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI

TSP with locational uncertainty: the adversarial model. (English) Zbl 1432.68508

Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 32, 16 p. (2017).
MSC:  68U05 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

The shortest separating cycle problem. (English) Zbl 1484.68326

Jansen, Klaus (ed.) et al., Approximation and online algorithms. 14th international workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10138, 1-13 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Universal guard problems. (English) Zbl 1396.68126

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 32, 13 p. (2016).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Computing the \(L_1\) geodesic diameter and center of a polygonal domain. (English) Zbl 1388.68280

Ollinger, Nicolas (ed.) et al., 33rd symposium on theoretical aspects of computer science, STACS 2016, Orléans, France, February 17–20, 2016. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-001-9). LIPIcs – Leibniz International Proceedings in Informatics 47, Article 14, 14 p. (2016).
MSC:  68U05 68W40
PDFBibTeX XMLCite
Full Text: DOI

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

Shortest path to a segment and quickest visibility queries. (English) Zbl 1378.68150

Arge, Lars (ed.) et al., 31st international symposium on computational geometry, SoCG’15, Eindhoven, Netherlands, June 22–25, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-83-5). LIPIcs – Leibniz International Proceedings in Informatics 34, 658-673 (2015).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI

Geometric hitting set for segments of few orientations. (English) Zbl 1383.68092

Sanità, Laura (ed.) et al., Approximation and online algorithms. 13th international workshop, WAOA 2015, Patras, Greece, September 17–18, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-28683-9/pbk; 978-3-319-28684-6/ebook). Lecture Notes in Computer Science 9499, 145-157 (2015).
MSC:  68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Choice is hard. (English) Zbl 1472.68061

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 318-328 (2015).
MSC:  68Q17 68U05
PDFBibTeX XMLCite
Full Text: DOI

An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains. (English) Zbl 1440.68314

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 947-959 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating watchman routes. (English) Zbl 1422.68254

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 844-855 (2013).
MSC:  68U05 68W25
PDFBibTeX XMLCite
Full Text: DOI

Beacon-based algorithms for geometric routing. (English) Zbl 1390.68709

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 158-169 (2013).
MSC:  68U05 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI

Spiral serpentine polygonization of a planar point set. (English) Zbl 1374.68665

Márquez, Alberto (ed.) et al., Computational geometry. XIV Spanish meeting on computational geometry, EGC 2011, dedicated to Ferran Hurtado on the occasion of his 60th birthday, Alcalá de Henares, Spain, June 27–30, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-34190-8/pbk). Lecture Notes in Computer Science 7579, 146-154 (2012).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Watchman routes for lines and segments. (English) Zbl 1357.68269

Fomin, Fedor V. (ed.) et al., Algorithm theory – SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4–6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 36-47 (2012).
MSC:  68U05 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI

Bichromatic 2-center of pairs of points. (English) Zbl 1297.52004

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 25-36 (2012).
MSC:  52C10 90B80
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

Exploring and triangulating a region by a swarm of robots. (English) Zbl 1343.68248

Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 206-217 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Convex transversals. (English) Zbl 1342.68325

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, 49-60 (2011).
MSC:  68U05 68Q17 68W25
PDFBibTeX XMLCite
Full Text: DOI

A constant-factor approximation algorithm for TSP with pairwise-disjoint connected neighborhoods in the plane. (English) Zbl 1284.68673

Proceedings of the 26th annual symposium on computational geometry, SoCG 2010, Snowbird, UT, USA, June 13–16, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0016-2). 183-191 (2010).
PDFBibTeX XMLCite
Full Text: DOI

Minimum covering with travel cost. (English) Zbl 1273.52009

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 393-402 (2009).
MSC:  52A30 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Geometric algorithms for optimal airspace design and air traffic controller workload balancing. (English) Zbl 1427.68329

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). 75-89 (2008).
MSC:  68U05 90B20 90C59
PDFBibTeX XMLCite
Full Text: DOI

Routing a maximum number of disks through a scene of moving obstacles. (English) Zbl 1271.65037

Proceedings of the twenty-fourth annual symposium on computational geometry, SCG 2008, College Park, MD, USA, June 09–11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 230-231 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Maximum thick paths in static and dynamic environments. (English) Zbl 1221.65053

Proceedings of the twenty-fourth annual symposium on computational geometry 2008 (SCG’08), College Park, MD, USA, June 09–11, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-071-5). 20-27 (2008).
MSC:  65D18 68U05 90B20
PDFBibTeX XMLCite
Full Text: DOI

Preprocessing imprecise points and splitting triangulations. (English) Zbl 1183.68675

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 544-555 (2008).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Locating guards for visibility coverage of polygons. (English) Zbl 1427.68326

Applegate, David (ed.) et al., Proceedings of the 9th workshop on algorithm engineering and experiments (ALENEX ’07), New Orleans, LA, USA, January 6, 2007. Proceedings in Applied Mathematics 126. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 120-134 (2007).
MSC:  68U05 68T20
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

Finding large sticks and potatoes in polygons. (English) Zbl 1192.68746

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). 474-483 (2006).
MSC:  68U05 52B70 68W25
PDFBibTeX XMLCite
Full Text: DOI

Approximating minimum-cost polygonal paths of bounded number of links in weighted subdivisions. (English) Zbl 1153.90527

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 483-484 (2006).
MSC:  90C27
PDFBibTeX XMLCite

Algorithms for two-box covering. (English) Zbl 1153.68518

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 459-467 (2006).
MSC:  68U05
PDFBibTeX XMLCite

Minimum-cost coverage of point sets by disks. (English) Zbl 1153.90478

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 449-458 (2006).
MSC:  90B80 90C60
PDFBibTeX XMLCite

Locked and unlocked chains of planar shapes. (English) Zbl 1153.68528

Computational geometry (SCG’06). Proceedings of the twenty-second annual symposium on computational geometry 2006, Sedona, Arizona, USA, June, 05–07, 2006. New York, NY: Association for Computing Machinery (ISBN 1-59593-340-9). 61-70 (2006).
MSC:  68U05 65D18
PDFBibTeX XMLCite

A constant-factor approximation algorithm for optimal terrain guarding. (English) Zbl 1297.68260

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 515-524 (2005).
MSC:  68W25 52A30 52C15
PDFBibTeX XMLCite

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

\(k\)-link shortest paths in weighted subdivisions. (English) Zbl 1161.68814

Dehne, Frank (ed.) et al., Algorithms and data structures. 9th international workshop, WADS 2005, Waterloo, Canada, August 15–17, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28101-0/pbk). Lecture Notes in Computer Science 3608, 325-337 (2005).
MSC:  68U05 68Q25 68W25
PDFBibTeX XMLCite
Full Text: DOI

Delineating boundaries for imprecise regions. (English) Zbl 1141.68402

Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 143-154 (2005).
MSC:  68P20 68U05 68U35
PDFBibTeX XMLCite
Full Text: DOI

New results on shortest paths in three dimensions. (English) Zbl 1373.68429

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). 124-133 (2004).
MSC:  68U05 68Q17 68W40
PDFBibTeX XMLCite
Full Text: DOI

Computing the visibility graph of points within a polygon. (English) Zbl 1373.68424

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). 27-35 (2004).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Touring a sequence of polygons. (English) Zbl 1192.68354

Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC 2003), San Diego, CA, USA,. New York, NY: ACM Press (ISBN 1-58113-674-9). 473-482, electronic only (2003).
MSC:  68Q25 68W05
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

all top 3

Software