Publications :: Search

Show author

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

Author information
First name:	Jirí
Last name:	Fiala
DBLP:	83/2527
Rating:	(not rated yet)
Bookmark:

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

Show item 1 to 25 of 54  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski. Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs	CoRR 2013, Volume 0	(0)	2013
	Journal article Jirí Fiala, Marcin Jakub Kaminski, Bernard Lidický, Daniël Paulusma. The k-in-a-Path Problem for Claw-free Graphs.	Algorithmica 2012, Volume 62	(0)	2012
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl, Bernard Lidický, Daniël Paulusma. Distance three labelings of trees.	Discrete Applied Mathematics 2012, Volume 160	(0)	2012
	Journal article Jirí Fiala, Marcin Jakub Kaminski, Daniël Paulusma. Detecting induced star-like minors in polynomial time.	J. Discrete Algorithms 2012, Volume 17	(0)	2012
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Parameterized complexity of coloring problems: Treewidth versus vertex cover.	Theor. Comput. Sci. 2011, Volume 412	(0)	2011
	Conference paper Jirí Fiala, Marcin Jakub Kaminski, Bernard Lidický, Daniël Paulusma. The k-in-a-path Problem for Claw-free Graphs.	27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France 2010	(0)	2010
	Journal article Jan Ekstein, Jirí Fiala, Premysl Holub, Bernard Lidický. The packing chromatic number of the square lattice is at least 12	CoRR 2010, Volume 0	(0)	2010
	Conference paper Jirí Fiala, Daniël Paulusma. Comparing Universal Covers in Polynomial Time.	Theory Comput. Syst. 2010, Volume 46	(0)	2010
	Conference paper Jirí Fiala, Petr A. Golovach. Complexity of the packing coloring problem for trees.	Discrete Applied Mathematics 2010, Volume 158	(0)	2010
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover.	Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings 2009	(0)	2009
	Conference paper Jirí Fiala, Marcin Jakub Kaminski, Bernard Lidický, Daniël Paulusma. The k-in-a-path problem for claw-free graphs	CoRR 2009, Volume 0	(0)	2009
	Conference paper Jirí Fiala, Sandi Klavzar, Bernard Lidický. The packing chromatic number of infinite product graphs.	Eur. J. Comb. 2009, Volume 30	(0)	2009
	Conference paper Jirí Fiala, Daniël Paulusma. Comparing Universal Covers in Polynomial Time.	Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings 2008	(0)	2008
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract).	Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games 2008	(0)	2008
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Distance Constrained Labelings of Trees.	Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings 2008	(0)	2008
	Conference paper Jirí Fiala, Petr A. Golovach. Complexity of the Packing Coloring Problem for Trees.	Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers 2008	(0)	2008
	Conference paper Jirí Fiala, Jan Kratochvíl, Attila Pór. On the computational complexity of partial covers of Theta graphs.	Discrete Applied Mathematics 2008, Volume 156	(0)	2008
	Conference paper Jirí Fiala, Daniël Paulusma, Jan Arne Telle. Locally constrained graph homomorphisms and equitable partitions.	Eur. J. Comb. 2008, Volume 29	(0)	2008
	Conference paper José Soto, Jirí Fiala. Block transitivity and degree matrices.	Eur. J. Comb. 2008, Volume 29	(0)	2008
	Conference paper Jirí Fiala, Jan Kratochvíl. Locally constrained graph homomorphisms - structure, complexity, and applications.	Computer Science Review 2008, Volume 2	(0)	2008
	Conference paper Jan Kratochvíl, Josep Díaz, Jirí Fiala. Editorial.	Discrete Applied Mathematics 2007, Volume 155	(0)	2007
	Conference paper Jirí Fiala, José Soto. Block transitivity and degree matrices: (Extended abstract).	Electronic Notes in Discrete Mathematics 2007, Volume 28	(0)	2007
	Conference paper Jirí Fiala, Jan Kratochvíl. Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.	Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers 2006	(0)	2006
	Conference paper Jirí Fiala, Jana Maxová. Cantor-Bernstein type theorem for locally constrained graph homomorphisms.	Eur. J. Comb. 2006, Volume 27	(0)	2006
	Conference paper Jirí Fiala, Petr A. Golovach, Jan Kratochvíl. Distance Constrained Labelings of Graphs of Bounded Treewidth.	Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings 2005	(0)	2005

Show item 1 to 25 of 54  

Your query returned 54 matches in the database.