The SCEAS System
| |||||||

## Search the dblp DataBase
Daniel Meister:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Daniel Meister
**Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.**[Citation Graph (0, 0)][DBLP] FCT, 2005, pp:80-91 [Conf] - Elmar Böhler, Christian Glaßer, Daniel Meister
**Error-Bounded Probabilistic Computations between MA and AM.**[Citation Graph (0, 0)][DBLP] MFCS, 2003, pp:249-258 [Conf] - Daniel Meister
**Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:91-102 [Conf] - Daniel Meister
**Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:146, n:3, pp:193-218 [Journal] - Daniel Meister
**Two characterisations of minimal triangulations of 2K**[Citation Graph (0, 0)][DBLP]_{2}-free graphs. Discrete Mathematics, 2006, v:306, n:24, pp:3327-3333 [Journal] - Elmar Böhler, Christian Glaßer, Daniel Meister
**Small Bounded-Error Computations and Completeness**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:069, pp:- [Journal] - Elmar Böhler, Christian Glaßer, Daniel Meister
**Error-bounded probabilistic computations between MA and AM.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:6, pp:1043-1076 [Journal] - Daniel Meister
**Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2007, v:41, n:2, pp:257-289 [Journal] **Bandwidth on AT-Free Graphs.**[Citation Graph (, )][DBLP]**Leaf Powers and Their Properties: Using the Trees.**[Citation Graph (, )][DBLP]**Bandwidth of Bipartite Permutation Graphs in Polynomial Time.**[Citation Graph (, )][DBLP]**Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.**[Citation Graph (, )][DBLP]**Graphs of Linear Clique-Width at Most 3.**[Citation Graph (, )][DBLP]**A Complete Characterisation of the Linear Clique-Width of Path Powers.**[Citation Graph (, )][DBLP]**Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.**[Citation Graph (, )][DBLP]**A Characterisation of the Minimal Triangulations of Permutation Graphs.**[Citation Graph (, )][DBLP]**Characterization and Recognition of Digraphs of Bounded Kelly-width.**[Citation Graph (, )][DBLP]**Chordal Digraphs.**[Citation Graph (, )][DBLP]**Polar Permutation Graphs.**[Citation Graph (, )][DBLP]**Are there any good digraph width measures?**[Citation Graph (, )][DBLP]**Recognizing digraphs of Kelly-width 2.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |