Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Diaz, Josep - Departament of Llenguatges i Sistemes Informátics, Universitat Politècnica de Catalunya
Balanced Cut Approximation in Random Geometric Graphs
Modelos de grafos para la web 1 Alvarez 2 Josep D az 2 Maria Serna 2
Hcolorings of Large Degree Graphs \Lambda Josep D'iaz y Jaroslav Nesetril z Maria Serna y
Random scaled sector graphs Josep D az Jordi Petit Maria Serna
Stability and non-stability of the FIFO protocol Josep D az y Dimitrios Koukopoulos z Sotiris Nikoletseas z
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
Bounds on the max and min bisection of random cubic
Ecient algorithms for parameterized H-colorings y Josep D az Maria Serna Dimitrios M. Thilikos
Approximating Layout Problems on Random Graphs \Lambda
Fixed Parameter Algorithms for Counting and Deciding Bounded Restrictive list H-Colorings ?
Efficient and Reliable High Level Communication in Randomly Deployed Wireless Sensor Networks
Efficient algorithms for counting parameterized list H-Colorings
Counting H-Colorings of Partial k-Trees ? Josep D az, Maria Serna, Dimtirios M. Thilikos
Intervalizing colored graphs is NPcomplete for caterpillars with hair length 2 \Lambda
Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
Fear in Mediation: Exploiting the "Windfall of Malice" D. Mitsche
Communication Tree Problems Carme `Alvarez Rafel Cases Josep Diaz Jordi Petit Maria Serna
Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Diaz1
Fast FPT-algorithms for cleaning grids Josep Diaz Dimitrios M. Thilikos
5-Regular Multi-Graphs are 3-Colorable with Independent of their Size Positive Probability
(H; C; K)-Coloring: Fast, Easy, and Hard Cases Josep D az y Maria Serna y Dimitrios M. Thilikos y
A Survey of Graph Layout Problems JOSEP D IAZ, JORDI PETIT and MARIA SERNA
The average complexity of the Circuit Value Problem \Lambda J.D'iaz y M.J.Serna y P.Spirakis z T.Tsukiji x
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Bisection of Random Cubic Graphs J. D az y N. Do z M.J. Serna y N.C. Wormald zx
The complexity of restrictive H-coloring Josep D az y Maria Serna y Dimitrios M. Thilikos y
TO CONCENTRATION BOUNDS Josep D'iaz, Jordi Petit and Maria Serna
Evaluation of basic protocols for optical smart dust networks ?
Convergence theorems for some layout measures on random lattice and random geometric graphs \Lambda
Theoretical Aspects of Graph Models for Josep Diaz1, Dieter Mitsche2, and Paolo Santi3
The cook-book approach to the differential equation D. Mitsche2
Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
