The following pages link to Pilu Crescenzi (Q222483):
Displaying 50 items.
- (Q386901) (redirect page) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Parsimonious flooding in dynamic graphs (Q661047) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets (Q714835) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Completeness in approximation classes (Q811119) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- (Q915445) (redirect page) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- On-line load balancing made simple: greedy strikes back (Q924556) (← links)
- The minimum likely column cover problem (Q1029075) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- A note on optimal area algorithms for upward drawings of binary trees (Q1208428) (← links)
- Sperner's lemma and robust machines (Q1272662) (← links)
- Strictly-upward drawings of ordered search trees (Q1274319) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- Linear area upward drawings of AVL trees (Q1384187) (← links)
- Text sparsification via local maxima. (Q1401406) (← links)
- On-line algorithms for the channel assignment problem in cellular networks. (Q1427805) (← links)
- Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
- Minimum-delay schedules in layered networks (Q1812948) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Complexity classes and sparse oracles (Q1894447) (← links)
- Smooth movement and Manhattan path based random waypoint mobility (Q1944081) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- On approximation scheme preserving reducibility and its applications (Q1969434) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- Synchronous context-free grammars and optimal linear parsing strategies (Q2353407) (← links)
- On computing Pareto optimal paths in weighted time-dependent networks (Q2656351) (← links)
- (Q2762500) (← links)
- Rumor spreading in random evolving graphs (Q2795745) (← links)
- Rumor Spreading in Random Evolving Graphs (Q2849323) (← links)
- A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs (Q2999337) (← links)
- On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone (Q3167622) (← links)
- DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING (Q3358213) (← links)
- Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications (Q3408167) (← links)
- On Computing the Hyperbolicity of Real-World Graphs (Q3452784) (← links)
- Finding the Diameter in Real-World Graphs (Q3586472) (← links)
- (Q3974859) (← links)
- (Q4258216) (← links)
- Structure in Approximation Classes (Q4268816) (← links)
- AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS (Q4275181) (← links)
- (Q4293543) (← links)
- (Q4426347) (← links)
- (Q4449245) (← links)
