All Stories

  1. Thresholds as Mechanisms for Weighting Influence in the Linear Threshold Rank
  2. On minimum vertex bisection of random d-regular graphs
  3. The multicolored graph realization problem
  4. Correction: Multidimension: a dimensionality extension of simple games
  5. Author Correction: Multidimension: a dimensionality extension of simple games
  6. Social disruption games in signed networks
  7. A Proposal for an Educational Well-Being Index (EWI) for Undergraduate Course Design
  8. Multidimension: a dimensionality extension of simple games
  9. Take the Challenge: Compute the CO2e emissions of your Programming Course
  10. On the generalized dimension and codimension of simple games
  11. Extremal Coalitions for Influence Games Through Swarm Intelligence-Based Methods
  12. On Weights and Quotas for Weighted Majority Voting Games
  13. Forward and backward linear threshold ranks
  14. On List k-Coloring Convex Bipartite Graphs
  15. Refining Indeterministic Choice: Imprecise Probabilities and Strategic Thinking
  16. The neighborhood role in the linear threshold rank on social networks
  17. Measuring satisfaction and power in influence based decision systems
  18. Refining the Imprecise Meaning of Non-determinism in the Web by Strategic Games
  19. Measuring Investment Opportunities Under Uncertainty
  20. Satisfaction and Power in Unanimous Majority Influence Decision Models
  21. Web Apps and Imprecise Probabilitites
  22. Centrality measure in social networks based on linear threshold model
  23. The social cost of congestion games by imposing variable delays
  24. The computational complexity of QoS measures for orchestrations
  25. Complexity of metric dimension on planar graphs
  26. An Angel-Daemon Approach to Assess the Uncertainty in the Power of a Collectivity to Act
  27. Uncertainty in basic short-term macroeconomic models with angel-daemon games
  28. Dimension and codimension of simple games
  29. Celebrity games
  30. The Complexity of Measuring Power in Generalized Opinion Leader Decision Models
  31. On the complexity of exchanging
  32. Absorption time of the Moran process
  33. Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio
  34. Preface
  35. Forms of representation for simple games: Sizes, conversions and equivalences
  36. On the Stability of Generalized Second Price Auctions with Budgets
  37. Network Formation for Asymmetric Players and Bilateral Contracting
  38. Cooperation through social influence
  39. The Robustness of Periodic Orchestrations in Uncertain Evolving Environments
  40. On the Stability of Generalized Second Price Auctions with Budgets
  41. Power Indices of Influence Games and New Centrality Measures for Agent Societies and Social Networks
  42. Analysing Web-Orchestrations Under Stress Using Uncertainty Profiles
  43. On the fixation probability of superstars
  44. Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
  45. Algorithms and Complexity
  46. Continuous monitoring in the dynamic sensor field model
  47. Approximating Fixation Probabilities in the Generalized Moran Process
  48. On the hardness of game equivalence under local isomorphism
  49. Continuous Monitoring in the Dynamic Sensor Field Model
  50. On the Complexity of Metric Dimension
  51. On the Existence of Nash Equilibria in Strategic Search Games
  52. Orchestrating Unreliable Services: Strategic and Probabilistic Approaches to Reliability
  53. The robustness of stability under link and node failures
  54. Equilibria problems on games: Complexity versus succinctness
  55. The complexity of game isomorphism
  56. On the complexity of problems on simple games
  57. Computational models for networks of tiny artifacts: A survey
  58. Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty
  59. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  60. Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung
  61. Vertex fusion under distance constraints
  62. On the proper intervalization of colored caterpillar trees
  63. Sensor Field: A Computational Model
  64. High level communication functionalities for wireless sensor networks
  65. Efficient algorithms for counting parameterized list H-colorings
  66. The distant-2 chromatic number of random proximity and random geometric graphs
  67. Walkers on the Cycle and the Grid
  68. Adversarial Queueing Model for Continuous Network Dynamics
  69. Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
  70. Bounds on the bisection width for random d -regular graphs
  71. Communication tree problems
  72. Vertex fusion under diameter constraints
  73. Complexity issues on bounded restrictive H-coloring
  74. The chromatic and clique numbers of random scaled sector graphs
  75. Cutwidth I: A linear time fixed parameter algorithm
  76. Cutwidth II: Algorithms for partial w-trees of bounded degree
  77. The approximability of non-Boolean satisfiability problems and restricted integer programming
  78. The restrictive H-coloring problem
  79. Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees,
  80. Adversarial models for priority-based networks
  81. The Proper Interval Colored Graph problem for caterpillar trees
  82. The complexity of deciding stability under FFS in the Adversarial Queueing model
  83. A Characterization of Universal Stability in the Adversarial Queuing Model
  84. Bounds on the max and min bisection of random cubic and random 4-regular graphs
  85. A random graph model for optical networks of sensors
  86. An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
  87. A survey of graph layout problems
  88. Counting H-colorings of partial k-trees
  89. Bisection of Random Cubic Graphs
  90. H-Colorings of Large Degree Graphs
  91. The Complexity of Restrictive H-Coloring
  92. Approximating layout problems on random graphs
  93. On the parallel approximability of a subclass of quadratic programming
  94. The hardness of intervalizing four colored caterpillars
  95. Approximating Layout Problems on Random Geometric Graphs
  96. Els Límits de la computació : indecidibilitat i NP-completesa
  97. (H,C,K) -Coloring: Fast, Easy, and Hard Cases
  98. A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
  99. Counting H-Colorings of Partial k-Trees
  100. Towards Formally Refining BSP Barriers into Explicit Two — Sided Communications
  101. Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
  102. Layout Problems on Lattice Graphs
  103. Algorítmica per a paral·lelisme massiu : introducció
  104. Linear Orderings of Random Geometric Graphs
  105. Randomization and Approximation Techniques in Computer Science
  106. Random Geometric Problems on [0, 1]2
  107. The (parallel) approximability of non-boolean satisfiability problems and restricted integer programming
  108. A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
  109. Approximating scheduling problems in parallel
  110. Algorithms — ESA '96
  111. Efficient parallel algorithms for some tree layout problems
  112. RATIONAL PROCESSES AND LINEAR SYSTEMS IN GSP
  113. On parallel versus sequential approximation
  114. Parallel approximation schemes for problems on planar graphs
  115. Approximating linear programming is log-space complete for P
  116. A parallel algorithm for two processors precedence constraint scheduling
  117. The approximability of problems complete for P
  118. On the Complexity of Equilibria Problems in Angel-Daemon Games
  119. On the Complexity of Game Isomorphism
  120. Tight RNC approximations to Max Flow