bibliographer - Computer Science - Discrete Mathematics

Metric Dimension and Geodetic Set Parameterized by Vertex Cover Florent Foucaud Esther Galby Liana Khazaliya Shaohua Li Fionn Mc Inerney Roohani Sharma Prafullkumar Tale Sat 05 April 2025
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover Florent Foucaud Esther Galby Liana Khazaliya Shaohua Li Fionn Mc Inerney Roohani Sharma Prafullkumar Tale Sat 05 April 2025
A Study of Weisfeiler-Leman Colorings on Planar Graphs Sandra Kiefer Daniel Neuen Thu 13 March 2025
Merge-width and First-Order Model Checking Jan Dreier Szymon Toruńczyk Sun 09 March 2025
Vanishing of Schubert Coefficients Igor Pak Colleen Robichaux Tue 18 February 2025
An efficient uniqueness theorem for overcomplete tensor decomposition Pascal Koiran Fri 14 February 2025
Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO Nikolas Mahlmann Wed 29 January 2025
A New Notion of Regularity: Finite State Automata Accepting Graphs Yvo Ad Meeres Sat 12 October 2024
First-Order Model Checking on Monadically Stable Graph Classes Jan Dreier Ioannis Eleftheriadis Nikolas Mahlmann Rose McCarty Michał Pilipczuk Szymon Toruńczyk Wed 02 October 2024
Computing with Hypergeometric-Type Terms Bertrand Teguia Tabuguia Wed 21 August 2024
The Subspace Flatness Conjecture and Faster Integer Programming Victor Reis Thomas Rothvoss Thu 01 August 2024
Color Refinement for Relational Structures Benjamin Scheidt Nicole Schweikardt Wed 31 July 2024
On Tree Automata, Generating Functions, and Differential Equations Rida Ait El Manssour Vincent Cheval Mahsa Shirmohammadi James Worrell Sat 13 July 2024
Weighted basic parallel processes and combinatorial enumeration Lorenzo Clemente Wed 10 July 2024
Addition in Dumont-Thomas Numeration Systems in Theory and Practice Olivier Carton Jean-Michel Couvreur Martin Delacourt Nicolas Ollinger Sun 23 June 2024
Treewidth Inapproximability and Tight ETH Lower Bound Édouard Bonnet Sun 23 June 2024
On shortest products for nonnegative matrix mortality Andrew Ryzhikov Fri 31 May 2024
On classes of bounded tree rank, their interpretations, and efficient sparsification Jakub Gajarský Rose McCarty Tue 07 May 2024
The Identity Problem in virtually solvable matrix groups over algebraic numbers Corentin Bodart Ruiwen Dong Fri 05 April 2024
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes Jan Dreier Nikolas Mahlmann Szymon Toruńczyk Tue 26 March 2024
Complexity problems in enumerative combinatorics Igor Pak Fri 22 March 2024
PosSLP and Sum of Squares Markus Blaser Julian Dørfler Gorav Jindal Mon 04 March 2024
Introducing q-deformed binomial coefficients of words Antoine Renard Michel Rigo Markus A. Whiteland Thu 29 February 2024
Decidability and k-Regular Sequences Daniel Krenn Jeffrey Shallit Wed 21 February 2024
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees Sandra Kiefer Daniel Neuen Tue 06 February 2024
Membership problems in nilpotent groups Corentin Bodart Thu 01 February 2024
Elementary first-order model checking for sparse graphs Jakub Gajarský Michał Pilipczuk Marek Sokołowski Giannos Stamoulis Szymon Toruńczyk Thu 01 February 2024
Strongly k-recursive sequences Daniel Krenn Jeffrey Shallit Tue 30 January 2024
Combinatorics on words and generating Dirichlet series of automatic sequences Jean-Paul Allouche Jeffrey Shallit Manon Stipulanti Tue 30 January 2024
Measuring well quasi-ordered finitary powersets Sergio Abriola Simon Halfon Aliaume Lopez Sylvain Schmitz Philippe Schnoebelen Isa Vialard Wed 27 December 2023
Factoring Pattern-Free Permutations into Separable ones Édouard Bonnet Romain Bourneuf Colin Geniet Stéphan Thomassé Sat 25 November 2023
Enumerating Tarski fixed points on lattices of binary relations Julian Muller Fri 24 November 2023
Combinatorics of nondeterministic walks Élie de Panafieu Michael Wallner Tue 07 November 2023
Proof of Irvine's Conjecture via Mechanized Guessing Jeffrey Shallit Thu 26 October 2023
Progress on Polynomial Identity Testing - II Nitin Saxena Mon 02 October 2023
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory Jeffrey Shallit Sonja Linghui Shan Thu 14 September 2023
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements Martin Grohe Moritz Lichter Daniel Neuen Pascal Schweitzer Mon 28 August 2023
Proving properties of some greedily-defined integer recurrences via automata theory Jeffrey Shallit Sat 26 August 2023
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond Jan Dreier Daniel Mock Peter Rossmanith Fri 14 July 2023
Testing Isomorphism of Graphs in Polynomial Time Rui Xue Wed 24 May 2023
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes Jan Dreier Fri 05 May 2023
Simulating Logspace-Recursion with Logarithmic Quantifier Depth Steffen van Bergerem Martin Grohe Sandra Kiefer Luca Oeljeklaus Fri 28 April 2023
The Iteration Number of the Weisfeiler-Leman Algorithm Martin Grohe Moritz Lichter Daniel Neuen Fri 28 April 2023
The Identity Problem in the special affine group of mathbbZ^2 Ruiwen Dong Fri 28 April 2023
Boolean symmetric vs. functional PCSP dichotomy Tamio-Vesa Nakajima Stanislav Živný Fri 28 April 2023
Transduction of Automatic Sequences and Applications Jeffrey Shallit Anatoly Zavyalov Mon 17 April 2023
An aperiodic monotile David Smith Joseph Samuel Myers Craig S. Kaplan Chaim Goodman-Strauss Sun 26 March 2023
The Mathematics of Ltextbackslash'aszltextbackslash'o Lovtextbackslash'asz Martin Grøtschel Jaroslav Nešetřil Wed 08 March 2023
First-Order Model Checking on Structurally Sparse Graph Classes Jan Dreier Nikolas Mahlmann Sebastian Siebertz Mon 20 February 2023
From Polynomial Invariants to Linear Loops George Kenison Laura Kovács Anton Varonka Mon 20 February 2023
Exact Probabilistic Inference Using Generating Functions Lutz Klinkenberg Mingshuai Chen Joost-Pieter Katoen Tobias Winkler Thu 09 February 2023
Rudin-Shapiro Sums Via Automata Theory and Logic Narad Rampersad Jeffrey Shallit Tue 07 February 2023
Flip-width: Cops and Robber on dense graphs Szymon Toruńczyk Tue 07 February 2023
Flipper games for monadically stable graph classes Jakub Gajarský Nikolas Mahlmann Rose McCarty Pierre Ohlmann Michał Pilipczuk Wojciech Przybyszewski Sebastian Siebertz Marek Sokołowski Szymon Toruńczyk Tue 07 February 2023
Counterexamples to a Conjecture of Dombi in Additive Number Theory Jason P. Bell Jeffrey Shallit Sat 07 January 2023
Automata and automatic sequences Jean-Paul Allouche Michel Mendès France Sat 24 December 2022
Some Tribonacci Conjectures Jeffrey Shallit Mon 17 October 2022
Order-theoretic trees: monadic second-order descriptions and regularity Bruno Courcelle Sun 09 October 2022
Asymptotics of Bernoulli random walks, bridges, excursions and meanders with a given number of peaks Jean-Maxime Labarbe Jean-François Marckert Mon 03 October 2022
Twin-width V: linear minors, modular counting, and matrix multiplication Édouard Bonnet Ugo Giocanti Patrice Ossona de Mendez Stéphan Thomassé Mon 03 October 2022
A characterization of functions over the integers computable in polynomial time using discrete differential equations Olivier Bournez Arnaud Durand Mon 03 October 2022
What is a combinatorial interpretation Igor Pak Fri 16 September 2022
Morphisms and minimisation of weighted automata Sylvain Lombardy Jacques Sakarovitch Tue 30 August 2022
Walking on Words Ian Pratt-Hartmann Mon 29 August 2022
From Kruskal's theorem to Friedman's gap condition Anton Freund Fri 22 July 2022
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs Colin Geniet Stéphan Thomassé Thu 21 July 2022
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes Jan Dreier Nikolas Mahlmann Sebastian Siebertz Szymon Toruńczyk Fri 01 July 2022
Optimizing tree decompositions in MSO Mikołaj Bojańczyk Michał Pilipczuk Mon 07 February 2022
Treelike decompositions for transductions of sparse graphs Jan Dreier Jakub Gajarský Sandra Kiefer Michał Pilipczuk Szymon Toruńczyk Tue 01 February 2022
Directed Width Measures and Monotonicity of Directed Graph Searching Łukasz Kaiser Stephan Kreutzer Roman Rabinovich Sebastian Siebertz Mon 26 July 2021
On the number of types in sparse graphs Michał Pilipczuk Sebastian Siebertz Szymon Toruńczyk Wed 19 May 2021
Combinators and the Story of Computation Stephen Wolfram Mon 22 February 2021
Resolution with Symmetry Rule applied to Linear Equations Pascal Schweitzer Constantin Seebach Sun 14 February 2021
Solving one variable word equations in the free group in cubic time Robert Ferens Artur Jeż Sun 14 February 2021
Exploring Rulial Space: The Case of Turing Machines Stephen Wolfram Sun 14 February 2021
Optimizing tree decompositions in MSO Mikołaj Bojańczyk Michał Pilipczuk Fri 11 December 2020
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture Jeffrey Shallit Sun 25 October 2020
Twin-width II: small classes Édouard Bonnet Colin Geniet Eun Jung Kim Stéphan Thomassé Rémi Watrigant Wed 14 October 2020
Twin-width I: tractable FO model checking Édouard Bonnet Eun Jung Kim Stéphan Thomassé Rémi Watrigant Wed 14 October 2020
On Positivity and Minimality for Second-Order Holonomic Sequences George Kenison Oleksiy Klurman Engel Lefaucheux Florian Luca Pieter Moree Joel Ouaknine Markus A. Whiteland James Worrell Sun 11 October 2020
Differential games, locality and model checking for FO logic of graphs Jakub Gajarský Maximilian Gorsky Stephan Kreutzer Thu 23 July 2020
Rankwidth meets stability Jaroslav Nesetril Patrice Ossona de Mendez Michal Pilipczuk Roman Rabinovich Sebastian Siebertz Sat 18 July 2020
The Iteration Number of Colour Refinement Sandra Kiefer Brendan D. McKay Thu 21 May 2020
Graph isomorphism in quasipolynomial time parameterized by treewidth Daniel Wiebking Sat 25 April 2020
The Resolution of Keller's Conjecture Joshua Brakensiek Marijn Heule John Mackey David Narváez Wed 08 April 2020
Deep Weisfeiler Leman Martin Grohe Pascal Schweitzer Daniel Wiebking Sun 29 March 2020
Generating functions for generating trees Cyril Banderier Philippe Flajolet Daniele Gardy Mireille Bousquet-Melou Alain Denise Dominique Gouyou-Beauchamps Sun 01 March 2020
Elements of Scheduling Jan Karel Lenstra David B. Shmoys Mon 27 January 2020
Properties of nowhere dense graph classes related to independent set problem Grzegorz Fabiański Wed 11 December 2019
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs Sandra Kiefer Daniel Neuen Thu 15 August 2019
On the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond Paul C. Bell Igor Potapov Pavel Semukhin Fri 28 June 2019
On the Decidability of Reachability in Linear Time-Invariant Systems Nathanael Fijalkow Joel Ouaknine Amaury Pouly João Sousa-Pinto James Worrell Mon 18 March 2019
The Weisfeiler-Leman Dimension of Planar Graphs is at most 3 S. Kiefer I. Ponomarenko P. Schweitzer Thu 06 September 2018
From indexed grammars to generating functions J. Adam E. Freden M. Mishna Thu 10 May 2018

Library Size: 13G (94 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A

[show logs] [hide logs]