pith. sign in

McConnell and Jeremy P

· 1999 · DOI 10.1016/s0012-365x(98)00319-7

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it
open at publisher browse 2 citing papers

fields

cs.CG 1 cs.DS 1

years

2026 1 2019 1

verdicts

UNVERDICTED 2

representative citing papers

Witness Set: A Visibility Problem in $NP\cap XP$

cs.CG · 2026-05-02 · unverdicted · novelty 7.0

Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.

Multidimensional Dominance Drawings

cs.DS · 2019-06-21 · unverdicted · novelty 6.0

Algorithm computes k-dimensional dominance drawing of DAG G (width w_G) for w_G ≤ k ≤ n/2 in O(kn) time after O(km) precomputation of compressed transitive closure, plus new concepts and bounds.

citing papers explorer

Showing 2 of 2 citing papers.

  • Witness Set: A Visibility Problem in $NP\cap XP$ cs.CG · 2026-05-02 · unverdicted · none · ref 19

    Witness Set for simple polygons is in NP ∩ XP and admits an n^{f(k)}-time algorithm via combinatorial discretization, in contrast to its ∃R-complete dual.

  • Multidimensional Dominance Drawings cs.DS · 2019-06-21 · unverdicted · none · ref 17

    Algorithm computes k-dimensional dominance drawing of DAG G (width w_G) for w_G ≤ k ≤ n/2 in O(kn) time after O(km) precomputation of compressed transitive closure, plus new concepts and bounds.