Paper title | Citations |
---|

box-rectangular drawings of planar graphs | 7 |

on embedding of certain recursive trees and stars into hypercube | 0 |

on graphs that are not pcgs | 29 |

circular graph drawings with large crossing angles | 7 |

an fpt algorithm for tree deletion set | 5 |

on directed tree realizations of degree sets | 1 |

improved fixed-parameter algorithm for the minimum weight 3-sat problem | 3 |

lower bounds for ramsey numbers for complete bipartite and 3-uniform tripartite subgraphs | 3 |

fixed-parameter tractability of error correction in graphical linear systems | 2 |

generalized rainbow connectivity of graphs | 1 |

the cyclical scheduling problem | 2 |

alliances and bisection width for planar graphs | 0 |

triangle-partitioning edges of planar graphs, toroidal graphs and k-planar graphs | 1 |

smoothed analysis of belief propagation for minimum-cost flow and matching | 14 |

shared-memory parallel frontier-based search | 2 |

broadcasting in conflict-aware multi-channel networks | 0 |

daemon conversions in distributed self-stabilizing algorithms | 14 |

approximation algorithms for the partition vertex cover problem | 2 |

linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs | 2 |

exact and approximation algorithms for densest k-subgraph | 19 |

a randomised approximation algorithm for the hitting set problem | 9 |

approximation schemes for covering and packing | 22 |

voronoi game on graphs | 24 |

counting maximal points in a query orthogonal rectangle | 5 |

base location problems for base-monotone regions | 1 |

a competitive strategy for distance-aware online shape allocation | 2 |

online exploration and triangulation in orthogonal polygonal regions | 4 |

fixed-orientation equilateral triangle matching of point sets | 10 |

a novel efficient approach for solving the art gallery problem | 9 |

adversarial prediction: lossless predictors and fractal like adversaries | 0 |

mobility and computations: some open research directions | 0 |

Total | 200 |