| Publication | Date of Publication | Type |
|---|
| On minimum vertex bisection of random \(d\)-regular graphs | 2024-07-01 | Paper |
| The multicolored graph realization problem | 2024-06-20 | Paper |
| Social disruption games in signed networks | 2024-03-21 | Paper |
| Efficient parallel algorithms for some tree layout problems | 2023-12-12 | Paper |
| Multidimension: a dimensionality extension of simple games | 2023-11-03 | Paper |
| On the generalized dimension and codimension of simple games | 2023-07-03 | Paper |
| On parallel versus sequential approximation | 2023-05-08 | Paper |
| Web apps and imprecise probabilitites | 2022-12-01 | Paper |
| The neighborhood role in the linear threshold rank on social networks | 2022-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091010 | 2022-07-21 | Paper |
| On weights and quotas for weighted majority voting 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 |
| https://portal.mardi4nfdi.de/entity/Q5743450 | 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 | 2017-11-09 | Paper |
| On the fixation probability of superstars | 2017-09-29 | Paper |
| An angel-daemon approach to assess the uncertainty in the power of a collectivity to act | 2017-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969651 | 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 | 2017-01-12 | Paper |
| On the stability of generalized second price auctions with budgets | 2016-09-21 | Paper |
| Complexity of metric dimension on planar graphs | 2016-09-16 | Paper |
| Celebrity games | 2016-09-12 | Paper |
| Absorption time of the Moran process | 2016-09-07 | Paper |
| Cooperation through social influence | 2016-07-26 | Paper |
| On the complexity of exchanging | 2016-04-06 | Paper |
| Forms of representation for simple games: sizes, conversions and equivalences | 2015-12-18 | Paper |
| The Robustness of Periodic Orchestrations in Uncertain Evolving Environments | 2015-11-10 | Paper |
| Approximating fixation probabilities in the generalized Moran process | 2014-11-19 | Paper |
| Computational models for networks of tiny artifacts: a survey | 2014-10-24 | Paper |
| On the stability of generalized second price auctions with budgets | 2014-03-31 | Paper |
| Computational aspects of uncertainty profiles and angel-daemon games | 2014-03-25 | Paper |
| On the hardness of game equivalence under local isomorphism | 2013-06-18 | Paper |
| Continuous monitoring in the dynamic sensor field model | 2013-01-07 | Paper |
| On the Complexity of Metric Dimension | 2012-09-25 | Paper |
| On the complexity of problems on simple games | 2012-04-18 | Paper |
| Equilibria problems on games: complexity versus succinctness | 2012-01-11 | Paper |
| The complexity of game isomorphism | 2011-12-07 | Paper |
| The robustness of stability under link and node failures | 2011-12-07 | Paper |
| Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty | 2011-06-29 | Paper |
| The distant-2 chromatic number of random proximity and random geometric graphs | 2010-04-19 | Paper |
| On the proper intervalization of colored caterpillar trees | 2009-12-18 | Paper |
| Vertex fusion under distance constraints | 2009-11-30 | Paper |
| Paradigms for Fast Parallel Approximability | 2009-10-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396557 | 2009-09-19 | Paper |
| Walkers on the Cycle and the Grid | 2009-05-27 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| High level communication functionalities for wireless sensor networks | 2008-11-12 | Paper |
| On the Complexity of Game Isomorphism | 2008-09-17 | Paper |
| Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming | 2008-07-29 | Paper |
| On the Complexity of Equilibria Problems in Angel-Daemon Games | 2008-07-10 | Paper |
| Efficient algorithms for counting parameterized list \(H\)-colorings | 2008-06-26 | Paper |
| Vertex fusion under diameter constraints | 2008-06-05 | Paper |
| Bounds on the bisection width for random \(d\)-regular graphs | 2007-09-18 | Paper |
| Communication tree problems | 2007-09-03 | Paper |
| Complexity issues on bounded restrictive \(H\)-coloring | 2007-06-26 | Paper |
| The Proper Interval Colored Graph problem for caterpillar trees | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424889 | 2007-03-05 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The chromatic and clique numbers of random scaled sector graphs | 2006-03-20 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Cutwidth I: A linear time fixed parameter algorithm | 2005-08-01 | Paper |
| Cutwidth II: Algorithms for partial w-trees of bounded degree | 2005-08-01 | Paper |
| The approximability of non-Boolean satisfiability problems and restricted integer programming | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660720 | 2005-04-04 | Paper |
| The restrictive \(H\)-coloring problem | 2005-02-22 | Paper |
| A Characterization of Universal Stability in the Adversarial Queuing Model | 2005-02-21 | Paper |
| Bounds on the max and min bisection of random cubic and random 4-regular graphs | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472491 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440432 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427278 | 2003-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426348 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414491 | 2003-07-25 | Paper |
| An efficient deterministic parallel algorithm for two processors precedence constraint scheduling | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796189 | 2003-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791950 | 2003-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779153 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536969 | 2002-11-06 | Paper |
| Approximating scheduling unrelated parallel machines in parallel | 2002-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551368 | 2002-09-05 | Paper |
| Counting \(H-\)colorings of partial \(k-\)trees | 2002-07-15 | Paper |
| Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs | 2001-10-07 | Paper |
| On the parallel approximability of a subclass of quadratic programming. | 2001-08-20 | Paper |
| Approximating Layout Problems on Random Geometric Graphs | 2001-07-29 | Paper |
| The hardness of intervalizing four colored caterpillars | 2001-07-18 | Paper |
| Approximating layout problems on random graphs | 2001-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788607 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944988 | 2000-08-03 | Paper |
| On the Average Case Complexity of Some P-complete Problems | 1999-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263466 | 1999-09-22 | Paper |
| Paradigms for Fast Parallel Approximability | 1999-02-28 | Paper |
| On the random generation and counting of matchings in dense graphs | 1998-08-13 | Paper |
| Parallel algorithms for the minimum cut and the minimum length tree layout problems | 1998-07-22 | Paper |
| Parallel approximation schemes for problems on planar graphs | 1997-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853315 | 1996-02-13 | Paper |
| Parallel Complexity of the Connected Subgraph Problem | 1993-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035662 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036582 | 1993-05-18 | Paper |
| Approximating linear programming is log-space complete for P | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484351 | 1989-01-01 | Paper |
| Asymptotical behaviour of some non-uniform measures | 1989-01-01 | Paper |
