Maria J. Serna

From MaRDI portal
Person:1391311

Available identifiers

zbMath Open serna.maria-joseWikidataQ60574340 ScholiaQ60574340MaRDI QIDQ1391311

List of research outcomes

PublicationDate of PublicationType
Social disruption games in signed networks2024-03-21Paper
Efficient parallel algorithms for some tree layout problems2023-12-12Paper
Multidimension: a dimensionality extension of simple games2023-11-03Paper
On the generalized dimension and codimension of simple games2023-07-03Paper
On parallel versus sequential approximation2023-05-08Paper
Web apps and imprecise probabilitites2022-12-01Paper
The neighborhood role in the linear threshold rank on social networks2022-08-05Paper
https://portal.mardi4nfdi.de/entity/Q50910102022-07-21Paper
On weights and quotas for weighted majority voting games2022-03-09Paper
On list \(k\)-coloring convex bipartite graphs2021-12-08Paper
Measuring investment opportunities under uncertainty2020-02-20Paper
https://portal.mardi4nfdi.de/entity/Q57434502019-05-10Paper
Satisfaction and power in unanimous majority influence decision models2018-10-11Paper
Data-compression for Parametrized Counting Problems on Sparse graphs2018-09-21Paper
The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures2017-11-09Paper
On the fixation probability of superstars2017-09-29Paper
An angel-daemon approach to assess the uncertainty in the power of a collectivity to act2017-09-05Paper
https://portal.mardi4nfdi.de/entity/Q29696512017-03-22Paper
Dimension and codimension of simple games2017-02-14Paper
The complexity of measuring power in generalized opinion leader decision models2017-02-13Paper
Network formation for asymmetric players and bilateral contracting2017-01-12Paper
On the stability of generalized second price auctions with budgets2016-09-21Paper
Complexity of metric dimension on planar graphs2016-09-16Paper
Celebrity games2016-09-12Paper
Absorption time of the Moran process2016-09-07Paper
Cooperation through social influence2016-07-26Paper
On the complexity of exchanging2016-04-06Paper
Forms of representation for simple games: sizes, conversions and equivalences2015-12-18Paper
The Robustness of Periodic Orchestrations in Uncertain Evolving Environments2015-11-10Paper
Approximating fixation probabilities in the generalized Moran process2014-11-19Paper
Computational models for networks of tiny artifacts: a survey2014-10-24Paper
On the stability of generalized second price auctions with budgets2014-03-31Paper
Computational aspects of uncertainty profiles and angel-daemon games2014-03-25Paper
On the hardness of game equivalence under local isomorphism2013-06-18Paper
Continuous monitoring in the dynamic sensor field model2013-01-07Paper
On the Complexity of Metric Dimension2012-09-25Paper
On the complexity of problems on simple games2012-04-18Paper
Equilibria problems on games: complexity versus succinctness2012-01-11Paper
The complexity of game isomorphism2011-12-07Paper
The robustness of stability under link and node failures2011-12-07Paper
Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty2011-06-29Paper
The distant-2 chromatic number of random proximity and random geometric graphs2010-04-19Paper
On the proper intervalization of colored caterpillar trees2009-12-18Paper
Vertex fusion under distance constraints2009-11-30Paper
Paradigms for Fast Parallel Approximability2009-10-21Paper
https://portal.mardi4nfdi.de/entity/Q33965572009-09-19Paper
Walkers on the Cycle and the Grid2009-05-27Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
High level communication functionalities for wireless sensor networks2008-11-12Paper
On the Complexity of Game Isomorphism2008-09-17Paper
Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming2008-07-29Paper
On the Complexity of Equilibria Problems in Angel-Daemon Games2008-07-10Paper
Efficient algorithms for counting parameterized list \(H\)-colorings2008-06-26Paper
Vertex fusion under diameter constraints2008-06-05Paper
Bounds on the bisection width for random \(d\)-regular graphs2007-09-18Paper
Communication tree problems2007-09-03Paper
Complexity issues on bounded restrictive \(H\)-coloring2007-06-26Paper
The Proper Interval Colored Graph problem for caterpillar trees2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34248892007-03-05Paper
Algorithms and Computation2006-11-14Paper
Mathematical Foundations of Computer Science 20052006-10-20Paper
The chromatic and clique numbers of random scaled sector graphs2006-03-20Paper
STACS 20052005-12-02Paper
Algorithms – ESA 20042005-08-18Paper
Cutwidth I: A linear time fixed parameter algorithm2005-08-01Paper
Cutwidth II: Algorithms for partial w-trees of bounded degree2005-08-01Paper
The approximability of non-Boolean satisfiability problems and restricted integer programming2005-04-06Paper
https://portal.mardi4nfdi.de/entity/Q46607202005-04-04Paper
The restrictive \(H\)-coloring problem2005-02-22Paper
A Characterization of Universal Stability in the Adversarial Queuing Model2005-02-21Paper
Bounds on the max and min bisection of random cubic and random 4-regular graphs2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44724912004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44404322003-12-17Paper
https://portal.mardi4nfdi.de/entity/Q44272782003-09-18Paper
https://portal.mardi4nfdi.de/entity/Q44263482003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44144912003-07-25Paper
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling2003-05-14Paper
https://portal.mardi4nfdi.de/entity/Q47961892003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q47919502003-02-04Paper
https://portal.mardi4nfdi.de/entity/Q47791532002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45369692002-11-06Paper
Approximating scheduling unrelated parallel machines in parallel2002-09-28Paper
https://portal.mardi4nfdi.de/entity/Q45513682002-09-05Paper
Counting \(H-\)colorings of partial \(k-\)trees2002-07-15Paper
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs2001-10-07Paper
On the parallel approximability of a subclass of quadratic programming.2001-08-20Paper
Approximating Layout Problems on Random Geometric Graphs2001-07-29Paper
The hardness of intervalizing four colored caterpillars2001-07-18Paper
Approximating layout problems on random graphs2001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q47886072001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49449882000-08-03Paper
On the Average Case Complexity of Some P-complete Problems1999-12-13Paper
https://portal.mardi4nfdi.de/entity/Q42634661999-09-22Paper
Paradigms for Fast Parallel Approximability1999-02-28Paper
On the random generation and counting of matchings in dense graphs1998-08-13Paper
Parallel algorithms for the minimum cut and the minimum length tree layout problems1998-07-22Paper
Parallel approximation schemes for problems on planar graphs1997-03-25Paper
https://portal.mardi4nfdi.de/entity/Q48533151996-02-13Paper
Parallel Complexity of the Connected Subgraph Problem1993-09-01Paper
https://portal.mardi4nfdi.de/entity/Q40356621993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40365821993-05-18Paper
Approximating linear programming is log-space complete for P1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843511989-01-01Paper
Asymptotical behaviour of some non-uniform measures1989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Maria J. Serna