Paper title | Citations |
---|

Graph Profile Realizations and Applications to Social Networks | 4 |

Parameterized Computational Geometry via Decomposition Theorems | 0 |

r-Gatherings on a Star | 0 |

Topological Stability of Kinetic k-centers | 2 |

A Linear Time Algorithm for the r-Gathering Problem on the Line (Extended Abstract) | 2 |

Maximum-Width Empty Square and Rectangular Annulus | 1 |

Hard and Easy Instances of L-Tromino Tilings | 1 |

The Prefix Fréchet Similarity | 0 |

Probabilistic Analysis of Optimization Problems on Generalized Random Shortest Path Metrics | 1 |

Optimal Partition of a Tree with Social Distance | 0 |

Flat-Foldability for 1 × n Maps with Square/Diagonal Grid Patterns | 0 |

(k, p)-Planarity: A Relaxation of Hybrid Planarity | 2 |

Drawing Clustered Graphs on Disk Arrangements | 1 |

Computing the Metric Dimension by Decomposing Graphs into Extended Biconnected Components | 3 |

On the Algorithmic Complexity of Double Vertex-Edge Domination in Graphs | 1 |

The Upper Bound on the Eulerian Recurrent Lengths of Complete Graphs Obtained by an IP Solver | 0 |

A Fast Algorithm for Unbounded Monotone Integer Linear Systems with Two Variables per Inequality via Graph Decomposition | 0 |

Multilevel Planarity | 0 |

Weighted Upper Edge Cover: Complexity and Approximability | 1 |

Linear Pseudo-Polynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem | 1 |

Matching Sets of Line Segments | 0 |

Efficient Algorithm for Box Folding | 2 |

Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems | 6 |

Greedy Consensus Tree and Maximum Greedy Consensus Tree Problems | 1 |

A Two Query Adaptive Bitprobe Scheme Storing Five Elements | 1 |

Applications of V-Order: Suffix Arrays, the Burrows-Wheeler Transform & the FM-index | 0 |

Towards Work-Efficient Parallel Parameterized Algorithms | 0 |

Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots | 10 |

Packing 2D Disks into a 3D Container | 0 |

Covering and Packing of Rectilinear Subdivision | 0 |

Minimum Membership Covering and Hitting | 0 |

Capacitated Discrete Unit Disk Cover | 0 |

Correction to: Weighted Upper Edge Cover: Complexity and Approximability | 0 |

proceeding 2019 | 0 |

Total | 40 |