Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Daniel
Last name:	Meister
DBLP:	27/3300
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 19 of 19  

Select a publication
Show	Title	Venue	Rating	Date
	Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov, Daniel Meister, Saket Saurabh. Bandwidth on AT-Free Graphs.	Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings 2009	(0)	2009
	Pinar Heggernes, Daniel Meister, Charis Papadopoulos. A Complete Characterisation of the Linear Clique-Width of Path Powers.	Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings 2009	(0)	2009
	Daniel Meister, Jan Arne Telle. Chordal Digraphs.	Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers 2010	(0)	2009
	Tinaz Ekim, Pinar Heggernes, Daniel Meister. Polar Permutation Graphs.	Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers 2009	(0)	2009
	Pinar Heggernes, Daniel Meister, Charis Papadopoulos. A new representation of proper interval graphs with an application to clique-width.	Electronic Notes in Discrete Mathematics 2009, Volume 32	(0)	2009
	Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle. Leaf Powers and Their Properties: Using the Trees.	Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings 2008	(0)	2008
	Pinar Heggernes, Dieter Kratsch, Daniel Meister. Bandwidth of Bipartite Permutation Graphs in Polynomial Time.	LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings 2008	(0)	2008
	Pinar Heggernes, Daniel Meister, Andrzej Proskurowski. Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs.	Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings 2008	(0)	2008
	Pinar Heggernes, Daniel Meister, Charis Papadopoulos. Graphs of Linear Clique-Width at Most 3.	Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings 2008	(0)	2008
	Daniel Meister. A Characterisation of the Minimal Triangulations of Permutation Graphs.	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers 2007	(0)	2007
	Daniel Meister, Jan Arne Telle, Martin Vatshelle. Characterization and Recognition of Digraphs of Bounded Kelly-width.	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers 2007	(0)	2007
	Daniel Meister. Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers.	Theory Comput. Syst. 2007, Volume 41	(0)	2007
	Daniel Meister. Two characterisations of minimal triangulations of 2K	Discrete Mathematics 2006, Volume 306	(0)	2006
	Elmar Böhler, Christian Glaßer, Daniel Meister. Error-bounded probabilistic computations between MA and AM.	J. Comput. Syst. Sci. 2006, Volume 72	(0)	2006
	Daniel Meister. Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.	Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings 2005	(0)	2005
	Daniel Meister. Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.	Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers 2005	(0)	2005
	Daniel Meister. Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs.	Discrete Applied Mathematics 2005, Volume 146	(0)	2005
	Elmar Böhler, Christian Glaßer, Daniel Meister. Error-Bounded Probabilistic Computations between MA and AM.	Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003	(0)	2003
	Elmar Böhler, Christian Glaßer, Daniel Meister. Small Bounded-Error Computations and Completeness	Electronic Colloquium on Computational Complexity (ECCC) 2003, Volume 10	(0)	2003

Your query returned 19 matches in the database.