Saved in:
| Main Authors: | Gledel, Valentin, Oijid, Nacim, Tavenas, Sébastien, Thomassé, Stéphan |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.06777 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Creating spanning trees in Waiter-Client games
by: Adamski, Grzegorz, et al.
Published: (2024)
by: Adamski, Grzegorz, et al.
Published: (2024)
Bounded degree QBF and positional games
by: Oijid, Nacim
Published: (2024)
by: Oijid, Nacim
Published: (2024)
On the complexity of the Maker-Breaker happy vertex game
by: Hilaire, Mathieu, et al.
Published: (2026)
by: Hilaire, Mathieu, et al.
Published: (2026)
On the parameterized complexity of the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2026)
by: Bagan, Guillaume, et al.
Published: (2026)
Exact number of flips required to sort a burnt stack of pancakes
by: Jäger, Gerold, et al.
Published: (2026)
by: Jäger, Gerold, et al.
Published: (2026)
Token positional games
by: Bagan, Guillaume, et al.
Published: (2026)
by: Bagan, Guillaume, et al.
Published: (2026)
Poset Positional Games
by: Bagan, Guillaume, et al.
Published: (2024)
by: Bagan, Guillaume, et al.
Published: (2024)
The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)
by: Galliot, Florian, et al.
Published: (2025)
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
by: Burke, Kyle, et al.
Published: (2024)
by: Burke, Kyle, et al.
Published: (2024)
Positional s-of-k games
by: Duchêne, Eric, et al.
Published: (2026)
by: Duchêne, Eric, et al.
Published: (2026)
A two-player version of the assignment problem
by: Galliot, Florian, et al.
Published: (2026)
by: Galliot, Florian, et al.
Published: (2026)
Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)
by: Bagan, Guillaume, et al.
Published: (2024)
The Maker-Breaker Largest Connected Subgraph Game
by: Bensmail, Julien, et al.
Published: (2024)
by: Bensmail, Julien, et al.
Published: (2024)
Computing the degreewidth of a digraph is hard
by: Aboulker, Pierre, et al.
Published: (2024)
by: Aboulker, Pierre, et al.
Published: (2024)
Graph Irregularity via Edge Deletions
by: Bensmail, Julien, et al.
Published: (2025)
by: Bensmail, Julien, et al.
Published: (2025)
Partition strategies for the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2024)
by: Bagan, Guillaume, et al.
Published: (2024)
A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)
by: Dailly, Antoine, et al.
Published: (2017)
Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)
by: Bourneuf, Romain, et al.
Published: (2023)
On the Metric Dimension of $K_a \times K_b \times K_c$
by: Gledel, Valentin, et al.
Published: (2024)
by: Gledel, Valentin, et al.
Published: (2024)
Improved fewnomial upper bounds from Wronskians and dessins d'enfant
by: Hilany, Boulos El, et al.
Published: (2024)
by: Hilany, Boulos El, et al.
Published: (2024)
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Dichromatic Number and Cycle Inversions
by: Charbit, Pierre, et al.
Published: (2024)
by: Charbit, Pierre, et al.
Published: (2024)
Complexity of Maker-Breaker Games on Edge Sets of Graphs
by: Duchêne, Eric, et al.
Published: (2023)
by: Duchêne, Eric, et al.
Published: (2023)
Simple Chopsticks: Playing with any number of hands and fingers
by: Dailly, Antoine, et al.
Published: (2024)
by: Dailly, Antoine, et al.
Published: (2024)
Two-block paths in oriented graphs of large semidegree
by: Penev, Irena, et al.
Published: (2025)
by: Penev, Irena, et al.
Published: (2025)
A structural description of Zykov and Blanche Descartes graphs
by: Marin, Malory, et al.
Published: (2024)
by: Marin, Malory, et al.
Published: (2024)
An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
by: Marcille, Clara, et al.
Published: (2026)
by: Marcille, Clara, et al.
Published: (2026)
A Polynomial-Time Approximation Algorithm for Complete Interval Minors
by: Bourneuf, Romain, et al.
Published: (2025)
by: Bourneuf, Romain, et al.
Published: (2025)
Cybo-Waiter: A Physical Agentic Framework for Humanoid Whole-Body Locomotion-Manipulation
by: Ren, Peng, et al.
Published: (2026)
by: Ren, Peng, et al.
Published: (2026)
First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
by: Geniet, Colin, et al.
Published: (2022)
by: Geniet, Colin, et al.
Published: (2022)
Small hitting sets for longest paths and cycles
by: Norin, Sergey, et al.
Published: (2025)
by: Norin, Sergey, et al.
Published: (2025)
Lollipops, dense cycles and chords
by: Dvořák, Zdeněk, et al.
Published: (2025)
by: Dvořák, Zdeněk, et al.
Published: (2025)
Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)
by: Bonnet, Édouard, et al.
Published: (2021)
Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
by: Bonnet, Édouard, et al.
Published: (2023)
by: Bonnet, Édouard, et al.
Published: (2023)
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
by: Bonamy, Marthe, et al.
Published: (2022)
by: Bonamy, Marthe, et al.
Published: (2022)
"One Soy Latte for Daniel": Visual and Movement Communication of Intention from a Robot Waiter to a Group of Customers
by: Hong, Seung Chan, et al.
Published: (2024)
by: Hong, Seung Chan, et al.
Published: (2024)
El lenguaje como instrumento del humor en The Dumb Waiter y Mountain Language, de Harold Pinter
by: Juan C. Saravia
Published: (2015)
by: Juan C. Saravia
Published: (2015)
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
by: Abiad, Aida, et al.
Published: (2026)
by: Abiad, Aida, et al.
Published: (2026)
Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
Similar Items
-
Creating spanning trees in Waiter-Client games
by: Adamski, Grzegorz, et al.
Published: (2024) -
Bounded degree QBF and positional games
by: Oijid, Nacim
Published: (2024) -
On the complexity of the Maker-Breaker happy vertex game
by: Hilaire, Mathieu, et al.
Published: (2026) -
On the parameterized complexity of the Maker-Breaker domination game
by: Bagan, Guillaume, et al.
Published: (2026) -
Exact number of flips required to sort a burnt stack of pancakes
by: Jäger, Gerold, et al.
Published: (2026)