The following pages link to Jiří Fiala (Q190515):
Displaying 40 items.
- New lower bounds on the weighted chromatic number of a graph (Q4669427) (← links)
- Partial covers of graphs (Q4786790) (← links)
- (Q4796709) (← links)
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769) (← links)
- (Q4825539) (← links)
- (Q4842442) (← links)
- Dichotomy of the H-Quasi-Cover Problem (Q4928495) (← links)
- (Q4944992) (← links)
- On the Edge-Length Ratio of 2-Trees (Q5014107) (← links)
- On Edge-Length Ratios of Partial 2-Trees (Q5072225) (← links)
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (Q5167767) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- Complexity of the Packing Coloring Problem for Trees (Q5302050) (← links)
- (Q5337314) (← links)
- Theoretical Computer Science (Q5395075) (← links)
- (Q5445048) (← links)
- Independence and Coloring Problems on Intersection Graphs of Disks (Q5450806) (← links)
- A Brooks-Type Theorem for the Generalized List T-Coloring (Q5470781) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492870) (← links)
- (Q5513155) (← links)
- A note on the integrals involving product of Hermite's polynomials (Q5513156) (← links)
- Compact sets in locally convex spaces (Q5521904) (← links)
- Zeroes of orthogonal polynomials by QD-algorithm (Q5589683) (← links)
- Interpolation with prescribed values of derivatives instead of function values (Q5630519) (← links)
- Axiomatic theory of investment evaluating (Q5635235) (← links)
- (Q5680921) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710822) (← links)
- Automata, Languages and Programming (Q5716789) (← links)
- (Q5747399) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897549) (← links)
- Block transitivity and degree matrices (Q5899391) (← links)
- Block transitivity and degree matrices (Q5900032) (← links)
- Computational complexity of covering cyclic graphs (Q5937921) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- (Q6168434) (← links)
- List covering of regular multigraphs with semi-edges (Q6396064) (← links)
- Computational Complexity of Covering Disconnected Multigraphs (Q6439886) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q6621198) (← links)
- Computational complexity of covering disconnected multigraphs (Q6633538) (← links)
