Table of Contents

• Extending Partial Representations of Circle Graphs in Near-Linear TimeGuido Brückner, Ignaz Rutter, Peter Stumpf. [doi]
• Probabilistic Model Checking for Strategic Equilibria-Based Decision Making: Advances and Challenges (Invited Talk)Marta Kwiatkowska, Gethin Norman, David Parker 0001, Gabriel Santos, Rui Yan 0002. [doi]
• Reducing the Vertex Cover Number via Edge ContractionsPaloma T. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, Uéverton S. Souza, Prafullkumar Tale. [doi]
• Bounded Degree Nonnegative Counting CSPJin-yi Cai, Daniel P. Szabo. [doi]
• The Complexity of Periodic Energy MinimisationDuncan Adamson, Argyrios Deligkas, Vladimir V. Gusev, Igor Potapov. [doi]
• On Synthesizing Computable Skolem Functions for First Order LogicSupratik Chakraborty, S. Akshay 0001. [doi]
• On the Role of the High-Low Partition in Realizing a Degree Sequence by a Bipartite GraphAmotz Bar-Noy, Toni Böhnlein, David Peleg, Dror Rawitz. [doi]
• Tree Exploration in Dual-Memory ModelDominik Bojko, Karol Gotfryd, Dariusz R. Kowalski, Dominik Pajak. [doi]
• Comonadic semantics for hybrid logicSamson Abramsky, Dan Marsden. [doi]
• Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime DimensionsRobert I. Booth, Titouan Carette. [doi]
• Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and SetsAnkit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh 0001. [doi]
• Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-SettingLane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah, Patrick A. Phillips. [doi]
• Not All Strangers Are the Same: The Impact of Tolerance in Schelling GamesPanagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris. [doi]
• A Robust Class of Languages of 2-Nested WordsSéverine Fratani, Guillaume Maurras, Pierre-Alain Reynier. [doi]
• Exact Matching in Graphs of Bounded Independence NumberNicolas El Maalouly, Raphael Steiner. [doi]
• Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query TimesDariusz Dereniowski, Izajasz P. Wrosz. [doi]
• Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching ProblemsNiclas Boehmer, Klaus Heeger, Rolf Niedermeier. [doi]
• Dispersing Obnoxious Facilities on Graphs by Rounding DistancesTim A. Hartmann, Stefan Lendl. [doi]
• Beyond Value Iteration for Parity Games: Strategy Iteration with Universal TreesZhuan Khye Koh, Georg Loho. [doi]
• Rabbits Approximate, Cows Compute Exactly!Balagopal Komarath, Anurag Pandey 0001, Nitin Saurabh. [doi]
• On Upward-Planar L-Drawings of GraphsPatrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo. [doi]
• Boundaries to Single-Agent Stability in Additively Separable Hedonic GamesMartin Bullinger. [doi]
• Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk)Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, Kirill Simonov. [doi]
• Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is HardChristian Komusiewicz, Nils Morawietz. [doi]
• Approximation Algorithms for Covering Vertices by Long PathsMingyang Gong, Jing Fan, Guohui Lin, Eiji Miyano. [doi]
• Polynomial Time Algorithm for ARRIVAL on Tree-Like MultigraphsDavid Auger, Pierre Coucheney, Loric Duhaze. [doi]
• Regular Monoidal LanguagesMatthew Earnshaw, Pawel Sobocinski 0001. [doi]
• On the Binary and Boolean Rank of Regular MatricesIshay Haviv, Michal Parnas. [doi]
• The Complexity of Computing Optimum Labelings for Temporal ConnectivityNina Klobas, George B. Mertzios, Hendrik Molter, Paul G. Spirakis. [doi]
• On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-SquaresIlario Bonacina, Nicola Galesi, Massimo Lauria. [doi]
• On Algorithms Based on Finitely Many Homomorphism CountsYijia Chen, Jörg Flum, Mingjun Liu, Zhiyang Xun. [doi]
• Independent Set Reconfiguration on Directed GraphsTakehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Masahiro Takahashi, Kunihiro Wasa. [doi]
• Computing the Minimum Bottleneck Moving Spanning TreeHaitao Wang 0001, Yiming Zhao. [doi]
• Improved Approximation Algorithms for the Traveling Tournament ProblemJingyang Zhao 0001, Mingyu Xiao, Chao Xu 0002. [doi]
• Fixed-Point Cycles and Approximate EFX AllocationsBenjamin Aram Berendsohn, Simona Boyadzhiyska, László Kozma 0002. [doi]
• Membership Problems in Finite GroupsMarkus Lohrey, Andreas Rosowski, Georg Zetzsche. [doi]
• Weighted Counting of Matchings in Unbounded-Treewidth Graph FamiliesAntoine Amarilli, Mikaël Monet. [doi]
• Space-Bounded Unitary Quantum Computation with PostselectionSeiichiro Tani. [doi]
• LO_v-Calculus: A Graphical Language for Linear Optical Quantum CircuitsAlexandre Clément, Nicolas Heurtel, Shane Mansfield, Simon Perdrix, Benoît Valiron. [doi]
• Streaming Word ProblemsMarkus Lohrey, Lukas Lück. [doi]
• Modern Dynamic Data Structures (Invited Talk)Monika Henzinger. [doi]
• New Lower Bounds and Upper Bounds for Listing Avoidable VerticesMingyang Deng, Virginia Vassilevska Williams, Ziqian Zhong. [doi]
• Higher-Order Causal Theories Are Models of BV-LogicWill Simmons, Aleks Kissinger. [doi]
• CNF Encodings of ParityGregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin. [doi]
• Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic SetJulian D'Costa, Engel Lefaucheux, Eike Neumann, Joël Ouaknine, James Worrell 0001. [doi]
• On Dynamic α + 1 Arboricity Decomposition and Out-OrientationAleksander B. G. Christiansen, Jacob Holm, Eva Rotenberg, Carsten Thomassen. [doi]
• Continuous Rational Functions Are Deterministic RegularOlivier Carton, Gaëtan Douéneau-Tabot. [doi]
• Graph Realization of Distance SetsAmotz Bar-Noy, David Peleg, Mor Perry, Dror Rawitz. [doi]
• On the Number of Quantifiers as a Complexity MeasureRonald Fagin, Jonathan Lenchner, Nikhil Vyas 0001, R. Ryan Williams. [doi]
• Automating OBDD proofs is NP-hardDmitry Itsykson, Artur Riazanov. [doi]
• Online Bipartite Matching and Adwords (Invited Talk)Vijay V. Vazirani. [doi]
• Metric Dimension Parameterized by Feedback Vertex Set and Other Structural ParametersEsther Galby, Liana Khazaliya, Fionn Mc Inerney, Roohani Sharma, Prafullkumar Tale. [doi]
• Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix OrderDominik Peteler, Karin Quaas. [doi]
• Complexity of the Cluster Vertex Deletion Problem on H-Free GraphsHoàng-Oanh Le, Van Bang Le. [doi]
• Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNPAnton Ehrmanntraut, Fabian Egidy, Christian Glaßer. [doi]
• Higher-Order Quantified Boolean SatisfiabilityDmitry Chistikov 0001, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti. [doi]
• Graph Similarity Based on Matrix NormsTimo Gervens, Martin Grohe. [doi]
• Cohomology in Constraint Satisfaction and Structure IsomorphismAdam Ó Conghaile. [doi]
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-CalculusAlexandre Clément, Simon Perdrix. [doi]
• Sample Compression Schemes for Balls in GraphsJérémie Chalopin, Victor Chepoi, Fionn Mc Inerney, Sébastien Ratel, Yann Vaxès. [doi]
• On the Identity Problem for Unitriangular Matrices of Dimension FourRuiwen Dong. [doi]
• On the Skolem Problem for Reversible SequencesGeorge Kenison. [doi]
• SAT-Based Circuit Local ImprovementAlexander S. Kulikov, Danila Pechenev, Nikita Slezkin. [doi]
• Conflict-Free Coloring on Claw-Free Graphs and Interval GraphsSriram Bhyravarapu, Subrahmanyam Kalyanasundaram, Rogers Mathew. [doi]
• On Extended Boundary Sequences of Morphic and Sturmian WordsMichel Rigo, Manon Stipulanti, Markus A. Whiteland. [doi]
• A Universal Skolem Set of Positive Lower DensityFlorian Luca, Joël Ouaknine, James Worrell 0001. [doi]
• An Exact Algorithm for Knot-Free Vertex DeletionM. S. Ramanujan 0001, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma. [doi]
• Generalized Bundled Fragments for First-Order Modal LogicMo Liu 0002, Anantha Padmanabha, R. Ramanujam 0001, Yanjing Wang 0001. [doi]
• A Complexity Approach to Tree Algebras: the Polynomial CaseThomas Colcombet, Arthur Jaquard. [doi]
• Learning Deterministic Visibly Pushdown Automata Under Accessible StackJakub Michaliszyn, Jan Otop. [doi]
• On Uniformization in the Full Binary TreeAlexander Rabinovich. [doi]
• On Kernels for d-Path Vertex CoverRadovan Cervený, Pratibha Choudhary, Ondrej Suchý. [doi]
• The Hamilton Compression of Highly Symmetric GraphsPetr Gregor, Arturo I. Merino, Torsten Mütze. [doi]
• Enumeration Classes Defined by CircuitsNadia Creignou, Arnaud Durand 0001, Heribert Vollmer. [doi]
• Non-Determinism in Lindenmayer Systems and Global TransformationsAlexandre Fernandez, Luidnel Maignan, Antoine Spicher. [doi]
• An Updated Survey of Bidding Games on Graphs (Invited Talk)Guy Avni, Thomas A. Henzinger. [doi]
• Skolem Meets SchanuelYuri Bilu, Florian Luca, Joris Nieuwveld, Joël Ouaknine, David Purser, James Worrell 0001. [doi]
• The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical SystemsJulian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, Mahmoud Salamati, James Worrell 0001. [doi]
• Towards a Model Theory of Ordered Logics: Expressivity and InterpolationBartosz Bednarczyk, Reijo Jaakkola. [doi]
• Algebraic Representations of Unique Bipartite Perfect MatchingGal Beniamini. [doi]
• Countdown μ-CalculusJedrzej Kolodziejski, Bartek Klin. [doi]
• Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic CircuitsC. S. Bhargav, Sagnik Dutta, Nitin Saxena 0001. [doi]
• RAC Drawings of Graphs with Low DegreePatrizio Angelini, Michael A. Bekos, Julia Katheder, Michael Kaufmann 0001, Maximilian Pfister 0002. [doi]