default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Neuen
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
- affiliation (former): CISPA Helmholtz Center for Information Security, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Daniel Neuen
:
Isomorphism Testing Parameterized by Genus and Beyond. SIAM J. Discret. Math. 38(1): 453-484 (2024)- [j8]Daniel Neuen:
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. ACM Trans. Algorithms 20(3): 25 (2024) - [c24]Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width. ICALP 2024: 78:1-78:20 - [c23]Sandra Kiefer, Daniel Neuen:
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. LICS 2024: 50:1-50:14 - [c22]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. SODA 2024: 314-345 - [c21]Daniel Neuen:
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. STACS 2024: 53:1-53:12 - [i27]Sandra Kiefer, Daniel Neuen:
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees. CoRR abs/2402.03274 (2024) - [i26]Radu Curticapean, Daniel Neuen:
Counting Small Induced Subgraphs: Hardness via Fourier Analysis. CoRR abs/2407.07051 (2024) - [i25]Radu Curticapean, Simon Döring, Daniel Neuen, Jiaheng Wang:
Can You Link Up With Treewidth? CoRR abs/2410.02606 (2024) - 2023
- [j7]Martin Grohe, Daniel Neuen, Daniel Wiebking:
Isomorphism Testing for Graphs Excluding Small Minors. SIAM J. Comput. 52(1): 238-272 (2023) - [j6]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. SIAM J. Comput. 52(6): S18-1 (2023) - [j5]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. ACM Trans. Comput. Log. 24(1): 6:1-6:31 (2023) - [c20]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. FOCS 2023: 798-809 - [c19]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. IPEC 2023: 17:1-17:23 - [c18]Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. LICS 2023: 1-13 - [c17]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. SODA 2023: 2087-2110 - [c16]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 - [i24]Martin Grohe, Moritz Lichter, Daniel Neuen:
The Iteration Number of the Weisfeiler-Leman Algorithm. CoRR abs/2301.13317 (2023) - [i23]Daniel Neuen:
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width. CoRR abs/2304.07011 (2023) - [i22]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) - [i21]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Optimally Repurposing Existing Algorithms to Obtain Exponential-Time Approximations. CoRR abs/2306.15331 (2023) - [i20]Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer:
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements. CoRR abs/2308.11970 (2023) - [i19]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Approximate Monotone Local Search for Weighted Problems. CoRR abs/2308.15306 (2023) - [i18]Martin Grohe, Daniel Neuen:
Isomorphism for Tournaments of Small Twin Width. CoRR abs/2312.02048 (2023) - 2022
- [j4]Sandra Kiefer, Daniel Neuen:
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. SIAM J. Discret. Math. 36(1): 252-298 (2022) - [j3]Daniel Neuen:
Hypergraph Isomorphism for Groups with Restricted Composition Factors. ACM Trans. Algorithms 18(3): 27:1-27:50 (2022) - [c15]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. ESA 2022: 50:1-50:19 - [c14]Sandra Kiefer, Daniel Neuen:
A Study of Weisfeiler-Leman Colorings on Planar Graphs. ICALP 2022: 81:1-81:20 - [c13]Daniel Neuen:
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. SODA 2022: 1411-1434 - [c12]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. SODA 2022: 2085-2127 - [i17]Sandra Kiefer, Daniel Neuen:
A Study of Weisfeiler-Leman Colorings on Planar Graphs. CoRR abs/2206.10557 (2022) - [i16]Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma:
Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search. CoRR abs/2206.13481 (2022) - [i15]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) - [i14]Akanksha Agrawal, Dániel Marx, Daniel Neuen, Jasper Slusallek:
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. CoRR abs/2211.04458 (2022) - 2021
- [j2]Martin Grohe, Daniel Neuen:
Isomorphism, canonization, and definability for graphs of bounded rank width. Commun. ACM 64(5): 98-105 (2021) - [c11]Martin Grohe, Daniel Neuen:
Recent advances on the graph isomorphism problem. BCC 2021: 187-234 - [c10]Daniel Neuen:
Isomorphism Testing Parameterized by Genus and Beyond. ESA 2021: 72:1-72:18 - [i13]Daniel Neuen:
Isomorphism Testing Parameterized by Genus and Beyond. CoRR abs/2106.14869 (2021) - [i12]Dániel Marx, Pranabendu Misra, Daniel Neuen, Prafullkumar Tale:
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs. CoRR abs/2110.15098 (2021) - 2020
- [j1]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-tree-width Graphs. ACM Trans. Algorithms 16(3): 34:1-34:31 (2020) - [c9]Martin Grohe, Daniel Wiebking, Daniel Neuen:
Isomorphism Testing for Graphs Excluding Small Minors. FOCS 2020: 625-636 - [c8]Daniel Neuen:
Hypergraph Isomorphism for Groups with Restricted Composition Factors. ICALP 2020: 88:1-88:19 - [i11]Daniel Neuen:
Hypergraph Isomorphism for Groups with Restricted Composition Factors. CoRR abs/2002.06997 (2020) - [i10]Martin Grohe, Daniel Neuen, Daniel Wiebking:
Isomorphism Testing for Graphs Excluding Small Minors. CoRR abs/2004.07671 (2020) - [i9]Martin Grohe, Daniel Neuen:
Recent Advances on the Graph Isomorphism Problem. CoRR abs/2011.01366 (2020) - [i8]Daniel Neuen:
Isomorphism Testing for Graphs Excluding Small Topological Subgraphs. CoRR abs/2011.14730 (2020)
2010 – 2019
- 2019
- [c7]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. LICS 2019: 1-13 - [c6]Sandra Kiefer, Daniel Neuen:
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. MFCS 2019: 45:1-45:15 - [i7]Martin Grohe, Daniel Neuen:
Canonisation and Definability for Graphs of Bounded Rank Width. CoRR abs/1901.10330 (2019) - [i6]Sandra Kiefer, Daniel Neuen:
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs. CoRR abs/1908.05268 (2019) - 2018
- [c5]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
A Faster Isomorphism Test for Graphs of Small Degree. FOCS 2018: 89-100 - [c4]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An Improved Isomorphism Test for Bounded-Tree-Width Graphs. ICALP 2018: 67:1-67:14 - [c3]Daniel Neuen, Pascal Schweitzer:
An exponential lower bound for individualization-refinement algorithms for graph isomorphism. STOC 2018: 138-150 - [i5]Martin Grohe, Daniel Neuen, Pascal Schweitzer:
Towards faster isomorphism tests for bounded-degree graphs. CoRR abs/1802.04659 (2018) - [i4]Martin Grohe, Daniel Neuen, Pascal Schweitzer, Daniel Wiebking:
An improved isomorphism test for bounded-tree-width graphs. CoRR abs/1803.06858 (2018) - 2017
- [c2]Daniel Neuen, Pascal Schweitzer:
Benchmark Graphs for Practical Graph Isomorphism. ESA 2017: 60:1-60:14 - [i3]Daniel Neuen, Pascal Schweitzer:
An exponential lower bound for Individualization-Refinement algorithms for Graph Isomorphism. CoRR abs/1705.03283 (2017) - [i2]Daniel Neuen, Pascal Schweitzer:
Benchmark Graphs for Practical Graph Isomorphism. CoRR abs/1705.03686 (2017) - 2016
- [c1]Daniel Neuen:
Graph Isomorphism for Unit Square Graphs. ESA 2016: 70:1-70:17 - [i1]Daniel Neuen:
Graph Isomorphism for unit square graphs. CoRR abs/1602.08371 (2016)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
