Maria Serna

Q: What Schools Are Affiliated With Maria Serna

Maria Serna is affiliated with the following schools: University of California, Berkeley, Stanford University, Polytechnic University of Catalonia

Maria Serna's AcademicInfluence.com Rankings

Maria Serna

Computer Science

#10870

World Rank

#11458

Historical Rank

Computational Linguistics

#3019

World Rank

#3054

Historical Rank

Machine Learning

#5465

World Rank

#5537

Historical Rank

Artificial Intelligence

#5915

World Rank

#6005

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Maria Serna's Degrees

PhD Computer Science Stanford University
Masters Computer Science University of California, Berkeley
Bachelors Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Maria Serna Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Maria José Serna Iglesias is a Spanish computer scientist and mathematician whose research includes work on parallel approximation, on algorithms for cutwidth and linear layout of graphs, on algorithmic game theory, and on adversarial queueing networks.

(See a Problem?)

Maria Serna's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A survey of graph layout problems (2002) (645)
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (2004) (240)
Cutwidth I: A linear time fixed parameter algorithm (2005) (77)
Randomization and Approximation Techniques in Computer Science (2002) (72)
Approximating Layout Problems on Random Geometric Graphs (2001) (66)
A Random Graph Model for Optical Networks of Sensors (2003) (64)
On the Complexity of Metric Dimension (2011) (62)
Approximating Fixation Probabilities in the Generalized Moran Process (2011) (59)
Counting H-colorings of partial k-trees (2001) (57)
Cutwidth II: Algorithms for partial w-trees of bounded degree (2005) (51)
Centrality measure in social networks based on linear threshold model (2018) (47)
A Characterization of Universal Stability in the Adversarial Queuing Model (2004) (45)
Approximating Linear Programming is Log-Space Complete for P (1991) (45)
Stability and non-stability of the FIFO protocol (2001) (45)
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs (2000) (43)
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width (2000) (40)
Cooperation through social influence (2015) (39)
Adversarial models for priority‐based networks (2003) (38)
Algorithms — ESA '96 (1996) (36)
Random Geometric Problems on [0, 1]² (1998) (35)
Bounds on the bisection width for random d -regular graphs (2007) (33)
On the fixation probability of superstars (2012) (32)
The complexity of game isomorphism (2011) (31)
Absorption time of the Moran process (2013) (29)
Pure Nash Equilibria in Games with a Large Number of Actions (2005) (26)
Parameterized Complexity for Graph Layout Problems (2005) (24)
Bounds on the max and min bisection of random cubic and random 4-regular graphs (2003) (24)
Adversarial Queueing Model for Continuous Network Dynamics (2005) (23)
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming (1998) (22)
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth (2001) (22)
(H, C, K)-Coloring: Fast, Easy, and Hard Cases (2001) (20)
Analysing Web-Orchestrations Under Stress Using Uncertainty Profiles (2014) (19)
Complexity of metric dimension on planar graphs (2011) (19)
The parallel complexity of the subgraph connectivity problem (1989) (18)
Paradigms for Fast Parallel Approximability (1997) (18)
Efficient and reliable high level communication in randomly deployed wireless sensor networks (2004) (18)
Approximating layout problems on random graphs (2001) (17)
On the complexity of problems on simple games (2011) (16)
Parallel Complexity of the Connected Subgraph Problem (1993) (16)
Faulty Random Geometric Networks (2000) (15)
The Approximability of Problems Complete for P (1989) (15)
Power Indices of Influence Games and New Centrality Measures for Agent Societies and Social Networks (2014) (14)
The restrictive H-coloring problem (2005) (14)
The impact of failure management on the stability of communication networks (2004) (14)
Analysing Orchestrations Using Risk Profiles And Angel-Daemon Games (2008) (14)
Parallel Approximation Schemes for problems on planar graphs (1996) (13)
Computation of the Bisection Width for Random d-Regular Graphs (2004) (13)
The robustness of stability under link and node failures (2011) (12)
The hardness of intervalizing four colored caterpillars (2001) (12)
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems (1997) (12)
A Hyper-Heuristic for Scheduling Independent Jobs in Computational Grids (2018) (11)
Evaluation of Basic Protocols for Optical Smart Dust Networks (2003) (11)
The chromatic and clique numbers of random scaled sector graphs (2005) (11)
Walkers on the Cycle and the Grid (2008) (11)
On the Complexity of Game Isomorphism (2007) (11)
Recent Results on Parameterized H-Colorings (2001) (11)
Universal stability of undirected graphs in the adversarial queueing model (2002) (10)
Forms of representation for simple games: Sizes, conversions and equivalences (2015) (10)
The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract) (2004) (10)
Complexity issues on bounded restrictive H-coloring (2007) (9)
Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, (2005) (9)
Parallel Algorithms for Two Processors Precedence Constraint Scheduling (1991) (9)
Layout Problems on Lattice Graphs (1999) (9)
A Guide to Concentration Bounds (2001) (9)
Sensor Field: A Computational Model (2009) (9)
Linear Orderings of Random Geometric Graphs (1999) (9)
Power indices of influence games and new centrality measures for social networks (2013) (8)
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings (2004) (8)
Measuring satisfaction and power in influence based decision systems (2019) (8)
Efficient algorithms for counting parameterized list H-colorings (2008) (7)
H-Colorings of Large Degree Graphs (2002) (7)
Approximating Scheduling Unrelated Parallel Machines in Parallel (2002) (7)
Equilibria problems on games: Complexity versus succinctness (2011) (7)
Celebrity games (2016) (7)
Computational models for networks of tiny artifacts: A survey (2011) (7)
High level communication functionalities for wireless sensor networks (2008) (7)
The approximability of non-Boolean satisfiability problems and restricted integer programming (2005) (7)
The Complexity of Testing Properties of Simple Games (2008) (7)
The neighborhood role in the linear threshold rank on social networks (2019) (6)
The Robustness of Periodic Orchestrations in Uncertain Evolving Environments (2015) (6)
Star-shaped mediation in influence games (2013) (6)
Random scaled sector graphs (2002) (6)
The Complexity of Restrictive H-Coloring (2002) (6)
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games (2013) (6)
Tight RNC Approximations to Max Flow (1991) (6)
Data-compression for Parametrized Counting Problems on Sparse graphs (2018) (5)
On the complexity of exchanging (2015) (5)
The distant-2 chromatic number of random proximity and random geometric graphs (2008) (5)
Social Influence as a Voting System: a Complexity Analysis of Parameters and Properties (2012) (5)
Network Formation for Asymmetric Players and Bilateral Contracting (2016) (5)
The complexity of deciding stability under FFS in the Adversarial Queueing model (2004) (5)
Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science (1997) (5)
Connectivity for Wireless Agents Moving on a Cycle or Grid (2005) (5)
Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio (2015) (5)
The computational complexity of QoS measures for orchestrations (2017) (5)
Bisection of Random Cubic Graphs (2002) (5)
Forward and backward linear threshold ranks (2021) (5)
Satisfaction and Power in Unanimous Majority Influence Decision Models (2018) (5)
Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty (2011) (4)
Routing Tree Problems on Random Graphs (2000) (4)
Orchestrating Unreliable Services: Strategic and Probabilistic Approaches to Reliability (2011) (4)
On Parallel versus Sequential Approximation (1995) (4)
On the Complexity of Equilibria Problems in Angel-Daemon Games (2008) (4)
Efficient Algorithms for Parameterized H-colorings (2006) (4)
Approximating Scheduling Problems in Parallel (1997) (4)
A Constructive linear time algorithm for small cutwidth (2000) (4)
Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung (2010) (4)
Randomized Parallel Approximations to Max Flow (2016) (3)
Refining the Imprecise Meaning of Non-determinism in the Web by Strategic Games (2019) (3)
Uncertainty in basic short-term macroeconomic models with angel-daemon games (2017) (3)
Parallel approximation to high multiplicity scheduling problems VIA smooth multi-valued quadratic programming (2008) (3)
Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications (2001) (3)
Parallel Approximation Schemes for problems on planar graphs (Extended Abstract) (1993) (3)
Measuring satisfaction in societies with opinion leaders and mediators (2016) (3)
Web Apps and Imprecise Probabilitites (2018) (3)
An Angel-Daemon Approach to Assess the Uncertainty in the Power of a Collectivity to Act (2017) (3)
The parallel approximability of a subclass of quadratic programming (1997) (2)
On the proper intervalization of colored caterpillar trees (2009) (2)
On List k-Coloring Convex Bipartite Graphs (2020) (2)
Extended Abstracts Summer 2015 (2017) (2)
Preface to special section of selected papers from WEA 2006 (2009) (2)
Efficient Parallel Algorithms for some Tree Layout Problems (1995) (2)
A Cost-benefit Analysis of Continuous Assessment (2015) (2)
On the Stability of Generalized Second Price Auctions with Budgets (2013) (2)
On the Average Case Complexity of Some P-complete Problems (1999) (2)
On the Random Generation and Counting of Matchings in Dense Graphs (1998) (2)
The Complexity of Measuring Power in Generalized Opinion Leader Decision Models (2016) (2)
Paradigms for Fast Parallel Approximability: Rounding, Interval Partitioning and Separation (1997) (1)
The Parallel Approximability of the False and True Gates Problems for NOR-Circuits (2002) (1)
Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings (2006) (1)
Rational Processes and Linear Systems in CSP (1995) (1)
D M ] 2 9 N ov 2 01 3 Absorption Time of the Moran Process ∗ (2017) (1)
Communication tree problems (2007) (1)
Approximating Fixation Probabilities in the Generalized Moran Process (2012) (1)
Algorithms and Complexity (2013) (1)
Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques (2010) (1)
A : European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty . " Symbolic and Quantitative Approaches to Reasoning with Uncertainty (2020) (1)
Random models for geometric graphs (2007) (1)
On the Existence of Nash Equilibria in Strategic Search Games (2011) (1)
Proceedings of the Fourth Annual European Symposium on Algorithms (1996) (1)
Algorithms -- ESA '96 : Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996 : proceedings (1996) (1)
Vertex fusion under diameter constraints (2007) (1)
On the hardness of game equivalence under local isomorphism (2013) (1)
An efficient deterministic parallel algorithm for two processors precedence constraint scheduling (2003) (1)
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution (1998) (1)
Dimension and Codimension of Simple Games (2016) (1)
Algorithmic Game Theory : 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings (2012) (1)
Algorithmic Game Theory (2012) (1)
The approximability of problems complete for P (invited) (1989) (1)
Randomization and approximation techniques in computer science : Second International Workshop, RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings (1998) (1)
Further Parallel Approximations (1997) (0)
Refining Indeterministic Choice: Imprecise Probabilities and Strategic Thinking (2020) (0)
Paradigms for Fast Parallel Approximability: Introduction (1997) (0)
Vertex fusion under distance constraints (2009) (0)
Paradigms for Fast Parallel Approximability: Bibliography (1997) (0)
The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android (2014) (0)
Bringing libraries to Web 3.0 (2012) (0)
Linear and nonlinear systems: A survey (1997) (0)
Measuring Investment Opportunities Under Uncertainty (2019) (0)
Paradigms for Fast Parallel Approximability: Extremal Graph Properties (1997) (0)
On the Value of Pedagogical Assets (2018) (0)
Counting List H-Colorings and Variants ∗ Josep Dı́az † (2001) (0)
Web Apps & Imprecise Probabilitites (2018) (0)
On the Complexity of Game Isomorphism (Extended Abstract) (2007) (0)
Relating Real and Synthetic Social Networks Through Centrality Measures (2022) (0)
Paradigms for Fast Parallel Approximability: Definition of Problems (1997) (0)
Coaching on New Technologies: Programming Workshop Android Applications for Google Phones (2011) (0)
Stars and Celebrities: A Network Creation Game (2015) (0)
The "Burnside process" converges slowly (1998) (0)
Algorithms and complexity : 8th international conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013 : proceedings (2013) (0)
Uncertainty Analysis of Simple Macroeconomic Models Using Angel-Daemon Games (2016) (0)
Proceedings of the 5th international conference on Experimental Algorithms (2006) (0)
Can Fixation be Guaranteed in the Generalized Moran Process? (2012) (0)
Optimizing the Social Cost of Congestion Games by Imposing Variable Delays (2014) (0)
An Eecient Parallel Algorithm for Two Processors Precedence Constraint Scheduling (2007) (0)
Parallel Approximability of MAXNP Problems (1995) (0)
Paradigms for Fast Parallel Approximability: Primal-Dual Method (1997) (0)
Continuous monitoring in the dynamic sensor field model (2011) (0)
Network Formation for Asymmetric Players and Bilateral Contracting (2015) (0)
A genetic approach for the parallel almost-uniform generation and approximate counting of matchings (1996) (0)
Paradigms for fast parallel approximability (Reprint from 1997) (2009) (0)
Proceedings of the 5th International Symposium on Algorithmic Game Theory - Volume 7615 (2012) (0)
Syntactically Defined Classes (1997) (0)
Random Models for Geometric Graphs (Abstract) (2007) (0)
Paradigms for Fast Parallel Approximability: Graph Decomposition (1997) (0)
On Vertex Bisection Width of Random d-Regular Graphs (2022) (0)
The Multicolored Graph Realization Problem (2021) (0)
Proceedings of the 5th international conference on Algorithmic Game Theory (2012) (0)
Letter from the Bulletin Editor (2013) (0)
On the Complexity of Trading (2015) (0)
Preface (2015) (0)

This paper list is powered by the following services:

Other Resources About Maria Serna

What Schools Are Affiliated With Maria Serna?

Maria Serna is affiliated with the following schools:

Maria Serna's Academic­Influence.com Rankings

Maria Serna's Degrees

Similar Degrees You Can Earn

Why Is Maria Serna Influential?

Maria Serna's Published Works

Published Works

Other Resources About Maria Serna

What Schools Are Affiliated With Maria Serna?

Maria Serna's AcademicInfluence.com Rankings