The following pages link to Peter Rossmanith (Q340580):
Displaying 50 items.
- (Q198421) (redirect page) (← links)
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- A property tester for tree-likeness of quartet topologies (Q649111) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- Parameterized power domination complexity (Q844180) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- Observations on \(\log(n)\) time parallel recognition of unambiguous cfl's (Q1209354) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. (Q1408377) (← links)
- Fixed-parameter algorithms for CLOSEST STRING and related problems (Q1424248) (← links)
- A general method to speed up fixed-parameter-tractable algorithms (Q1607033) (← links)
- Moderately exponential time algorithms for the maximum bounded-degree-1 set problem (Q1627852) (← links)
- What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) (Q1679951) (← links)
- Fixed-parameter algorithms for Vertex Cover \(P_3\) (Q1751145) (← links)
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits (Q1892887) (← links)
- Recognition of probe distance-hereditary graphs (Q1932454) (← links)
- New fixed-parameter algorithms for the minimum quartet inconsistency problem (Q1959377) (← links)
- Optimal deterministic sorting and routing on grids and tori with diagonals (Q1961046) (← links)
- Online node- and edge-deletion problems with advice (Q1979452) (← links)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- The online knapsack problem: advice and randomization (Q2437775) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Testing consistency of quartet topologies: a parameterized approach (Q2445322) (← links)
- Exact algorithms for problems related to the densest \(k\)-set problem (Q2448865) (← links)
- Dynamic programming for minimum Steiner trees (Q2464320) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- (Q2729233) (← links)
- (Q2754086) (← links)
- Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343) (← links)
- On the Advice Complexity of the Knapsack Problem (Q2894454) (← links)
- (Q2904773) (← links)
- A Fine-grained Analysis of a Simple Independent Set Algorithm (Q2920136) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
