Paper title | Citations |
---|

Combinatorial Optimization with Noisy Inputs: How Can We Separate the Wheat from the Chaff? | 0 |

Approximability of Stable Matching Problems | 1 |

On Three-Dimensional Graph Drawing and Embedding | 0 |

Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression | 0 |

Generalized Above Guarantee Vertex Cover and r-Partization | 0 |

Farthest Voronoi Diagrams under Travel Time Metrics | 3 |

Tight Bound for Farthest-Color Voronoi Diagrams of Line Segments | 2 |

Range Aggregate Maximal Points in the Plane | 0 |

Approximating the Multi-level Bottleneck Assignment Problem | 20 |

Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion | 5 |

Comparing and Aggregating Partial Orders with Kendall Tau Distances | 24 |

On the Round-Trip 1-Center and 1-Median Problems | 5 |

Triangle-Free Outerplanar 3-Graphs Are Pairwise Compatibility Graphs | 15 |

On Relaxing the Constraints in Pairwise Compatibility Graphs | 19 |

Universal Line-Sets for Drawing Planar 3-Trees | 6 |

On the Hardness of Point-Set Embeddability | 10 |

Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet | 7 |

Fat Heaps without Regular Counters | 0 |

Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles | 5 |

Drawing Unordered Trees on k-Grids | 3 |

Heuristics for the Maximum 2-layer RAC Subgraph Problem | 7 |

Nash Equilibria with Minimum Potential in Undirected Broadcast Games | 17 |

Calculating Average Joint Hamming Weight for Minimal Weight Conversion of d Integers | 1 |

proceeding 2012 | 0 |

Total | 150 |