ORCID as entered in ROS

Select Publications
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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,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
,2020, 'Mechanism design for school choice with soft diversity constraints', in Ijcai International Joint Conference on Artificial Intelligence, pp. 153 - 159
,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
,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
,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
,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
,2019, 'Fair online allocation of perishable goods and its application to electric vehicle charging', in IJCAI International Joint Conference on Artificial Intelligence, Macao, China, pp. 5569 - 5575, presented at Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-, Macao, China, 10 August 2019, http://dx.doi.org/10.24963/ijcai.2019/773
,2019, 'From matching with diversity constraints to matching with regional quotas', in Elkind E; Veloso M; Agmon N; Taylor ME (eds.), Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems Aamas, ASSOC COMPUTING MACHINERY, CANADA, Montreal, pp. 377 - 385, presented at 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), CANADA, Montreal, 13 May 2019 - 17 May 2019, http://dx.doi.org/10.26190/unsworks/27612
,2019, 'Exact algorithms via monotone local search', in Journal of the ACM, http://dx.doi.org/10.1145/3284176
,2019, 'Optimal Surveillance of Covert Networks by Minimizing Inverse Geodesic Length', in THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE, Honolulu, HI, pp. 533 - 540, presented at 33rd AAAI Conference on Artificial Intelligence / 31st Innovative Applications of Artificial Intelligence Conference / 9th AAAI Symposium on Educational Advances in Artificial Intelligence, Honolulu, HI, 27 January 2019 - 01 February 2019, http://dx.doi.org/10.1609/aaai.v33i01.3301533
,2019, 'Enumeration of Preferred Extensions in Almost Oriented Digraphs.', in Rossmanith P; Heggernes P; Katoen J-P (eds.), MFCS, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 74:1 - 74:1, http://www.dagstuhl.de/dagpub/978-3-95977-117-7
,2018, 'Defender stackelberg game with inverse geodesic length as utility metric', in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, International Foundation for Autonomous Agents and Multiagent Systems, Stockholm, Sweden, pp. 694 - 702, presented at AAMAS (International Conference on Autonomous Agents and Multiagent Systems) 2018, Stockholm, Sweden, 10 July 2018 - 15 July 2018, http://ifaamas.org/Proceedings/aamas2018/pdfs/p694.pdf
,2018, 'Stability and pareto optimality in refugee allocation matchings', in Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS, ACM, Stockholm, Sweden, pp. 964 - 972, presented at 17th International Conference on Autonomous Agents and MultiAgent Systems, Stockholm, Sweden, 10 July 2018 - 15 July 2018, https://dl.acm.org/citation.cfm?id=3237383
,