Maria J. Serna

Vietnam. J. Comput. Sci., 2020

On List k-Coloring Convex Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Measuring satisfaction and power in influence based decision systems.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2019

Refining the Imprecise Meaning of Non-determinism in the Web by Strategic Games.

[BibT_eX]

[DOI]

Proceedings of the Computational Collective Intelligence - 11th International Conference, 2019

Measuring Investment Opportunities Under Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2019

2018

Centrality measure in social networks based on linear threshold model.

[BibT_eX]

[DOI]

Pablo Gonzalez Cantergiani

Knowl. Based Syst., 2018

Satisfaction and Power in Unanimous Majority Influence Decision Models.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Data-Compression for Parametrized Counting Problems on Sparse Graphs.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Web Apps and Imprecise Probabilitites.

[BibT_eX]

[DOI]

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

2017

Complexity of metric dimension on planar graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

The computational complexity of QoS measures for orchestrations - The computational complexity of QoS measures.

[BibT_eX]

[DOI]

Sergio Leon Gaixas

J. Comb. Optim., 2017

Uncertainty in basic short-term macroeconomic models with angel-daemon games.

[BibT_eX]

[DOI]

Int. J. Data Anal. Tech. Strateg., 2017

The social cost of congestion games by imposing variable delays.

[BibT_eX]

[DOI]

ICT Express, 2017

An Angel-Daemon Approach to Assess the Uncertainty in the Power of a Collectivity to Act.

[BibT_eX]

[DOI]

Giulia Fragnito

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

2016

Randomized Parallel Approximations to Max Flow.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Parallel Algorithms for Two Processors Precedence Constraint Scheduling.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Celebrity games.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Absorption time of the Moran process.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2016

On the Stability of Generalized Second Price Auctions with Budgets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2016

Network Formation for Asymmetric Players and Bilateral Contracting.

[BibT_eX]

[DOI]

Aleix Fernàndez

Theory Comput. Syst., 2016

On the complexity of exchanging.

[BibT_eX]

[DOI]

Martin Olsen

Inf. Process. Lett., 2016

The Complexity of Measuring Power in Generalized Opinion Leader Decision Models.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Dimension and codimension of simple games.

[BibT_eX]

[DOI]

Sascha Kurz

Maria José Serna Iglesias

Martin Olsen

Electron. Notes Discret. Math., 2016

Measuring satisfaction in societies with opinion leaders and mediators.

[BibT_eX]

[DOI]

CoRR, 2016

Uncertainty Analysis of Simple Macroeconomic Models Using Angel-Daemon Games.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Preface.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

Forms of representation for simple games: Sizes, conversions and equivalences.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2015

Cooperation through social influence.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

Stars and Celebrities: A Network Creation Game.

[BibT_eX]

[DOI]

CoRR, 2015

The Robustness of Periodic Orchestrations in Uncertain Evolving Environments.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2015

A Cost-benefit Analysis of Continuous Assessment.

[BibT_eX]

Proceedings of the CSEDU 2015, 2015

Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.

[BibT_eX]

[DOI]

Proceedings of the Computer Supported Education - 7th International Conference, 2015

2014

Computational Aspects of Uncertainty Profiles and Angel-Daemon Games.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Optimizing the Social Cost of Congestion Games by Imposing Variable Delays.

[BibT_eX]

[DOI]

CoRR, 2014

Analysing Web-Orchestrations Under Stress Using Uncertainty Profiles.

[BibT_eX]

[DOI]

Alan Stewart

Comput. J., 2014

Approximating Fixation Probabilities in the Generalized Moran Process.

[BibT_eX]

[DOI]

Algorithmica, 2014

Power Indices of Influence Games and New Centrality Measures for Agent Societies and Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Ambient Intelligence - Software and Applications, 2014

The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android.

[BibT_eX]

[DOI]

Proceedings of the CSEDU 2014, 2014

2013

On the hardness of game equivalence under local isomorphism.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2013

Letter from the Bulletin Editor.

[BibT_eX]

[DOI]

Bull. EATCS, 2013

Power indices of influence games and new centrality measures for social networks.

[BibT_eX]

[DOI]

CoRR, 2013

Star-shaped mediation in influence games.

[BibT_eX]

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

2012

Continuous monitoring in the dynamic sensor field model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Social Influence as a Voting System: a Complexity Analysis of Parameters and Properties

[BibT_eX]

[DOI]

CoRR, 2012

Can Fixation be Guaranteed in the Generalized Moran Process?

[BibT_eX]

[DOI]

CoRR, 2012

On the Complexity of Metric Dimension.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

The complexity of game isomorphism.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

The robustness of stability under link and node failures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

On the complexity of problems on simple games.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2011

Equilibria problems on games: Complexity versus succinctness.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.

[BibT_eX]

[DOI]

Bull. EATCS, 2011

Computational models for networks of tiny artifacts: A survey.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Comput. Sci. Rev., 2011

Orchestrating Unreliable Services: Strategic and Probabilistic Approaches to Reliability.

[BibT_eX]

[DOI]

Alan Stewart

Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

On the Existence of Nash Equilibria in Strategic Search Games.

[BibT_eX]

[DOI]

Amalia Duch

Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Web Services and <i>Incerta Spiriti</i>: A Game Theoretic Approach to Uncertainty.

[BibT_eX]

[DOI]

Alan Stewart

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2011

2010

Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung.

[BibT_eX]

[DOI]

Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

2009

Adversarial Queueing Model for Continuous Network Dynamics.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Preface to special section of selected papers from WEA 2006.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2009

On the proper intervalization of colored caterpillar trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Vertex fusion under distance constraints.

[BibT_eX]

[DOI]

Marc Comas

Eur. J. Comb., 2009

Sensor Field: A Computational Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

Paradigms for fast parallel approximability (Reprint from 1997).

[BibT_eX]

[DOI]

Cambridge international series on parallel computation 8, Cambridge University Press, ISBN: 978-0-521-43170-5, 2009

2008

Randomized Parallel Approximations to Max Flow.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Parallel Algorithms for Two Processors Precedence Constraint Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

High level communication functionalities for wireless sensor networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Walkers on the Cycle and the Grid.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2008

Efficient algorithms for counting parameterized list H-colorings.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

The distant-2 chromatic number of random proximity and random geometric graphs.

[BibT_eX]

[DOI]

Zvi Lotker

Inf. Process. Lett., 2008

The Complexity of Testing Properties of Simple Games

[BibT_eX]

[DOI]

CoRR, 2008

Analysing Orchestrations Using Risk Profiles And Angel-Daemon Games.

[BibT_eX]

[DOI]

Proceedings of the Grid Computing, 2008

On the Complexity of Equilibria Problems in Angel-Daemon Games.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Bounds on the bisection width for random d -regular graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Theor. Comput. Sci., 2007

Communication tree problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Vertex fusion under diameter constraints.

[BibT_eX]

[DOI]

Marc Comas

Electron. Notes Discret. Math., 2007

Complexity issues on bounded restrictive H-coloring.

[BibT_eX]

[DOI]

Discret. Math., 2007

Random Models for Geometric Graphs (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 6th International Workshop, 2007

A Hyper-Heuristic for Scheduling Independent Jobs in Computational Grids.

[BibT_eX]

Juan Antonio Gonzalez

Proceedings of the ICSOFT 2007, 2007

2005

The approximability of non-Boolean satisfiability problems and restricted integer programming.

[BibT_eX]

[DOI]

Luca Trevisan

Theor. Comput. Sci., 2005

The chromatic and clique numbers of random scaled sector graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Adversarial models for priority-based networks.

[BibT_eX]

[DOI]

Networks, 2005

Cutwidth II: Algorithms for partial w-trees of bounded degree.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Cutwidth I: A linear time fixed parameter algorithm.

[BibT_eX]

[DOI]

J. Algorithms, 2005

Pure Nash equilibria in games with a large number of actions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

Parameterized Complexity for Graph Layout Problems.

[BibT_eX]

Bull. EATCS, 2005

The restrictive <i>H</i>-coloring problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Connectivity for Wireless Agents Moving on a Cycle or Grid.

[BibT_eX]

[DOI]

Proceedings of the STACS 2005, 2005

Adversarial Queueing Model for Continuous Network Dynamics.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, .

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

A Characterization of Universal Stability in the Adversarial Queuing Model.

[BibT_eX]

[DOI]

SIAM J. Comput., 2004

The complexity of deciding stability under FFS in the Adversarial Queueing model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Efficient and reliable high level communication in randomly deployed wireless sensor networks.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004

Computation of the Bisection Width for Random d-Regular Graphs.

[BibT_eX]

[DOI]

Nicholas C. Wormald

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

The Impact of Failure Management on the Stability of Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Parallel and Distributed Systems, 2004

Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2004

2003

A Random Graph Model for Optical Networks of Sensors.

[BibT_eX]

[DOI]

IEEE Trans. Mob. Comput., 2003

An efficient deterministic parallel algorithm for two processors precedence constraint scheduling.

[BibT_eX]

[DOI]

Hermann Jung

Theor. Comput. Sci., 2003

Bounds on the max and min bisection of random cubic and random 4-regular graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Evaluation of Basic Protocols for Optical Smart Dust Networks.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

2002

Counting H-colorings of partial k-trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The Parallel Approximability of the False and True Gates Problems for NOR-Circuits.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2002

A survey of graph layout problems.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2002

Approximating Scheduling Unrelated Parallel Machines in Parallel.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2002

The Complexity of Restrictive H-Coloring.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Universal stability of undirected graphs in the adversarial queueing model.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Bisection of Random Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

H-Colorings of Large Degree Graphs.

[BibT_eX]

[DOI]

Jaroslav Nesetril

Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

2001

On the parallel approximability of a subclass of quadratic programming.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Approximating Layout Problems on Random Geometric Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 2001

Approximating layout problems on random graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

The hardness of intervalizing four colored caterpillars.

[BibT_eX]

[DOI]

Discret. Math., 2001

Stability and non-stability of the FIFO protocol.

[BibT_eX]

[DOI]

Dimitrios Koukopoulos

Sotiris E. Nikoletseas

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

(H, C, K)-Coloring: Fast, Easy, and Hard Cases.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

Recent Results on Parameterized H-Colorings.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Faulty Random Geometric Networks.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2000

Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Routing Tree Problems on Random Graphs.

[BibT_eX]

Proceedings of the ICALP Workshops 2000, 2000

1999

On the Average Case Complexity of Some P-complete Problems.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1999

Linear Orderings of Random Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Layout Problems on Lattice Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

On the Random Generation and Counting of Matchings in Dense Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming.

[BibT_eX]

[DOI]

Luca Trevisan

Proceedings of the STACS 98, 1998

Random Geometric Problems on [0, 1]².

[BibT_eX]

[DOI]

Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Approximating Scheduling Problems in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Linear and nonlinear systems: A survey.

[BibT_eX]

[DOI]

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Parallel Approximation Schemes for Problems on Planar Graphs.

[BibT_eX]

[DOI]

Jacobo Torán

Acta Informatica, 1996

1995

Rational Processes and Linear Systems in CSP.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1995

On Parallel versus Sequential Approximation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

Efficient Parallel Algorithms for some Tree Layout Problems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993

Parallel Complexity of the Connected Subgraph Problem.

[BibT_eX]

[DOI]

Lefteris M. Kirousis

SIAM J. Comput., 1993

Parallel Approximation Schemes for problems on planar graphs (Extended Abstract).

[BibT_eX]

[DOI]

Jacobo Torán

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1991

Approximating Linear Programming is Log-Space Complete for P.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Tight RNC Approximations to Max Flow.

[BibT_eX]

[DOI]

Proceedings of the STACS 91, 1991

A Parallel Algorithm for Two Processors Precedence Constraint Scheduling.

[BibT_eX]

[DOI]

Hermann Jung

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989

Asymptotical Behaviour of Some Non-Uniform Measures.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1989

The Approximability of Problems Complete for P.

[BibT_eX]

[DOI]

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

The Parallel Complexity of the Subgraph Connectivity Problem

[BibT_eX]

[DOI]

Lefteris M. Kirousis