default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Meintrup
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. ICALP 2024: 55:1-55:18- 2023
- [c4]Frank Kammer, Johannes Meintrup:
Succinct Planar Encoding with Minor Operations. ISAAC 2023: 44:1-44:18 - [c3]Frank Kammer, Johannes Meintrup, Andrej Sajenko
:
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. IWOCA 2023: 356-367 - [c2]Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck:
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - [i7]Frank Kammer, Johannes Meintrup:
Succinct Planar Encoding with Minor Operations. CoRR abs/2301.10564 (2023) - [i6]Arindam Biswas, Johannes Meintrup:
Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time. CoRR abs/2307.00996 (2023) - [i5]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i4]Konstantinos Dogeas, Thomas Erlebach, Frank Kammer, Johannes Meintrup, William K. Moses Jr.:
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous. CoRR abs/2312.07140 (2023) - [i3]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [j1]Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Space-Efficient Vertex Separators for Treewidth. Algorithmica 84(9): 2414-2461 (2022) - [c1]Frank Kammer, Johannes Meintrup:
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. ISAAC 2022: 62:1-62:15 - [i2]Frank Kammer, Johannes Meintrup:
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings. CoRR abs/2205.06128 (2022)
2010 – 2019
- 2019
- [i1]Frank Kammer, Johannes Meintrup, Andrej Sajenko:
Space-Efficient Vertex Separators for Treewidth. CoRR abs/1907.00676 (2019)
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:24 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:
