Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 721, doi. 10.1007/s00224-011-9378-8
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2012 AND VI 50 AND IP 4
Results: 9
1
2
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 706, doi. 10.1007/s00224-011-9376-x
- By:
- Publication type:
- Article
3
Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 694, doi. 10.1007/s00224-011-9369-9
- By:
- Publication type:
- Article
4
Parameterizing by the Number of Numbers.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 675, doi. 10.1007/s00224-011-9367-y
- By:
- Publication type:
- Article
5
Structure of Polynomial-Time Approximation.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 641, doi. 10.1007/s00224-011-9366-z
- By:
- Publication type:
- Article
6
Effective Versions of Local Connectivity Properties.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 621, doi. 10.1007/s00224-011-9364-1
- By:
- Publication type:
- Article
7
The Efficiency of Fair Division.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 589, doi. 10.1007/s00224-011-9359-y
- By:
- Publication type:
- Article
8
Cops and Robber Game Without Recharging.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 611, doi. 10.1007/s00224-011-9360-5
- By:
- Publication type:
- Article
9
An Effective Carathéodory Theorem.
- Published in:
- Theory of Computing Systems, 2012, v. 50, n. 4, p. 579, doi. 10.1007/s00224-011-9356-1
- By:
- Publication type:
- Article