Parameterized complexity of distance labeling and uniform channel assignment problems
- 1 October 2018
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 248, 46-55
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Kontakt (LH12095)
- GAUK (1784214)
This publication has 14 references indexed in Scilit:
- Parameterized complexity of coloring problems: Treewidth versus vertex coverTheoretical Computer Science, 2011
- Intractability of Clique-Width ParameterizationsSIAM Journal on Computing, 2010
- The NLC-width and clique-width for powers of graphs of bounded tree-widthDiscrete Applied Mathematics, 2009
- The Channel Assignment Problem with Variable WeightsSIAM Journal on Discrete Mathematics, 2006
- On the Relationship Between Clique-Width and TreewidthSIAM Journal on Computing, 2005
- Fixed-parameter complexity of λ-labelingsDiscrete Applied Mathematics, 2001
- Upper bounds to the clique width of graphsDiscrete Applied Mathematics, 2000
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- An application of simultaneous diophantine approximation in combinatorial optimizationCombinatorica, 1987