Paper title | Citations |
---|

calculating average joint hamming weight for minimal weight conversion of d integers | 1 |

nash equilibria with minimum potential in undirected broadcast games | 17 |

heuristics for the maximum 2-layer rac subgraph problem | 8 |

drawing unordered trees on k-grids | 3 |

drawing graphs with vertices at specified positions and crossings at large angles | 6 |

fat heaps without regular counters | 6 |

linear time inference of strings from cover arrays using a binary alphabet | 7 |

on the hardness of point-set embeddability | 10 |

universal line-sets for drawing planar 3-trees | 6 |

on relaxing the constraints in pairwise compatibility graphs | 19 |

triangle-free outerplanar 3-graphs are pairwise compatibility graphs | 15 |

on the round-trip 1-center and 1-median problems | 6 |

comparing and aggregating partial orders with kendall tau distances | 26 |

reoptimization of the maximum weighted p k -free subgraph problem under vertex insertion | 5 |

approximating the multi-level bottleneck assignment problem | 21 |

range aggregate maximal points in the plane | 17 |

tight bound for farthest-color voronoi diagrams of line segments | 2 |

farthest voronoi diagrams under travel time metrics | 3 |

generalized above guarantee vertex cover and r-partization | 0 |

bounding the number of reduced trees, cographs, and series-parallel graphs by compression | 0 |

on three-dimensional graph drawing and embedding | 0 |

approximability of stable matching problems | 1 |

combinatorial optimization with noisy inputs: how can we separate the wheat from the chaff? | 0 |

Total | 179 |