The following pages link to Josep Diaz (Q314817):
Displaying 50 items.
- (Q190501) (redirect page) (← links)
- Complexity of metric dimension on planar graphs (Q314819) (← links)
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- (Q465656) (redirect page) (← links)
- Book review of: D. P. Dubhashi and A. Panconesi, Concentration of measure for the analysis of randomized algorithms. (Q465657) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- Book review of: C. Moore and S. Mertens, The nature of computation. (Q465687) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- The chromatic and clique numbers of random scaled sector graphs (Q817771) (← links)
- A survey of the modified Moran process and evolutionary graph theory (Q826319) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- High level communication functionalities for wireless sensor networks (Q952445) (← links)
- A note on the subgraphs of the (\(2\times \infty \))-grid (Q960965) (← links)
- The distant-2 chromatic number of random proximity and random geometric graphs (Q963353) (← links)
- Communication tree problems (Q995575) (← links)
- Balanced cut approximation in random geometric graphs (Q1029344) (← links)
- A note on a theorem by Ladner (Q1051633) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- On the random generation and counting of matchings in dense graphs (Q1129018) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- Parallel algorithms for the minimum cut and the minimum length tree layout problems (Q1391312) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- The restrictive \(H\)-coloring problem (Q1764813) (← links)
- Bounds on the max and min bisection of random cubic and random 4-regular graphs (Q1885048) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Continuous monitoring in the dynamic sensor field model (Q1929224) (← links)
- On list \(k\)-coloring convex bipartite graphs (Q2056881) (← links)
- Book review of: G. Ausiello, The making of a new science. A personal journey through the early years of theoretical computer science (Q2197787) (← links)
- On the satisfiability threshold of formulas with three literals per clause (Q2271431) (← links)
- Complexity issues on bounded restrictive \(H\)-coloring (Q2370448) (← links)
- Bounds on the bisection width for random \(d\)-regular graphs (Q2381523) (← links)
- Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
- Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs (Q2711615) (← links)
- Approximating Layout Problems on Random Geometric Graphs (Q2731603) (← links)
- Absorption time of the Moran process (Q2818278) (← links)
- On the relation between graph distance and Euclidean distance in random geometric graphs (Q2830884) (← links)
- The Power of Choice for Random Satisfiability (Q2851879) (← links)
- On the Complexity of Metric Dimension (Q2912859) (← links)
- Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613) (← links)
- (Q2968924) (← links)
- (Q2969651) (← links)
- Classes of bounded nondeterminism (Q3034815) (← links)
- Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks (Q3092275) (← links)
- A new upper bound for 3-SAT (Q3165956) (← links)
- Paradigms for Fast Parallel Approximability (Q3184627) (← links)
- (Q3395943) (← links)
- (Q3424889) (← links)
- (Q3579492) (← links)
- Walkers on the Cycle and the Grid (Q3629474) (← links)
