Frank Kammer

Available identifiers

zbMath Open kammer.frankMaRDI QIDQ306254

List of research outcomes

Publication	Date of Publication	Type
Space-efficient graph kernelizations	2024-11-12	Paper
Space-efficient graph coarsening with applications to succinct planar encodings	2024-09-11	Paper
Sorting and ranking of self-delimiting numbers with applications to tree isomorphism	2023-12-22	Paper
Space-efficient vertex separators for treewidth	2022-08-18	Paper
Simple 2^f-Color Choice Dictionaries	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5092344	2022-07-21	Paper
Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays.	2021-08-04	Paper
Multistage graph problems on a global budget	2021-05-10	Paper
On-the-Fly Array Initialization in Less Space	2020-11-25	Paper
Linear-time in-place DFS and BFS on the word RAM	2020-02-06	Paper
https://portal.mardi4nfdi.de/entity/Q5743430	2019-05-10	Paper
Space-efficient biconnected components and recognition of outerplanar graphs	2019-03-11	Paper
Space-efficient Euler partition and bipartite edge coloring	2018-12-04	Paper
Space-Efficient Plane-Sweep Algorithms.	2018-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4608619	2018-03-21	Paper
Space-Efficient Euler Partition and Bipartite Edge Coloring	2017-07-21	Paper
Space-efficient Basic Graph Algorithms	2017-01-24	Paper
Approximate tree decompositions of planar graphs in linear time	2016-08-31	Paper
A linear-time kernelization for the rooted \(k\)-leaf outbranching problem	2015-07-24	Paper
Approximation algorithms for intersection graphs	2014-12-02	Paper
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty	2014-10-14	Paper
A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem	2013-12-06	Paper
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs	2012-06-15	Paper
Removing local extrema from imprecise terrains	2012-05-18	Paper
The complexity of minimum convex coloring	2012-05-11	Paper
Approximation Algorithms for Intersection Graphs	2010-09-10	Paper
The k-Disjoint Paths Problem on Chordal Graphs	2010-01-21	Paper
The Complexity of Minimum Convex Coloring	2009-01-29	Paper
Determining the Smallest k Such That G Is k-Outerplanar	2008-09-25	Paper
Simultaneous Embedding with Two Bends per Edge in Polynomial Area	2007-09-07	Paper
Network Analysis	2005-11-11	Paper

Research outcomes over time

This page was built for person: Frank Kammer