Found: 26
Select item for more details and to access through your institution.
On the Core and f-Nucleolus of Flow Games.
- Published in:
- Mathematics of Operations Research, 2009, v. 34, n. 4, p. 981, doi. 10.1287/moor.1090.0405
- By:
- Publication type:
- Article
MATCHING GAMES: THE LEAST CORE AND THE NUCLEOLUS.
- Published in:
- Mathematics of Operations Research, 2003, v. 28, n. 2, p. 294, doi. 10.1287/moor.28.2.294.14477
- By:
- Publication type:
- Article
Using contracted solution graphs for solving reconfiguration problems.
- Published in:
- Acta Informatica, 2019, v. 56, n. 7/8, p. 619, doi. 10.1007/s00236-019-00336-8
- By:
- Publication type:
- Article
Parameterized complexity of three edge contraction problems with degree constraints.
- Published in:
- Acta Informatica, 2014, v. 51, n. 7, p. 473, doi. 10.1007/s00236-014-0204-z
- By:
- Publication type:
- Article
Finding vertex-surjective graph homomorphisms.
- Published in:
- Acta Informatica, 2012, v. 49, n. 6, p. 381, doi. 10.1007/s00236-012-0164-0
- By:
- Publication type:
- Article
Clique‐width: Harnessing the power of atoms.
- Published in:
- Journal of Graph Theory, 2023, v. 104, n. 4, p. 769, doi. 10.1002/jgt.23000
- By:
- Publication type:
- Article
Bounding the mim‐width of hereditary graph classes.
- Published in:
- Journal of Graph Theory, 2022, v. 99, n. 1, p. 117, doi. 10.1002/jgt.22730
- By:
- Publication type:
- Article
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
- Published in:
- Journal of Graph Theory, 2021, v. 98, n. 1, p. 81, doi. 10.1002/jgt.22683
- By:
- Publication type:
- Article
Filling the complexity gaps for colouring planar and bounded degree graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 92, n. 4, p. 377, doi. 10.1002/jgt.22459
- By:
- Publication type:
- Article
Hereditary graph classes: When the complexities of coloring and clique cover coincide.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 3, p. 267, doi. 10.1002/jgt.22431
- By:
- Publication type:
- Article
Bounding the Clique-Width of H-Free Chordal Graphs.
- Published in:
- Journal of Graph Theory, 2017, v. 86, n. 1, p. 42, doi. 10.1002/jgt.22111
- By:
- Publication type:
- Article
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.
- Published in:
- Journal of Graph Theory, 2017, v. 84, n. 4, p. 331, doi. 10.1002/jgt.22028
- By:
- Publication type:
- Article
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 4, p. 340, doi. 10.1002/jgt.22000
- By:
- Publication type:
- Article
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
- Published in:
- Journal of Graph Theory, 2015, v. 79, n. 4, p. 282, doi. 10.1002/jgt.21832
- By:
- Publication type:
- Article
Finding Cactus Roots in Polynomial Time.
- Published in:
- Theory of Computing Systems, 2018, v. 62, n. 6, p. 1409, doi. 10.1007/s00224-017-9825-2
- By:
- Publication type:
- Article
Obtaining Online Ecological Colourings by Generalizing First-Fit.
- Published in:
- Theory of Computing Systems, 2014, v. 54, n. 2, p. 244, doi. 10.1007/s00224-013-9513-9
- By:
- Publication type:
- Article
Comparing Universal Covers in Polynomial Time.
- Published in:
- Theory of Computing Systems, 2010, v. 46, n. 4, p. 620, doi. 10.1007/s00224-009-9200-z
- By:
- Publication type:
- Article
Minimal disconnected cuts in planar graphs.
- Published in:
- Networks, 2016, v. 68, n. 4, p. 250, doi. 10.1002/net.21696
- By:
- Publication type:
- Article
Graph labelings derived from models in distributed computing: A complete complexity classification.
- Published in:
- Networks, 2011, v. 58, n. 3, p. 207, doi. 10.1002/net.20432
- By:
- Publication type:
- Article
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
- Published in:
- Graphs & Combinatorics, 2009, v. 25, n. 4, p. 427, doi. 10.1007/s00373-009-0855-7
- By:
- Publication type:
- Article
Simple games versus weighted voting games: bounding the critical threshold value.
- Published in:
- Social Choice & Welfare, 2020, v. 54, n. 4, p. 609, doi. 10.1007/s00355-019-01221-6
- By:
- Publication type:
- Article
What Graphs are 2-Dot Product Graphs?
- Published in:
- International Journal of Computational Geometry & Applications, 2021, v. 31, n. 1, p. 1, doi. 10.1142/S0218195921500011
- By:
- Publication type:
- Article
Computing solutions for matching games.
- Published in:
- International Journal of Game Theory, 2012, v. 41, n. 1, p. 75, doi. 10.1007/s00182-011-0273-y
- By:
- Publication type:
- Article
Note on the computational complexity of least core concepts for min-cost spanning tree games.
- Published in:
- Mathematical Methods of Operations Research, 2000, v. 52, n. 1, p. 23, doi. 10.1007/s001860000059
- By:
- Publication type:
- Article
The Complexity of Matching Games: A Survey.
- Published in:
- Journal of Artificial Intelligence Research, 2023, v. 77, p. 459, doi. 10.1613/jair.1.14281
- By:
- Publication type:
- Article
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
- Published in:
- Computer Journal, 2016, v. 59, n. 5, p. 650, doi. 10.1093/comjnl/bxv096
- By:
- Publication type:
- Article