1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2020
Engineering Exact Quasi-Threshold Editing
Lars Gottesbüren, Michael Hamann, Philipp Schoch +3
Quasi-threshold graphs are -free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the -free editing pr…
cs.DS2017
Computing Tree Decompositions with FlowCutter: PACE 2017 Submission
Ben Strasser
We describe the algorithm behind our PACE 2017 submission to the heuristic tree decomposition computation track. It was the only competitor to solve all instances and won a tight s…
cs.DS2017★ 1 cited
Connection Scan Algorithm
Julian Dibbelt, Thomas Pajor, Ben Strasser +1
We introduce the Connection Scan Algorithm (CSA) to efficiently answer queries to timetable information systems. The input consists, in the simplest setting, of a source position a…