#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2007

2018

- This year (1)
- Last 5 years (9)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

In this paper we derive a limit theorem for recursively defined processes. For several instances of recursive processes like for depth first search processes in random trees with logarithmic heightâ€¦ (More)

- Kord Eickmeyer, Martin Grohe, Magdalena GrÃ¼ber
- 2008 23rd Annual IEEE Conference on Computationalâ€¦
- 2008

We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio unless FPT = W[P]. Ourâ€¦ (More)

- Kord Eickmeyer, Ken-ichi Kawarabayashi
- CSL
- 2016

We show that the model-checking problem for successor-invariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of theâ€¦ (More)

- Kord Eickmeyer, Peter Huggins, Lior Pachter, Ruriko Yoshida
- Algorithms for Molecular Biology
- 2007

The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point ofâ€¦ (More)

- Kord Eickmeyer, Michael Elberfeld, Frederik Harwath
- MFCS
- 2014

- Kord Eickmeyer, Ken-ichi Kawarabayashi, Stephan Kreutzer
- 2013 28th Annual ACM/IEEE Symposium on Logic inâ€¦
- 2013

Model checking problems for first- and monadic second-order logic on graphs have received considerable attention in the past, not the least due to their connections to problems in algorithmic graphâ€¦ (More)

- Sang Won Bae, Jean-FranÃ§ois Baffier, +8 authors Csaba D. TÃ³th
- Theor. Comput. Sci.
- 2018

We introduce the family of k-gap-planar graphs for k â‰¥ 0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k ofâ€¦ (More)

- Kord Eickmeyer
- CSL
- 2011

We investigate the expressive power of randomised first-order logic (BPFO) on restricted classes of structures. While BPFO is stronger than FO in general, even on structures with a builtin additionâ€¦ (More)

- Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
- Electronic Colloquium on Computational Complexity
- 2012

We consider the problem of approximating the minmax value of a multiplayer game in strategic form. We argue that in 3-player games with 0-1 payoffs, approximating the minmax value within an additiveâ€¦ (More)

- Kord Eickmeyer, Ken-ichi Kawarabayashi
- FCT
- 2017