Counting the Number of Perfect Matchings in K -Free Graphs.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 416, doi. 10.1007/s00224-015-9645-1
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2016 AND VI 59 AND IP 3
Results: 7
1
2
Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 440, doi. 10.1007/s00224-015-9646-0
- By:
- Publication type:
- Article
3
On the Advice Complexity of the k-server Problem Under Sparse Metrics.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 476, doi. 10.1007/s00224-015-9649-x
- By:
- Publication type:
- Article
4
On the Minimization of (Complete) Ordered Binary Decision Diagrams.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 532, doi. 10.1007/s00224-015-9657-x
- By:
- Publication type:
- Article
5
Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 500, doi. 10.1007/s00224-015-9659-8
- By:
- Publication type:
- Article
6
Distinguishing Two Probability Ensembles with One Sample from each Ensemble.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 517, doi. 10.1007/s00224-015-9661-1
- By:
- Publication type:
- Article
7
Network Formation for Asymmetric Players and Bilateral Contracting.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 3, p. 397, doi. 10.1007/s00224-015-9640-6
- By:
- Publication type:
- Article