×

Found 256 Documents (Results 1–100)

100
MathJax

Edge partitions and visibility representations of 1-planar graphs. (English) Zbl 1476.05141

Hong, Seok-Hee (ed.) et al., Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 – December 1, 2016. Singapore: Springer. 89-107 (2020).
MSC:  05C62 05C70 05C10
PDF BibTeX XML Cite
Full Text: DOI

Fast Byzantine gathering with visibility in graphs. (English) Zbl 1475.68394

Pinotti, Cristina M. (ed.) et al., Algorithms for sensor systems. 16th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2020, Pisa, Italy, September 9–10, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12503, 140-153 (2020).
MSC:  68T40 68R10 68W15
PDF BibTeX XML Cite
Full Text: DOI arXiv

Computing the one-visibility copnumber of trees. (English) Zbl 1482.05325

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 411-423 (2020).
MSC:  05C85 05C05
PDF BibTeX XML Cite
Full Text: DOI

On conflict-free chromatic guarding of simple polygons. (English) Zbl 1435.68339

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, 601-612 (2019).
MSC:  68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

On colourability of polygon visibility graphs. (English) Zbl 07278093

Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 21, 14 p. (2018).
MSC:  68N30 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

FO model checking of geometric graphs. (English) Zbl 1443.68105

Lokshtanov, Daniel (ed.) et al., 12th international symposium on parameterized and exact computation, IPEC 2017, Vienna, Austria, September 6–8, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 89, Article 19, 12 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI

Reconstructing generalized staircase polygons with uniform step length. (English) Zbl 07026980

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, 88-101 (2018).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Routing on the visibility graph. (English) Zbl 1457.68280

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 18, 12 p. (2017).
MSC:  68U05 68R10
PDF BibTeX XML Cite
Full Text: DOI arXiv

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).
PDF BibTeX XML Cite
Full Text: DOI arXiv

On colouring point visibility graphs. (English) Zbl 06702484

Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10156, 156-165 (2017).
PDF BibTeX XML Cite
Full Text: DOI

On visibility representations of non-planar graphs. (English) Zbl 1387.68241

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 19, 16 p. (2016).
MSC:  68U05 68Q25 68R10
PDF BibTeX XML Cite
Full Text: DOI

Natural visibility graphs for diagnosing attention deficit hyperactivity disorder (ADHD). (English) Zbl 1356.05152

de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 337-342 (2016).
MSC:  05C90 05C99 92F05
PDF BibTeX XML Cite
Full Text: DOI Link

The orthogonal art gallery theorem with constrained guards. (English) Zbl 1440.52002

de Mier, Anna (ed.) et al., Discrete mathematics days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electron. Notes Discrete Math. 54, 27-32 (2016).
MSC:  52A10 05B40 05C15
PDF BibTeX XML Cite
Full Text: DOI

Essential constraints of edge-constrained proximity graphs. (English) Zbl 1478.05037

Mäkinen, Veli (ed.) et al., Combinatorial algorithms. 27th international workshop, IWOCA 2016, Helsinki, Finland, August 17–19, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9843, 55-67 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

An improved constant-factor approximation algorithm for planar visibility counting problem. (English) Zbl 1476.68265

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, 209-221 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Visibility graphs of anchor polygons. (English) Zbl 1474.68412

Hajiaghayi, Mohammad Taghi (ed.) et al., Topics in theoretical computer science. The first IFIP WG 1.8 international conference, TTCS 2015, Tehran, Iran, August 26–28, 2015. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 9541, 72-89 (2016).
MSC:  68U05 68R10
PDF BibTeX XML Cite
Full Text: DOI Link

Geometric spanners for points inside a polygonal domain. (English) Zbl 1378.68143

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, 186-197 (2015).
MSC:  68U05 05C85
PDF BibTeX XML Cite
Full Text: DOI

Recognition and complexity of point visibility graphs. (English) Zbl 1378.68162

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, 171-185 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Peeling potatoes near-optimally in near-linear time. (English) Zbl 1395.68293

Proceedings of the 30th annual symposium on computational geometry, SoCG ’14, Kyoto, Japan, June 8–11, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2594-3). 224-231 (2014).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Patrolling by robots equipped with visibility. (English) Zbl 1416.68189

Halldórsson, Magnús M. (ed.), Structural information and communication complexity. 21st international colloquium, SIROCCO 2014, Takayama, Japan, July 23–25, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8576, 224-234 (2014).
MSC:  68T40 68Q25 68R10
PDF BibTeX XML Cite
Full Text: DOI Link

Mapping a polygon with holes using a compass. (English) Zbl 1351.68291

Bar-Noy, Amotz (ed.) et al., Algorithms for sensor systems. 8th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2012, Ljubljana, Slovenia, September 13–14, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-36091-6/pbk). Lecture Notes in Computer Science 7718, 78-89 (2013).
MSC:  68T40 68U05
PDF BibTeX XML Cite
Full Text: DOI

On planar point sets with the pentagon property. (English) Zbl 1305.68221

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). 81-90 (2013).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification