The Rank-Width of Edge-Coloured Graphs.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 599, doi. 10.1007/s00224-012-9399-y
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2013 AND VI 52 AND IP 4
Results: 8
1
2
On Rationality of Verbal Subsets in a Group.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 587, doi. 10.1007/s00224-012-9394-3
- By:
- Publication type:
- Article
3
Partition Into Triangles on Bounded Degree Graphs.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 687, doi. 10.1007/s00224-012-9412-5
- By:
- Publication type:
- Article
4
Collusion in Atomic Splittable Routing Games.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 763, doi. 10.1007/s00224-012-9421-4
- By:
- Publication type:
- Article
5
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 729, doi. 10.1007/s00224-012-9420-5
- By:
- Publication type:
- Article
6
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 719, doi. 10.1007/s00224-012-9415-2
- By:
- Publication type:
- Article
7
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 645, doi. 10.1007/s00224-012-9410-7
- By:
- Publication type:
- Article
8
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games.
- Published in:
- Theory of Computing Systems, 2013, v. 52, n. 4, p. 668, doi. 10.1007/s00224-012-9411-6
- By:
- Publication type:
- Article