Polynomial Kernelization for Removing Induced Claws and Diamonds.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 615, doi. 10.1007/s00224-016-9689-x
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2017 AND VI 60 AND IP 4
Results: 8
1
2
Multi-processor Search and Scheduling Problems with Setup Cost.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 637, doi. 10.1007/s00224-016-9691-3
- By:
- Publication type:
- Article
3
On the Generic Undecidability of the Halting Problem for Normalized Turing Machines.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 671, doi. 10.1007/s00224-016-9698-9
- By:
- Publication type:
- Article
4
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 677, doi. 10.1007/s00224-016-9699-8
- By:
- Publication type:
- Article
5
Paradigms for Parameterized Enumeration.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 737, doi. 10.1007/s00224-016-9702-4
- By:
- Publication type:
- Article
6
The Complexity of Model Checking Multi-Stack Systems.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 695, doi. 10.1007/s00224-016-9700-6
- By:
- Publication type:
- Article
7
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 581, doi. 10.1007/s00224-016-9686-0
- By:
- Publication type:
- Article
8
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 759, doi. 10.1007/s00224-016-9705-1
- By:
- Publication type:
- Article