Paper title | Citations |
---|

Algorithms for Equilibrium Prices in Linear Market Models | 0 |

In as Few Comparisons as Possible | 0 |

The Happy End Theorem and Related Results | 0 |

Generalized Class Cover Problem with Axis-Parallel Strips | 3 |

Top-k Manhattan Spatial Skyline Queries | 0 |

On Generalized Planar Skyline and Convex Hull Range Queries | 2 |

Boundary Labeling with Flexible Label Positions | 13 |

Approximating the Bipartite TSP and Its Biased Generalization | 10 |

A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow | 0 |

Simple Linear Comparison of Strings in V-Order | 5 |

SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search | 6 |

Optimal Serial Broadcast of Successive Chunks | 11 |

The G-Packing with t-Overlap Problem | 10 |

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity | 25 |

On a Class of Covering Problems with Variable Capacities in Wireless Networks | 3 |

Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs | 8 |

Some Results on Point Visibility Graphs | 0 |

Some Extensions of the Bottleneck Paths Problem | 4 |

I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs | 1 |

On Some NP-complete SEFE Problems | 7 |

On Dilworth k Graphs and Their Pairwise Compatibility | 2 |

Efficient Algorithms for Sorting k-Sets in Bins | 1 |

Results on Independent Sets in Categorical Products of Graphs, the Ultimate Categorical Independence Ratio and the Ultimate Categorical Independent Domination Ratio | 0 |

Editing the Simplest Graphs | 17 |

Alignment with Non-overlapping Inversions on Two Strings | 9 |

Collapsing Exact Arithmetic Hierarchies | 0 |

Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs | 1 |

Quasi-Upward Planar Drawings of Mixed Graphs with Few Bends: Heuristics and Exact Methods | 2 |

On Minimum Average Stretch Spanning Trees in Polygonal 2-Trees | 3 |

Linear Layouts of Weakly Triangulated Graphs | 8 |

Bichromatic Point-Set Embeddings of Trees with Fewer Bends | 0 |

ℓ1-Embeddability of 2-Dimensional ℓ1-Rigid Periodic Graphs | 1 |

proceeding 2014 | 0 |

Total | 152 |