Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Dániel Marx

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jacob Focke

> Home > Persons > Dániel Marx

Publications

2024
[i106]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2402-07331
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2402-07331
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness. CoRR abs/2402.07331 (2024)
[i105]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2402-14927
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2402-14927
Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024)
2023
[c122]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/FockeMINSSW23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/FockeMINSSW23
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs. SODA 2023: 3664-3683
[i102]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2306-03640
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2306-03640
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results. CoRR abs/2306.03640 (2023)
[i97]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2312-11086
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2312-11086
Jacob Focke, Florian Hörsch, Shaohua Li, Dániel Marx:
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern. CoRR abs/2312.11086 (2023)
2022
[c116]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/FockeMR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/FockeMR22
Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. SODA 2022: 431-458
[i89]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-10677
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-10677
Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski:
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. CoRR abs/2210.10677 (2022)
[i88]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2211-04278
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2211-04278
Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz:
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. CoRR abs/2211.04278 (2022)
2021
[i84]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2107-06889
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2107-06889
Jacob Focke, Dániel Marx, Pawel Rzazewski:
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. CoRR abs/2107.06889 (2021)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.