- Léonard Brice, Jean-François Raskin, Marie van den Bogaard:
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. MFCS 2023: 26:1-26:15 - Nader H. Bshouty:
On Property Testing of the Binary Rank. MFCS 2023: 27:1-27:14 - Jakub Bulín, Michael Kompatscher:
Short Definitions in Constraint Languages. MFCS 2023: 28:1-28:15 - Elisabet Burjons, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith:
The Online Simple Knapsack Problem with Reservation and Removability. MFCS 2023: 29:1-29:12 - Michaël Cadilhac, Arka Ghosh, Guillermo A. Pérez, Ritam Raha:
Parikh One-Counter Automata. MFCS 2023: 30:1-30:15 - Deniz Agaoglu Çagirici, Onur Çagirici, Jan Derbisz, Tim A. Hartmann, Petr Hlinený, Jan Kratochvíl, Tomasz Krawczyk, Peter Zeman:
Recognizing H-Graphs - Beyond Circular-Arc Graphs. MFCS 2023: 8:1-8:14 - Dibyayan Chakraborty, Jérémie Chalopin, Florent Foucaud, Yann Vaxès:
Isometric Path Complexity of Graphs. MFCS 2023: 32:1-32:14 - Diptarka Chakraborty, Gunjan Kumar, Kuldeep S. Meel:
Support Size Estimation: The Power of Conditioning. MFCS 2023: 33:1-33:13 - Arkadev Chattopadhyay, Yogesh Dahiya, Meena Mahajan:
Query Complexity of Search Problems. MFCS 2023: 34:1-34:15 - Vera Chekan, Stefan Kratsch:
Tight Algorithmic Applications of Clique-Width Generalizations. MFCS 2023: 35:1-35:15 - Artur Czumaj:
Modern Parallel Algorithms (Invited Talk). MFCS 2023: 3:1-3:2 - Mohan Dantam, Richard Mayr:
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games. MFCS 2023: 38:1-38:15 - Samir Datta, Asif Khan, Anish Mukherjee:
Dynamic Planar Embedding Is in DynFO. MFCS 2023: 39:1-39:15 - Laure Daviaud, Andrew Ryzhikov:
Universality and Forall-Exactness of Cost Register Automata with Few Registers. MFCS 2023: 40:1-40:15 - Tom Demeulemeester, Jannik Peters:
Relaxed Core Stability for Hedonic Games with Size-Dependent Utilities. MFCS 2023: 41:1-41:14 - Thomas Dissaux, Foivos Fioravantes, Harmender Gahlawat, Nicolas Nisse:
Recontamination Helps a Lot to Hunt a Rabbit. MFCS 2023: 42:1-42:14 - Matthew Earnshaw, Pawel Sobocinski:
String Diagrammatic Trace Theory. MFCS 2023: 43:1-43:15 - Martijn van Ee, Tim Oosterwijk, René Sitters, Andreas Wiese:
Exact and Approximation Algorithms for Routing a Convoy Through a Graph. MFCS 2023: 86:1-86:15 - Fabian Egidy, Christian Glaßer, Martin Herold:
Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. MFCS 2023: 44:1-44:15 - Eduard Eiben, Diptapriyo Majumdar, M. S. Ramanujan:
Finding a Highly Connected Steiner Subgraph and its Applications. MFCS 2023: 45:1-45:15 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Tomohiro Koana:
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges. MFCS 2023: 46:1-46:8 - Florian Frank, Stefan Milius, Henning Urbat:
Positive Data Languages. MFCS 2023: 48:1-48:15 - Harmender Gahlawat, Meirav Zehavi:
Parameterized Analysis of the Cops and Robber Game. MFCS 2023: 49:1-49:17 - François Le Gall, Masayuki Miyamoto, Harumichi Nishimura:
Distributed Merlin-Arthur Synthesis of Quantum States and Its Applications. MFCS 2023: 63:1-63:15 - Luisa Gargano, Adele A. Rescigno:
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width. MFCS 2023: 50:1-50:15 - Mika Göös, Ziyi Guan, Tiberiu Mosnoi:
Depth-3 Circuits for Inner Product. MFCS 2023: 51:1-51:12 - Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS 2023: 52:1-52:14 - Niklas Hahn, Michalis Xefteris:
The Covering Canadian Traveller Problem Revisited. MFCS 2023: 53:1-53:12 - Jana Holznigenkemper, Christian Komusiewicz, Nils Morawietz, Bernhard Seeger:
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric. MFCS 2023: 54:1-54:15 - Satyabrata Jana, Daniel Lokshtanov, Soumen Mandal, Ashutosh Rai, Saket Saurabh:
Parameterized Approximation Scheme for Feedback Vertex Set. MFCS 2023: 56:1-56:15