Packing Trees into 1-Planar Graphs (English)
- New search for: De Luca, Felice
- Further information on De Luca, Felice:
-
https://orcid.org/http://orcid.org/0000-0001-5937-7636
- New search for: Di Giacomo, Emilio
- Further information on Di Giacomo, Emilio:
-
https://orcid.org/http://orcid.org/0000-0002-9794-1928
- New search for: Hong, Seok-Hee
- Further information on Hong, Seok-Hee:
-
https://orcid.org/http://orcid.org/0000-0003-1698-3868
- New search for: Kobourov, Stephen
- Further information on Kobourov, Stephen:
-
https://orcid.org/http://orcid.org/0000-0002-0477-2724
- New search for: Lenhart, William
- Further information on Lenhart, William:
-
https://orcid.org/http://orcid.org/0000-0002-8618-2444
- New search for: Liotta, Giuseppe
- Further information on Liotta, Giuseppe:
-
https://orcid.org/http://orcid.org/0000-0002-2886-9694
- New search for: Meijer, Henk
- New search for: Tappini, Alessandra
- Further information on Tappini, Alessandra:
-
https://orcid.org/http://orcid.org/0000-0001-9192-2067
- New search for: Wismath, Stephen
- Further information on Wismath, Stephen:
-
https://orcid.org/http://orcid.org/0000-0002-9632-3247
- New search for: Rahman, M. Sohel
- Further information on Rahman, M. Sohel:
-
https://orcid.org/https://orcid.org/0000-0001-9419-6478
- New search for: Sadakane, Kunihiko
- Further information on Sadakane, Kunihiko:
-
https://orcid.org/https://orcid.org/0000-0002-8212-3682
- New search for: Sung, Wing-Kin
- Further information on Sung, Wing-Kin:
-
https://orcid.org/https://orcid.org/0000-0001-7806-7086
- New search for: De Luca, Felice
- Further information on De Luca, Felice:
-
https://orcid.org/http://orcid.org/0000-0001-5937-7636
- New search for: Di Giacomo, Emilio
- Further information on Di Giacomo, Emilio:
-
https://orcid.org/http://orcid.org/0000-0002-9794-1928
- New search for: Hong, Seok-Hee
- Further information on Hong, Seok-Hee:
-
https://orcid.org/http://orcid.org/0000-0003-1698-3868
- New search for: Kobourov, Stephen
- Further information on Kobourov, Stephen:
-
https://orcid.org/http://orcid.org/0000-0002-0477-2724
- New search for: Lenhart, William
- Further information on Lenhart, William:
-
https://orcid.org/http://orcid.org/0000-0002-8618-2444
- New search for: Liotta, Giuseppe
- Further information on Liotta, Giuseppe:
-
https://orcid.org/http://orcid.org/0000-0002-2886-9694
- New search for: Meijer, Henk
- New search for: Tappini, Alessandra
- Further information on Tappini, Alessandra:
-
https://orcid.org/http://orcid.org/0000-0001-9192-2067
- New search for: Wismath, Stephen
- Further information on Wismath, Stephen:
-
https://orcid.org/http://orcid.org/0000-0002-9632-3247
In:
WALCOM: Algorithms and Computation
: 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings
;
Chapter: 8
;
81-93
;
2020
- Article/Chapter (Book) / Electronic Resource
-
Title:Packing Trees into 1-Planar Graphs
-
Additional title:Lect.Notes Computer
-
Contributors:Rahman, M. Sohel ( editor ) / Sadakane, Kunihiko ( editor ) / Sung, Wing-Kin ( editor ) / De Luca, Felice ( author ) / Di Giacomo, Emilio ( author ) / Hong, Seok-Hee ( author ) / Kobourov, Stephen ( author ) / Lenhart, William ( author ) / Liotta, Giuseppe ( author ) / Meijer, Henk ( author )
-
Conference:International Workshop on Algorithms and Computation ; 2020 ; Singapore, Singapore
-
Published in:WALCOM: Algorithms and Computation : 14th International Conference, WALCOM 2020, Singapore, Singapore, March 31 – April 2, 2020, Proceedings ; Chapter: 8 ; 81-93Lecture Notes in Computer Science ; 12049 ; 81-93
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2020-02-20
-
Size:13 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Drawing Planar GraphsRahman, Md. Saidur / Karim, Md. Rezaul et al. | 2020
- 2
-
Space Efficient Separator Algorithms for Planar GraphsWatanabe, Osamu et al. | 2020
- 3
-
Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic NetworksZhang, Louxin et al. | 2020
- 4
-
Optimum Algorithm for the Mutual Visibility ProblemBhagat, Subhash et al. | 2020
- 5
-
Routing in HistogramsChiu, Man-Kwun / Cleve, Jonas / Klost, Katharina / Korman, Matias / Mulzer, Wolfgang / van Renssen, André / Roeloffzen, Marcel / Willert, Max et al. | 2020
- 6
-
A Waste-Efficient Algorithm for Single-Droplet Sample Preparation on Microfluidic ChipsGonzalez, Miguel Coviello / Chrobak, Marek et al. | 2020
- 7
-
Shortest Covers of All Cyclic Shifts of a StringCrochemore, Maxime / Iliopoulos, Costas S. / Radoszewski, Jakub / Rytter, Wojciech / Straszyński, Juliusz / Waleń, Tomasz / Zuba, Wiktor et al. | 2020
- 8
-
Packing Trees into 1-Planar GraphsDe Luca, Felice / Di Giacomo, Emilio / Hong, Seok-Hee / Kobourov, Stephen / Lenhart, William / Liotta, Giuseppe / Meijer, Henk / Tappini, Alessandra / Wismath, Stephen et al. | 2020
- 9
-
Angle Covers: Algorithms and ComplexityEvans, William / Gethner, Ellen / Spalding-Jamieson, Jack / Wolff, Alexander et al. | 2020
- 10
-
Fast Multiple Pattern Cartesian Tree MatchingGu, Geonmo / Song, Siwoo / Faro, Simone / Lecroq, Thierry / Park, Kunsoo et al. | 2020
- 11
-
Generalized Dictionary Matching Under Substring Consistent Equivalence RelationsHendrian, Diptarama et al. | 2020
- 12
-
Reconfiguring k-path Vertex CoversHoang, Duc A. / Suzuki, Akira / Yagita, Tsuyoshi et al. | 2020
- 13
-
Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal PolygonsIwamoto, Chuzo / Ibusuki, Tatsuaki et al. | 2020
- 14
-
Maximum Bipartite Subgraph of Geometric Intersection GraphsJana, Satyabrata / Maheshwari, Anil / Mehrabi, Saeed / Roy, Sasanka et al. | 2020
- 15
-
The Stub Resolution of 1-Planar GraphsKaufmann, Michael / Kratochvil, Jan / Lipp, Fabian / Montecchiani, Fabrizio / Raftopoulou, Chrysanthi / Valtr, Pavel et al. | 2020
- 16
-
Dispersion of Mobile Robots on GridsKshemkalyani, Ajay D. / Molla, Anisur Rahaman / Sharma, Gokarna et al. | 2020
- 17
-
Packing and Covering with SegmentsMitchell, Joseph S. B. / Pandit, Supantha et al. | 2020
- 18
-
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph EnumerationNakahata, Yu / Kawahara, Jun / Horiyama, Takashi / Minato, Shin-ichi et al. | 2020
- 19
-
Partitioning a Graph into Complementary SubgraphsNascimento, Julliano Rosa / Souza, Uéverton S. / Szwarcfiter, Jayme L. et al. | 2020
- 20
-
On the Maximum Edge-Pair Embedding Bipartite MatchingNguyen, Cam Ly / Suppakitpaisarn, Vorapong / Surarerks, Athasit / Vajanopath, Phanu et al. | 2020
- 21
-
Packing Arc-Disjoint Cycles in Bipartite TournamentsJacob, Ajay Saju / Krithika, R. et al. | 2020
- 22
-
Matching Random Colored Points with RectanglesCorujo, Josué / Flores-Peñaloza, David / Huemer, Clemens / Pérez-Lantero, Pablo / Seara, Carlos et al. | 2020
- 23
-
Designing Survivable Networks with Zero-Suppressed Binary Decision DiagramsSuzuki, Hirofumi / Ishihata, Masakazu / Minato, Shin-ichi et al. | 2020
- 24
-
Approximability of the Independent Feedback Vertex Set Problem for Bipartite GraphsTamura, Yuma / Ito, Takehiro / Zhou, Xiao et al. | 2020
- 25
-
Efficient Enumeration of Non-isomorphic Ptolemaic GraphsTran, Dat Hoang / Uehara, Ryuhei et al. | 2020
- 26
-
Faster Privacy-Preserving Computation of Edit Distance with MovesYoshimoto, Yohei / Kataoka, Masaharu / Takabatake, Yoshimasa / I, Tomohiro / Shin, Kilho / Sakamoto, Hiroshi et al. | 2020
- 27
-
Parameterized Algorithms for the Happy Set ProblemAsahiro, Yuichi / Eto, Hiroshi / Hanaka, Tesshu / Lin, Guohui / Miyano, Eiji / Terabaru, Ippei et al. | 2020
- 28
-
An Experimental Study of a 1-Planarity Testing and Embedding AlgorithmBinucci, Carla / Didimo, Walter / Montecchiani, Fabrizio et al. | 2020
- 29
-
Trichotomy for the Reconfiguration Problem of Integer Linear SystemsKimura, Kei / Suzuki, Akira et al. | 2020
- 30
-
Train Scheduling: Hardness and AlgorithmsScheffer, Christian et al. | 2020