default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Meister 0001
Person information
- affiliation: RWTH Aachen, Germany
- affiliation: University of Trier, Germany
- affiliation: University of Würzburg, Germany
Other persons with the same name
- Daniel Meister 0002
![[0000-0002-3149-1442]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3149-1442")
— Czech Technical University in Prague - Daniel Meister 0003 — Fraunhofer Institute for Integrated Circuits IIS, Erlangen, Germany
- Daniel Meister 0004 — Advanced Micro Devices, Inc., Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j25]Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
Clique-width of path powers. Discret. Appl. Math. 205: 62-72 (2016)- [j24]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? J. Comb. Theory B 116: 250-286 (2016) - 2015
- [j23]Daniel Meister, Udi Rotics:
Clique-width of full bubble model graphs. Discret. Appl. Math. 185: 138-167 (2015) - [j22]Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics:
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187: 70-81 (2015) - [j21]Henning Fernau, Pinar Heggernes, Pim van 't Hof, Daniel Meister, Reza Saei:
Computing the metric dimension for chain graphs. Inf. Process. Lett. 115(9): 671-676 (2015) - [j20]Pinar Heggernes, Pim van 't Hof, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs. Theor. Comput. Sci. 562: 252-269 (2015) - [j19]Daniel Meister:
Using swaps and deletes to make strings match. Theor. Comput. Sci. 562: 606-620 (2015) - [c20]Dieter Kratsch, Mathieu Liedloff, Daniel Meister:
End-Vertices of Graph Search Algorithms. CIAC 2015: 300-312 - 2014
- [j18]Henning Fernau, Daniel Meister:
Digraphs of bounded elimination width. Discret. Appl. Math. 168: 78-87 (2014) - [j17]Daniel Meister:
Clique-width with an inactive label. Discret. Math. 337: 34-64 (2014) - 2013
- [j16]Daniel Meister:
Two characterisations of the minimal triangulations of permutation graphs. Discret. Math. 313(20): 2262-2280 (2013) - [j15]Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34(3): 576-592 (2013) - [i3]Daniel Meister, Udi Rotics:
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. CoRR abs/1306.2114 (2013) - 2012
- [j14]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. 160(6): 888-901 (2012) - [j13]Daniel Meister, Jan Arne Telle:
Chordal digraphs. Theor. Comput. Sci. 463: 73-83 (2012) - [c19]Tínaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof, Daniel Meister:
Computing Minimum Geodetic Sets of Proper Interval Graphs. LATIN 2012: 279-290 - 2011
- [j12]Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs. Theor. Comput. Sci. 412(12-14): 1275-1297 (2011) - [j11]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412(39): 5466-5486 (2011) - [j10]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-free graphs. Theor. Comput. Sci. 412(50): 7001-7008 (2011) - [c18]Binh-Minh Bui-Xuan, Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition. COCOON 2011: 331-342 - [c17]Pinar Heggernes, Daniel Meister, Udi Rotics:
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR 2011: 233-246 - 2010
- [j9]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Recognizing digraphs of Kelly-width 2. Discret. Appl. Math. 158(7): 741-746 (2010) - [j8]Pinar Heggernes, Daniel Meister:
Hardness and approximation of minimum distortion embeddings. Inf. Process. Lett. 110(8-9): 312-316 (2010) - [j7]Daniel Meister:
Treewidth and minimum fill-in on permutation graphs in linear time. Theor. Comput. Sci. 411(40-42): 3685-3700 (2010) - [c16]Pinar Heggernes, Daniel Meister, Yngve Villanger:
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. ISAAC (2) 2010: 399-409 - [c15]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are There Any Good Digraph Width Measures? IPEC 2010: 135-146 - [c14]Pinar Heggernes, Daniel Meister, Udi Rotics:
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295 - [i2]Robert Ganian, Petr Hlinený, Joachim Kneis, Daniel Meister, Jan Obdrzálek, Peter Rossmanith, Somnath Sikdar:
Are there any good digraph width measures? CoRR abs/1004.1485 (2010)
2000 – 2009
- 2009
- [j6]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. 32: 27-34 (2009) - [j5]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of bipartite permutation graphs in polynomial time. J. Discrete Algorithms 7(4): 533-544 (2009) - [c13]Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh:
Bandwidth on AT-Free Graphs. ISAAC 2009: 573-582 - [c12]Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar Permutation Graphs. IWOCA 2009: 218-229 - [c11]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC 2009: 241-250 - [c10]Daniel Meister, Jan Arne Telle:
Chordal Digraphs. WG 2009: 273-284 - 2008
- [c9]Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle:
Leaf Powers and Their Properties: Using the Trees. ISAAC 2008: 402-413 - [c8]Pinar Heggernes, Dieter Kratsch, Daniel Meister:
Bandwidth of Bipartite Permutation Graphs in Polynomial Time. LATIN 2008: 216-227 - [c7]Pinar Heggernes, Daniel Meister, Andrzej Proskurowski:
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs. SWAT 2008: 331-342 - [c6]Pinar Heggernes, Daniel Meister, Charis Papadopoulos:
Graphs of Linear Clique-Width at Most 3. TAMC 2008: 330-341 - 2007
- [j4]Daniel Meister:
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers. Theory Comput. Syst. 41(2): 257-289 (2007) - [c5]Daniel Meister:
A Characterisation of the Minimal Triangulations of Permutation Graphs. WG 2007: 99-108 - [c4]Daniel Meister, Jan Arne Telle, Martin Vatshelle:
Characterization and Recognition of Digraphs of Bounded Kelly-width. WG 2007: 270-279 - 2006
- [b1]Daniel Meister:
The complexity of membership problems for finite recurrent systems and minimal triangulations. Julius Maximilians University Würzburg, Germany, 2006, pp. 1-245 - [j3]Daniel Meister:
Two characterisations of minimal triangulations of 2K2-free graphs. Discret. Math. 306(24): 3327-3333 (2006) - [j2]Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006) - 2005
- [j1]Daniel Meister:
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Discret. Appl. Math. 146(3): 193-218 (2005) - [c3]Daniel Meister:
Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals. FCT 2005: 80-91 - [c2]Daniel Meister:
Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time. WG 2005: 91-102 - 2003
- [c1]Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258 - [i1]Elmar Böhler, Christian Glaßer, Daniel Meister:
Small Bounded-Error Computations and Completeness. Electron. Colloquium Comput. Complex. TR03 (2003)
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-04 20:58 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:
