default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeike Hatzel
Person information
- affiliation: National Institute of Informatics, Tokyo, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Comb. 44(2): 417-427 (2024)- [i17]Meike Hatzel, Stephan Kreutzer, Marcelo Garlet Milani, Irene Muzi:
Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem. CoRR abs/2404.19222 (2024) - [i16]Maria Chudnovsky, Meike Hatzel, Tuukka Korhonen, Nicolas Trotignon, Sebastian Wiederrecht:
Unavoidable induced subgraphs in graphs with complete bipartite induced minors. CoRR abs/2405.01879 (2024) - [i15]Meike Hatzel, Johannes Schröder:
Computing 𝒮-DAGs and Parity Games. CoRR abs/2405.05571 (2024) - [i14]Vera Chekan, Colin Geniet, Meike Hatzel, Michal Pilipczuk, Marek Sokolowski, Michal T. Seweryn, Marcin Witkowski:
Half-integral Erdös-Pósa property for non-null S-T paths. CoRR abs/2408.16344 (2024) - [i13]Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk:
Erdös-Pósa property of tripods in directed graphs. CoRR abs/2408.16733 (2024) - 2023
- [b1]Meike Hatzel:
Dualities in graphs and digraphs. TU Berlin, Germany, 2023, ISBN 978-3-7983-3291-1, pp. 1-276 - [c8]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of DIRECTED MULTICUT with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. SODA 2023: 3229-3244 - [c7]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. SOSA 2023: 156-165 - [i12]Meike Hatzel, Konrad Majewski, Michal Pilipczuk, Marek Sokolowski:
Simpler and faster algorithms for detours in planar digraphs. CoRR abs/2301.02421 (2023) - [i11]Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak:
Tight bound on treedepth in terms of pathwidth and longest path. CoRR abs/2302.02995 (2023) - [i10]Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich:
Decomposition of (infinite) digraphs along directed 1-separations. CoRR abs/2305.09192 (2023) - 2022
- [j3]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná
, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j2]Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [i9]Meike Hatzel, Lars Jaffke, Paloma T. Lima, Tomás Masarík, Marcin Pilipczuk, Roohani Sharma, Manuel Sorge:
Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation. CoRR abs/2207.07425 (2022) - 2021
- [c6]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with Two Moplexes. LAGOS 2021: 248-256 - [i8]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. CoRR abs/2105.09871 (2021) - [i7]Clément Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin Milanic:
Graphs with at most two moplexes. CoRR abs/2106.10049 (2021) - 2020
- [j1]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable Paths in Graphs. Electron. J. Comb. 27(4): 4 (2020) - [i6]Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. CoRR abs/2008.02133 (2020)
2010 – 2019
- 2019
- [c5]Meike Hatzel, Ken-ichi Kawarabayashi, Stephan Kreutzer:
Polynomial Planar Directed Grid Theorem. SODA 2019: 1465-1484 - [c4]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. WG 2019: 53-65 - [i5]Meike Hatzel, Roman Rabinovich, Sebastian Wiederrecht:
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs. CoRR abs/1902.01322 (2019) - [i4]Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht:
Braces of Perfect Matching Width 2. CoRR abs/1902.06307 (2019) - [i3]Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut:
Avoidable paths in graphs. CoRR abs/1908.03788 (2019) - 2018
- [c3]Meike Hatzel, Sebastian Wiederrecht:
On Perfect Linegraph Squares. WG 2018: 252-265 - 2017
- [c2]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-Like Graphs. WG 2017: 249-262 - [i2]Till Fluschnik, Meike Hatzel, Steffen Härtlein, Hendrik Molter, Henning Seidler:
The Minimum Shared Edges Problem on Grid-like Graphs. CoRR abs/1703.02332 (2017) - 2015
- [c1]Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann:
Encoding CSP into CCS. EXPRESS/SOS 2015: 61-75 - [i1]Meike Hatzel, Christoph Wagner, Kirstin Peters, Uwe Nestmann:
Encoding CSP into CCS (Extended Version). CoRR abs/1508.01127 (2015)
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-09-30 01:01 CEST 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:
