| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6179340 | 2023-12-16 | Paper |
| Straight-line drawings of 1-planar graphs | 2023-09-15 | Paper |
| The equivalence of boundary and confluent graph grammars on graph languages of bounded degree | 2022-12-09 | Paper |
| Correction to: ``Outer 1-planar graphs | 2021-11-19 | Paper |
| Fan-crossing free graphs and their relationship to other beyond-planar graphs | 2021-04-15 | Paper |
| On fan-crossing graphs | 2020-09-17 | Paper |
| Characterizing 5-map graphs by 2-fan-crossing graphs | 2019-09-19 | Paper |
| Characterizing and recognizing 4-map graphs | 2019-05-07 | Paper |
| Graph automata for linear graph languages | 2019-01-10 | Paper |
| On fan-crossing and fan-crossing free graphs | 2018-07-17 | Paper |
| Recognizing IC-Planar and NIC-Planar Graphs | 2018-06-14 | Paper |
| Data Structures and their Planar Graph Layouts | 2018-04-25 | Paper |
| Recognizing optimal 1-planar graphs in linear time | 2018-02-28 | Paper |
| \(\mathsf{T}\)-shape visibility representations of 1-planar graphs | 2018-02-28 | Paper |
| A First Order Logic Definition of Beyond-Planar Graphs | 2018-01-12 | Paper |
| On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs | 2018-01-04 | Paper |
| \(\mathsf{NIC}\)-planar graphs | 2017-10-17 | Paper |
| On Aligned Bar 1-Visibility Graphs | 2017-04-05 | Paper |
| Recognizing and drawing IC-planar graphs | 2017-02-10 | Paper |
| Recognizing and drawing IC-planar graphs | 2016-06-01 | Paper |
| Ranking chain sum orders | 2016-06-01 | Paper |
| Outer 1-planar graphs | 2016-05-31 | Paper |
| On Aligned Bar 1-Visibility Graphs | 2016-05-03 | Paper |
| On the hardness of maximum rank aggregation problems | 2015-03-24 | Paper |
| 1-Planarity of Graphs with a Rotation System | 2015-03-04 | Paper |
| On Bar (1,j)-Visibility Graphs | 2015-02-27 | Paper |
| Upward planar graphs and their duals | 2015-01-30 | Paper |
| 1-Visibility Representations of 1-Planar Graphs | 2014-09-30 | Paper |
| On Maximum Rank Aggregation Problems | 2014-01-17 | Paper |
| Upward planar drawings on the standing and the rolling cylinders | 2014-01-08 | Paper |
| Characterizing Planarity by the Splittable Deque | 2013-12-20 | Paper |
| Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs | 2013-12-20 | Paper |
| Recognizing Outer 1-Planar Graphs in Linear Time | 2013-12-20 | Paper |
| Rolling Upward Planarity Testing of Strongly Connected Graphs | 2013-12-06 | Paper |
| Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs | 2013-12-06 | Paper |
| Global k-Level Crossing Reduction | 2013-11-28 | Paper |
| COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES | 2013-09-05 | Paper |
| Optical Graph Recognition | 2013-08-13 | Paper |
| The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders | 2013-08-02 | Paper |
| Drawing Planar Graphs on Area | 2013-06-28 | Paper |
| On the Density of Maximal 1-Planar Graphs | 2013-04-03 | Paper |
| Optical Graph Recognition | 2013-04-03 | Paper |
| Drawing Recurrent Hierarchies | 2012-12-04 | Paper |
| The Duals of Upward Planar Graphs on Cylinders | 2012-11-06 | Paper |
| Comparing and Aggregating Partial Orders with Kendall Tau Distances | 2012-06-08 | Paper |
| Classification of Planar Upward Embedding | 2012-03-09 | Paper |
| The Open Graph Archive: A Community-Driven Effort | 2012-03-09 | Paper |
| The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders | 2011-06-03 | Paper |
| Plane Drawings of Queue and Deque Graphs | 2011-02-11 | Paper |
| Shortest path and maximum flow problems in networks with additive losses and gains | 2011-02-02 | Paper |
| A Global k-Level Crossing Reduction Algorithm | 2010-02-09 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Coordinate Assignment for Cyclic Level Graphs | 2009-07-23 | Paper |
| Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains | 2009-07-14 | Paper |
| On the complexity of crossings in permutations | 2009-04-09 | Paper |
| Cyclic Leveling of Directed Graphs | 2009-03-03 | Paper |
| Tree Drawings on the Hexagonal Grid | 2009-03-03 | Paper |
| Partitions of Graphs into Trees | 2007-08-28 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| Computing and Drawing Isomorphic Subgraphs | 2006-04-03 | Paper |
| Radial Level Planarity Testing and Embedding in Linear Time | 2006-04-03 | Paper |
| Finite graph automata for linear and boundary graph languages | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043763 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043792 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472330 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422264 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422308 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414484 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4389392 | 1999-11-08 | Paper |
| The ancestor width of grammars and languages | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336268 | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694750 | 1993-06-29 | Paper |
| Efficient reductions of picture words | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037305 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037306 | 1993-05-18 | Paper |
| On the intersection of stacks and queues | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787507 | 1988-01-01 | Paper |
| A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers) | 1987-01-01 | Paper |
| Representations of language families by homomorphic equality operations and generalized equality sets | 1987-01-01 | Paper |
| Uniform simulations of nondeterministic real time multitape turing machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785989 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3730030 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343456 | 1984-01-01 | Paper |
| Uniformly growing k-th power-free homomorphisms | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3321473 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3667955 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945600 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959427 | 1982-01-01 | Paper |
| Three write heads are as good ask | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907112 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911424 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912052 | 1981-01-01 | Paper |
| Unary multiple equality sets: The languages of rational matrices | 1981-01-01 | Paper |
| Multiple equality sets and Post machines | 1980-01-01 | Paper |
| Equality Sets and Complexity Classes | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195938 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181291 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4124343 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131653 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4766061 | 1973-01-01 | Paper |
