By Professor Serge Gaspers

Journal articles

Fomin FV; Gaspers S; Golovach PA; Kratsch D; Saurabh S, 2010, 'Parameterized algorithm for eternal vertex cover', Information Processing Letters, 110, pp. 702 - 706, http://dx.doi.org/10.1016/j.ipl.2010.05.029

Gaspers S; Messinger ME; Nowakowski RJ; Prałat P, 2010, 'Parallel cleaning of a network with brushes', Discrete Applied Mathematics, 158, pp. 467 - 478, http://dx.doi.org/10.1016/j.dam.2009.11.003

Fomin FV; Gaspers S; Kratsch D; Liedloff M; Saurabh S, 2010, 'Iterative compression and exact algorithms', Theoretical Computer Science, 411, pp. 1045 - 1053, http://dx.doi.org/10.1016/j.tcs.2009.11.012

Gaspers S; Kratsch D; Liedloff M; Todinca I, 2009, 'Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes', ACM TRANSACTIONS ON ALGORITHMS, 6, http://dx.doi.org/10.1145/1644015.1644024

Gaspers S; Messinger ME; Nowakowski RJ; Prałat P, 2009, 'Clean the graph before you draw it!', Information Processing Letters, 109, pp. 463 - 467, http://dx.doi.org/10.1016/j.ipl.2009.01.003

Fomin FV; Gaspers S; Saurabh S; Stepanov AA, 2009, 'On two techniques of combining branching and treewidth', Algorithmica New York, 54, pp. 181 - 207, http://dx.doi.org/10.1007/s00453-007-9133-3

Fomin FV; Gaspers S; Pyatkin AV; Razgon I, 2008, 'On the minimum feedback vertex set problem: Exact and enumeration algorithms', Algorithmica New York, 52, pp. 293 - 307, http://dx.doi.org/10.1007/s00453-007-9152-0

Conference Papers

Gaspers S; Li JZ, 2024, 'Quantum Algorithms for Graph Coloring and Other Partitioning, Covering, and Packing Problems', in Leibniz International Proceedings in Informatics Lipics, http://dx.doi.org/10.4230/LIPIcs.ICALP.2024.69

Orang AV; Dorri A; Gaspers S; Ruj S, 2024, 'Blockchain-Enabled Private and Secure Task Allocation Framework', in 2024 16th International Conference on Communication Systems and Networks Comsnets 2024, pp. 666 - 670, http://dx.doi.org/10.1109/COMSNETS59351.2024.10427531

Nederlof J; Szilágyi K, 2024, 'Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 413 - 426, https://doi.org/10.1007/978-3-031-52113-3

Laußmann C; Rothe J; Seeger T, 2024, 'Apportionment with Thresholds: Strategic Campaigns are Easy in the Top-Choice but Hard in the Second-Chance Mode.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 355 - 368, https://doi.org/10.1007/978-3-031-52113-3

Hoffmann S, 2024, 'Automata Classes Accepting Languages Whose Commutative Closure is Regular.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 311 - 325, https://doi.org/10.1007/978-3-031-52113-3

Perrot K; Sené S; Tapin L, 2024, 'Combinatorics of Block-Parallel Automata Networks.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 442 - 455, https://doi.org/10.1007/978-3-031-52113-3

Mattes C; Ushakov A; Weiß A, 2024, 'Complexity of Spherical Equations in Finite Groups.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 383 - 397, https://doi.org/10.1007/978-3-031-52113-3

Dirks J; Gerhard E; Grobler M; Mouawad AE; Siebertz S, 2024, 'Data Reduction for Directed Feedback Vertex Set on Graphs Without Long Induced Cycles.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 183 - 197, https://doi.org/10.1007/978-3-031-52113-3

Shur AM; Rubinchik M, 2024, 'Distance Labeling for Families of Cycles.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 471 - 484, https://doi.org/10.1007/978-3-031-52113-3

Bliznets I; Nederlof J, 2024, 'Exact and Parameterized Algorithms for Choosability.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 111 - 124, https://doi.org/10.1007/978-3-031-52113-3

Hanaka T; Kiya H; Lampis M; Ono H; Yoshiwatari K, 2024, 'Faster Winner Determination Algorithms for (Colored) Arc Kayles.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 297 - 310, https://doi.org/10.1007/978-3-031-52113-3

Beikmohammadi A; Evans WS; Tabatabaee SA, 2024, 'Fractional Bamboo Trimming and Distributed Windows Scheduling.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 69 - 81, https://doi.org/10.1007/978-3-031-52113-3

Aloisio A; Flammini M; Vinci C, 2024, 'Generalized Distance Polymatrix Games.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 25 - 39, https://doi.org/10.1007/978-3-031-52113-3

Bonis AD, 2024, 'Group Testing in Arbitrary Hypergraphs and Related Combinatorial Structures.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 154 - 168, https://doi.org/10.1007/978-3-031-52113-3

Maldonado D; Montealegre P; Ríos-Wilson M; Theyssier G, 2024, 'Local Certification of Majority Dynamics.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 369 - 382, https://doi.org/10.1007/978-3-031-52113-3

Firman O; Hegemann T; Klemz B; Klesen F; Sieper MD; Wolff A; Zink J, 2024, 'Morphing Graph Drawings in the Presence of Point Obstacles.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 240 - 254, https://doi.org/10.1007/978-3-031-52113-3

Berndt S; Mnich M; Stamm T, 2024, 'New Support Size Bounds and Proximity Bounds for Integer Linear Programming.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 82 - 95, https://doi.org/10.1007/978-3-031-52113-3

Banbara M; Minato S-I; Ono H; Uehara R, 2024, 'On the Computational Complexity of Generalized Common Shape Puzzles.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 55 - 68, https://doi.org/10.1007/978-3-031-52113-3

Takhanov R, 2024, 'On the Induced Problem for Fixed-Template CSPs.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 485 - 499, https://doi.org/10.1007/978-3-031-52113-3

Bhyravarapu S; Kanesh L; Mohanapriya A; Purohit N; Sadagopan N; Saurabh S, 2024, 'On the Parameterized Complexity of Minus Domination.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 96 - 110, https://doi.org/10.1007/978-3-031-52113-3

Vlas JMD, 2024, 'On the Parameterized Complexity of the Perfect Phylogeny Problem.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 169 - 182, https://doi.org/10.1007/978-3-031-52113-3

Praveen M; Schnoebelen P; Veron J; Vialard I, 2024, 'On the Piecewise Complexity of Words and Periodic Words.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 456 - 470, https://doi.org/10.1007/978-3-031-52113-3

Fiala J; Firman O; Liotta G; Wolff A; Zink J, 2024, 'Outerplanar and Forest Storyplans.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 211 - 225, https://doi.org/10.1007/978-3-031-52113-3

Bliznets I; Nederlof J; Szilágyi K, 2024, 'Parameterized Algorithms for Covering by Arithmetic Progressions.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 125 - 138, https://doi.org/10.1007/978-3-031-52113-3

Mousawi SM; Zilles S, 2024, 'Positive Characteristic Sets for Relational Pattern Languages.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 398 - 412, https://doi.org/10.1007/978-3-031-52113-3

Kawasaki Y; Hendrian D; Yoshinaka R; Shinohara A, 2024, 'Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 340 - 354, https://doi.org/10.1007/978-3-031-52113-3

Martínez VA; Chaplick S; Kelk S; Meuwese R; Mihalák M; Stamoulis G, 2024, 'Relaxed Agreement Forests.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 40 - 54, https://doi.org/10.1007/978-3-031-52113-3

Gourvès L; Pagourtzis A, 2024, 'Removable Online Knapsack with Bounded Size Items.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 283 - 296, https://doi.org/10.1007/978-3-031-52113-3

Crespi-Reghizzi S; Restivo A; Pietro PS, 2024, 'Row-Column Combination of Dyck Words.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 139 - 153, https://doi.org/10.1007/978-3-031-52113-3

Janousek J; Plachý S, 2024, 'Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 326 - 339, https://doi.org/10.1007/978-3-031-52113-3

Firbas A; Dobler A; Holzer F; Schafellner J; Sorge M; Villedieu A; Wißmann M, 2024, 'The Complexity of Cluster Vertex Splitting and Company.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 226 - 239, https://doi.org/10.1007/978-3-031-52113-3

Fuchs J; Grüne C; Janßen T, 2024, 'The Complexity of Online Graph Games.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 269 - 282, https://doi.org/10.1007/978-3-031-52113-3

Schmid ML, 2024, 'The Information Extraction Framework of Document Spanners - A Very Informal Survey.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 3 - 22, https://doi.org/10.1007/978-3-031-52113-3

Nász A-T, 2024, 'The Weighted HOM-Problem Over Fields.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 427 - 441, https://doi.org/10.1007/978-3-031-52113-3

Evans WS; Köck K; Kobourov SG, 2024, 'Visualization of Bipartite Graphs in Limited Window Size.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 198 - 210, https://doi.org/10.1007/978-3-031-52113-3

Fleischmann P; Haschke L; Löck T; Nowotka D, 2024, 'Word-Representable Graphs from a Word's Perspective.', in Fernau H; Gaspers S; Klasing R (eds.), SOFSEM, Springer, pp. 255 - 268, https://doi.org/10.1007/978-3-031-52113-3

Gaspers S; Kaploun A, 2022, 'Faster Algorithms for Weak Backdoors', in Proceedings of the 36th Aaai Conference on Artificial Intelligence Aaai 2022, pp. 3741 - 3748, http://dx.doi.org/10.1609/aaai.v36i4.20288

Aziz H; Gaspers S; Sun Z, 2020, 'Mechanism design for school choice with soft diversity constraints', in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas, pp. 1756 - 1758

Aziz H; Gaspers S; Sun Z, 2020, 'Mechanism design for school choice with soft diversity constraints', in Ijcai International Joint Conference on Artificial Intelligence, pp. 153 - 159

Aziz H; Gaspers S; Sun Z; Yokoo M, 2020, 'Multiple levels of importance in matching with distributional constraints', in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas, pp. 1759 - 1761

Aziz H; Gaspers S; Sun Z; Yokoo M, 2020, 'Multiple Levels of Importance in Matching with Distributional Constraints: Extended Abstract.', in Seghrouchni AEF; Sukthankar G; An B; Yorke-Smith N (eds.), AAMAS, International Foundation for Autonomous Agents and Multiagent Systems, pp. 1759 - 1761, https://dl.acm.org/doi/10.5555/3398761

Gaspers S; Lau J, 2019, 'Minimizing and computing the inverse geodesic length on trees', in Leibniz International Proceedings in Informatics, LIPIcs, Shanghai, China, presented at 30th International Symposium on Algorithms and Computation (ISAAC 2019) held in Shanghai, China on December 8-11, 2019, Shanghai, China, 08 December 2019 - 11 December 2019, http://dx.doi.org/10.4230/LIPIcs.ISAAC.2019.59

Gaspers S; Li R, 2019, 'Enumeration of preferred extensions in almost oriented digraphs', in Leibniz International Proceedings in Informatics, LIPIcs, Aachen, Germany, presented at 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), Aachen, Germany, 26 August 2019, http://dx.doi.org/10.4230/LIPIcs.MFCS.2019.74

Back to profile page