| Improved Reconstruction of Random Geometric Graphs | 0 | 0.34 | 2022 |
| The making of a new science: A personal Journey Through the Early Years of Theoretical Computer Science, Ausiello Giorgio, Fisher Adam (Eds.), in: Valley of Genius: The uncensored History of Silicon Valley. Twelve (Hachette) (2018). | 0 | 0.34 | 2020 |
| Algorithmically Efficient Syntactic Characterization of Possibility Domains. | 0 | 0.34 | 2019 |
| The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. | 0 | 0.34 | 2019 |
| EATCS Fellows 2020 - Call for Nominations. | 0 | 0.34 | 2019 |
| Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. | 0 | 0.34 | 2018 |
| EATCS Fellows 2019 - Call for Nominations. | 0 | 0.34 | 2018 |
| Learning random points from geometric graphs or orderings | 0 | 0.34 | 2018 |
| The social cost of congestion games by imposing variable delays | 0 | 0.34 | 2017 |
| ON THE RELATION BETWEEN GRAPH DISTANCE AND EUCLIDEAN DISTANCE IN RANDOM GEOMETRIC GRAPHS | 2 | 0.36 | 2014 |
| On the Stability of Generalized Second Price Auctions with Budgets. | 0 | 0.34 | 2014 |
| Optimizing the Social Cost of Congestion Games by Imposing Variable Delays. | 0 | 0.34 | 2014 |
| Social-aware forwarding improves routing performance in pocket switched networks | 7 | 0.58 | 2011 |
| Balanced cut approximation in random geometric graphs | 0 | 0.34 | 2009 |
| On the chromatic number of a random 5-regular graph | 5 | 0.53 | 2009 |
| Large Connectivity for Dynamic Random Geometric Graphs | 15 | 1.01 | 2009 |
| A new upper bound for 3-SAT. | 0 | 0.34 | 2008 |
| The distant-2 chromatic number of random proximity and random geometric graphs | 2 | 0.37 | 2008 |
| Complexity issues on bounded restrictive H-coloring | 3 | 0.40 | 2007 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings | 37 | 3.17 | 2006 |
| The chromatic and clique numbers of random scaled sector graphs | 4 | 0.53 | 2005 |
| Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings | 95 | 10.89 | 2004 |
| Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive List H-Colorings | 5 | 0.49 | 2004 |
| Computation of the Bisection Width for Random d-Regular Graphs | 8 | 0.59 | 2004 |
| Adversarial models for priority-based networks | 13 | 0.67 | 2003 |
| A Random Graph Model for Optical Networks of Sensors | 36 | 2.43 | 2003 |
| Bisection of Random Cubic Graphs | 4 | 0.49 | 2002 |
| Counting H-colorings of partial k-trees | 9 | 0.67 | 2002 |
| The Complexity of Restrictive H-Coloring | 5 | 0.56 | 2002 |
| Primes in P (Without Assumptions) | 0 | 0.34 | 2002 |
| Analysis of Algorithms (AofA): Part I: 1993 -- 1998 | 0 | 0.34 | 2002 |
| H-Colorings of Large Degree Graphs | 2 | 0.39 | 2002 |
| (H, C, K)-Coloring: Fast, Easy, and Hard Cases | 9 | 0.59 | 2001 |
| Recent results on parameterized H-colorings | 3 | 0.45 | 2001 |
| H-Colorings of Graphs | 5 | 0.58 | 2001 |
| Approximating layout problems on random graphs | 7 | 0.89 | 2001 |
| Faulty Random Geometric Networks | 9 | 0.71 | 2000 |
| Linear Orderings of Random Geometric Graphs | 1 | 0.50 | 1999 |
| Random Geometric Problems on [0, 1]² | 14 | 0.95 | 1998 |
| A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution | 0 | 0.34 | 1998 |
| Parallel algorithms for the minimum cut and the minimum length tree layout problems | 4 | 0.51 | 1997 |
| Algorithms - ESA '96, Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996, Proceedings | 40 | 15.85 | 1996 |
| Parallel Approximation Schemes for problems on planar graphs (Extended Abstract) | 0 | 0.34 | 1993 |
| TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89) | 23 | 21.37 | 1989 |
| TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages (CCIPL) | 23 | 6.42 | 1989 |
| Complexity Classes with Complete Problems Between P and NP-C | 10 | 2.42 | 1989 |
| Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain, July 18-22, 1983, Proceedings | 59 | 112.36 | 1983 |
| Formalization of Programming Concepts, International Colloquium, Peniscola, Spain, April 19-25, 1981, Proceedings | 30 | 11.13 | 1981 |
