List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
DEBUG first row: length=10 | [1]=https://portal.mardi4nfdi.de/wiki/Public | [2]=Weakly leveled planarity with bounded sp | [3]=https://portal.mardi4nfdi.de/entity/Q683 | [4]=2026-03-30 | [5]=Q6835786 | [6]=https://portal.mardi4nfdi.de/entity/Q597 | [7]=Paper | [8]=8179330 | [9]=Theoretical Computer Science | [10]=
| Publication | Date of Publication | Type |
|---|---|---|
| Weakly leveled planarity with bounded span Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2026-03-30 | Paper |
| Graph product structure for \(h\)-framed graphs The Electronic Journal of Combinatorics row10= | journal=The Electronic Journal of Combinatorics | arxivId= | 2025-01-27 | Paper |
| Axis-parallel right angle crossing graphs row10= | journal= | arxivId= | 2025-01-06 | Paper |
| Strictly-convex drawings of 3-connected planar graphs Journal of Computational Geometry row10= | journal=Journal of Computational Geometry | arxivId= | 2024-10-18 | Paper |
| Graph product structure for \(h\)-framed graphs row10= | journal= | arxivId= | 2024-09-11 | Paper |
| RAC drawings of graphs with low degree row10= | journal= | arxivId= | 2024-08-06 | Paper |
| Recognizing map graphs of bounded treewidth row10= | journal= | arxivId= | 2024-05-27 | Paper |
| Convex grid drawings of planar graphs with constant edge-vertex resolution Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2024-02-23 | Paper |
| Recognizing map graphs of bounded treewidth Algorithmica row10= | journal=Algorithmica | arxivId= | 2024-01-25 | Paper |
| Book embeddings of nonplanar graphs with small faces in few pages row10= | journal= | arxivId= | 2023-11-02 | Paper |
| Book embeddings of \(k\)-framed graphs and \(k\)-map graphs Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2023-10-30 | Paper |
| Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario Algorithmica row10= | journal=Algorithmica | arxivId= | 2023-09-27 | Paper |
| Strictly-convex drawings of 3-connected planar graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2023-08-16 | Paper |
| The Rique-number of graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2023-08-16 | Paper |
| Recognizing DAGs with page-number 2 is NP-complete Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2023-08-16 | Paper |
| scientific article; zbMATH DE number 7692359 (Why is no real title available?) row10= | journal= | arxivId= | 2023-06-05 | Paper |
| An improved upper bound on the queue number of planar graphs Algorithmica row10= | journal=Algorithmica | arxivId= | 2023-02-16 | Paper |
| Recognizing DAGs with page-number 2 is NP-complete Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2023-02-01 | Paper |
| Bitonic st-orderings for upward planar graphs: the variable embedding setting row10= | journal= | arxivId= | 2022-12-21 | Paper |
| On turn-regular orthogonal representations Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2022-11-14 | Paper |
| On mixed linear layouts of series-parallel graphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2022-10-21 | Paper |
| Convex grid drawings of planar graphs with constant edge-vertex resolution row10= | journal= | arxivId= | 2022-08-30 | Paper |
| Universal slope sets for upward planar drawings Algorithmica row10= | journal=Algorithmica | arxivId= | 2022-08-18 | Paper |
| On the queue number of planar graphs row10= | journal= | arxivId= | 2022-07-01 | Paper |
| On morphing 1-planar drawings row10= | journal= | arxivId= | 2022-06-08 | Paper |
| Graph Product Structure for h-Framed Graphs row10= | journal= | arxivId= | 2022-04-25 | Paper |
| On Mixed Linear Layouts of Series-Parallel Graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2021-12-01 | Paper |
| On Turn-Regular Orthogonal Representations Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2021-12-01 | Paper |
| Grid drawings of graphs with constant edge-vertex resolution Computational Geometry row10= | journal=Computational Geometry | arxivId= | 2021-09-17 | Paper |
| Fan-planar graphs Beyond Planar Graphs row10= | journal=Beyond Planar Graphs | arxivId= | 2021-07-22 | Paper |
| \(k\)-planar graphs Beyond Planar Graphs row10= | journal=Beyond Planar Graphs | arxivId= | 2021-07-22 | Paper |
| The Mixed Page Number of Graphs row10=2107.04993 | journal= | arxivId=2107.04993 | 2021-07-11 | Paper |
| On dispersable book embeddings Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2021-03-09 | Paper |
| Four pages are indeed necessary for planar graphs row10= | journal= | arxivId= | 2020-09-09 | Paper |
| Geometric representations of dichotomous ordinal data row10= | journal= | arxivId= | 2020-02-24 | Paper |
| Planar graphs of bounded degree have bounded queue number Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing row10= | journal=Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | arxivId= | 2020-01-30 | Paper |
| Coloring outerplanar graphs and planar 3-trees with small monochromatic components row10= | journal= | arxivId= | 2019-11-25 | Paper |
| Greedy rectilinear drawings Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2019-10-18 | Paper |
| Planar drawings of fixed-mobile bigraphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2019-10-18 | Paper |
| Planar graphs of bounded degree have bounded queue number SIAM Journal on Computing row10= | journal=SIAM Journal on Computing | arxivId= | 2019-10-11 | Paper |
| Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity row10=1908.03042 | journal= | arxivId=1908.03042 | 2019-08-08 | Paper |
| Hierarchical partial planarity Algorithmica row10= | journal=Algorithmica | arxivId= | 2019-05-17 | Paper |
| Universal slope sets for 1-bend planar drawings Algorithmica row10= | journal=Algorithmica | arxivId= | 2019-05-17 | Paper |
| On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings Algorithmica row10= | journal=Algorithmica | arxivId= | 2019-05-07 | Paper |
| Edge partitions of optimal 2-plane and 3-plane graphs Discrete Mathematics row10= | journal=Discrete Mathematics | arxivId= | 2019-02-20 | Paper |
| 1-fan-bundle-planar drawings of graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2019-02-20 | Paper |
| On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2019-02-20 | Paper |
| Planar drawings of fixed-mobile bigraphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2019-02-20 | Paper |
| Greedy rectilinear drawings Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2019-02-15 | Paper |
| Universal slope sets for upward planar drawings Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2019-02-15 | Paper |
| On dispersable book embeddings Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2018-11-22 | Paper |
| Edge partitions of optimal 2-plane and 3-plane graphs Graph-Theoretic Concepts in Computer Science row10= | journal=Graph-Theoretic Concepts in Computer Science | arxivId= | 2018-11-22 | Paper |
| On Optimal 2- and 3-Planar Graphs row10= | journal= | arxivId= | 2018-08-13 | Paper |
| A universal slope set for 1-bend planar drawings row10= | journal= | arxivId= | 2018-08-13 | Paper |
| 1-fan-bundle-planar drawings of graphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2018-04-04 | Paper |
| Hierarchical partial planarity Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2018-01-04 | Paper |
| On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs row10= | journal= | arxivId= | 2018-01-04 | Paper |
| The book thickness of 1-planar graphs is constant Algorithmica row10= | journal=Algorithmica | arxivId= | 2017-10-10 | Paper |
| On the recognition of fan-planar and maximal outer-fan-planar graphs Algorithmica row10= | journal=Algorithmica | arxivId= | 2017-10-10 | Paper |
| The maximum \(k\)-differential coloring problem Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2017-10-06 | Paper |
| On RAC drawings of 1-planar graphs Theoretical Computer Science row10= | journal=Theoretical Computer Science | arxivId= | 2017-09-07 | Paper |
| Algorithms and Insights for RaceTrack row10= | journal= | arxivId= | 2017-07-17 | Paper |
| On the total number of bends for planar octilinear drawings Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2017-07-13 | Paper |
| Improved approximation algorithms for box contact representations Algorithmica row10= | journal=Algorithmica | arxivId= | 2017-04-12 | Paper |
| Vertex-coloring with defects Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2017-04-05 | Paper |
| On a conjecture of Lovász on circle-representations of simple 4-regular planar graphs row10= | journal= | arxivId= | 2017-03-30 | Paper |
| Two-page book embeddings of 4-planar graphs row10= | journal= | arxivId= | 2017-03-03 | Paper |
| On the density of non-simple 3-planar graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2017-02-21 | Paper |
| Low Ply Drawings of Trees Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2017-02-21 | Paper |
| The book embedding problem from a SAT-solving perspective Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2017-02-10 | Paper |
| Two-page book embeddings of 4-planar graphs Algorithmica row10= | journal=Algorithmica | arxivId= | 2016-06-28 | Paper |
| Vertex-coloring with star-defects WALCOM: Algorithms and Computation row10= | journal=WALCOM: Algorithms and Computation | arxivId= | 2016-05-03 | Paper |
| On the Total Number of Bends for Planar Octilinear Drawings LATIN 2016: Theoretical Informatics row10= | journal=LATIN 2016: Theoretical Informatics | arxivId= | 2016-05-03 | Paper |
| Simultaneous drawing of planar graphs with right-angle crossings and few bends Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2016-03-03 | Paper |
| Planar octilinear drawings with one bend per edge Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2016-01-07 | Paper |
| Many-to-one boundary labeling with backbones Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2016-01-07 | Paper |
| 1-planar graphs have constant book thickness Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2015-11-19 | Paper |
| Simultaneous drawing of planar graphs with right-angle crossings and few bends WALCOM: Algorithms and Computation row10= | journal=WALCOM: Algorithms and Computation | arxivId= | 2015-02-27 | Paper |
| The maximum k-differential coloring problem Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2015-02-20 | Paper |
| Slanted orthogonal drawings: model, algorithms and evaluations Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2015-01-15 | Paper |
| On the recognition of fan-planar and maximal outer-fan-planar graphs Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications row10= | journal=Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | arxivId= | 2015-01-07 | Paper |
| Planar octilinear drawings with one bend per edge Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications row10= | journal=Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | arxivId= | 2015-01-07 | Paper |
| A note on maximum differential coloring of planar graphs Journal of Discrete Algorithms row10= | journal=Journal of Discrete Algorithms | arxivId= | 2014-11-24 | Paper |
| Improved approximation algorithms for box contact representations Algorithms - ESA 2014 row10= | journal=Algorithms - ESA 2014 | arxivId= | 2014-10-08 | Paper |
| Smooth Orthogonal Drawings of Planar Graphs LATIN 2014: Theoretical Informatics row10= | journal=LATIN 2014: Theoretical Informatics | arxivId= | 2014-03-31 | Paper |
| Many-to-one boundary labeling with backbones Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2013-12-20 | Paper |
| Slanted orthogonal drawings Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2013-12-20 | Paper |
| Smooth orthogonal layouts Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2013-10-29 | Paper |
| Circle-representations of simple 4-regular planar graphs Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2013-04-03 | Paper |
| Smooth orthogonal layouts Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2013-04-03 | Paper |
| On Maximum Differential Coloring of Planar Graphs row10= | journal= | arxivId= | 2013-02-28 | Paper |
| Geometric RAC simultaneous drawings of graphs Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2013-01-07 | Paper |
| The straight-line RAC drawing problem is NP-hard Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2012-12-04 | Paper |
| Geometric RAC Simultaneous Drawings of Graphs Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2012-09-25 | Paper |
| Combining problems on RAC drawings and simultaneous graph drawings Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2012-03-09 | Paper |
| The straight-line RAC drawing problem is NP-hard SOFSEM 2011: Theory and Practice of Computer Science row10= | journal=SOFSEM 2011: Theory and Practice of Computer Science | arxivId= | 2011-02-15 | Paper |
| Combining traditional map labeling with boundary labeling SOFSEM 2011: Theory and Practice of Computer Science row10= | journal=SOFSEM 2011: Theory and Practice of Computer Science | arxivId= | 2011-02-15 | Paper |
| Maximizing the total resolution of graphs Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2011-02-11 | Paper |
| Boundary labeling with octilinear leaders Algorithmica row10= | journal=Algorithmica | arxivId= | 2010-05-19 | Paper |
| On metro-line crossing minimization Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2010-02-04 | Paper |
| Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2009-03-03 | Paper |
| Efficient Labeling of Collinear Sites Journal of Graph Algorithms and Applications row10= | journal=Journal of Graph Algorithms and Applications | arxivId= | 2009-01-19 | Paper |
| Boundary Labeling with Octilinear Leaders Algorithm Theory – SWAT 2008 row10= | journal=Algorithm Theory – SWAT 2008 | arxivId= | 2008-07-15 | Paper |
| Multi-stack Boundary Labeling Problems FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science row10= | journal=FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | arxivId= | 2008-04-17 | Paper |
| Line Crossing Minimization on Metro Maps Graph Drawing row10= | journal=Graph Drawing | arxivId= | 2008-03-25 | Paper |
| Boundary labeling: Models and efficient algorithms for rectangular maps Computational Geometry row10= | journal=Computational Geometry | arxivId= | 2007-02-19 | Paper |
| Graph Drawing Lecture Notes in Computer Science row10= | journal=Lecture Notes in Computer Science | arxivId= | 2005-12-07 | Paper |
Research outcomes over time
This page was built for person: Michael A. Bekos
