×

Found 451 Documents (Results 1–100)

100
MathJax

Using the metro-map metaphor for drawing hypergraphs. (English) Zbl 1490.68153

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 361-372 (2021).
MSC:  68R10 05C65
PDF BibTeX XML Cite
Full Text: DOI

Upward point set embeddings of paths and trees. (English) Zbl 07405965

Uehara, Ryuhei (ed.) et al., WALCOM: algorithms and computation. 15th international conference and workshops, WALCOM 15, Yangon, Myanmar, February 28 – March 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12635, 234-246 (2021).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Extending nearly complete \(1\)-planar drawings in polynomial time. (English) Zbl 07559402

Esparza, Javier (ed.) et al., 45th international symposium on mathematical foundations of computer science, MFCS 2020, August 25–26, 2020, Prague, Czech Republic. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 170, Article 31, 16 p. (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Rectilinear planarity testing of plane series-parallel graphs in linear time. (English) Zbl 07436636

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 436-449 (2020).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

A tipping point for the planarity of small and medium sized graphs. (English) Zbl 07436617

Auber, David (ed.) et al., Graph drawing and network visualization. 28th international symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12590, 181-188 (2020).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

1-planar graphs. (English) Zbl 1486.05063

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. 47-68 (2020).
MSC:  05C10 05C60 57M15
PDF BibTeX XML Cite
Full Text: DOI

Succinct monotone circuit certification: planarity and parameterized complexity. (English) Zbl 07336129

Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 496-507 (2020).
MSC:  68Rxx
PDF BibTeX XML Cite
Full Text: DOI

Fully-dynamic planarity testing in polylogarithmic time. (English) Zbl 07298239

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 167-180 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Planar projections of graphs. (English) Zbl 1453.68121

Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 453-462 (2020).
MSC:  68R10 05C62 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Dual circumference and collinear sets. (English) Zbl 07559229

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 29, 17 p. (2019).
MSC:  68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Recognizing and embedding simple optimal 2-planar graphs. (English) Zbl 07551735

Purchase, Helen C. (ed.) et al., Graph drawing and network visualization. 29th international symposium, GD 2021, Tübingen, Germany, September 14–17, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12868, 87-100 (2021).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Computing \(k\)-modal embeddings of planar digraphs. (English) Zbl 07525456

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 19, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Efficient generation of different topological representations of graphs beyond-planarity. (English) Zbl 07266121

Archambault, Daniel (ed.) et al., Graph drawing and network visualization. 27th international symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11904, 253-267 (2019).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

\((k, p)\)-planarity: a relaxation of hybrid planarity. (English) Zbl 07117322

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

Beyond-planarity: Turán-type results for non-planar bipartite graphs. (English) Zbl 07561382

Hsu, Wen-Lian (ed.) et al., 29th international symposium on algorithms and computation, ISAAC 2018, December 16–19, 2018, Jiaoxi, Yilan, Taiwan. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 123, Article 28, 13 p. (2018).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Hanani-Tutte for approximating maps of graphs. (English) Zbl 07236443

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 39, 15 p. (2018).
MSC:  57Q35 57M15 05C10
PDF BibTeX XML Cite
Full Text: DOI arXiv

Property testing of planarity in the CONGEST model. (English) Zbl 1428.68386

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 347-356 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Crossing minimization in perturbed drawings. (English) Zbl 07023827

Biedl, Therese (ed.) et al., Graph drawing and network visualization. 26th international symposium, GD 2018, Barcelona, Spain, September 26–28, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11282, 229-241 (2018).
MSC:  68R10 68U05
PDF BibTeX XML Cite
Full Text: DOI arXiv

Construction of a topological drawing of the most planar subgraph of the non-planar graph. (English. Russian original) Zbl 1401.05084

Autom. Remote Control 79, No. 5, 793-810 (2018); translation from Avtom. Telemekh. 2018, No. 5, 24-45 (2018).
MSC:  05C10
PDF BibTeX XML Cite
Full Text: DOI

The diagram approach in knot theory and applications to graph theory. (English. Russian original) Zbl 1400.57003

Mosc. Univ. Math. Bull. 73, No. 3, 124-130 (2018); translation from Vestn. Mosk. Univ., Ser. I 73, No. 3, 65-71 (2018).
MSC:  57M15 05C10
PDF BibTeX XML Cite
Full Text: DOI

Embedding graphs into embedded graphs. (English) Zbl 1457.68214

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 34, 12 p. (2017).
MSC:  68R10 05C62 68U05
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

all top 3

Software