#### Filter Results:

- Full text PDF available (26)

#### Publication Year

2003

2018

- This year (4)
- Last 5 years (16)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Elmar Böhler, Christian Glaßer, Daniel Meister
- MFCS
- 2003

We introduce the probabilistic class SBP which is defined in aBPP-like manner. This class emerges fromBPP by keeping the promise of a probability gap but decreasing th e probability limit from 1=2 to… (More)

- Robert Ganian, Petr Hlinený, +4 authors Somnath Sikdar
- IPEC
- 2010

Several different measures for digraph width have appeared in the last few years. However, none of them shares all the “nice” properties of treewidth: First, being algorithmically useful i.e.… (More)

- Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
- Discrete Applied Mathematics
- 2015

Clique-width of graphs is defined algebraically through operations on graphs with vertex labels. We characterise the clique-width in a combinatorial way by means of partitions of the vertex set,… (More)

- Pinar Heggernes, Daniel Meister, Andrzej Proskurowski
- Theor. Comput. Sci.
- 2011

The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent results appearing in… (More)

- Pinar Heggernes, Daniel Meister, Charis Papadopoulos
- TAMC
- 2008

A graph has linear clique-width at most k if it has a clique-width expression using at most k labels such that every disjoint union operation has an operand which is a single vertex graph. We give… (More)

- Daniel Meister
- WG
- 2005

- Pinar Heggernes, Daniel Meister, Udi Rotics
- CSR
- 2011

Clique-width is one of the most important graph parameters, as many NP-hard graph problems are solvable in linear time on graphs of bounded clique-width. Unfortunately the computation of clique-width… (More)

- Daniel Meister
- Theor. Comput. Sci.
- 2015

Given a source and a target string, their swap-delete-edit distance is the minimum number of interchange-consecutive-symbols and delete operations applied to the source string to make it equal the… (More)

- Daniel Meister
- Discrete Mathematics
- 2006

2K2-free graphs do not contain the complement of the chordless cycle on four vertices (2K2) as induced subgraph. A triangulation H of a graph G is a chordal graph that is obtained by adding edges. If… (More)

- Pinar Heggernes, Daniel Meister, Yngve Villanger
- ISAAC
- 2010

The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a complete graph the… (More)