Výsledky vyhľadávania - "Mathematics of computing → Combinatorial algorithms"

On the complexity of Client-Waiter and Waiter-Client games ; Complexité des jeux Client-Waiter et Waiter-Client

Autori: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a ďalší

Prispievatelia: Gledel, Valentin Oijid, Nacim Tavenas, Sébastien a ďalší

Zdroj: 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)
International Colloquium on Automata, Languages, and Programming (ICALP)
https://hal.science/hal-04643212
International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2025, Aarhus, Denmark. ⟨10.4230/LIPIcs.ICALP.2025.89⟩

Predmety: Maker-Breaker, reductions and completeness, Theory of computation → Problems, Mathematics of computing → Hypergraphs, Mathematics of computing → Combinatorial algorithms, PSPACE-complete, Waiter-Client, Client-Waiter, positional games, FPT, Complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Geografické téma: Aarhus, Denmark

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2407.06777; ARXIV: 2407.06777

Dostupnosť: https://hal.science/hal-04643212
https://hal.science/hal-04643212v1/document
https://hal.science/hal-04643212v1/file/On%20the%20complexity%20of%20Waiter-Client%20and%20Client-Waiter%20games.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2025.89

Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

Autori: Timothy F. Chan Jacob W. Cooper Martin Koutecký a ďalší

Prispievatelia: Timothy F. Chan Jacob W. Cooper Martin Koutecký a ďalší

Zdroj: SIAM Journal on Computing. 51:664-700

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, Mathematics of computing → Combinatorial optimization, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, branch-width, width parameters, fixed parameter tractability, Optimization and Control (math.OC), Mathematics of computing → Matroids and greedoids, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics of computing → Combinatorial algorithms, Matroid algorithms, ddc:004, integer programming, Mathematics - Optimization and Control, branch-depth, Computer Science - Discrete Mathematics

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/1907.06688
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.26