Paper title | Citations |
---|

erratum: competitive analysis for multi-objective online algorithms | 0 |

logspace and fpt algorithms for graph isomorphism for subclasses of bounded tree-width graphs | 4 |

on triangle cover contact graphs | 4 |

superset generation on decision diagrams | 1 |

threshold circuits for global patterns in 2-dimensional maps | 3 |

common unfolding of regular tetrahedron and johnson-zalgaller solid | 7 |

dichotomy theorems for homomorphism polynomials of graph classes | 4 |

non-repetitive strings over alphabet lists | 4 |

simultaneous time-space upper bounds for red-blue path problem in planar dags | 2 |

on bar (1,j)-visibility graphs | 4 |

an improved algorithm for parameterized edge dominating set problem | 10 |

simultaneous drawing of planar graphs with right-angle crossings and few bends | 16 |

competitive analysis for multi-objective online algorithms | 8 |

dynamic online multiselection in internal and external memory | 4 |

an efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks | 6 |

the impact of communication patterns on distributed self-adjusting binary search trees | 1 |

enumerating eulerian trails via hamiltonian path enumeration | 0 |

fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement | 29 |

ptasâ€™s for some metric p-source communication spanning tree problems | 3 |

an almost optimal algorithm for voronoi diagrams of non-disjoint line segments | 1 |

folding a paper strip to minimize thickness | 8 |

straight-path queries in trajectory data | 6 |

approximate distance oracle in o(n2) time and o(n) space for chordal graphs | 4 |

forming plurality at minimum cost | 3 |

a practical succinct data structure for tree-like graphs | 3 |

compact encodings and indexes for the nearest larger neighbor problem | 4 |

unit covering in color-spanning set model | 2 |

edge-colorings of weighted graphs | 0 |

the directed ring loading with penalty cost | 0 |

fast algorithms for constrained graph density problems | 0 |

encoding data structures | 6 |

Total | 147 |