| Paper title | Citations |
|---|
| train scheduling: hardness and algorithms | 2 |
| trichotomy for the reconfiguration problem of integer linear systems | 0 |
| an experimental study of a 1-planarity testing and embedding algorithm | 1 |
| parameterized algorithms for the happy set problem | 2 |
| faster privacy-preserving computation of edit distance with moves | 0 |
| efficient enumeration of non-isomorphic ptolemaic graphs | 0 |
| approximability of the independent feedback vertex set problem for bipartite graphs | 1 |
| designing survivable networks with zero-suppressed binary decision diagrams | 0 |
| matching random colored points with rectangles | 2 |
| packing arc-disjoint cycles in bipartite tournaments | 2 |
| on the maximum edge-pair embedding bipartite matching | 0 |
| partitioning a graph into complementary subgraphs | 0 |
| implicit enumeration of topological-minor-embeddings and its application to planar subgraph enumeration | 0 |
| packing and covering with segments | 0 |
| dispersion of mobile robots on grids | 6 |
| the stub resolution of 1-planar graphs | 0 |
| maximum bipartite subgraph of geometric intersection graphs | 0 |
| computational complexity of the chromatic art gallery problem for orthogonal polygons | 1 |
| reconfiguring k-path vertex covers | 0 |
| generalized dictionary matching under substring consistent equivalence relations | 0 |
| fast multiple pattern cartesian tree matching | 2 |
| angle covers: algorithms and complexity | 0 |
| packing trees into 1-planar graphs | 0 |
| shortest covers of all cyclic shifts of a string | 1 |
| a waste-efficient algorithm for single-droplet sample preparation on microfluidic chips | 1 |
| routing in histograms | 0 |
| optimum algorithm for the mutual visibility problem | 0 |
| recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks | 0 |
| space efficient separator algorithms for planar graphs | 0 |
| drawing planar graphs | 0 |
| Total | 21 |