default search action
47th MFCS 2022: Vienna, Austria
- Stefan Szeider
, Robert Ganian
47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria. LIPIcs 241, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-256-3 - Fedor V. Fomin
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk). 1:1-1:4 - Monika Henzinger
Modern Dynamic Data Structures (Invited Talk). 2:1-2:2 - Guy Avni, Thomas A. Henzinger:
An Updated Survey of Bidding Games on Graphs (Invited Talk). 3:1-3:6 - Marta Kwiatkowska
Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk). 4:1-4:22 - Vijay V. Vazirani:
Online Bipartite Matching and Adwords (Invited Talk). 5:1-5:11 - Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets. 6:1-6:15 - Samson Abramsky
Comonadic semantics for hybrid logic. 7:1-7:14 - Duncan Adamson
The Complexity of Periodic Energy Minimisation. 8:1-8:15 - Antoine Amarilli
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. 9:1-9:15 - Patrizio Angelini
On Upward-Planar L-Drawings of Graphs. 10:1-10:15 - Patrizio Angelini
RAC Drawings of Graphs with Low Degree. 11:1-11:15 - David Auger
Polynomial Time Algorithm for ARRIVAL on Tree-Like Multigraphs. 12:1-12:14 - Amotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz:
Graph Realization of Distance Sets. 13:1-13:14 - Amotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz:
On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite Graph. 14:1-14:15 - Bartosz Bednarczyk
Towards a Model Theory of Ordered Logics: Expressivity and Interpolation. 15:1-15:14 - Gal Beniamini:
Algebraic Representations of Unique Bipartite Perfect Matching. 16:1-16:17 - Benjamin Aram Berendsohn, Simona Boyadzhiyska
Fixed-Point Cycles and Approximate EFX Allocations. 17:1-17:13 - C. S. Bhargav
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. 18:1-18:16 - Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram
Conflict-Free Coloring on Claw-Free Graphs and Interval Graphs. 19:1-19:14 - Yuri Bilu
Skolem Meets Schanuel. 20:1-20:15 - Niclas Boehmer, Klaus Heeger, Rolf Niedermeier:
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems. 21:1-21:15 - Dominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pajak:
Tree Exploration in Dual-Memory Model. 22:1-22:16 - Ilario Bonacina
On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares. 23:1-23:15 - Robert I. Booth
Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions. 24:1-24:15 - Guido Brückner, Ignaz Rutter
Extending Partial Representations of Circle Graphs in Near-Linear Time. 25:1-25:14 - Martin Bullinger:
Boundaries to Single-Agent Stability in Additively Separable Hedonic Games. 26:1-26:15 - Jin-Yi Cai, Daniel P. Szabo:
Bounded Degree Nonnegative Counting CSP. 27:1-27:16 - Olivier Carton
Continuous Rational Functions Are Deterministic Regular. 28:1-28:13 - Radovan Cervený
On Kernels for d-Path Vertex Cover. 29:1-29:14 - Supratik Chakraborty
On Synthesizing Computable Skolem Functions for First Order Logic. 30:1-30:15 - Jérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès:
Sample Compression Schemes for Balls in Graphs. 31:1-31:14 - Yijia Chen
On Algorithms Based on Finitely Many Homomorphism Counts. 32:1-32:15 - Dmitry Chistikov
Higher-Order Quantified Boolean Satisfiability. 33:1-33:15 - Aleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation. 34:1-34:15 - Alexandre Clément
LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits. 35:1-35:16 - Alexandre Clément
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus. 36:1-36:15 - Thomas Colcombet
A Complexity Approach to Tree Algebras: the Polynomial Case. 37:1-37:14 - Nadia Creignou, Arnaud Durand, Heribert Vollmer
Enumeration Classes Defined by Circuits. 38:1-38:14 - Julian D'Costa, Engel Lefaucheux
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set. 39:1-39:14 - Julian D'Costa
The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems. 40:1-40:13 - Mingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong:
New Lower Bounds and Upper Bounds for Listing Avoidable Vertices. 41:1-41:14 - Dariusz Dereniowski
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times. 42:1-42:15 - Ruiwen Dong
On the Identity Problem for Unitriangular Matrices of Dimension Four. 43:1-43:14 - Matthew Earnshaw
Regular Monoidal Languages. 44:1-44:14 - Anton Ehrmanntraut
Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. 45:1-45:15 - Nicolas El Maalouly
Exact Matching in Graphs of Bounded Independence Number. 46:1-46:14 - Gregory Emdin, Alexander S. Kulikov
CNF Encodings of Parity. 47:1-47:12 - Ronald Fagin
On the Number of Quantifiers as a Complexity Measure. 48:1-48:14 - Alexandre Fernandez, Luidnel Maignan
Non-Determinism in Lindenmayer Systems and Global Transformations. 49:1-49:13 - Séverine Fratani, Guillaume Maurras, Pierre-Alain Reynier:
A Robust Class of Languages of 2-Nested Words. 50:1-50:15 - Esther Galby
Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters. 51:1-51:15 - Timo Gervens
Graph Similarity Based on Matrix Norms. 52:1-52:15 - Mingyang Gong
Approximation Algorithms for Covering Vertices by Long Paths. 53:1-53:14 - Petr Gregor
The Hamilton Compression of Highly Symmetric Graphs. 54:1-54:14 - Tim A. Hartmann
Dispersing Obnoxious Facilities on Graphs by Rounding Distances. 55:1-55:14 - Ishay Haviv, Michal Parnas:
On the Binary and Boolean Rank of Regular Matrices. 56:1-56:14 - Lane A. Hemaspaandra
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting. 57:1-57:15 - Takehiro Ito
Independent Set Reconfiguration on Directed Graphs. 58:1-58:15 - Dmitry Itsykson
Automating OBDD proofs is NP-hard. 59:1-59:15 - Panagiotis Kanellopoulos
Not All Strangers Are the Same: The Impact of Tolerance in Schelling Games. 60:1-60:14 - George Kenison
On the Skolem Problem for Reversible Sequences. 61:1-61:15 - Nina Klobas
The Complexity of Computing Optimum Labelings for Temporal Connectivity. 62:1-62:15 - Zhuan Khye Koh
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees. 63:1-63:15 - Jedrzej Kolodziejski
Countdown μ-Calculus. 64:1-64:14 - Balagopal Komarath, Anurag Pandey, Nitin Saurabh:
Rabbits Approximate, Cows Compute Exactly! 65:1-65:14 - Christian Komusiewicz
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard. 66:1-66:14 - Alexander S. Kulikov
SAT-Based Circuit Local Improvement. 67:1-67:15 - Hoàng-Oanh Le
Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs. 68:1-68:10 - Paloma T. Lima
Reducing the Vertex Cover Number via Edge Contractions. 69:1-69:14 - Mo Liu
Generalized Bundled Fragments for First-Order Modal Logic. 70:1-70:14 - Markus Lohrey
Membership Problems in Finite Groups. 71:1-71:16 - Markus Lohrey
Streaming Word Problems. 72:1-72:15 - Florian Luca
A Universal Skolem Set of Positive Lower Density. 73:1-73:12 - Jakub Michaliszyn
Learning Deterministic Visibly Pushdown Automata Under Accessible Stack. 74:1-74:16 - Adam Ó Conghaile:
Cohomology in Constraint Satisfaction and Structure Isomorphism. 75:1-75:16 - Dominik Peteler, Karin Quaas:
Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. 76:1-76:15 - Alexander Rabinovich
On Uniformization in the Full Binary Tree. 77:1-77:14 - M. S. Ramanujan, Abhishek Sahu, Saket Saurabh, Shaily Verma:
An Exact Algorithm for Knot-Free Vertex Deletion. 78:1-78:15 - Michel Rigo
On Extended Boundary Sequences of Morphic and Sturmian Words. 79:1-79:16 - Will Simmons
Higher-Order Causal Theories Are Models of BV-Logic. 80:1-80:14 - Seiichiro Tani
Space-Bounded Unitary Quantum Computation with Postselection. 81:1-81:15 - Haitao Wang, Yiming Zhao:
Computing the Minimum Bottleneck Moving Spanning Tree. 82:1-82:15 - Jingyang Zhao
Improved Approximation Algorithms for the Traveling Tournament Problem. 83:1-83:15
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: