16 citations · 94 across the 30 of their papers we have counts for
8 papers · 1 filter
Beyond circular-arc graphs -- recognizing lollipop graphs and medusa graphs
Deniz Ağaoğlu Çağırıcı, Onur Çağırıcı, Jan Derbisz +5
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected graph , the class of -graphs, defined as the intersection graphs of connected subgraphs of some subdivisio…
Graph Product Structure for h-Framed Graphs
Michael A. Bekos, Giordano Da Lozzo, Petr Hliněný +1
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding struc…
Efficient Isomorphism for -graphs and -graphs
Deniz Ağaoğlu Çağırıcı, Petr Hliněný
An -graph is one representable as the intersection graph of connected subgraphs of a suitable subdivision of a fixed graph , introduced by Biró, Hujter and Tuza (1992). An $H…
Inserting Multiple Edges into a Planar Graph
Markus Chimani, Petr Hliněný
Let be a connected planar (but not yet embedded) graph and a set of additional edges not yet in . The {multiple edge insertion} problem (MEI) asks for a drawing of …
Kernelization Using Structural Parameters on Sparse Graph Classes
Jakub Gajarský, Petr Hliněný, Jan Obdržálek +5
Meta-theorems for polynomial (linear) kernels have been the subject of intensive research in parameterized complexity. Heretofore, meta-theorems for linear kernels exist on graphs…
Dynamic Scope-Based Dijkstra's Algorithm
Petr Hlineny, Ondrej Moris
We briefly report on the current state of a new dynamic algorithm for the route planning problem based on a concept of scope (the static variant presented at ESA'11, HM2011A). We f…