Items where Division is "Dániel Marx (DM)" and Year is 2022

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Author(s)/Creator(s) | Item Type | No Grouping
Jump to: B | C | E | F | G | M | N
Number of items: 17.

B

Bensmail, Julien and Fioravantes, Foivos and Mc Inerney, Fionn and Nisse, Nicolas
(2022) The Largest Connected Subgraph Game.
Algorithmica, 84 (9). pp. 2533-2555. ISSN 0178-4617

Bensmail, Julien and Mc Inerney, Fionn
(2022) On a vertex-capturing game.
Theoretical Computer Science, 923. pp. 27-46. ISSN 0304-3975

C

Can Esmer, Baris and Kulik, Ariel and Marx, Dániel and Neuen, Daniel and Sharma, Roohani
(2022) Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search.
In: 30th Annual European Symposium on Algorithms (ESA 2022).
Conference: ESA European Symposium on Algorithms

Chalopin, Jérémie and Chepoi, Victor and Mc Inerney, Fionn and Ratel, Sébastien and Vaxès, Yann
(2022) Sample Compression Schemes for Balls in Graphs.
In: MFCS 2022.
Conference: MFCS International Symposium on Mathematical Foundations of Computer Science

Chistikov, Dmitry and Majumdar, Rupak and Schepper, Philipp
(2022) Subcubic certificates for CFL reachability.
In: POPL 2022.
Conference: POPL ACM-SIGACT Symposium on Principles of Programming Languages

E

Esmer, Baris Can and Kulik, Ariel and Marx, Dániel and Schepper, Philipp and Węgrzycki, Karol
(2022) Computing Generalized Convolutions Faster Than Brute Force.
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Esmer, Baris Can and Nakos, Vasileios
(2022) On (1+ϵ)-Approximate Block Sparse Recovery.
In: ISIT 2022.
Conference: ISIT IEEE International Symposium on Information Theory
(Submitted)

F

Focke, Jacob and Goldberg, Leslie Ann and Roth, Marc and Živný, Stanislav
(2022) Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations.
In: PODS '22.
Conference: PODS ACM SIGMOD-SIGACT-SIGART Conference on Principles of Database Systems

Focke, Jacob and Marx, Dániel and Rzążewski, Paweł
(2022) Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.
In: SODA 2022 - ACM/SIAM Symposium on Discrete Algorithms.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms

Focke, Jacob and Roth, Marc
(2022) Counting Small Induced Subgraphs with Hereditary Properties.
In: STOC 2022.
Conference: STOC ACM Symposium on Theory of Computing

G

Galby, Esther and Khazaliya, Liana and Mc Inerney, Fionn and Sharma, Roohani and Tale, Prafullkumar
(2022) Metric Dimension Parameterized by Feedback Vertex Set and Other Structural Parameters.
In: MFCS 2022.
Conference: MFCS International Symposium on Mathematical Foundations of Computer Science

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Domination and Cut Problems on Chordal Graphs with Bounded Leafage.
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

Galby, Esther and Marx, Dániel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar
(2022) Parameterized Complexity of Weighted Multicut in Trees.
In: 48th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2022).
Conference: WG International Workshop on Graph-Theoretic Concepts in Computer Science

M

Marx, Dániel and Misra, Pranabendu and Neuen, Daniel and Tale, Prafullkumar
(2022) A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
In: UNSPECIFIED.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

Marx, Dániel and Sandeep, R.B.
(2022) Incompressibility of H-free edge modification problems: Towards a dichotomy.
Journal of Computer and System Sciences, 125. pp. 25-58. ISSN 00220000

Marx, Dániel and Sankar, Govind and Schepper, Philipp
(2022) Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard).
In: 17th International Symposium on Parameterized and Exact Computation (IPEC 2022).
Conference: IPEC International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004)
(In Press)

N

Neuen, Daniel
(2022) Isomorphism Testing for Graphs Excluding Small Topological Subgraphs.
In: UNSPECIFIED.
Conference: SODA ACM/SIAM Symposium on Discrete Algorithms
(Submitted)

This list was generated on Tue Jan 21 01:10:08 2025 CET.
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.