| Publication | Date of Publication | Type |
|---|
On minimum vertex bisection of random \(d\)-regular graphs
Journal of Computer and System Sciences | 2024-07-01 | Paper |
The multicolored graph realization problem
Discrete Applied Mathematics | 2024-06-20 | Paper |
Social disruption games in signed networks
Communications in Nonlinear Science and Numerical Simulation | 2024-03-21 | Paper |
Efficient parallel algorithms for some tree layout problems
Lecture Notes in Computer Science | 2023-12-12 | Paper |
Multidimension: a dimensionality extension of simple games
Computational and Applied Mathematics | 2023-11-03 | Paper |
On the generalized dimension and codimension of simple games
European Journal of Operational Research | 2023-07-03 | Paper |
On parallel versus sequential approximation
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Web apps and imprecise probabilitites
| 2022-12-01 | Paper |
The neighborhood role in the linear threshold rank on social networks
Physica A | 2022-08-05 | Paper |
Data-compression for parametrized counting problems on sparse graphs
| 2022-07-21 | Paper |
On weights and quotas for weighted majority voting games
Games | 2022-03-09 | Paper |
On list \(k\)-coloring convex bipartite graphs
| 2021-12-08 | Paper |
Measuring investment opportunities under uncertainty
| 2020-02-20 | Paper |
Approximating fixation probabilities in the generalized Moran process
| 2019-05-10 | Paper |
Satisfaction and power in unanimous majority influence decision models
| 2018-10-11 | Paper |
Data-compression for Parametrized Counting Problems on Sparse graphs
| 2018-09-21 | Paper |
The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
On the fixation probability of superstars
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
An angel-daemon approach to assess the uncertainty in the power of a collectivity to act
| 2017-09-05 | Paper |
Absorption time of the Moran process
| 2017-03-22 | Paper |
Dimension and codimension of simple games
| 2017-02-14 | Paper |
The complexity of measuring power in generalized opinion leader decision models
| 2017-02-13 | Paper |
Network formation for asymmetric players and bilateral contracting
Theory of Computing Systems | 2017-01-12 | Paper |
On the stability of generalized second price auctions with budgets
Theory of Computing Systems | 2016-09-21 | Paper |
Complexity of metric dimension on planar graphs
Journal of Computer and System Sciences | 2016-09-16 | Paper |
Celebrity games
Theoretical Computer Science | 2016-09-12 | Paper |
Absorption time of the Moran process
Random Structures & Algorithms | 2016-09-07 | Paper |
Cooperation through social influence
European Journal of Operational Research | 2016-07-26 | Paper |
On the complexity of exchanging
Information Processing Letters | 2016-04-06 | Paper |
Forms of representation for simple games: sizes, conversions and equivalences
Mathematical Social Sciences | 2015-12-18 | Paper |
The robustness of periodic orchestrations in uncertain evolving environments
Lecture Notes in Computer Science | 2015-11-10 | Paper |
Approximating fixation probabilities in the generalized Moran process
Algorithmica | 2014-11-19 | Paper |
Computational models for networks of tiny artifacts: a survey
Computer Science Review | 2014-10-24 | Paper |
On the stability of generalized second price auctions with budgets
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Computational aspects of uncertainty profiles and angel-daemon games
Theory of Computing Systems | 2014-03-25 | Paper |
On the hardness of game equivalence under local isomorphism
RAIRO - Theoretical Informatics and Applications | 2013-06-18 | Paper |
Continuous monitoring in the dynamic sensor field model
Theoretical Computer Science | 2013-01-07 | Paper |
On the Complexity of Metric Dimension
Algorithms – ESA 2012 | 2012-09-25 | Paper |
On the complexity of problems on simple games
RAIRO - Operations Research | 2012-04-18 | Paper |
Equilibria problems on games: complexity versus succinctness
Journal of Computer and System Sciences | 2012-01-11 | Paper |
The complexity of game isomorphism
Theoretical Computer Science | 2011-12-07 | Paper |
The robustness of stability under link and node failures
Theoretical Computer Science | 2011-12-07 | Paper |
Web services and \textit{incerta spiriti}: a game theoretic approach to uncertainty
Lecture Notes in Computer Science | 2011-06-29 | Paper |
The distant-2 chromatic number of random proximity and random geometric graphs
Information Processing Letters | 2010-04-19 | Paper |
On the proper intervalization of colored caterpillar trees
RAIRO - Theoretical Informatics and Applications | 2009-12-18 | Paper |
Vertex fusion under distance constraints
European Journal of Combinatorics | 2009-11-30 | Paper |
Paradigms for Fast Parallel Approximability
| 2009-10-21 | Paper |
scientific article; zbMATH DE number 5605062 (Why is no real title available?)
| 2009-09-19 | Paper |
Walkers on the Cycle and the Grid
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
High level communication functionalities for wireless sensor networks
Theoretical Computer Science | 2008-11-12 | Paper |
On the Complexity of Game Isomorphism
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
RAIRO - Theoretical Informatics and Applications | 2008-07-29 | Paper |
On the Complexity of Equilibria Problems in Angel-Daemon Games
Lecture Notes in Computer Science | 2008-07-10 | Paper |
Efficient algorithms for counting parameterized list \(H\)-colorings
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Vertex fusion under diameter constraints
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Bounds on the bisection width for random \(d\)-regular graphs
Theoretical Computer Science | 2007-09-18 | Paper |
Communication tree problems
Theoretical Computer Science | 2007-09-03 | Paper |
Complexity issues on bounded restrictive \(H\)-coloring
Discrete Mathematics | 2007-06-26 | Paper |
The Proper Interval Colored Graph problem for caterpillar trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Efficient algorithms for parameterized \(H\)-colorings
| 2007-03-05 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The chromatic and clique numbers of random scaled sector graphs
Theoretical Computer Science | 2006-03-20 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms | 2005-08-01 | Paper |
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms | 2005-08-01 | Paper |
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science | 2005-04-06 | Paper |
scientific article; zbMATH DE number 2151250 (Why is no real title available?)
| 2005-04-04 | Paper |
The restrictive \(H\)-coloring problem
Discrete Applied Mathematics | 2005-02-22 | Paper |
A Characterization of Universal Stability in the Adversarial Queuing Model
SIAM Journal on Computing | 2005-02-21 | Paper |
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 2080246 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2019629 (Why is no real title available?)
| 2003-12-17 | Paper |
scientific article; zbMATH DE number 1983292 (Why is no real title available?)
| 2003-09-18 | Paper |
scientific article; zbMATH DE number 1982179 (Why is no real title available?)
| 2003-09-16 | Paper |
scientific article; zbMATH DE number 1953088 (Why is no real title available?)
| 2003-07-25 | Paper |
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
Theoretical Computer Science | 2003-05-14 | Paper |
scientific article; zbMATH DE number 1875430 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1863308 (Why is no real title available?)
| 2003-02-04 | Paper |
scientific article; zbMATH DE number 1834657 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1760037 (Why is no real title available?)
| 2002-11-06 | Paper |
Approximating scheduling unrelated parallel machines in parallel
Computational Optimization and Applications | 2002-09-28 | Paper |
scientific article; zbMATH DE number 1796974 (Why is no real title available?)
| 2002-09-05 | Paper |
Counting \(H-\)colorings of partial \(k-\)trees
Theoretical Computer Science | 2002-07-15 | Paper |
Convergence theorems for some layout measures on random lattice and random geometric graphs
Combinatorics, Probability and Computing | 2001-10-07 | Paper |
On the parallel approximability of a subclass of quadratic programming.
Theoretical Computer Science | 2001-08-20 | Paper |
Approximating layout problems on random geometric graphs
Journal of Algorithms | 2001-07-29 | Paper |
The hardness of intervalizing four colored caterpillars
Discrete Mathematics | 2001-07-18 | Paper |
Approximating layout problems on random graphs
Discrete Mathematics | 2001-07-18 | Paper |
scientific article; zbMATH DE number 1857648 (Why is no real title available?)
| 2001-01-01 | Paper |
scientific article; zbMATH DE number 1420916 (Why is no real title available?)
| 2000-08-03 | Paper |
On the Average Case Complexity of Some P-complete Problems
RAIRO - Theoretical Informatics and Applications | 1999-12-13 | Paper |
scientific article; zbMATH DE number 1341904 (Why is no real title available?)
| 1999-09-22 | Paper |
Paradigms for Fast Parallel Approximability
| 1999-02-28 | Paper |
On the random generation and counting of matchings in dense graphs
Theoretical Computer Science | 1998-08-13 | Paper |
Parallel algorithms for the minimum cut and the minimum length tree layout problems
Theoretical Computer Science | 1998-07-22 | Paper |
Parallel approximation schemes for problems on planar graphs
Acta Informatica | 1997-03-25 | Paper |
scientific article; zbMATH DE number 810103 (Why is no real title available?)
| 1996-02-13 | Paper |
Parallel Complexity of the Connected Subgraph Problem
SIAM Journal on Computing | 1993-09-01 | Paper |
scientific article; zbMATH DE number 176752 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176498 (Why is no real title available?)
| 1993-05-18 | Paper |
Approximating linear programming is log-space complete for P
Information Processing Letters | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4155879 (Why is no real title available?)
| 1989-01-01 | Paper |
Asymptotical behaviour of some non-uniform measures
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
