default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Dreier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Jan Dreier
, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond:
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347(1): 113750 (2024)- [j5]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT backdoors: Depth beats size. J. Comput. Syst. Sci. 142: 103520 (2024) - [c20]Jan Dreier, Nikolas Mählmann, Szymon Torunczyk:
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. STOC 2024: 1550-1560 - [i21]Jan Dreier, Nikolas Mählmann, Szymon Torunczyk:
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. CoRR abs/2403.15201 (2024) - 2023
- [j4]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP beyond tractable constraint languages. Constraints An Int. J. 28(3): 450-471 (2023) - [j3]Jan Dreier:
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes. Log. Methods Comput. Sci. 19(2) (2023) - [c19]Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA 2023: 43:1-43:17 - [c18]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk:
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP 2023: 125:1-125:18 - [c17]Jan Dreier, Jamie Tucker-Foltz:
Pseudorandom Finite Models. LICS 2023: 1-13 - [c16]Benjamin Bergougnoux, Jan Dreier, Lars Jaffke:
A logic-based algorithmic meta-theorem for mim-width. SODA 2023: 3282-3304 - [c15]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz:
First-Order Model Checking on Structurally Sparse Graph Classes. STOC 2023: 567-580 - [i20]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz:
First-Order Model Checking on Structurally Sparse Graph Classes. CoRR abs/2302.03527 (2023) - [i19]Jan Dreier, Jamie Tucker-Foltz:
Pseudorandom Finite Models. CoRR abs/2304.12109 (2023) - [i18]Jan Dreier, Robert Ganian, Thekla Hamm:
Approximate Evaluation of Quantitative Second Order Queries. CoRR abs/2305.02056 (2023) - [i17]Jan Dreier, Daniel Mock, Peter Rossmanith:
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. CoRR abs/2307.01832 (2023) - [i16]Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. CoRR abs/2311.18740 (2023) - 2022
- [j2]Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond:
Twin-width and generalized coloring numbers. Discret. Math. 345(3): 112746 (2022) - [c14]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP Beyond Tractable Constraint Languages. CP 2022: 20:1-20:17 - [c13]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. ESA 2022: 46:1-46:18 - [c12]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC 2022: 11:1-11:17 - [c11]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike Decompositions for Transductions of Sparse Graphs. LICS 2022: 31:1-31:14 - [c10]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. LICS 2022: 54:1-54:13 - [i15]Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk:
Treelike decompositions for transductions of sparse graphs. CoRR abs/2201.11082 (2022) - [i14]Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
SAT Backdoors: Depth Beats Size. CoRR abs/2202.08326 (2022) - [i13]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. CoRR abs/2202.13014 (2022) - [i12]Benjamin Bergougnoux, Jan Dreier, Lars Jaffke:
A logic-based algorithmic meta-theorem for mim-width. CoRR abs/2202.13335 (2022) - [i11]Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk:
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR abs/2206.13765 (2022) - [i10]Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny:
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR abs/2206.14509 (2022) - 2021
- [c9]Jan Dreier:
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. LICS 2021: 1-13 - [c8]Jan Dreier, Peter Rossmanith:
Approximate Evaluation of First-Order Counting Queries. SODA 2021: 1720-1739 - [i9]Jan Dreier:
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. CoRR abs/2104.10446 (2021) - 2020
- [j1]Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen:
Complexity of independency and cliquy trees. Discret. Appl. Math. 272: 2-15 (2020) - [c7]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. APPROX-RANDOM 2020: 14:1-14:13 - [c6]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
First-Order Model-Checking in Random Graphs and Complex Networks. ESA 2020: 40:1-40:23 - [c5]Jan Dreier, Henri Lotze, Peter Rossmanith:
Hard Problems on Random Graphs. ICALP 2020: 40:1-40:14 - [i8]Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith:
Advice for Online Knapsack With Removable Items. CoRR abs/2005.01867 (2020) - [i7]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
First-Order Model-Checking in Random Graphs and Complex Networks. CoRR abs/2006.14488 (2020) - [i6]Jan Dreier, Peter Rossmanith:
Approximate Evaluation of First-Order Counting Queries. CoRR abs/2010.14814 (2020)
2010 – 2019
- 2019
- [c4]Jan Dreier, Peter Rossmanith:
Motif Counting in Preferential Attachment Graphs. FSTTCS 2019: 13:1-13:14 - [c3]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. IPEC 2019: 10:1-10:16 - [c2]Jan Dreier, Peter Rossmanith:
Hardness of FO Model-Checking on Random Graphs. IPEC 2019: 11:1-11:15 - [i5]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. CoRR abs/1910.00440 (2019) - 2018
- [c1]Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith:
Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM 2018: 125-136 - [i4]Jan Dreier, Philipp Kuinke, Peter Rossmanith:
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. CoRR abs/1803.11114 (2018) - 2017
- [i3]Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith:
Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. CoRR abs/1709.09152 (2017) - 2014
- [i2]Jan Dreier:
Overlapping Communities in Complex Networks. CoRR abs/1409.7615 (2014) - [i1]Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar:
Overlapping Communities in Social Networks. CoRR abs/1412.4973 (2014)
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-10-07 21:19 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:
