| Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. | 0 | 0.34 | 2022 |
| Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract). | 0 | 0.34 | 2021 |
| The Maximum Binary Tree Problem | 0 | 0.34 | 2021 |
| Models we Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation | 0 | 0.34 | 2021 |
| Kernelization, Proof Complexity and Social Choice | 0 | 0.34 | 2021 |
| Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. | 0 | 0.34 | 2020 |
| It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities | 0 | 0.34 | 2020 |
| Attacking Power Indices by Manipulating Player Reliability. | 0 | 0.34 | 2019 |
| Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. | 0 | 0.34 | 2018 |
| The language (and series) of Hammersley-type processes. | 0 | 0.34 | 2018 |
| Computing a minimal partition of partial orders into heapable subsets. | 0 | 0.34 | 2017 |
| Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. | 1 | 0.48 | 2016 |
| The Minimum Entropy Submodular Set Cover Problem. | 1 | 0.39 | 2016 |
| Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process. | 2 | 0.53 | 2015 |
| Short Proofs of the Kneser-Lovász Coloring Principle. | 0 | 0.34 | 2015 |
| Learning Cover Context-Free Grammars from Structural Data. | 0 | 0.34 | 2014 |
| Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). | 0 | 0.34 | 2014 |
| Proof Complexity and the Kneser-Lovász Theorem. | 0 | 0.34 | 2014 |
| Adversarial scheduling in discrete models of social dynamics | 1 | 0.37 | 2012 |
| A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games | 2 | 0.38 | 2012 |
| Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós | 0 | 0.34 | 2012 |
| Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem | 0 | 0.34 | 2012 |
| Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs | 0 | 0.34 | 2011 |
| Geometric properties of satisfying assignments of random epsilon-1-in-k SAT. | 0 | 0.34 | 2009 |
| Computational Complexity: A Conceptual Perspective by Oded Goldreich. | 0 | 0.34 | 2009 |
| On Hadwiger's Number of a graph with partial information | 0 | 0.34 | 2009 |
| On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT) | 1 | 0.41 | 2008 |
| Counting preimages of TCP reordering patterns | 3 | 0.45 | 2008 |
| Identifying Almost Sorted Permutations From Tcp Buffer Dynamics | 1 | 0.37 | 2008 |
| Adversarial Scheduling in Evolutionary Game Dynamics | 3 | 0.47 | 2008 |
| Geometric properties of satisfying assignments of random $\epsilon$-1-in-k SAT | 0 | 0.34 | 2008 |
| The Peculiar Phase Structure of Random Graph Bisection | 5 | 0.50 | 2008 |
| Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion | 1 | 0.37 | 2008 |
| A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas | 2 | 0.42 | 2007 |
| Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps | 0 | 0.34 | 2007 |
| Satisfying assignments of Random Boolean CSP: Clusters and Overlaps | 0 | 0.34 | 2007 |
| Semantic compression of TCP traces | 4 | 0.49 | 2006 |
| Packet Reordering Metrics: Some Methodological Considerations | 2 | 0.44 | 2006 |
| Combinatorics of TCP reordering | 4 | 0.50 | 2006 |
| Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems | 1 | 0.35 | 2005 |
| Threshold properties of random boolean constraint satisfaction problems | 5 | 0.43 | 2005 |
| Spines of random constraint satisfaction problems: definition and connection with computational complexity | 5 | 0.49 | 2005 |
| Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity. | 1 | 0.35 | 2004 |
| Phase Transitions and all that | 4 | 0.46 | 2002 |
| Convergence Of The Iterated Prisoner's Dilemma Game | 13 | 0.95 | 2002 |
| The phase transition in random horn satisfiability and its algorithmic implications | 5 | 0.52 | 2002 |
| On the Satisfiability of Random k-Horn Formulae. | 0 | 0.34 | 2001 |
| The phase transition in 1-in-<italic>k</italic> SAT and NAE 3-SAT | 18 | 1.05 | 2001 |
| Review of Parameterized Complexity by R. Downey and M. Fellows | 0 | 0.34 | 2000 |
| Dimension-Dependent behavior in the satisfability of random k-Horn formulae | 1 | 0.38 | 2000 |
