Martin Pergel

MaRDI QIDQ1671343zbMATH OpenORCIDWikidataFDO

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!

Publication	Date of Publication	Type
Recognising the overlap graphs of subtrees of restricted trees is hard Acta Mathematica Universitatis Comenianae. New Series	2024-10-18	Paper
On unit grid intersection graphs and several other intersection graph classes Acta Mathematica Universitatis Comenianae. New Series	2024-10-18	Paper
On flips in planar matchings Graph-Theoretic Concepts in Computer Science	2022-12-21	Paper
Recognising the overlap graphs of subtrees of restricted trees is hard	2021-12-22	Paper
On flips in planar matchings Discrete Applied Mathematics	2020-12-29	Paper
On flips in planar matchings Discrete Applied Mathematics	2020-12-29	Paper
Homothetic polygons and beyond: maximal cliques in intersection graphs Discrete Applied Mathematics	2018-09-06	Paper
On edge intersection graphs of paths with 2 bends Discrete Applied Mathematics	2017-06-14	Paper
On edge intersection graphs of paths with 2 bends Discrete Applied Mathematics	2017-06-14	Paper
The complexity of the partial order dimension problem: closing the gap SIAM Journal on Discrete Mathematics	2017-01-27	Paper
On edge intersection graphs of paths with 2 bends Graph-Theoretic Concepts in Computer Science	2016-12-22	Paper
Intersection graphs of homothetic polygons Electronic Notes in Discrete Mathematics	2013-06-28	Paper
Unit Grid Intersection Graphs: Recognition and Properties	2013-06-07	Paper
Beyond homothetic polygons: recognition and maximum clique Algorithms and Computation	2013-03-21	Paper
Clustered planarity: small clusters in cycles and Eulerian graphs Journal of Graph Algorithms and Applications	2010-02-04	Paper
Graph Drawing Lecture Notes in Computer Science	2009-08-11	Paper
Geometric Intersection Graphs: Do Short Cycles Help? Lecture Notes in Computer Science	2009-03-06	Paper
The Complexity of Sorting with Networks of Stacks and Queues Algorithms - ESA 2008	2008-11-25	Paper
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete Graph-Theoretic Concepts in Computer Science	2008-07-01	Paper
Clustered Planarity: Small Clusters in Eulerian Graphs Graph Drawing	2008-03-25	Paper

Research outcomes over time

This page was built for person: Martin Pergel