No. Title Author Year
1 Near-Optimal Algorithms for Point-Line Covering Problems Chen, Jianer et al. 2022
2 Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time Chen, Jianer et al. 2021
3 On Covering Segments with Unit Intervals Bergren, Dan et al. 2020
4 How to Navigate Through Obstacles? Eiben, Eduard et al. 2018
5 Solving Partition Problems Almost Always Requires Pushing Many Vertices Around Kanj, Iyad et al. 2018
6 Degree Four Plane Spanners: Simpler and Better Kanj, Iyad et al. 2016
7 On Existential MSO and its Relation to ETH Ganian, Robert et al. 2016
8 Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs Kanj, Iyad et al. 2016
9 Flip Distance Is in FPT Time O(n+ k * c^k) Kanj, Iyad et al. 2015
10 Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors Husfeldt, Thore et al. 2015
11 LIPIcs, Volume 43, IPEC'15, Complete Volume Husfeldt, Thore et al. 2015
12 On Geometric Spanners of Euclidean and Unit Disk Graphs Perkovic, Ljubomir et al. 2008
13 On the Induced Matching Problem Kanj, Iyad A. et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI