The following pages link to Kord Eickmeyer (Q1679972):
Displayed 18 items.
- FO model checking on map graphs (Q1679973) (← links)
- Gap-planar graphs (Q1786592) (← links)
- Approximating Multi Commodity Network Design on Graphs of Bounded Pathwidth and Bounded Degree (Q2856138) (← links)
- Non-Definability Results for Randomised First-Order Logic (Q2915684) (← links)
- Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures (Q2922020) (← links)
- The Geometry of the Neighbor-Joining Algorithm for Small Trees (Q3599195) (← links)
- Succinctness of Order-Invariant Logics on Depth-Bounded Structures (Q4608722) (← links)
- Gap-Planar Graphs (Q4625141) (← links)
- The Exponential Time Hypothesis and the Parameterized Clique Problem (Q4899237) (← links)
- Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (Q4910937) (← links)
- Neighborhood complexity and kernelization for nowhere dense classes of graphs (Q5111394) (← links)
- Model-Checking on Ordered Structures (Q5121264) (← links)
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (Q5271050) (← links)
- Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (Q5278404) (← links)
- A limit theorem for recursively defined processes in Lp (Q5460215) (← links)
- Randomisation and Derandomisation in Descriptive Complexity Theory (Q5895525) (← links)
- Randomisation and Derandomisation in Descriptive Complexity Theory (Q5901153) (← links)
- Partitioning the Sample Space on Five Taxa for the Neighbor Joining Algorithm (Q6478898) (← links)