An FPT Algorithm for Bipartite Vertex Splitting (English)
- New search for: Ahmed, Reyan
- New search for: Kobourov, Stephen
- Further information on Kobourov, Stephen:
- https://orcid.org/http://orcid.org/0000-0002-0477-2724
- New search for: Kryven, Myroslav
- New search for: Angelini, Patrizio
- Further information on Angelini, Patrizio:
- https://orcid.org/https://orcid.org/0000-0002-7602-1524
- New search for: von Hanxleden, Reinhard
- Further information on von Hanxleden, Reinhard:
- https://orcid.org/https://orcid.org/0000-0001-5691-1215
- New search for: Ahmed, Reyan
- New search for: Kobourov, Stephen
- Further information on Kobourov, Stephen:
- https://orcid.org/http://orcid.org/0000-0002-0477-2724
- New search for: Kryven, Myroslav
In:
Graph Drawing and Network Visualization
: 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers
;
Chapter: 19
;
261-268
;
2023
- Article/Chapter (Book) / Electronic Resource
-
Title:An FPT Algorithm for Bipartite Vertex Splitting
-
Additional title:Lect.Notes Computer
-
Contributors:Angelini, Patrizio ( editor ) / von Hanxleden, Reinhard ( editor ) / Ahmed, Reyan ( author ) / Kobourov, Stephen ( author ) / Kryven, Myroslav ( author )
-
Conference:International Symposium on Graph Drawing and Network Visualization ; 2022 ; Tokyo, Japan
-
Published in:Graph Drawing and Network Visualization : 30th International Symposium, GD 2022, Tokyo, Japan, September 13–16, 2022, Revised Selected Papers ; Chapter: 19 ; 261-268Lecture Notes in Computer Science ; 13764 ; 261-268
-
Publisher:
- New search for: Springer International Publishing
-
Place of publication:Cham
-
Publication date:2023-01-19
-
Size:8 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
-
Unavoidable Patterns in Complete Simple Topological GraphsSuk, Andrew / Zeng, Ji et al. | 2023
- 2
-
Compatible Spanning Trees in Simple Drawings of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document}Aichholzer, Oswin / Knorr, Kristin / Mulzer, Wolfgang / El Maalouly, Nicolas / Obenaus, Johannes / Paul, Rosna / M. Reddy, Meghana / Vogtenhuber, Birgit / Weinberger, Alexandra et al. | 2023
- 3
-
Mutual Witness Gabriel Drawings of Complete Bipartite GraphsLenhart, William J. / Liotta, Giuseppe et al. | 2023
- 4
-
Empty Triangles in Generalized Twisted Drawings of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_n$$\end{document}García, Alfredo / Tejel, Javier / Vogtenhuber, Birgit / Weinberger, Alexandra et al. | 2023
- 5
-
Shooting Stars in Simple Drawings of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_{m,n}$$\end{document}Aichholzer, Oswin / García, Alfredo / Parada, Irene / Vogtenhuber, Birgit / Weinberger, Alexandra et al. | 2023
- 6
-
FORBID: Fast Overlap Removal by Stochastic GradIent Descent for Graph DrawingGiovannangeli, Loann / Lalanne, Frederic / Giot, Romain / Bourqui, Romain et al. | 2023
- 7
-
Spherical Graph Drawing by Multi-dimensional ScalingMiller, Jacob / Huroyan, Vahan / Kobourov, Stephen et al. | 2023
- 8
-
Shape-Faithful Graph DrawingsMeidiana, Amyra / Hong, Seok-Hee / Eades, Peter et al. | 2023
- 9
-
Planar Confluent Orthogonal Drawings of 4-Modal DigraphsCornelsen, Sabine / Diatzko, Gregor et al. | 2023
- 10
-
Unit-length Rectangular Drawings of GraphsAlegría, Carlos / Da Lozzo, Giordano / Di Battista, Giuseppe / Frati, Fabrizio / Grosso, Fabrizio / Patrignani, Maurizio et al. | 2023
- 11
-
Strictly-Convex Drawings of 3-Connected Planar GraphsBekos, Michael A. / Gronemann, Martin / Montecchiani, Fabrizio / Symvonis, Antonios et al. | 2023
- 12
-
Rectilinear Planarity of Partial 2-TreesDidimo, Walter / Kaufmann, Michael / Liotta, Giuseppe / Ortali, Giacomo et al. | 2023
- 13
-
Testing Upward Planarity of Partial 2-TreesChaplick, Steven / Di Giacomo, Emilio / Frati, Fabrizio / Ganian, Robert / Raftopoulou, Chrysanthi N. / Simonov, Kirill et al. | 2023
- 14
-
Computing a Feedback Arc Set Using PageRankGeladaris, Vasileios / Lionakis, Panagiotis / Tollis, Ioannis G. et al. | 2023
- 15
-
st-Orientations with Few Transitive EdgesBinucci, Carla / Didimo, Walter / Patrignani, Maurizio et al. | 2023
- 16
-
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai ProblemFox, Jacob / Pach, János / Suk, Andrew et al. | 2023
- 17
-
Planarizing Graphs and Their Drawings by Vertex SplittingNöllenburg, Martin / Sorge, Manuel / Terziadis, Soeren / Villedieu, Anaïs / Wu, Hsiang-Yun / Wulms, Jules et al. | 2023
- 18
-
The Thickness of Fan-Planar Graphs is At Most ThreeCheong, Otfried / Pfister, Maximilian / Schlipf, Lena et al. | 2023
- 19
-
An FPT Algorithm for Bipartite Vertex SplittingAhmed, Reyan / Kobourov, Stephen / Kryven, Myroslav et al. | 2023
- 20
-
On Time and Space: An Experimental Study on Graph Structural and Temporal EncodingsFilipov, Velitchko / Arleo, Alessio / Bögl, Markus / Miksch, Silvia et al. | 2023
- 21
-
Small Point-Sets Supporting Graph StoriesDi Battista, Giuseppe / Didimo, Walter / Grilli, Luca / Grosso, Fabrizio / Ortali, Giacomo / Patrignani, Maurizio / Tappini, Alessandra et al. | 2023
- 22
-
On the Complexity of the Storyplan ProblemBinucci, Carla / Di Giacomo, Emilio / Lenhart, William J. / Liotta, Giuseppe / Montecchiani, Fabrizio / Nöllenburg, Martin / Symvonis, Antonios et al. | 2023
- 23
-
Visualizing Evolving TreesGray, Kathryn / Li, Mingwei / Ahmed, Reyan / Kobourov, Stephen et al. | 2023
- 24
-
Improved Scheduling of Morphing Edge DrawingMisue, Kazuo et al. | 2023
- 25
-
Queue Layouts of Two-Dimensional PosetsPupyrev, Sergey et al. | 2023
- 26
-
Recognizing DAGs with Page-Number 2 Is NP-completeBekos, Michael A. / Da Lozzo, Giordano / Frati, Fabrizio / Gronemann, Martin / Mchedlidze, Tamara / Raftopoulou, Chrysanthi N. et al. | 2023
- 27
-
The Rique-Number of GraphsBekos, Michael A. / Felsner, Stefan / Kindermann, Philipp / Kobourov, Stephen / Kratochvíl, Jan / Rutter, Ignaz et al. | 2023
- 28
-
Morphing Rectangular DualsChaplick, Steven / Kindermann, Philipp / Klawitter, Jonathan / Rutter, Ignaz / Wolff, Alexander et al. | 2023
- 29
-
Visibility Representations of Toroidal and Klein-bottle GraphsBiedl, Therese et al. | 2023
- 30
-
Coloring Mixed and Directional Interval GraphsGutowski, Grzegorz / Mittelstädt, Florian / Rutter, Ignaz / Spoerhase, Joachim / Wolff, Alexander / Zink, Johannes et al. | 2023
- 31
-
Outside-Obstacle Representations with All Vertices on the Outer FaceFirman, Oksana / Kindermann, Philipp / Klawitter, Jonathan / Klemz, Boris / Klesen, Felix / Wolff, Alexander et al. | 2023
- 32
-
Arrangements of Pseudocircles: On Digons and TrianglesFelsner, Stefan / Roch, Sandro / Scheucher, Manfred et al. | 2023
- 33
-
Graph Drawing Contest ReportKindermann, Philipp / Klute, Fabian / Mchedlidze, Tamara / Meulemans, Wouter et al. | 2023