https://scifaro.com/en/abs/on-line-viterbi-algorithm-and-its-relationship-to-random-walks-0704.00622010-01-25 https://scifaro.com/zh/abs/on-line-viterbi-algorithm-and-its-relationship-to-random-walks-0704.00622010-01-25 https://scifaro.com/en/abs/optimal-synthesis-of-multiple-algorithms-0704.07882007-05-23 https://scifaro.com/zh/abs/optimal-synthesis-of-multiple-algorithms-0704.07882007-05-23 https://scifaro.com/en/abs/p-adic-arithmetic-coding-0704.08342007-05-23 https://scifaro.com/zh/abs/p-adic-arithmetic-coding-0704.08342007-05-23 https://scifaro.com/en/abs/straggler-identification-in-round-trip-data-streams-via-newton-s-identities-and-invertible-bloom-filters-0704.33132009-09-10 https://scifaro.com/zh/abs/straggler-identification-in-round-trip-data-streams-via-newton-s-identities-and-invertible-bloom-filters-0704.33132009-09-10 https://scifaro.com/en/abs/polynomial-algorithms-for-protein-similarity-search-for-restricted-mrna-structures-0704.34962007-05-23 https://scifaro.com/zh/abs/polynomial-algorithms-for-protein-similarity-search-for-restricted-mrna-structures-0704.34962007-05-23 https://scifaro.com/en/abs/avoiding-rotated-bitboards-with-direct-lookup-0704.37732007-10-09 https://scifaro.com/zh/abs/avoiding-rotated-bitboards-with-direct-lookup-0704.37732007-10-09 https://scifaro.com/en/abs/minimizing-unsatisfaction-in-colourful-neighbourhoods-0704.38352009-11-13 https://scifaro.com/zh/abs/minimizing-unsatisfaction-in-colourful-neighbourhoods-0704.38352009-11-13 https://scifaro.com/en/abs/acyclic-preference-systems-in-p2p-networks-0704.39042007-05-23 https://scifaro.com/zh/abs/acyclic-preference-systems-in-p2p-networks-0704.39042007-05-23 https://scifaro.com/en/abs/using-images-to-create-a-hierarchical-grid-spatial-index-0705.02042016-11-17 https://scifaro.com/zh/abs/using-images-to-create-a-hierarchical-grid-spatial-index-0705.02042016-11-17 https://scifaro.com/en/abs/edges-and-switches-tunnels-and-bridges-0705.04132009-07-09 https://scifaro.com/zh/abs/edges-and-switches-tunnels-and-bridges-0705.04132009-07-09 https://scifaro.com/en/abs/succinct-indexable-dictionaries-with-applications-to-encoding-k-ary-trees-prefix-sums-and-multisets-0705.05522011-08-10 https://scifaro.com/en/abs/iterative-rounding-for-the-closest-string-problem-0705.05612011-05-12 https://scifaro.com/zh/abs/iterative-rounding-for-the-closest-string-problem-0705.05612011-05-12 https://scifaro.com/en/abs/recognizing-partial-cubes-in-quadratic-time-0705.10252011-07-21 https://scifaro.com/zh/abs/recognizing-partial-cubes-in-quadratic-time-0705.10252011-07-21 https://scifaro.com/en/abs/optimal-cache-oblivious-mesh-layouts-0705.10332009-10-05 https://scifaro.com/zh/abs/optimal-cache-oblivious-mesh-layouts-0705.10332009-10-05 https://scifaro.com/en/abs/a-note-on-module-composed-graphs-0705.15212007-07-23 https://scifaro.com/zh/abs/a-note-on-module-composed-graphs-0705.15212007-07-23 https://scifaro.com/en/abs/a-tighter-analysis-of-setcover-greedy-algorithm-for-test-set-0705.17502011-03-08 https://scifaro.com/zh/abs/a-tighter-analysis-of-setcover-greedy-algorithm-for-test-set-0705.17502011-03-08 https://scifaro.com/en/abs/scheduling-dags-under-uncertainty-0705.18762007-05-23 https://scifaro.com/zh/abs/scheduling-dags-under-uncertainty-0705.18762007-05-23 https://scifaro.com/en/abs/a-closed-form-method-for-lru-replacement-under-generalized-power-law-demand-0705.19702007-05-23 https://scifaro.com/zh/abs/a-closed-form-method-for-lru-replacement-under-generalized-power-law-demand-0705.19702007-05-23 https://scifaro.com/en/abs/on-the-hopcroft-s-minimization-algorithm-0705.19862007-05-23 https://scifaro.com/zh/abs/on-the-hopcroft-s-minimization-algorithm-0705.19862007-05-23 https://scifaro.com/en/abs/parallelized-approximation-algorithms-for-minimum-routing-cost-spanning-trees-0705.21252007-07-04 https://scifaro.com/zh/abs/parallelized-approximation-algorithms-for-minimum-routing-cost-spanning-trees-0705.21252007-07-04 https://scifaro.com/en/abs/improved-approximability-result-for-test-set-with-small-redundancy-0705.25032007-09-27 https://scifaro.com/zh/abs/improved-approximability-result-for-test-set-with-small-redundancy-0705.25032007-09-27 https://scifaro.com/en/abs/grover-search-algorithm-0705.41712007-05-30 https://scifaro.com/zh/abs/grover-search-algorithm-0705.41712007-05-30 https://scifaro.com/en/abs/an-improved-tight-closure-algorithm-for-integer-octagonal-constraints-0705.46182007-06-01 https://scifaro.com/zh/abs/an-improved-tight-closure-algorithm-for-integer-octagonal-constraints-0705.46182007-06-01 https://scifaro.com/en/abs/a-randomized-algorithm-for-the-on-line-weighted-bipartite-matching-problem-0705.46732007-06-06 https://scifaro.com/zh/abs/a-randomized-algorithm-for-the-on-line-weighted-bipartite-matching-problem-0705.46732007-06-06 https://scifaro.com/en/abs/symmetry-partition-sort-0706.00462007-06-04 https://scifaro.com/zh/abs/symmetry-partition-sort-0706.00462007-06-04 https://scifaro.com/en/abs/sublinear-algorithms-for-approximating-string-compressibility-0706.10842007-06-11 https://scifaro.com/zh/abs/sublinear-algorithms-for-approximating-string-compressibility-0706.10842007-06-11 https://scifaro.com/en/abs/dualheap-selection-algorithm-efficient-inherently-parallel-and-somewhat-mysterious-0706.21552007-06-15 https://scifaro.com/zh/abs/dualheap-selection-algorithm-efficient-inherently-parallel-and-somewhat-mysterious-0706.21552007-06-15 https://scifaro.com/en/abs/the-complexity-of-determining-existence-a-hamiltonian-cycle-is-o-n-3-0706.27252007-06-20 https://scifaro.com/zh/abs/the-complexity-of-determining-existence-a-hamiltonian-cycle-is-o-n-3-0706.27252007-06-20 https://scifaro.com/en/abs/cache-analysis-of-non-uniform-distribution-sorting-algorithms-0706.28392007-08-14 https://scifaro.com/zh/abs/cache-analysis-of-non-uniform-distribution-sorting-algorithms-0706.28392007-08-14 https://scifaro.com/en/abs/dualheap-sort-algorithm-an-inherently-parallel-generalization-of-heapsort-0706.28932007-06-21 https://scifaro.com/en/abs/group-testing-with-random-pools-optimal-two-stage-algorithms-0706.31042007-11-14 https://scifaro.com/zh/abs/group-testing-with-random-pools-optimal-two-stage-algorithms-0706.31042007-11-14 https://scifaro.com/en/abs/experimental-algorithm-for-the-maximum-independent-set-problem-0706.35652016-03-02 https://scifaro.com/zh/abs/experimental-algorithm-for-the-maximum-independent-set-problem-0706.35652016-03-02 https://scifaro.com/en/abs/radix-sorting-with-no-extra-space-0706.41072007-06-29 https://scifaro.com/zh/abs/radix-sorting-with-no-extra-space-0706.41072007-06-29 https://scifaro.com/en/abs/directed-feedback-vertex-set-is-fixed-parameter-tractable-0707.02822007-07-03 https://scifaro.com/zh/abs/directed-feedback-vertex-set-is-fixed-parameter-tractable-0707.02822007-07-03 https://scifaro.com/en/abs/weighted-popular-matchings-0707.05462007-07-05 https://scifaro.com/zh/abs/weighted-popular-matchings-0707.05462007-07-05 https://scifaro.com/en/abs/another-view-of-the-gaussian-algorithm-0707.06442007-07-05 https://scifaro.com/zh/abs/another-view-of-the-gaussian-algorithm-0707.06442007-07-05 https://scifaro.com/en/abs/dial-a-ride-from-k-forest-0707.06482007-07-05 https://scifaro.com/zh/abs/dial-a-ride-from-k-forest-0707.06482007-07-05 https://scifaro.com/en/abs/noisy-sorting-without-resampling-0707.10512007-07-10 https://scifaro.com/zh/abs/noisy-sorting-without-resampling-0707.10512007-07-10 https://scifaro.com/en/abs/better-algorithms-and-bounds-for-directed-maximum-leaf-problems-0707.10952007-07-10 https://scifaro.com/en/abs/sorting-and-selection-in-posets-0707.15322007-07-12 https://scifaro.com/zh/abs/sorting-and-selection-in-posets-0707.15322007-07-12 https://scifaro.com/en/abs/sampling-algorithms-and-coresets-for-lp-regression-0707.17142007-07-13 https://scifaro.com/zh/abs/sampling-algorithms-and-coresets-for-lp-regression-0707.17142007-07-13 https://scifaro.com/en/abs/splay-trees-davenport-schinzel-sequences-and-the-deque-conjecture-0707.21602007-07-17 https://scifaro.com/zh/abs/splay-trees-davenport-schinzel-sequences-and-the-deque-conjecture-0707.21602007-07-17 https://scifaro.com/en/abs/faster-subsequence-recognition-in-compressed-strings-0707.34072011-11-10 https://scifaro.com/zh/abs/faster-subsequence-recognition-in-compressed-strings-0707.34072011-11-10 https://scifaro.com/en/abs/faster-exon-assembly-by-sparse-spliced-alignment-0707.34092007-07-24 https://scifaro.com/zh/abs/faster-exon-assembly-by-sparse-spliced-alignment-0707.34092007-07-24 https://scifaro.com/en/abs/semi-local-string-comparison-algorithmic-techniques-and-applications-0707.36192015-03-13 https://scifaro.com/zh/abs/semi-local-string-comparison-algorithmic-techniques-and-applications-0707.36192015-03-13 https://scifaro.com/en/abs/on-sparse-representations-of-linear-operators-and-the-approximation-of-matrix-products-0707.44482009-06-26 https://scifaro.com/zh/abs/on-sparse-representations-of-linear-operators-and-the-approximation-of-matrix-products-0707.44482009-06-26 https://scifaro.com/en/abs/complementary-algorithms-for-graphs-and-percolation-0708.06002009-11-13 https://scifaro.com/zh/abs/complementary-algorithms-for-graphs-and-percolation-0708.06002009-11-13 https://scifaro.com/en/abs/on-the-self-stabilization-of-mobile-robots-in-graphs-0708.09092009-09-29 https://scifaro.com/zh/abs/on-the-self-stabilization-of-mobile-robots-in-graphs-0708.09092009-09-29 https://scifaro.com/en/abs/randomized-algorithm-for-the-k-server-problem-on-decomposable-spaces-0708.23512007-08-20 https://scifaro.com/zh/abs/randomized-algorithm-for-the-k-server-problem-on-decomposable-spaces-0708.23512007-08-20 https://scifaro.com/en/abs/priority-queue-based-on-multilevel-prefix-tree-0708.29362007-08-23 https://scifaro.com/zh/abs/priority-queue-based-on-multilevel-prefix-tree-0708.29362007-08-23 https://scifaro.com/en/abs/fast-evaluation-of-union-intersection-expressions-0708.32592007-08-27 https://scifaro.com/zh/abs/fast-evaluation-of-union-intersection-expressions-0708.32592007-08-27 https://scifaro.com/en/abs/linear-time-algorithms-based-on-multilevel-prefix-tree-for-finding-shortest-path-with-positive-weights-and-minimum-spanning-tree-in-a-networks-0708.34082007-08-28 https://scifaro.com/zh/abs/linear-time-algorithms-based-on-multilevel-prefix-tree-for-finding-shortest-path-with-positive-weights-and-minimum-spanning-tree-in-a-networks-0708.34082007-08-28 https://scifaro.com/en/abs/relative-error-cur-matrix-decompositions-0708.36962007-08-29 https://scifaro.com/zh/abs/relative-error-cur-matrix-decompositions-0708.36962007-08-29 https://scifaro.com/en/abs/pattern-matching-in-trees-and-strings-0708.42882007-09-03 https://scifaro.com/zh/abs/pattern-matching-in-trees-and-strings-0708.42882007-09-03 https://scifaro.com/en/abs/type-iv-dct-dst-and-mdct-algorithms-with-reduced-numbers-of-arithmetic-operations-0708.43992009-01-29 https://scifaro.com/zh/abs/type-iv-dct-dst-and-mdct-algorithms-with-reduced-numbers-of-arithmetic-operations-0708.43992009-01-29 https://scifaro.com/en/abs/on-faster-integer-calculations-using-non-arithmetic-primitives-0709.06242007-09-06 https://scifaro.com/zh/abs/on-faster-integer-calculations-using-non-arithmetic-primitives-0709.06242007-09-06 https://scifaro.com/en/abs/using-data-compressors-to-construct-rank-tests-0709.06702012-02-28 https://scifaro.com/en/abs/efficient-algorithms-for-node-disjoint-subgraph-homeomorphism-determination-0709.12272008-10-09 https://scifaro.com/zh/abs/efficient-algorithms-for-node-disjoint-subgraph-homeomorphism-determination-0709.12272008-10-09 https://scifaro.com/en/abs/incremental-satisfiability-and-implication-for-utvpi-constraints-0709.29612007-09-20 https://scifaro.com/zh/abs/incremental-satisfiability-and-implication-for-utvpi-constraints-0709.29612007-09-20 https://scifaro.com/en/abs/sorting-and-selection-with-random-costs-0710.00832007-10-02 https://scifaro.com/zh/abs/sorting-and-selection-with-random-costs-0710.00832007-10-02 https://scifaro.com/en/abs/fast-minimum-weight-double-tree-shortcutting-for-metric-tsp-is-the-best-one-good-enough-0710.03182009-07-16 https://scifaro.com/zh/abs/fast-minimum-weight-double-tree-shortcutting-for-metric-tsp-is-the-best-one-good-enough-0710.03182009-07-16 https://scifaro.com/en/abs/a-novel-solution-to-the-att48-benchmark-problem-0710.05392007-10-03 https://scifaro.com/zh/abs/a-novel-solution-to-the-att48-benchmark-problem-0710.05392007-10-03 https://scifaro.com/en/abs/faster-least-squares-approximation-0710.14352010-09-28 https://scifaro.com/zh/abs/faster-least-squares-approximation-0710.14352010-09-28 https://scifaro.com/en/abs/efficient-optimally-lazy-algorithms-for-minimal-interval-semantics-0710.15252016-08-12 https://scifaro.com/zh/abs/efficient-optimally-lazy-algorithms-for-minimal-interval-semantics-0710.15252016-08-12 https://scifaro.com/en/abs/sleeping-on-the-job-energy-efficient-broadcast-for-radio-networks-0710.25322007-10-15 https://scifaro.com/zh/abs/sleeping-on-the-job-energy-efficient-broadcast-for-radio-networks-0710.25322007-10-15 https://scifaro.com/en/abs/bloom-maps-0710.32462007-10-18 https://scifaro.com/zh/abs/bloom-maps-0710.32462007-10-18 https://scifaro.com/en/abs/on-the-complexity-of-spill-everywhere-under-ssa-form-0710.36422009-09-18 https://scifaro.com/zh/abs/on-the-complexity-of-spill-everywhere-under-ssa-form-0710.36422009-09-18 https://scifaro.com/en/abs/a-multi-level-blocking-distinct-degree-factorization-algorithm-0710.44102010-04-20 https://scifaro.com/zh/abs/a-multi-level-blocking-distinct-degree-factorization-algorithm-0710.44102010-04-20 https://scifaro.com/en/abs/a-tutorial-on-spectral-clustering-0711.01892007-11-02 https://scifaro.com/zh/abs/a-tutorial-on-spectral-clustering-0711.01892007-11-02 https://scifaro.com/en/abs/faster-algorithms-for-online-topological-ordering-0711.02512007-11-05 https://scifaro.com/zh/abs/faster-algorithms-for-online-topological-ordering-0711.02512007-11-05 https://scifaro.com/en/abs/data-structures-for-mergeable-trees-0711.16822007-11-13 https://scifaro.com/zh/abs/data-structures-for-mergeable-trees-0711.16822007-11-13 https://scifaro.com/en/abs/on-approximating-multi-criteria-tsp-0711.21572011-07-14 https://scifaro.com/en/abs/minimum-weight-double-tree-shortcutting-for-metric-tsp-bounding-the-approximation-ratio-0711.23992008-12-30 https://scifaro.com/en/abs/computing-the-tutte-polynomial-in-vertex-exponential-time-0711.25852008-04-14 https://scifaro.com/en/abs/finding-a-feasible-flow-in-a-strongly-connected-network-0711.27102007-12-03 https://scifaro.com/en/abs/improved-fully-dynamic-reachability-algorithm-for-directed-graph-0711.32502007-11-22 https://scifaro.com/en/abs/approximation-algorithms-for-restless-bandit-problems-0711.38612009-02-03 https://scifaro.com/en/abs/an-fpt-algorithm-for-directed-spanning-k-leaf-0711.40522007-11-27 https://scifaro.com/en/abs/a-note-on-computing-set-overlap-classes-0711.45732007-11-29 https://scifaro.com/en/abs/approximation-algorithms-for-orienteering-with-time-windows-0711.48252007-12-03 https://scifaro.com/en/abs/circumspect-descent-prevails-in-solving-random-constraint-satisfaction-problems-0711.49022009-11-13 https://scifaro.com/en/abs/efficient-modularity-optimization-by-multistep-greedy-algorithm-and-vertex-mover-refinement-0712.11632008-05-02 https://scifaro.com/en/abs/approximation-algorithms-for-the-highway-problem-under-the-coupon-model-0712.26292011-09-29 https://scifaro.com/en/abs/an-approximation-ratio-for-biclustering-0712.26822008-08-22 https://scifaro.com/en/abs/solving-medium-density-subset-sum-problems-in-expected-polynomial-time-an-enumeration-approach-0712.32032008-06-23 https://scifaro.com/en/abs/on-the-approximability-of-the-vertex-cover-and-related-problems-0712.33332007-12-21 https://scifaro.com/en/abs/a-polynomial-time-frac-3-2-approximation-algorithm-for-the-vertex-cover-problem-on-a-class-of-graphs-0712.33352007-12-21 https://scifaro.com/en/abs/compressed-text-indexes-from-theory-to-practice-0712.33602007-12-21 https://scifaro.com/en/abs/a-partition-based-relaxation-for-steiner-trees-0712.35682007-12-24 https://scifaro.com/en/abs/bottleneck-flows-in-networks-0712.38582007-12-27 https://scifaro.com/en/abs/explicit-non-adaptive-combinatorial-group-testing-schemes-0712.38762008-04-29 https://scifaro.com/en/abs/lagrangian-relaxation-and-partial-cover-0712.39362007-12-27 https://scifaro.com/en/abs/almost-2-sat-is-fixed-parameter-tractable-0801.13002008-04-18 https://scifaro.com/en/abs/minimum-leaf-out-branching-and-related-problems-0801.19792008-10-14 https://scifaro.com/en/abs/a-nearly-linear-time-ptas-for-explicit-fractional-packing-and-covering-linear-programs-0801.19872015-06-02 https://scifaro.com/en/abs/string-algorithms-and-data-structures-0801.23782008-01-16 https://scifaro.com/en/abs/from-k-sat-to-k-csp-two-generalized-algorithms-0801.31472008-01-22 https://scifaro.com/en/abs/picking-up-the-pieces-self-healing-in-reconfigurable-networks-0801.37102016-11-17 https://scifaro.com/en/abs/algorithms-for-temperature-aware-task-scheduling-in-microprocessor-systems-0801.42382008-01-29 https://scifaro.com/en/abs/improved-deterministic-length-reduction-0802.00172008-02-04 https://scifaro.com/en/abs/on-approximating-frequency-moments-of-data-streams-with-skewed-projections-0802.08022008-02-07 https://scifaro.com/en/abs/bit-optimal-lempel-ziv-compression-0802.08352008-02-07 https://scifaro.com/en/abs/an-empirical-study-of-cache-oblivious-priority-queues-and-their-application-to-the-shortest-path-problem-0802.10262008-02-08 https://scifaro.com/en/abs/average-case-analysis-of-online-topological-ordering-0802.10592008-02-08 https://scifaro.com/en/abs/minimum-entropy-orientations-0802.12372008-10-28 https://scifaro.com/en/abs/approximating-general-metric-distances-between-a-pattern-and-a-text-0802.14272008-02-12 https://scifaro.com/en/abs/error-correcting-data-structures-0802.14712008-12-01 https://scifaro.com/en/abs/generalized-whac-a-mole-0802.16852016-09-08 https://scifaro.com/en/abs/parameterized-algorithms-for-partial-cover-problems-0802.17222008-02-14 https://scifaro.com/en/abs/domination-in-graphs-with-bounded-propagation-algorithms-formulations-and-hardness-results-0802.21302008-02-18 https://scifaro.com/en/abs/set-covering-problems-with-general-objective-functions-0802.21842008-02-18 https://scifaro.com/en/abs/min-cost-2-connected-subgraphs-with-k-terminals-0802.25282008-02-19 https://scifaro.com/en/abs/the-isomorphism-problem-for-planar-3-connected-graphs-is-in-unambiguous-logspace-0802.28252008-02-21 https://scifaro.com/en/abs/design-by-measure-and-conquer-a-faster-exact-algorithm-for-dominating-set-0802.28272008-02-21 https://scifaro.com/en/abs/understanding-maximal-repetitions-in-strings-0802.28292008-02-21 https://scifaro.com/en/abs/rent-lease-or-buy-randomized-algorithms-for-multislope-ski-rental-0802.28322008-02-21 https://scifaro.com/en/abs/trimmed-moebius-inversion-and-graphs-of-bounded-degree-0802.28342008-02-21 https://scifaro.com/en/abs/minimizing-flow-time-in-the-wireless-gathering-problem-0802.28362019-07-01 https://scifaro.com/en/abs/factoring-polynomials-over-finite-fields-using-balance-test-0802.28382008-02-21 https://scifaro.com/en/abs/stackelberg-network-pricing-games-0802.28412008-02-21 https://scifaro.com/en/abs/shortest-vertex-disjoint-two-face-paths-in-planar-graphs-0802.28452008-02-21 https://scifaro.com/en/abs/geodesic-fr-echet-distance-inside-a-simple-polygon-0802.28462008-05-21 https://scifaro.com/en/abs/on-dynamic-breadth-first-search-in-external-memory-0802.28472008-02-21 https://scifaro.com/en/abs/deterministically-isolating-a-perfect-matching-in-bipartite-planar-graphs-0802.28502008-02-21 https://scifaro.com/en/abs/an-improved-randomized-truthful-mechanism-for-scheduling-unrelated-machines-0802.28512008-02-21 https://scifaro.com/en/abs/tight-bounds-for-blind-search-on-the-integers-0802.28522008-02-21 https://scifaro.com/en/abs/computing-minimum-spanning-trees-with-uncertainty-0802.28552008-02-21 https://scifaro.com/en/abs/convergence-thresholds-of-newton-s-method-for-monotone-polynomial-equations-0802.28562008-02-29 https://scifaro.com/en/abs/on-geometric-spanners-of-euclidean-and-unit-disk-graphs-0802.28642008-02-21 https://scifaro.com/en/abs/fixed-parameter-polynomial-time-algorithms-for-maximum-agreement-and-compatible-supertrees-0802.28672008-02-21 https://scifaro.com/en/abs/deriving-sorting-algorithms-0802.38812008-02-27 https://scifaro.com/en/abs/networks-become-navigable-as-nodes-move-and-forget-0803.02482008-03-04 https://scifaro.com/en/abs/stream-sampling-for-variance-optimal-estimation-of-subset-sums-0803.04732010-11-16 https://scifaro.com/en/abs/spanning-directed-trees-with-many-leaves-0803.07012008-03-06 https://scifaro.com/en/abs/a-quadratic-algorithm-for-road-coloring-0803.07262013-05-31 https://scifaro.com/en/abs/incremental-topological-ordering-and-strong-component-maintenance-0803.07922008-03-07 https://scifaro.com/en/abs/graph-sparsification-by-effective-resistances-0803.09292009-11-18 https://scifaro.com/en/abs/faster-approximate-lossy-generalized-flow-via-interior-point-algorithms-0803.09882008-04-07 https://scifaro.com/en/abs/treewidth-computation-and-extremal-combinatorics-0803.13212008-05-05 https://scifaro.com/en/abs/local-approximation-schemes-for-topology-control-0803.21742008-03-17 https://scifaro.com/en/abs/rapport-de-recherche-sur-le-probl-eme-du-plus-court-chemin-contraint-0803.26152008-12-18 https://scifaro.com/en/abs/admission-control-to-minimize-rejections-and-online-set-cover-with-repetitions-0803.28422008-12-18 https://scifaro.com/en/abs/a-new-upper-bound-for-max-2-sat-a-graph-theoretic-approach-0803.35312008-12-18 https://scifaro.com/en/abs/succinct-data-structures-for-retrieval-and-approximate-membership-0803.36932008-03-27 https://scifaro.com/en/abs/on-two-dimensional-orthogonal-knapsack-problem-0803.42602008-12-18 https://scifaro.com/en/abs/from-random-graph-to-small-world-by-wandering-0804.01492008-12-18 https://scifaro.com/en/abs/mapping-semantic-networks-to-undirected-networks-0804.02772008-12-02 https://scifaro.com/en/abs/a-parameterized-perspective-on-p-2-packings-0804.05702008-12-18 https://scifaro.com/en/abs/a-memetic-algorithm-for-the-generalized-traveling-salesman-problem-0804.07222010-03-30 https://scifaro.com/en/abs/generalized-traveling-salesman-problem-reduction-algorithms-0804.07352010-03-30 https://scifaro.com/en/abs/cache-oblivious-selection-in-sorted-x-y-matrices-0804.09362008-04-08 https://scifaro.com/en/abs/optimum-binary-search-trees-on-the-hierarchical-memory-model-0804.09402008-04-08 https://scifaro.com/en/abs/adaptive-dynamics-of-realistic-small-world-networks-0804.11152008-04-08 https://scifaro.com/en/abs/approximating-l1-distances-between-mixture-distributions-using-random-projections-0804.11702008-04-09 https://scifaro.com/en/abs/information-acquisition-and-exploitation-in-multichannel-wireless-networks-0804.17242008-04-11 https://scifaro.com/en/abs/an-optimal-bloom-filter-replacement-based-on-matrix-solving-0804.18452008-04-14 https://scifaro.com/en/abs/tight-bounds-and-faster-algorithms-for-directed-max-leaf-problems-0804.20322008-12-18 https://scifaro.com/en/abs/truthful-unsplittable-flow-for-large-capacity-networks-0804.21122008-12-18 https://scifaro.com/en/abs/parameterized-low-distortion-embeddings-graph-metrics-into-lines-and-trees-0804.30282008-04-21 https://scifaro.com/en/abs/minimum-energy-broadcast-in-random-grid-ad-hoc-networks-approximation-and-distributed-algorithms-0804.39022008-04-25 https://scifaro.com/en/abs/time-dependent-contraction-hierarchies-basic-algorithmic-ideas-0804.39472008-12-18 https://scifaro.com/en/abs/sketching-and-streaming-entropy-via-approximation-theory-0804.41382008-12-18 https://scifaro.com/en/abs/the-minimum-backlog-problem-0804.48192016-03-24 https://scifaro.com/en/abs/search-space-contraction-in-canonical-labeling-of-graphs-0804.48812015-03-13 https://scifaro.com/en/abs/algorithms-for-probabilistically-constrained-models-of-risk-averse-stochastic-optimization-with-black-box-distributions-0805.03892008-05-06 https://scifaro.com/en/abs/bounds-for-self-stabilization-in-unidirectional-networks-0805.08512009-09-29 https://scifaro.com/en/abs/submodular-approximation-sampling-based-algorithms-and-lower-bounds-0805.10712010-06-02 https://scifaro.com/en/abs/searching-for-frequent-colors-in-rectangles-0805.13482008-05-12 https://scifaro.com/en/abs/a-simple-in-place-algorithm-for-in-shuffle-0805.15982008-05-13 https://scifaro.com/en/abs/napx-a-polynomial-time-approximation-scheme-for-the-noah-s-ark-problem-0805.16612008-10-27 https://scifaro.com/en/abs/sequential-design-of-experiments-via-linear-programming-0805.26302013-06-19 https://scifaro.com/en/abs/small-approximate-pareto-sets-for-bi-objective-shortest-paths-and-other-problems-0805.26462008-05-20 https://scifaro.com/en/abs/finger-indexed-sets-new-approaches-0805.26712008-12-18 https://scifaro.com/en/abs/balanced-families-of-perfect-hash-functions-and-their-applications-0805.43002008-12-18 https://scifaro.com/en/abs/a-dynamic-programming-framework-for-combinatorial-optimization-problems-on-graphs-with-bounded-pathwidth-0806.08402012-12-18 https://scifaro.com/en/abs/drawing-binary-tanglegrams-an-experimental-evaluation-0806.09282009-05-15 https://scifaro.com/en/abs/a-comparison-of-performance-measures-for-online-algorithms-0806.09832012-10-15 https://scifaro.com/en/abs/fast-arithmetics-using-chinese-remaindering-0806.17222008-06-11 https://scifaro.com/en/abs/tight-bounds-for-hashing-block-sources-0806.19482008-06-12 https://scifaro.com/en/abs/max-cut-and-the-smallest-eigenvalue-0806.19782008-12-08 https://scifaro.com/en/abs/approximately-counting-embeddings-into-random-graphs-0806.22872019-02-20 https://scifaro.com/en/abs/local-search-heuristics-for-the-multidimensional-assignment-problem-0806.32582015-02-24 https://scifaro.com/en/abs/approximating-multi-criteria-max-tsp-0806.36682008-12-18 https://scifaro.com/en/abs/optimal-scheduling-of-file-transfers-with-divisible-sizes-on-multiple-disjoint-paths-0806.38272012-12-21 https://scifaro.com/en/abs/a-comparison-of-two-approaches-for-polynomial-time-algorithms-computing-basic-graph-parameters-0806.40732008-12-18 https://scifaro.com/en/abs/space-efficient-multi-dimensional-range-reporting-0806.43612009-04-24 https://scifaro.com/en/abs/the-1-fixed-endpoint-path-cover-problem-is-polynomial-on-interval-graph-0806.43722008-12-18 https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-random-instances-of-weighted-d-cnf-satisfiability-0806.46522008-12-18 https://scifaro.com/en/abs/linear-time-algorithms-for-finding-a-dominating-set-of-fixed-size-in-degenerated-graphs-0806.47352008-12-18 https://scifaro.com/en/abs/ams-without-4-wise-independence-on-product-domains-0806.47902010-02-03 https://scifaro.com/en/abs/a-dynamic-programming-approach-to-length-limited-huffman-coding-0806.48992008-07-01 https://scifaro.com/en/abs/range-medians-0807.02222008-07-02 https://scifaro.com/en/abs/greedy-d-approximation-algorithm-for-covering-with-arbitrary-constraints-and-submodular-cost-0807.06442015-06-02 https://scifaro.com/en/abs/bloomier-filters-a-second-look-0807.09282008-07-08 https://scifaro.com/en/abs/algorithms-for-secretary-problems-on-graphs-and-hypergraphs-0807.11392008-07-09 https://scifaro.com/en/abs/online-scheduling-to-minimize-the-maximum-delay-factor-0807.18912008-07-14 https://scifaro.com/en/abs/derandomizing-the-lovasz-local-lemma-more-effectively-0807.21202008-09-15 https://scifaro.com/en/abs/optimal-acyclic-hamiltonian-path-completion-for-outerplanar-triangulated-st-digraphs-with-application-to-upward-topological-book-embeddings-0807.23302008-07-25 https://scifaro.com/en/abs/algorithms-for-scheduling-weighted-packets-with-deadlines-in-a-bounded-queue-0807.26942009-02-09 https://scifaro.com/en/abs/the-rank-convergence-of-hits-can-be-slow-0807.30062008-07-21 https://scifaro.com/en/abs/finding-paths-of-length-k-in-o-2-k-time-0807.30262010-01-05 https://scifaro.com/en/abs/improved-algorithms-for-approximate-string-matching-extended-abstract-0807.43682008-07-29 https://scifaro.com/en/abs/lower-bounds-for-embedding-into-distributions-over-excluded-minor-graph-families-0807.45822008-07-30 https://scifaro.com/en/abs/approximate-kernel-clustering-0807.46262008-12-09 https://scifaro.com/en/abs/finding-dense-subgraphs-in-g-n-1-2-0807.51112008-09-22 https://scifaro.com/en/abs/eigenvalue-bounds-spectral-partitioning-and-metrical-deformations-via-flows-0808.01482008-08-09 https://scifaro.com/en/abs/twice-ramanujan-sparsifiers-0808.01632024-06-01 https://scifaro.com/en/abs/declarative-combinatorics-boolean-functions-circuit-synthesis-and-bdds-in-haskell-0808.07602008-08-07 https://scifaro.com/en/abs/on-complexity-of-minimum-leaf-out-branching-problem-0808.09802008-08-08 https://scifaro.com/en/abs/cache-oblivious-storage-and-access-heuristics-for-blocked-matrix-matrix-multiplication-0808.11082008-08-15 https://scifaro.com/en/abs/dynamic-connectivity-connecting-to-networks-and-geometry-0808.11282008-08-11 https://scifaro.com/en/abs/minimum-dissatisfaction-personnel-scheduling-0808.12462013-01-22 https://scifaro.com/en/abs/the-optimal-quantile-estimator-for-compressed-counting-0808.17662008-08-14 https://scifaro.com/en/abs/a-very-efficient-scheme-for-estimating-entropy-of-data-streams-using-compressed-counting-0808.17712008-08-21 https://scifaro.com/en/abs/transitive-closure-spanners-0808.17872008-08-14 https://scifaro.com/en/abs/nearly-tight-low-stretch-spanning-trees-0808.20172008-08-15 https://scifaro.com/en/abs/better-bounds-for-frequency-moments-in-random-order-streams-0808.22222008-08-19 https://scifaro.com/en/abs/on-the-monotonicity-of-work-function-in-k-server-conjecture-0808.31972008-08-26 https://scifaro.com/en/abs/efficient-algorithms-for-the-basis-of-finite-abelian-groups-0808.33312008-08-26 https://scifaro.com/en/abs/spectral-sparsification-of-graphs-0808.41342010-07-22 https://scifaro.com/en/abs/canonical-coin-systems-for-change-making-problems-0809.04002009-03-21 https://scifaro.com/en/abs/stochastic-combinatorial-optimization-under-probabilistic-constraints-0809.04602008-09-03 https://scifaro.com/en/abs/minkowski-sum-selection-and-finding-0809.11712008-09-09 https://scifaro.com/en/abs/improved-smoothed-analysis-of-the-k-means-method-0809.17152008-09-11 https://scifaro.com/en/abs/characterization-of-the-errors-of-the-fmm-in-particle-simulations-0809.18102011-09-21 https://scifaro.com/en/abs/thinking-twice-about-second-price-ad-auctions-0809.18952008-09-12 https://scifaro.com/en/abs/fast-c-k-r-partitions-of-sparse-graphs-0809.19022009-09-09 https://scifaro.com/en/abs/betweenness-centrality-algorithms-and-lower-bounds-0809.19062008-10-19 https://scifaro.com/en/abs/low-congestion-online-routing-and-an-improved-mistake-bound-for-online-prediction-of-graph-labeling-0809.20752008-09-12 https://scifaro.com/en/abs/algorithms-for-locating-constrained-optimal-intervals-0809.20972008-09-15 https://scifaro.com/en/abs/the-fast-intersection-transform-with-applications-to-counting-paths-0809.24892008-09-16 https://scifaro.com/en/abs/simpler-analyses-of-local-search-algorithms-for-facility-location-0809.25542008-09-16 https://scifaro.com/en/abs/single-source-shortest-paths-in-h-minor-free-graphs-0809.29702008-09-18 https://scifaro.com/en/abs/a-local-clustering-algorithm-for-massive-graphs-and-its-application-to-nearly-linear-time-graph-partitioning-0809.32322008-09-19 https://scifaro.com/en/abs/inferring-company-structure-from-limited-available-information-0809.35272012-12-27 https://scifaro.com/en/abs/locating-restricted-facilities-on-binary-maps-0809.35282013-01-31 https://scifaro.com/en/abs/approximating-acyclicity-parameters-of-sparse-hypergraphs-0809.36462008-09-23 https://scifaro.com/en/abs/multistep-greedy-algorithm-identifies-community-structure-in-real-world-and-computer-generated-networks-0809.43982008-09-26 https://scifaro.com/en/abs/a-generic-top-down-dynamic-programming-approach-to-prefix-free-coding-0809.45772008-09-29 https://scifaro.com/en/abs/multi-armed-bandits-in-metric-spaces-0809.48822008-09-30 https://scifaro.com/en/abs/acerca-del-algoritmo-de-dijkstra-0810.00752008-10-02 https://scifaro.com/en/abs/a-fast-generic-sequence-matching-algorithm-0810.02642008-10-02 https://scifaro.com/en/abs/the-ratio-index-for-budgeted-learning-with-applications-0810.05582016-04-12 https://scifaro.com/en/abs/packing-multiway-cuts-in-capacitated-graphs-0810.06742008-10-06 https://scifaro.com/en/abs/a-linear-time-algorithm-for-l-2-1-labeling-of-trees-0810.09062010-11-25 https://scifaro.com/en/abs/community-structure-in-large-networks-natural-cluster-sizes-and-the-absence-of-large-well-defined-clusters-0810.13552008-10-13 https://scifaro.com/en/abs/identifying-almost-sorted-permutations-from-tcp-buffer-dynamics-0810.16392008-11-04 https://scifaro.com/en/abs/near-optimal-radio-use-for-wireless-network-synchronization-0810.17562012-02-15 https://scifaro.com/en/abs/efficient-pattern-matching-on-binary-strings-0810.23902008-10-15 https://scifaro.com/en/abs/watermarking-digital-images-based-on-a-content-based-image-retrieval-technique-0810.30582009-09-29 https://scifaro.com/en/abs/efficient-algorithms-and-routing-protocols-for-handling-transient-single-node-failures-0810.34382008-10-21 https://scifaro.com/en/abs/a-new-distance-for-high-level-rna-secondary-structure-comparison-0810.40022008-10-23 https://scifaro.com/en/abs/kernel-s-for-problems-with-no-kernel-on-out-trees-with-many-leaves-0810.47962008-11-06 https://scifaro.com/en/abs/a-constructive-proof-of-the-lovasz-local-lemma-0810.48122008-10-29 https://scifaro.com/en/abs/exponential-time-approximation-of-hard-problems-0810.49342008-10-29 https://scifaro.com/en/abs/fpt-algorithms-and-kernels-for-the-directed-k-leaf-problem-0810.49462009-08-18 https://scifaro.com/en/abs/lower-bounds-for-distributed-markov-chain-problems-0810.52632008-10-30 https://scifaro.com/en/abs/worst-case-time-decremental-connectivity-and-k-edge-witness-0810.54772008-10-31 https://scifaro.com/en/abs/algorithmic-techniques-for-several-optimization-problems-regarding-distributed-systems-with-tree-topologies-0811.13352009-03-21 https://scifaro.com/en/abs/exact-exponential-time-algorithms-for-max-internal-spanning-tree-0811.18752009-06-12 https://scifaro.com/en/abs/perfect-matchings-via-uniform-sampling-in-regular-bipartite-graphs-0811.24572008-11-18 https://scifaro.com/en/abs/phase-transition-for-local-search-on-planted-sat-0811.25462008-11-18 https://scifaro.com/en/abs/an-efficient-algorithm-for-partial-order-production-0811.25722010-05-06 https://scifaro.com/en/abs/generating-random-networks-without-short-cycles-0811.28532018-01-01 https://scifaro.com/en/abs/dynamic-external-hashing-the-limit-of-buffering-0811.30622008-11-20 https://scifaro.com/en/abs/linear-time-approximation-schemes-for-the-gale-berlekamp-game-and-related-minimization-problems-0811.32442008-11-21 https://scifaro.com/en/abs/an-experimental-analysis-of-lemke-howson-algorithm-0811.32472008-11-21 https://scifaro.com/en/abs/binar-sort-a-linear-generalized-sorting-algorithm-0811.34482011-05-18 https://scifaro.com/en/abs/binar-shuffle-algorithm-shuffling-bit-by-bit-0811.34492008-11-24 https://scifaro.com/en/abs/faster-approximate-string-matching-for-short-patterns-0811.34902011-03-21 https://scifaro.com/en/abs/low-memory-adaptive-prefix-coding-0811.36022008-11-24 https://scifaro.com/en/abs/revisiting-norm-estimation-in-data-streams-0811.36482009-04-09 https://scifaro.com/en/abs/tight-approximation-ratio-of-a-general-greedy-splitting-algorithm-for-the-minimum-k-way-cut-problem-0811.37232008-11-25 https://scifaro.com/en/abs/communication-efficiency-in-self-stabilizing-silent-protocols-0811.37602008-11-25 https://scifaro.com/en/abs/finding-sparse-cuts-locally-using-evolving-sets-0811.37792008-11-25 https://scifaro.com/en/abs/dynamic-indexability-the-query-update-tradeoff-for-one-dimensional-range-queries-0811.43462008-11-27 https://scifaro.com/en/abs/how-robust-is-quicksort-average-complexity-0811.43762016-11-27 https://scifaro.com/en/abs/fast-and-quality-guaranteed-data-streaming-in-resource-constrained-sensor-networks-0811.46722008-12-01 https://scifaro.com/en/abs/compact-labelings-for-efficient-first-order-model-checking-0811.47132014-07-09 https://scifaro.com/en/abs/lower-bounds-on-performance-of-metric-tree-indexing-schemes-for-exact-similarity-search-in-high-dimensions-0812.01462013-03-27 https://scifaro.com/en/abs/optimal-tracking-of-distributed-heavy-hitters-and-quantiles-0812.02092008-12-02 https://scifaro.com/en/abs/stackelberg-network-pricing-is-hard-to-approximate-0812.03202011-03-07 https://scifaro.com/en/abs/approximation-algorithms-for-bregman-co-clustering-and-tensor-clustering-0812.03892009-11-09 https://scifaro.com/en/abs/adaptive-uncertainty-resolution-in-bayesian-combinatorial-optimization-problems-0812.10122010-01-28 https://scifaro.com/en/abs/improved-approximation-for-the-number-of-hamiltonian-cycles-in-dense-digraphs-0812.11232009-11-23 https://scifaro.com/en/abs/fast-phylogeny-reconstruction-through-learning-of-ancestral-sequences-0812.15872008-12-10 https://scifaro.com/en/abs/accelerated-data-flow-analysis-0812.20112008-12-11 https://scifaro.com/en/abs/convex-hull-of-arithmetic-automata-0812.20142008-12-11 https://scifaro.com/en/abs/characterizing-truthful-multi-armed-bandit-mechanisms-0812.22912013-06-05 https://scifaro.com/en/abs/efficient-isomorphism-testing-for-a-class-of-group-extensions-0812.22982021-10-05 https://scifaro.com/en/abs/learning-low-rank-matrices-from-o-n-entries-0812.25992008-12-16 https://scifaro.com/en/abs/approximating-the-least-hypervolume-contributor-np-hard-in-general-but-fast-in-practice-0812.26362015-03-13 https://scifaro.com/en/abs/optimal-succinctness-for-range-minimum-queries-0812.27752009-12-02 https://scifaro.com/en/abs/the-violation-heap-a-relaxed-fibonacci-like-heap-0812.28512010-02-11 https://scifaro.com/en/abs/minimax-trees-in-linear-time-0812.28682009-01-28 https://scifaro.com/en/abs/algorithmic-and-statistical-challenges-in-modern-large-scale-data-analysis-are-the-focus-of-mmds-2008-0812.37022008-12-22 https://scifaro.com/en/abs/pancake-flipping-with-two-spatulas-0812.39332009-05-04 https://scifaro.com/en/abs/comparing-rna-structures-using-a-full-set-of-biologically-relevant-edit-operations-is-intractable-0812.39462008-12-23 https://scifaro.com/en/abs/multi-level-algorithms-for-modularity-clustering-0812.40732009-09-22 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-column-subset-selection-problem-0812.42932015-03-13 https://scifaro.com/en/abs/an-o-k-3-log-n-approximation-algorithm-for-vertex-connectivity-survivable-network-design-0812.44422008-12-24 https://scifaro.com/en/abs/random-projections-for-the-nonnegative-least-squares-problem-0812.45472009-03-13 https://scifaro.com/en/abs/almost-stable-matchings-in-constant-time-0812.48932012-05-15 https://scifaro.com/en/abs/obtaining-a-planar-graph-by-vertex-deletion-0812.49192008-12-31 https://scifaro.com/en/abs/on-allocating-goods-to-maximize-fairness-0901.02052009-01-05 https://scifaro.com/en/abs/offline-algorithmic-techniques-for-several-content-delivery-problems-in-some-restricted-types-of-distributed-systems-0901.02902009-01-06 https://scifaro.com/en/abs/interprocedural-dataflow-analysis-over-weight-domains-with-infinite-descending-chains-0901.05012009-01-06 https://scifaro.com/en/abs/an-omega-n-log-n-lower-bound-for-computing-the-sum-of-even-ranked-elements-0901.09302009-03-23 https://scifaro.com/en/abs/on-profit-maximizing-pricing-for-the-highway-and-tollbooth-problems-0901.11402015-05-13 https://scifaro.com/en/abs/balanced-allocation-memory-performance-tradeoffs-0901.11552012-09-13 https://scifaro.com/en/abs/towards-optimal-range-medians-0901.17612009-01-14 https://scifaro.com/en/abs/on-some-simplicial-elimination-schemes-for-chordal-graphs-0901.26452009-02-17 https://scifaro.com/en/abs/an-overview-of-multiple-sequence-alignment-systems-0901.27472009-01-20 https://scifaro.com/en/abs/pyro-align-sample-align-based-multiple-alignment-system-for-pyrosequencing-reads-of-large-number-0901.27512009-01-20 https://scifaro.com/en/abs/online-validation-of-the-pi-and-pi-failure-functions-0901.28972009-09-30 https://scifaro.com/en/abs/an-o-log-n-fully-dynamic-algorithm-for-maximum-matching-in-a-tree-0901.29002009-01-20 https://scifaro.com/en/abs/nuclear-norm-minimization-for-the-planted-clique-and-biclique-problems-0901.33482009-01-22 https://scifaro.com/en/abs/max-edge-coloring-of-trees-0901.40022009-01-27 https://scifaro.com/en/abs/peer-to-peer-optimistic-collaborative-editing-on-xml-like-trees-0901.42012009-01-28 https://scifaro.com/en/abs/on-the-bit-complexity-of-sparse-polynomial-multiplication-0901.43232009-01-28 https://scifaro.com/en/abs/allsat-compressed-with-wildcards-all-or-all-maximum-independent-sets-0901.44172019-06-06 https://scifaro.com/en/abs/graph-sparsification-in-the-semi-streaming-model-0902.01402009-05-05 https://scifaro.com/en/abs/compressed-representations-of-permutations-and-applications-0902.10382009-02-09 https://scifaro.com/en/abs/on-the-average-complexity-of-moore-s-state-minimization-algorithm-0902.10482009-02-09 https://scifaro.com/en/abs/almost-uniform-sampling-of-points-on-high-dimensional-algebraic-varieties-0902.12542009-02-10 https://scifaro.com/en/abs/nonclairvoyant-speed-scaling-for-flow-and-energy-0902.12602009-02-10 https://scifaro.com/en/abs/an-approximation-algorithm-for-l-infty-fitting-robinson-structures-to-distances-0902.12612009-02-10 https://scifaro.com/en/abs/on-the-additive-constant-of-the-k-server-work-function-algorithm-0902.13782009-02-10 https://scifaro.com/en/abs/a-comparison-of-techniques-for-sampling-web-pages-0902.16042009-02-11 https://scifaro.com/en/abs/lower-bounds-for-multi-pass-processing-of-multiple-data-streams-0902.16052009-02-11 https://scifaro.com/en/abs/perfect-matchings-in-o-n-1-5-time-in-regular-bipartite-graphs-0902.16172009-07-30 https://scifaro.com/en/abs/fast-evaluation-of-interlace-polynomials-on-graphs-of-bounded-treewidth-0902.16932015-03-13 https://scifaro.com/en/abs/cover-time-and-broadcast-time-0902.17352009-02-11 https://scifaro.com/en/abs/optimal-cache-aware-suffix-selection-0902.17372009-02-11 https://scifaro.com/en/abs/correlation-robust-stochastic-optimization-0902.17922009-10-11 https://scifaro.com/en/abs/optimal-probabilistic-ring-exploration-by-asynchronous-oblivious-robots-0902.18342009-09-30 https://scifaro.com/en/abs/abstraction-and-refinement-in-static-model-checking-0902.18712009-02-12 https://scifaro.com/en/abs/online-scheduling-of-bounded-length-jobs-to-maximize-throughput-0902.22092009-04-14 https://scifaro.com/en/abs/the-forgiving-graph-a-distributed-data-structure-for-low-stretch-under-adversarial-attack-0902.25012012-08-08 https://scifaro.com/en/abs/more-haste-less-waste-lowering-the-redundancy-in-fully-indexable-dictionaries-0902.26482009-02-17 https://scifaro.com/en/abs/a-graph-reduction-step-preserving-element-connectivity-and-applications-0902.27952009-02-18 https://scifaro.com/en/abs/compact-ancestry-labeling-schemes-for-trees-of-small-depth-0902.30812009-02-19 https://scifaro.com/en/abs/parallel-machine-scheduling-with-precedence-constraints-and-setup-times-0902.31212009-02-19 https://scifaro.com/en/abs/a-fast-multigrid-algorithm-for-energy-minimization-under-planar-density-constraints-0902.32082009-02-19 https://scifaro.com/en/abs/pricing-strategies-for-viral-marketing-on-social-networks-0902.34852009-02-23 https://scifaro.com/en/abs/energy-efficient-shortest-path-algorithms-for-convergecast-in-sensor-networks-0902.35172009-02-23 https://scifaro.com/en/abs/treewidth-reduction-for-constrained-separation-and-bipartization-problems-0902.37802010-02-03 https://scifaro.com/en/abs/measuring-independence-of-datasets-0903.00342009-03-03 https://scifaro.com/en/abs/heaps-simplified-0903.01162009-03-03 https://scifaro.com/en/abs/a-polynomial-graph-extension-procedure-for-improving-graph-isomorphism-algorithms-0903.01362009-03-03 https://scifaro.com/en/abs/rotation-distance-is-fixed-parameter-tractable-0903.01972018-03-19 https://scifaro.com/en/abs/a-linear-time-approximation-algorithm-for-rotation-distance-0903.01992018-03-19 https://scifaro.com/en/abs/how-to-play-unique-games-on-expanders-0903.03672009-03-03 https://scifaro.com/en/abs/de-amortized-cuckoo-hashing-provable-worst-case-performance-and-experimental-results-0903.03912009-03-04 https://scifaro.com/en/abs/a-constructive-proof-of-the-general-lovasz-local-lemma-0903.05442009-05-21 https://scifaro.com/en/abs/algorithm-for-finding-k-vertex-out-trees-and-its-application-to-k-internal-out-branching-problem-0903.09382009-03-06 https://scifaro.com/en/abs/decomposition-reformulation-and-diving-in-university-course-timetabling-0903.10952014-04-10 https://scifaro.com/en/abs/deposition-and-extension-approach-to-find-longest-common-subsequence-for-multiple-sequences-0903.20152009-06-30 https://scifaro.com/en/abs/an-absolute-2-approximation-algorithm-for-two-dimensional-bin-packing-0903.22652009-03-16 https://scifaro.com/en/abs/analysis-of-the-relationships-among-longest-common-subsequences-shortest-common-supersequences-and-patterns-and-its-application-on-pattern-discovery-in-biological-sequences-0903.23102016-11-17 https://scifaro.com/en/abs/stabilizing-maximal-independent-set-in-unidirectional-networks-is-hard-0903.31062009-04-20 https://scifaro.com/en/abs/fault-tolerant-consensus-in-unknown-and-anonymous-networks-0903.34612009-03-23 https://scifaro.com/en/abs/string-comparison-by-transposition-networks-0903.35792009-03-23 https://scifaro.com/en/abs/algorithmic-solutions-to-some-transportation-optimization-problems-with-applications-in-the-metallurgical-industry-0903.36222009-03-24 https://scifaro.com/en/abs/pairing-heaps-with-costless-meld-0903.41302009-04-09 https://scifaro.com/en/abs/on-the-use-of-suffix-arrays-for-memory-efficient-lempel-ziv-data-compression-0903.42512016-11-17 https://scifaro.com/en/abs/differentially-private-combinatorial-optimization-0903.45102009-11-11 https://scifaro.com/en/abs/solving-dominating-set-in-larger-classes-of-graphs-fpt-algorithms-and-polynomial-kernels-0903.45212009-05-15 https://scifaro.com/en/abs/range-quantile-queries-another-virtue-of-wavelet-trees-0903.47262015-05-13 https://scifaro.com/en/abs/fast-fpt-algorithms-for-vertex-subset-and-vertex-partitioning-problems-using-neighborhood-unions-0903.47962011-03-10 https://scifaro.com/en/abs/sublinear-time-algorithms-for-earth-mover-s-distance-0904.02922009-04-03 https://scifaro.com/en/abs/incremental-deployment-of-network-monitors-based-on-group-betweenness-centrality-0904.03522020-10-05 https://scifaro.com/en/abs/thin-partitions-isoperimetric-inequalities-and-sampling-algorithms-for-some-nonconvex-families-0904.05832009-04-06 https://scifaro.com/en/abs/approximability-of-sparse-integer-programs-0904.08592010-02-09 https://scifaro.com/en/abs/a-program-to-determine-the-exact-competitive-ratio-of-list-s-batching-with-unit-jobs-0904.10022009-04-08 https://scifaro.com/en/abs/k-means-has-polynomial-smoothed-complexity-0904.11132009-08-07 https://scifaro.com/en/abs/the-distribution-and-deposition-algorithm-for-multiple-sequences-sets-0904.12422010-05-03 https://scifaro.com/en/abs/bounded-max-colorings-of-graphs-0904.17052009-04-13 https://scifaro.com/en/abs/a-near-optimal-algorithm-for-l1-difference-0904.20272009-04-15 https://scifaro.com/en/abs/crossing-optimal-acyclic-hp-completion-for-outerplanar-st-digraphs-0904.21292009-04-15 https://scifaro.com/en/abs/ptas-for-k-tour-cover-problem-on-the-plane-for-moderately-large-values-of-k-0904.25762009-04-20 https://scifaro.com/en/abs/new-branching-rules-improvements-on-independent-set-and-vertex-cover-in-sparse-graphs-0904.27122009-04-20 https://scifaro.com/en/abs/fast-computation-of-empirically-tight-bounds-for-the-diameter-of-massive-graphs-0904.27282009-09-30 https://scifaro.com/en/abs/approximate-counting-with-a-floating-point-counter-0904.30622009-08-24 https://scifaro.com/en/abs/counting-paths-and-packings-in-halves-0904.30932009-04-21 https://scifaro.com/en/abs/efficient-construction-of-neighborhood-graphs-by-the-multiple-sorting-method-0904.31512009-04-22 https://scifaro.com/en/abs/reconstructing-3-colored-grids-from-horizontal-and-vertical-projections-is-np-hard-0904.31692009-04-22 https://scifaro.com/en/abs/on-the-complexity-of-submodular-function-minimisation-on-diamonds-0904.31832009-04-22 https://scifaro.com/en/abs/on-evaluation-of-permanents-0904.32512009-04-22 https://scifaro.com/en/abs/on-the-complexity-of-searching-in-trees-average-case-minimization-0904.35032009-08-10 https://scifaro.com/en/abs/the-h-index-of-a-graph-and-its-application-to-dynamic-subgraph-statistics-0904.37412015-07-16 https://scifaro.com/en/abs/on-the-approximability-of-geometric-and-geographic-generalization-and-the-min-max-bin-covering-problem-0904.37562009-05-12 https://scifaro.com/en/abs/approximate-triangle-counting-0904.37612009-06-30 https://scifaro.com/en/abs/on-smoothed-analysis-of-quicksort-and-hoare-s-find-0904.38982009-04-27 https://scifaro.com/en/abs/approximation-algorithms-for-key-management-in-secure-multicast-0904.40612009-04-28 https://scifaro.com/en/abs/learning-character-strings-via-mastermind-queries-with-a-case-study-involving-mtdna-0904.44582016-11-15 https://scifaro.com/en/abs/dynamic-ftss-in-asynchronous-systems-the-case-of-unison-0904.46152011-02-11 https://scifaro.com/en/abs/discrepancy-sensitive-dynamic-fractional-cascading-dominated-maxima-searching-and-2-d-nearest-neighbors-in-any-minkowski-metric-0904.46702009-04-30 https://scifaro.com/en/abs/on-the-algorithmic-complexity-of-the-mastermind-game-with-black-peg-results-0904.49112009-05-13 https://scifaro.com/en/abs/optimal-embedding-into-star-metrics-0905.02832009-05-05 https://scifaro.com/en/abs/fully-functional-static-and-dynamic-succinct-trees-0905.07682010-09-27 https://scifaro.com/en/abs/improved-adaptive-group-testing-algorithms-with-applications-to-multiple-access-channels-and-dead-sensor-diagnosis-0905.19062009-05-13 https://scifaro.com/en/abs/fast-algorithms-for-min-independent-dominating-set-0905.19932015-05-13 https://scifaro.com/en/abs/quantum-algorithms-of-bio-molecular-solutions-for-the-clique-problem-on-a-quantum-computer-0905.20282009-05-14 https://scifaro.com/en/abs/curse-of-dimensionality-in-the-application-of-pivot-based-indexes-to-the-similarity-search-problem-0905.21412009-05-14 https://scifaro.com/en/abs/outlining-an-elegant-solver-for-3-sat-0905.22132011-04-12 https://scifaro.com/en/abs/the-rainbow-skip-graph-a-fault-tolerant-constant-degree-p2p-relay-structure-0905.22142009-05-15 https://scifaro.com/en/abs/a-new-self-stabilizing-minimum-spanning-tree-construction-with-loop-free-property-0905.22872016-11-25 https://scifaro.com/en/abs/random-tensors-and-planted-cliques-0905.23812015-05-13 https://scifaro.com/en/abs/two-snap-stabilizing-point-to-point-communication-protocols-in-message-switched-networks-0905.25402009-05-18 https://scifaro.com/en/abs/fast-and-compact-prefix-codes-0905.31072009-05-20 https://scifaro.com/en/abs/some-results-on-convex-greedy-embedding-conjecture-for-3-connected-planar-graphs-0905.38122015-05-13 https://scifaro.com/en/abs/supernova-a-novel-algorithm-for-graph-automorphism-calculations-0905.39272015-03-13 https://scifaro.com/en/abs/a-4-3-competitive-randomized-algorithm-for-online-scheduling-of-packets-with-agreeable-deadlines-0905.40682010-02-03 https://scifaro.com/en/abs/online-stochastic-matching-beating-1-1-e-0905.41002009-05-27 https://scifaro.com/en/abs/the-usefulness-of-multilevel-hash-tables-with-multiple-hash-functions-in-large-databases-0905.42012009-05-27 https://scifaro.com/en/abs/approximation-algorithms-for-the-traveling-repairman-and-speeding-deliveryman-problems-0905.44442009-05-28 https://scifaro.com/en/abs/analysis-of-sorting-algorithms-by-kolmogorov-complexity-a-survey-0905.44522009-05-28 https://scifaro.com/en/abs/representations-of-stream-processors-using-nested-fixed-points-0905.48132015-07-01 https://scifaro.com/en/abs/improved-approximation-algorithms-for-segment-minimization-in-intensity-modulated-radiation-therapy-0905.49302011-09-27 https://scifaro.com/en/abs/a-survey-of-tree-convex-sets-test-0906.02052009-06-03 https://scifaro.com/en/abs/rivisiting-token-bucket-algorithms-in-new-applications-0906.03282009-06-02 https://scifaro.com/en/abs/towards-a-centralized-scheduling-framework-for-communication-flows-in-distributed-systems-0906.03502009-06-02 https://scifaro.com/en/abs/offline-algorithms-for-several-network-design-clustering-and-qos-optimization-problems-0906.03762009-06-03 https://scifaro.com/en/abs/curse-of-dimensionality-in-pivot-based-indexes-0906.03912016-11-17 https://scifaro.com/en/abs/a-new-upper-bound-on-2d-online-bin-packing-0906.04092009-06-03 https://scifaro.com/en/abs/a-memetic-algorithm-for-the-multidimensional-assignment-problem-0906.08622010-03-30 https://scifaro.com/en/abs/efficient-algorithms-for-several-constrained-activity-scheduling-problems-in-the-time-and-space-domains-0906.13412009-06-09 https://scifaro.com/en/abs/efficient-algorithms-for-several-constrained-resource-allocation-management-and-discovery-problems-0906.13432009-06-09 https://scifaro.com/en/abs/a-probabilistic-approach-to-problems-parameterized-above-or-below-tight-bounds-0906.13562009-08-18 https://scifaro.com/en/abs/fixed-parameter-algorithms-in-analysis-of-heuristics-for-extracting-networks-in-linear-programs-0906.13592010-03-30 https://scifaro.com/en/abs/uniform-unweighted-set-cover-the-power-of-non-oblivious-local-search-0906.15572009-06-09 https://scifaro.com/en/abs/a-randomized-algorithm-for-3-sat-0906.18492020-08-11 https://scifaro.com/en/abs/an-exponential-time-2-approximation-algorithm-for-bandwidth-0906.19532012-05-01 https://scifaro.com/en/abs/scheduling-with-outliers-0906.20202015-05-13 https://scifaro.com/en/abs/minimizing-maximum-response-time-and-delay-factor-in-broadcast-scheduling-0906.20482009-06-12 https://scifaro.com/en/abs/longest-wait-first-for-broadcast-scheduling-0906.23952009-06-15 https://scifaro.com/en/abs/the-limit-of-convexity-based-isoperimetry-sampling-harmonic-concave-functions-0906.24482009-06-16 https://scifaro.com/en/abs/oscillations-and-random-perturbations-of-a-fitzhugh-nagumo-system-0906.26712009-06-16 https://scifaro.com/en/abs/data-structures-for-approximate-range-counting-0906.27382009-10-05 https://scifaro.com/en/abs/approximating-scheduling-machines-with-capacity-constraints-0906.30562009-06-18 https://scifaro.com/en/abs/efficient-offline-algorithmic-techniques-for-several-packet-routing-problems-in-distributed-systems-0906.34832009-06-19 https://scifaro.com/en/abs/optimal-constrained-resource-allocation-strategies-under-low-risk-circumstances-0906.34902009-06-19 https://scifaro.com/en/abs/a-universally-fastest-algorithm-for-max-2-sat-max-2-csp-and-everything-in-between-0906.35272009-06-22 https://scifaro.com/en/abs/on-optimally-partitioning-a-text-to-improve-its-compression-0906.46922009-06-26 https://scifaro.com/en/abs/sharp-kernel-clustering-algorithms-and-their-associated-grothendieck-inequalities-0906.48162009-06-29 https://scifaro.com/en/abs/testing-cycle-freeness-finding-a-certificate-0906.50102009-06-30 https://scifaro.com/en/abs/afptas-results-for-common-variants-of-bin-packing-a-new-method-to-handle-the-small-items-0906.50502012-02-16 https://scifaro.com/en/abs/bin-packing-with-general-cost-structures-0906.50512009-06-30 https://scifaro.com/en/abs/geometrical-interpretation-of-the-master-theorem-for-divide-and-conquer-recurrences-0906.50622016-09-08 https://scifaro.com/en/abs/integrating-genetic-algorithm-tabu-search-approach-for-job-shop-scheduling-0906.50702009-06-30 https://scifaro.com/en/abs/comparing-and-aggregating-partially-resolved-trees-0906.50892009-06-30 https://scifaro.com/en/abs/improved-approximation-guarantees-for-weighted-matching-in-the-semi-streaming-model-0907.03052012-02-16 https://scifaro.com/en/abs/a-randomized-sublinear-time-parallel-gcd-algorithm-for-the-erew-pram-0907.07182010-01-15 https://scifaro.com/en/abs/asymmetric-traveling-salesman-path-and-directed-latency-problems-0907.07262010-06-03 https://scifaro.com/en/abs/tight-bounds-for-online-stable-sorting-0907.07412009-07-07 https://scifaro.com/en/abs/deterministic-polynomial-time-algorithms-for-matrix-completion-problems-0907.07742014-07-11 https://scifaro.com/en/abs/self-improving-algorithms-0907.08842011-05-30 https://scifaro.com/en/abs/a-lower-bound-for-succinct-rank-queries-0907.11032009-07-08 https://scifaro.com/en/abs/online-sorting-via-searching-and-selection-0907.12952009-09-30 https://scifaro.com/en/abs/towards-an-o-sqrt-3-log-n-approximation-algorithm-for-sc-balanced-separator-0907.13692009-07-10 https://scifaro.com/en/abs/classified-stable-matching-0907.17792009-10-25 https://scifaro.com/en/abs/a-ptas-for-the-minimum-consensus-clustering-problem-with-a-fixed-number-of-clusters-0907.18402009-07-13 https://scifaro.com/en/abs/randomised-buffer-management-with-bounded-delay-against-adaptive-adversary-0907.20502011-02-09 https://scifaro.com/en/abs/layered-working-set-trees-0907.20712009-07-14 https://scifaro.com/en/abs/on-the-maximal-number-of-highly-periodic-runs-in-a-string-0907.21572009-07-14 https://scifaro.com/en/abs/kernels-for-feedback-arc-set-in-tournaments-0907.21652009-10-29 https://scifaro.com/en/abs/bounded-delay-packet-scheduling-in-a-bounded-buffer-0907.27412009-07-17 https://scifaro.com/en/abs/fast-searching-in-packed-strings-0907.31352010-09-08 https://scifaro.com/en/abs/a-linear-vertex-kernel-for-maximum-internal-spanning-tree-0907.32082012-03-06 https://scifaro.com/en/abs/interchanging-distance-and-capacity-in-probabilistic-mappings-0907.36312009-07-22 https://scifaro.com/en/abs/contextual-bandits-with-similarity-information-0907.39862014-05-21 https://scifaro.com/en/abs/domination-problems-in-nowhere-dense-classes-of-graphs-0907.42832009-07-27 https://scifaro.com/en/abs/solving-max-r-sat-above-a-tight-lower-bound-0907.45732011-08-23 https://scifaro.com/en/abs/fast-detour-computation-for-ride-sharing-0907.52692009-07-31 https://scifaro.com/en/abs/speedup-in-the-traveling-repairman-problem-with-unit-time-windows-0907.53722009-07-31 https://scifaro.com/en/abs/betweenness-parameterized-above-tight-lower-bound-0907.54272013-06-25 https://scifaro.com/en/abs/optimal-angular-resolution-for-face-symmetric-drawings-0907.54742009-08-03 https://scifaro.com/en/abs/on-bijective-variants-of-the-burrows-wheeler-transform-0908.02392009-08-04 https://scifaro.com/en/abs/region-growing-for-multi-route-cuts-0908.03502009-08-05 https://scifaro.com/en/abs/deterministic-algorithms-for-the-lovasz-local-lemma-0908.03752019-08-07 https://scifaro.com/en/abs/approximating-the-statistics-of-various-properties-in-randomly-weighted-graphs-0908.09682010-03-30 https://scifaro.com/en/abs/breaking-the-multicommodity-flow-barrier-for-sqrt-log-n-approximations-to-sparsest-cut-0908.13792009-08-11 https://scifaro.com/en/abs/faster-generation-of-random-spanning-trees-0908.14482009-08-12 https://scifaro.com/en/abs/contraction-of-timetable-networks-with-realistic-transfers-0908.15282009-08-12 https://scifaro.com/en/abs/on-k-column-sparse-packing-programs-0908.22562015-05-13 https://scifaro.com/en/abs/on-revenue-maximization-in-second-price-ad-auctions-0908.28342009-08-21 https://scifaro.com/en/abs/data-structure-for-representing-a-graph-combination-of-linked-list-and-hash-table-0908.30892009-08-24 https://scifaro.com/en/abs/algorithmic-aspects-of-several-data-transfer-service-optimization-problems-0908.34552009-08-25 https://scifaro.com/en/abs/an-algorithmic-perspective-on-some-network-design-construction-and-analysis-problems-0908.34592009-08-25 https://scifaro.com/en/abs/polynomial-time-algorithms-for-minimum-energy-scheduling-0908.35052010-09-06 https://scifaro.com/en/abs/notes-on-large-angle-crossing-graphs-0908.35452013-03-12 https://scifaro.com/en/abs/in-packet-bloom-filters-design-and-networking-applications-0908.35742010-01-20 https://scifaro.com/en/abs/optimal-geometric-partitions-covers-and-k-centers-0908.36522009-08-26 https://scifaro.com/en/abs/an-oblivious-o-1-approximation-for-single-source-buy-at-bulk-0908.37402009-08-27 https://scifaro.com/en/abs/algorithms-for-placing-monitors-in-a-flow-network-0908.43092009-09-01 https://scifaro.com/en/abs/online-algorithms-for-self-organizing-sequential-search-a-survey-0909.00952009-09-02 https://scifaro.com/en/abs/constraint-minimum-vertex-cover-in-k-partite-graph-approximation-algorithm-and-complexity-analysis-0909.00972009-09-02 https://scifaro.com/en/abs/a-randomized-rounding-algorithm-for-the-asymmetric-traveling-salesman-problem-0909.09412009-09-07 https://scifaro.com/en/abs/the-euler-path-to-static-level-ancestors-0909.10302009-09-08 https://scifaro.com/en/abs/randomized-shellsort-a-simple-oblivious-sorting-algorithm-0909.10372015-03-13 https://scifaro.com/en/abs/paired-approximation-problems-and-incompatible-inapproximabilities-0909.18702009-09-11 https://scifaro.com/en/abs/computing-alignment-plots-efficiently-0909.20002009-09-11 https://scifaro.com/en/abs/deterministic-approximation-for-the-cover-time-of-trees-0909.20052009-09-11 https://scifaro.com/en/abs/approximate-nearest-neighbor-search-through-comparisons-0909.21942009-09-14 https://scifaro.com/en/abs/generating-all-partitions-a-comparison-of-two-encodings-0909.23312014-05-05 https://scifaro.com/en/abs/simple-implementation-of-deletion-from-open-address-hash-table-0909.25472009-09-15 https://scifaro.com/en/abs/memory-consistency-conditions-for-self-assembly-programming-0909.27042009-09-16 https://scifaro.com/en/abs/an-optimal-labeling-scheme-for-ancestry-queries-0909.27332009-09-16 https://scifaro.com/en/abs/crossing-free-acyclic-hamiltonian-path-completion-for-planar-st-digraphs-0909.27872009-09-16 https://scifaro.com/en/abs/the-asymmetric-traveling-salesman-problem-on-graphs-with-bounded-genus-0909.28492011-01-17 https://scifaro.com/en/abs/a-note-on-the-data-driven-capacity-of-p2p-networks-0909.31222009-09-18 https://scifaro.com/en/abs/fpt-algorithms-for-connected-feedback-vertex-set-0909.31802009-09-18 https://scifaro.com/en/abs/perfect-matchings-in-o-n-log-n-time-in-regular-bipartite-graphs-0909.33462010-11-15 https://scifaro.com/en/abs/packet-scheduling-in-a-size-bounded-buffer-0909.36372010-02-01 https://scifaro.com/en/abs/efficient-and-error-correcting-data-structures-for-membership-and-polynomial-evaluation-0909.36962010-01-27 https://scifaro.com/en/abs/large-girth-roots-of-graphs-0909.40112009-09-23 https://scifaro.com/en/abs/beyond-o-2-n-in-domination-type-problems-0909.40212009-09-23 https://scifaro.com/en/abs/breaking-the-2-n-barrier-for-irredundance-a-parameterized-route-to-solving-exact-puzzles-0909.42242009-09-24 https://scifaro.com/en/abs/lightweight-data-indexing-and-compression-in-external-memory-0909.43412009-09-25 https://scifaro.com/en/abs/dependent-randomized-rounding-for-matroid-polytopes-and-applications-0909.43482009-11-07 https://scifaro.com/en/abs/exploration-of-periodically-varying-graphs-0909.43692009-09-25 https://scifaro.com/en/abs/planar-subgraph-isomorphism-revisited-0909.46922009-09-28 https://scifaro.com/en/abs/combinatiorial-algorithms-for-wireless-information-flow-0909.48082009-09-29 https://scifaro.com/en/abs/range-non-overlapping-indexing-0909.48932010-01-12 https://scifaro.com/en/abs/mach-fast-randomized-tensor-decompositions-0909.49692009-09-29 https://scifaro.com/en/abs/fast-set-intersection-and-two-patterns-matching-0909.51462010-03-12 https://scifaro.com/en/abs/finding-induced-subgraphs-via-minimal-triangulations-0909.52782009-12-22 https://scifaro.com/en/abs/gpu-sample-sort-0909.56492009-10-01 https://scifaro.com/en/abs/algorithms-for-finding-dispensable-variables-0910.00132009-10-02 https://scifaro.com/en/abs/improved-hardness-of-approximation-for-stackelberg-shortest-path-pricing-0910.01102009-10-02 https://scifaro.com/en/abs/finding-associations-and-computing-similarity-via-biased-pair-sampling-0910.01122010-02-17 https://scifaro.com/en/abs/exact-covers-via-determinants-0910.04602010-02-03 https://scifaro.com/en/abs/improved-analysis-of-a-max-cut-algorithm-based-on-spectral-partitioning-0910.05042014-12-03 https://scifaro.com/en/abs/combining-approximation-algorithms-for-the-prize-collecting-tsp-0910.05532009-10-06 https://scifaro.com/en/abs/algorithmic-meta-theorems-for-graphs-of-bounded-vertex-cover-0910.05822009-11-05 https://scifaro.com/en/abs/the-knapsack-problem-with-neighbour-constraints-0910.07772011-09-28 https://scifaro.com/en/abs/optimal-deterministic-ring-exploration-with-oblivious-asynchronous-robots-0910.08322015-05-14 https://scifaro.com/en/abs/sorting-from-noisy-information-0910.11912009-10-08 https://scifaro.com/en/abs/simpler-proofs-by-symbolic-perturbation-0910.13872009-11-04 https://scifaro.com/en/abs/simple-efficient-maxima-finding-algorithms-for-multidimensional-samples-0910.13922009-10-09 https://scifaro.com/en/abs/on-the-sample-complexity-of-compressed-counting-0910.14032009-10-09 https://scifaro.com/en/abs/convergence-time-evaluation-of-algorithms-in-manets-0910.14752009-10-09 https://scifaro.com/en/abs/estimating-entropy-of-data-streams-using-compressed-counting-0910.14952009-10-09 https://scifaro.com/en/abs/a-generalized-recursive-algorithm-for-binary-multiplication-based-on-vedic-mathematics-0910.19692009-10-13 https://scifaro.com/en/abs/a-log-n-omega-1-integrality-gap-for-the-sparsest-cut-sdp-0910.20242009-11-18 https://scifaro.com/en/abs/an-algorithm-for-computing-cutpoints-in-finite-metric-spaces-0910.23172009-10-14 https://scifaro.com/en/abs/scalable-distributed-memory-external-sorting-0910.25822009-10-15 https://scifaro.com/en/abs/wee-lcp-0910.31232010-02-19 https://scifaro.com/en/abs/parameterized-complexity-of-the-k-anonymity-problem-0910.31482013-11-20 https://scifaro.com/en/abs/testing-distribution-identity-efficiently-0910.32432009-10-20 https://scifaro.com/en/abs/the-1-375-approximation-algorithm-for-sorting-by-transpositions-can-run-in-o-n-log-n-time-0910.32922009-10-20 https://scifaro.com/en/abs/b-bit-minwise-hashing-0910.33492009-10-20 https://scifaro.com/en/abs/searching-a-bitstream-in-linear-time-for-the-longest-substring-of-any-given-density-0910.35032011-08-22 https://scifaro.com/en/abs/sharp-load-thresholds-for-cuckoo-hashing-0910.51472009-10-28 https://scifaro.com/en/abs/maximum-matchings-in-random-bipartite-graphs-and-the-space-utilization-of-cuckoo-hashtables-0910.55352009-11-17 https://scifaro.com/en/abs/vector-bin-packing-with-multiple-choice-0910.55992015-05-14 https://scifaro.com/en/abs/exact-algorithms-for-owa-optimization-in-multiobjective-spanning-tree-problems-0910.57442009-11-02 https://scifaro.com/en/abs/sorting-under-partial-information-without-the-ellipsoid-algorithm-0911.00862013-01-22 https://scifaro.com/en/abs/a-o-e-time-shortest-path-algorithm-for-non-negative-weighted-undirected-graphs-0911.01742009-11-03 https://scifaro.com/en/abs/algorithm-as-defining-dynamic-systems-0911.03972009-11-03 https://scifaro.com/en/abs/fast-arc-annotated-subsequence-matching-in-linear-space-0911.05772010-09-09 https://scifaro.com/en/abs/tractable-hypergraph-properties-for-constraint-satisfaction-and-conjunctive-queries-0911.08012015-03-13 https://scifaro.com/en/abs/sharp-dichotomies-for-regret-minimization-in-metric-spaces-0911.11742009-11-09 https://scifaro.com/en/abs/belief-propagation-and-loop-calculus-for-the-permanent-of-a-non-negative-matrix-0911.14192015-05-14 https://scifaro.com/en/abs/fast-approximation-in-subspaces-by-doubling-metric-decomposition-0911.16262010-06-18 https://scifaro.com/en/abs/gedi-scalable-algorithms-for-genotype-error-detection-and-imputation-0911.17652016-09-08 https://scifaro.com/en/abs/a-faster-exact-algorithm-for-the-directed-maximum-leaf-spanning-tree-problem-0911.19002009-11-11 https://scifaro.com/en/abs/approximation-schemes-for-the-betweenness-problem-in-tournaments-and-related-ranking-problems-0911.22142010-07-12 https://scifaro.com/en/abs/pagerank-optimization-by-edge-selection-0911.22802014-05-22 https://scifaro.com/en/abs/synthesizing-minimal-tile-sets-for-patterned-dna-self-assembly-0911.29242015-03-13 https://scifaro.com/en/abs/a-dynamic-near-optimal-algorithm-for-online-linear-programming-0911.29742014-04-10 https://scifaro.com/en/abs/recognizing-well-parenthesized-expressions-in-the-streaming-model-0911.32912009-11-18 https://scifaro.com/en/abs/a-minimal-periods-algorithm-with-applications-0911.33552015-05-14 https://scifaro.com/en/abs/randomized-interior-point-methods-for-sampling-and-optimization-0911.39502015-11-17 https://scifaro.com/en/abs/hitting-diamonds-and-growing-cacti-0911.43662015-05-14 https://scifaro.com/en/abs/ptolemaic-indexing-0911.43842015-07-08 https://scifaro.com/en/abs/improved-algorithm-for-degree-bounded-survivable-network-design-problem-0911.45442010-07-08 https://scifaro.com/en/abs/efficient-higher-order-derivatives-of-objective-functions-composed-of-matrix-operations-0911.49402016-09-08 https://scifaro.com/en/abs/efficient-fully-compressed-sequence-representations-0911.49812012-04-03 https://scifaro.com/en/abs/an-o-n-2-algorithm-for-computing-longest-common-cyclic-subsequence-0911.50312010-04-20 https://scifaro.com/en/abs/faster-fast-feedback-arc-set-in-tournaments-0911.50942009-11-30 https://scifaro.com/en/abs/approximation-schemes-for-steiner-forest-on-planar-graphs-and-graphs-of-bounded-treewidth-0911.51432009-11-30 https://scifaro.com/en/abs/note-on-max-lin-2-above-average-0911.53842009-12-01 https://scifaro.com/en/abs/faster-and-simpler-approximation-of-stable-matchings-0911.56602014-04-07 https://scifaro.com/en/abs/approximate-sparse-recovery-optimizing-time-and-measurements-0912.02292014-02-10 https://scifaro.com/en/abs/optimal-lower-bounds-for-locality-sensitive-hashing-except-when-q-is-tiny-0912.02502009-12-02 https://scifaro.com/en/abs/tight-thresholds-for-cuckoo-hashing-via-xorsat-0912.02872010-12-22 https://scifaro.com/en/abs/submodular-functions-extensions-distributions-and-algorithms-a-survey-0912.03222011-11-08 https://scifaro.com/en/abs/variants-of-constrained-longest-common-subsequence-0912.03682013-11-20 https://scifaro.com/en/abs/a-local-spectral-method-for-graphs-with-applications-to-improving-graph-partitions-and-exploring-data-graphs-locally-0912.06812011-10-24 https://scifaro.com/en/abs/new-algorithmic-approaches-for-computing-optimal-network-paths-with-several-types-of-qos-constraints-0912.08032009-12-07 https://scifaro.com/en/abs/practical-algorithmic-techniques-for-several-string-processing-problems-0912.08072009-12-07 https://scifaro.com/en/abs/grammar-based-compression-in-a-streaming-model-0912.08502010-02-06 https://scifaro.com/en/abs/an-expected-case-sub-cubic-solution-to-the-all-pairs-shortest-path-problem-in-r-0912.09752009-12-08 https://scifaro.com/en/abs/thresholded-covering-algorithms-for-robust-and-max-min-optimization-0912.10452011-02-25 https://scifaro.com/en/abs/euclidean-prize-collecting-steiner-forest-0912.11372009-12-08 https://scifaro.com/en/abs/extending-karger-s-randomized-min-cut-algorithm-for-a-synchronous-distributed-setting-0912.12002010-01-01 https://scifaro.com/en/abs/energy-efficient-scheduling-via-partial-shutdown-0912.13292009-12-08 https://scifaro.com/en/abs/algorithms-and-hardness-for-subspace-approximation-0912.14032011-01-04 https://scifaro.com/en/abs/lexicographic-multi-objective-geometric-programming-problems-0912.18322009-12-10 https://scifaro.com/en/abs/renewal-theory-in-analysis-of-tries-and-strings-0912.21742009-12-14 https://scifaro.com/en/abs/computing-a-discrete-logarithm-in-o-n-3-0912.22692009-12-29 https://scifaro.com/en/abs/faster-algorithms-for-finding-and-counting-subgraphs-0912.23712009-12-15 https://scifaro.com/en/abs/succinct-coverage-oracles-0912.24042010-04-09 https://scifaro.com/en/abs/construction-sequences-and-certifying-3-connectedness-0912.25612010-02-03 https://scifaro.com/en/abs/combining-partial-order-alignment-and-progressive-near-optimal-alignment-0912.28132010-04-13 https://scifaro.com/en/abs/relaxed-spanners-for-directed-disk-graphs-0912.28152010-02-03 https://scifaro.com/en/abs/robust-fault-tolerant-uncapacitated-facility-location-0912.31882010-02-03 https://scifaro.com/en/abs/a-simplified-proof-for-the-application-of-freivalds-technique-to-verify-matrix-multiplication-0912.39252010-03-17 https://scifaro.com/en/abs/fast-fraction-integer-method-for-computing-multiplicative-inverse-0912.39632009-12-22 https://scifaro.com/en/abs/computing-an-integer-prime-factoring-in-o-n-2-5-0912.40842011-07-29 https://scifaro.com/en/abs/computing-least-fixed-points-of-probabilistic-systems-of-polynomials-0912.42262010-02-03 https://scifaro.com/en/abs/continuous-monitoring-of-distributed-data-streams-over-a-time-based-sliding-window-0912.45692010-02-03 https://scifaro.com/en/abs/demand-supply-optimization-with-risk-management-for-a-multi-connection-water-reservoir-network-0912.47982009-12-25 https://scifaro.com/en/abs/lipschitz-unimodal-and-isotonic-regression-on-paths-and-trees-0912.51822009-12-31 https://scifaro.com/en/abs/backyard-cuckoo-hashing-constant-worst-case-operations-with-a-succinct-representation-0912.54242015-03-13 https://scifaro.com/en/abs/time-and-memory-efficient-lempel-ziv-compression-using-suffix-arrays-0912.54492009-12-31 https://scifaro.com/en/abs/a-variable-depth-sequential-search-heuristic-for-the-quadratic-assignment-problem-0912.54732009-12-31 https://scifaro.com/en/abs/optimal-exploration-of-terrains-with-obstacles-1001.06392015-05-14 https://scifaro.com/en/abs/beyond-bidimensionality-parameterized-subexponential-algorithms-on-directed-graphs-1001.08212010-01-07 https://scifaro.com/en/abs/approximate-shortest-paths-avoiding-a-failed-vertex-optimal-size-data-structures-for-unweighted-graph-1001.08242010-02-03 https://scifaro.com/en/abs/how-to-meet-asynchronously-almost-everywhere-1001.08902016-11-25 https://scifaro.com/en/abs/online-correlation-clustering-1001.09202010-02-03 https://scifaro.com/en/abs/computing-a-frobenius-coin-problem-decision-problem-in-o-n-2-1001.09612010-01-08 https://scifaro.com/en/abs/new-constructive-aspects-of-the-lovasz-local-lemma-1001.12312011-10-04 https://scifaro.com/en/abs/a-new-approximation-technique-for-resource-allocation-problems-1001.14702017-12-19 https://scifaro.com/en/abs/a-reduced-offset-based-method-for-fast-computation-of-the-prime-implicants-covering-a-given-cube-1001.15262010-01-12 https://scifaro.com/en/abs/random-access-to-grammar-compressed-strings-1001.15652013-10-30 https://scifaro.com/en/abs/algorithmic-differentiation-of-linear-algebra-functions-with-application-in-optimum-experimental-design-extended-version-1001.16542010-02-19 https://scifaro.com/en/abs/genealogical-information-search-by-using-parent-bidirectional-breadth-algorithm-and-rule-based-relationship-1001.18192010-02-12 https://scifaro.com/en/abs/sampled-longest-common-prefix-array-1001.21012010-06-30 https://scifaro.com/en/abs/approximating-matrix-p-norms-1001.26132010-05-04 https://scifaro.com/en/abs/succinct-dictionary-matching-with-no-slowdown-1001.28602015-05-18 https://scifaro.com/en/abs/detecting-high-log-densities-an-o-n-1-4-approximation-for-densest-k-subgraph-1001.28912010-01-19 https://scifaro.com/en/abs/dynamic-sharing-of-a-multiple-access-channel-1001.30442010-02-03 https://scifaro.com/en/abs/optimal-gossip-based-aggregate-computation-1001.32422010-01-20 https://scifaro.com/en/abs/minimum-vertex-cover-in-rectangle-graphs-1001.33322010-01-20 https://scifaro.com/en/abs/posynomial-geometric-programming-problems-with-multiple-parameters-1001.34932010-03-25 https://scifaro.com/en/abs/on-fast-algorithm-for-computing-even-length-dct-1001.37132010-01-22 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-computing-kemeny-scores-theory-and-practice-1001.40032011-08-11 https://scifaro.com/en/abs/connected-searching-of-weighted-trees-1001.43412021-03-05 https://scifaro.com/en/abs/the-complexity-of-flood-filling-games-1001.44202011-06-10 https://scifaro.com/en/abs/the-highest-expected-reward-decoding-for-hmms-with-application-to-recombination-detection-1001.44992013-08-06 https://scifaro.com/en/abs/online-stochastic-packing-applied-to-display-ad-allocation-1001.50762010-02-17 https://scifaro.com/en/abs/an-in-place-truncated-fourier-transform-and-applications-to-polynomial-multiplication-1001.52722010-02-01 https://scifaro.com/en/abs/multi-dimensional-boltzmann-sampling-of-languages-1002.00462010-12-21 https://scifaro.com/en/abs/minimum-and-maximum-against-k-lies-1002.05622015-05-18 https://scifaro.com/en/abs/an-optimal-algorithm-for-the-indirect-covering-subtree-problem-1002.05802010-02-03 https://scifaro.com/en/abs/madmx-a-novel-strategy-for-maximal-dense-motif-extraction-1002.08742010-02-05 https://scifaro.com/en/abs/heuristic-contraction-hierarchies-with-approximation-guarantee-1002.10212010-02-05 https://scifaro.com/en/abs/mod-resc-parsimony-inference-1002.12922015-05-18 https://scifaro.com/en/abs/estimating-and-sampling-graphs-with-multidimensional-random-walks-1002.17512010-09-08 https://scifaro.com/en/abs/a-sublogarithmic-approximation-for-highway-and-tollbooth-pricing-1002.20842010-02-11 https://scifaro.com/en/abs/optimization-with-more-than-one-budget-1002.21472010-02-11 https://scifaro.com/en/abs/constructive-algorithms-for-discrepancy-minimization-1002.22592015-03-13 https://scifaro.com/en/abs/negative-interactions-in-irreversible-self-assembly-1002.27462015-05-18 https://scifaro.com/en/abs/range-reporting-for-moving-points-on-a-grid-1002.35112010-02-19 https://scifaro.com/en/abs/finite-volume-spaces-and-sparsification-1002.35412010-08-03 https://scifaro.com/en/abs/improved-bounds-for-stochastic-matching-1002.37632010-09-07 https://scifaro.com/en/abs/deciding-the-finiteness-of-the-number-of-simple-permutations-contained-in-a-wreath-closed-class-is-polynomial-1002.38662011-03-30 https://scifaro.com/en/abs/multi-objective-geometric-programming-problem-being-cost-coefficients-as-continous-function-with-weighted-mean-method-1002.40022010-03-25 https://scifaro.com/en/abs/improved-nsga-ii-based-on-a-novel-ranking-scheme-1002.40052010-03-25 https://scifaro.com/en/abs/on-constant-factor-approximation-for-earth-mover-distance-over-doubling-metrics-1002.40342010-02-23 https://scifaro.com/en/abs/mergeable-dictionaries-1002.42482012-11-20 https://scifaro.com/en/abs/defining-and-computing-alternative-routes-in-road-networks-1002.43302010-02-24 https://scifaro.com/en/abs/threshold-rules-for-online-sample-selection-1002.50342010-07-20 https://scifaro.com/en/abs/an-o-loglog-n-competitive-binary-search-tree-with-optimal-worst-case-access-times-1003.01392015-05-18 https://scifaro.com/en/abs/multidimensional-divide-and-conquer-and-weighted-digital-sums-1003.01502010-03-02 https://scifaro.com/en/abs/when-lp-is-the-cure-for-your-matching-woes-approximating-stochastic-matchings-1003.01672010-09-06 https://scifaro.com/en/abs/approximation-algorithms-for-optimal-decision-trees-and-adaptive-tsp-problems-1003.07222017-04-24 https://scifaro.com/en/abs/minimum-spanning-tree-on-spatio-temporal-networks-1003.12512010-05-24 https://scifaro.com/en/abs/cleaning-interval-graphs-1003.12602010-03-08 https://scifaro.com/en/abs/hitting-and-commute-times-in-large-graphs-are-often-misleading-1003.12662015-03-13 https://scifaro.com/en/abs/fault-tolerant-facility-location-a-randomized-dependent-lp-rounding-algorithm-1003.12952015-05-18 https://scifaro.com/en/abs/on-column-restricted-and-priority-covering-integer-programs-1003.15072015-05-18 https://scifaro.com/en/abs/constrained-non-monotone-submodular-maximization-offline-and-secretary-algorithms-1003.15172010-10-07 https://scifaro.com/en/abs/efficient-parallel-and-out-of-core-algorithms-for-constructing-large-bi-directed-de-bruijn-graphs-1003.19402010-03-10 https://scifaro.com/en/abs/on-the-border-length-minimization-problem-blmp-on-a-square-array-1003.28392015-03-13 https://scifaro.com/en/abs/approaching-optimality-for-solving-sdd-systems-1003.29582015-03-13 https://scifaro.com/en/abs/on-generalizations-of-network-design-problems-with-degree-bounds-1003.29772015-05-18 https://scifaro.com/en/abs/exponential-lower-bounds-for-policy-iteration-1003.34182010-03-18 https://scifaro.com/en/abs/simple-heuristics-for-the-assembly-line-worker-assignment-and-balancing-problem-1003.36762013-08-02 https://scifaro.com/en/abs/phase-synchronization-in-railway-timetables-1003.40122010-11-03 https://scifaro.com/en/abs/a-new-approach-to-population-sizing-for-memetic-algorithms-a-case-study-for-the-multidimensional-assignment-problem-1003.43142015-03-13 https://scifaro.com/en/abs/graph-iterators-decoupling-graph-structures-from-algorithms-1003.43662010-03-24 https://scifaro.com/en/abs/approximate-dynamic-programming-using-halfspace-queries-and-multiscale-monge-decomposition-1003.49422015-03-13 https://scifaro.com/en/abs/lin-kernighan-heuristic-adaptations-for-the-generalized-traveling-salesman-problem-1003.53302012-02-15 https://scifaro.com/en/abs/a-note-on-integer-factorization-using-lattices-1003.54612010-03-30 https://scifaro.com/en/abs/angle-tree-nearest-neighbor-search-in-high-dimensions-with-low-intrinsic-dimensionality-1003.54742010-04-19 https://scifaro.com/en/abs/faster-approximation-schemes-for-fractional-multicommodity-flow-problems-via-dynamic-graph-algorithms-1003.59072015-03-13 https://scifaro.com/en/abs/an-oblivious-spanning-tree-for-buy-at-bulk-network-design-problems-1004.03512010-04-05 https://scifaro.com/en/abs/concise-compressed-n-composable-integer-set-1004.04032015-03-14 https://scifaro.com/en/abs/restricted-common-superstring-and-restricted-common-supersequence-1004.04242010-06-29 https://scifaro.com/en/abs/a-new-lower-bound-on-the-maximum-number-of-satisfied-clauses-in-max-sat-and-its-algorithmic-applications-1004.05262015-05-18 https://scifaro.com/en/abs/strong-fault-tolerance-for-self-assembly-with-fuzzy-temperature-1004.09952015-03-14 https://scifaro.com/en/abs/the-graph-traversal-pattern-1004.10012010-12-24 https://scifaro.com/en/abs/unified-compression-based-acceleration-of-edit-distance-computation-1004.11942016-10-05 https://scifaro.com/en/abs/a-deterministic-algorithm-for-the-vertex-connectivity-survivable-network-design-problem-1004.12082010-04-09 https://scifaro.com/en/abs/relaxation-based-coarsening-and-multiscale-graph-organization-1004.12202010-04-09 https://scifaro.com/en/abs/spectral-methods-for-matrices-and-tensors-1004.12532010-04-09 https://scifaro.com/en/abs/a-note-on-johnson-minkoff-and-phillips-algorithm-for-the-prize-collecting-steiner-tree-problem-1004.14372010-06-21 https://scifaro.com/en/abs/a-streaming-approximation-algorithm-for-klee-s-measure-problem-1004.15692010-10-29 https://scifaro.com/en/abs/on-feedback-vertex-set-new-measure-and-new-structures-1004.16722014-06-04 https://scifaro.com/en/abs/polynomial-time-algorithm-for-graph-isomorphism-testing-1004.18082013-06-19 https://scifaro.com/en/abs/clustering-with-spectral-norm-and-the-k-means-algorithm-1004.18232010-04-13 https://scifaro.com/en/abs/all-ternary-permutation-constraint-satisfaction-problems-parameterized-above-average-have-kernels-with-quadratic-numbers-of-variables-1004.19562011-07-11 https://scifaro.com/en/abs/feasibility-analysis-of-sporadic-real-time-multiprocessor-task-systems-1004.20332012-09-28 https://scifaro.com/en/abs/an-o-m-n-log-n-algorithm-for-the-jacobi-symbol-1004.20912010-11-29 https://scifaro.com/en/abs/one-tree-suffices-a-simultaneous-o-1-approximation-for-single-sink-buy-at-bulk-1004.22912010-08-30 https://scifaro.com/en/abs/on-the-continuous-cnn-problem-1004.23932012-06-20 https://scifaro.com/en/abs/streaming-graph-computations-with-a-helpful-advisor-1004.28992015-03-14 https://scifaro.com/en/abs/clustering-with-diversity-1004.29682010-04-22 https://scifaro.com/en/abs/subset-feedback-vertex-set-is-fixed-parameter-tractable-1004.29722011-08-02 https://scifaro.com/en/abs/prizing-on-paths-a-ptas-for-the-highway-problem-1004.30512010-04-20 https://scifaro.com/en/abs/fast-normal-random-number-generators-on-vector-processors-1004.31052010-04-21 https://scifaro.com/en/abs/uses-of-randomness-in-computation-1004.31082010-04-21 https://scifaro.com/en/abs/a-fast-vectorised-implementation-of-wallace-s-normal-random-number-generator-1004.31142010-04-20 https://scifaro.com/en/abs/some-long-period-random-number-generators-using-shifts-and-xors-1004.31152010-04-20 https://scifaro.com/en/abs/differential-privacy-and-the-fat-shattering-dimension-of-linear-queries-1004.32052011-01-20 https://scifaro.com/en/abs/faster-algorithms-for-semi-matching-problems-1004.33632012-06-15 https://scifaro.com/en/abs/faster-approximation-schemes-and-parameterized-algorithms-on-h-minor-free-and-odd-minor-free-graphs-1004.33922015-05-18 https://scifaro.com/en/abs/empirical-comparison-of-algorithms-for-network-community-detection-1004.35392010-04-21 https://scifaro.com/en/abs/approximating-the-minimum-directed-tree-cover-1004.36682015-05-18 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-3sat-1004.37022026-04-23 https://scifaro.com/en/abs/some-linear-time-algorithms-for-systolic-arrays-1004.37162010-04-22 https://scifaro.com/en/abs/on-practical-algorithms-for-entropy-estimation-and-the-improved-sample-complexity-of-compressed-counting-1004.37822015-03-14 https://scifaro.com/en/abs/n-level-graph-partitioning-1004.40242010-04-26 https://scifaro.com/en/abs/efficient-volume-sampling-for-row-column-subset-selection-1004.40572010-04-26 https://scifaro.com/en/abs/a-general-framework-for-graph-sparsification-1004.40802010-04-26 https://scifaro.com/en/abs/a-sparse-johnson-lindenstrauss-transform-1004.42402015-03-14 https://scifaro.com/en/abs/optimal-data-placement-on-networks-with-constant-number-of-clients-1004.44202013-09-30 https://scifaro.com/en/abs/simulating-parallel-algorithms-in-the-mapreduce-framework-with-applications-to-parallel-computational-geometry-1004.47082015-03-14 https://scifaro.com/en/abs/modern-computer-arithmetic-version-0-5-1-1004.47102021-06-28 https://scifaro.com/en/abs/graph-sparsification-via-refinement-sampling-1004.49152015-03-17 https://scifaro.com/en/abs/the-stubborn-problem-is-stubborn-no-more-a-polynomial-algorithm-for-3-compatible-colouring-and-the-stubborn-list-partition-problem-1004.50102010-11-13 https://scifaro.com/en/abs/bandwidth-and-distortion-revisited-1004.50122010-04-29 https://scifaro.com/en/abs/multiscale-approach-for-the-network-compression-friendly-ordering-1004.51862010-04-30 https://scifaro.com/en/abs/parallel-algorithms-in-linear-algebra-1004.54372015-03-17 https://scifaro.com/en/abs/on-the-im-possibility-of-preserving-utility-and-privacy-in-personalized-social-recommendations-1004.56002015-03-17 https://scifaro.com/en/abs/on-finding-frequent-patterns-in-directed-acyclic-graphs-1005.02392010-05-04 https://scifaro.com/en/abs/graph-sparsification-by-edge-connectivity-and-random-spanning-trees-1005.02652010-08-10 https://scifaro.com/en/abs/the-deletable-bloom-filter-a-new-member-of-the-bloom-family-1005.03522010-05-04 https://scifaro.com/en/abs/lower-bounds-on-near-neighbor-search-via-metric-expansion-1005.04182010-05-05 https://scifaro.com/en/abs/local-algorithms-for-the-maximum-flow-and-minimum-cut-in-bounded-degree-networks-1005.05132023-11-03 https://scifaro.com/en/abs/the-b-skip-list-a-simpler-uniquely-represented-alternative-to-b-trees-1005.06622015-03-17 https://scifaro.com/en/abs/a-linear-time-algorithm-for-sparsification-of-unweighted-graphs-1005.06702010-05-06 https://scifaro.com/en/abs/on-estimating-the-first-frequency-moment-of-data-streams-1005.08092015-03-17 https://scifaro.com/en/abs/round-trip-voronoi-diagrams-and-doubling-density-in-geographic-networks-1005.10532019-09-04 https://scifaro.com/en/abs/estimating-small-moments-of-data-stream-in-nearly-optimal-space-time-1005.11202010-06-21 https://scifaro.com/en/abs/estimating-small-frequency-moments-of-data-stream-a-characteristic-function-approach-1005.11222010-06-01 https://scifaro.com/en/abs/a-simple-approach-to-error-reconciliation-in-quantum-key-distribution-1005.12062010-05-10 https://scifaro.com/en/abs/arboricity-h-index-and-dynamic-algorithms-1005.22112014-08-18 https://scifaro.com/en/abs/chains-into-bins-processes-1005.26162015-05-19 https://scifaro.com/en/abs/low-rank-matrix-valued-chernoff-bounds-and-approximate-matrix-multiplication-1005.27242010-10-28 https://scifaro.com/en/abs/note-on-maximal-bisection-above-tight-lower-bound-1005.28482010-05-18 https://scifaro.com/en/abs/efficient-algorithms-and-data-structures-for-massive-data-sets-1005.34732010-05-20 https://scifaro.com/en/abs/exact-counting-of-euler-tours-for-generalized-series-parallel-graphs-1005.34772015-03-17 https://scifaro.com/en/abs/a-better-memoryless-online-algorithm-for-fifo-buffering-packets-with-two-values-1005.38352011-08-02 https://scifaro.com/en/abs/polylogarithmic-approximation-for-edit-distance-and-the-asymmetric-query-complexity-1005.40332010-05-24 https://scifaro.com/en/abs/max-stable-sketches-estimation-of-lp-norms-dominance-norms-and-point-queries-for-non-negative-signals-1005.43442010-05-25 https://scifaro.com/en/abs/scheduling-packets-with-values-and-deadlines-in-size-bounded-buffers-1005.43942015-05-19 https://scifaro.com/en/abs/succinct-representations-of-dynamic-strings-1005.46522010-06-25 https://scifaro.com/en/abs/bidimensionality-and-eptas-1005.54492015-03-17 https://scifaro.com/en/abs/almost-optimal-unrestricted-fast-johnson-lindenstrauss-transform-1005.55132010-06-01 https://scifaro.com/en/abs/efficient-local-search-algorithms-for-known-and-new-neighborhoods-for-the-generalized-traveling-salesman-problem-1005.55252012-02-15 https://scifaro.com/en/abs/inferring-networks-of-diffusion-and-influence-1006.02342015-03-17 https://scifaro.com/en/abs/a-note-on-element-wise-matrix-sparsification-via-a-matrix-valued-bernstein-inequality-1006.04072012-10-05 https://scifaro.com/en/abs/tight-and-simple-web-graph-compression-1006.08092011-09-07 https://scifaro.com/en/abs/reconstruction-of-causal-networks-by-set-covering-1006.08492010-06-07 https://scifaro.com/en/abs/systolic-array-technique-for-determining-common-approximate-substrings-1006.11042010-06-08 https://scifaro.com/en/abs/on-the-hardness-of-distance-oracle-for-sparse-graph-1006.11172010-06-08 https://scifaro.com/en/abs/on-the-insertion-time-of-cuckoo-hashing-1006.12312013-10-11 https://scifaro.com/en/abs/i-o-efficient-algorithms-for-matrix-computations-1006.13072010-06-08 https://scifaro.com/en/abs/algebraic-characterisation-of-one-way-patterns-1006.14312010-06-09 https://scifaro.com/en/abs/smoothed-analysis-of-balancing-networks-1006.14432010-06-09 https://scifaro.com/en/abs/parallel-approximation-algorithms-for-facility-location-problems-1006.19232010-06-11 https://scifaro.com/en/abs/minimizing-a-sum-of-submodular-functions-1006.19902012-06-12 https://scifaro.com/en/abs/constructions-from-dots-and-lines-1006.23612010-09-07 https://scifaro.com/en/abs/fast-incremental-and-personalized-pagerank-1006.28802010-09-01 https://scifaro.com/en/abs/quasirandom-load-balancing-1006.33022013-04-22 https://scifaro.com/en/abs/optimal-constant-time-approximation-algorithms-and-unconditional-inapproximability-results-for-every-bounded-degree-csp-1006.33682010-11-01 https://scifaro.com/en/abs/complexity-dichotomy-on-partial-grid-recognition-1006.35412012-04-13 https://scifaro.com/en/abs/a-derandomized-sparse-johnson-lindenstrauss-transform-1006.35852010-12-08 https://scifaro.com/en/abs/should-static-search-trees-ever-be-unbalanced-1006.37152010-06-21 https://scifaro.com/en/abs/methods-for-accelerating-conway-s-doomsday-algorithm-part-1-1006.39132011-01-28 https://scifaro.com/en/abs/practical-range-aggregation-selection-and-set-maintenance-techniques-1006.39682010-06-22 https://scifaro.com/en/abs/approximating-sparsest-cut-in-graphs-of-bounded-treewidth-1006.39702010-06-24 https://scifaro.com/en/abs/an-algorithm-to-list-all-the-fixed-point-free-involutions-on-a-finite-set-1006.39932010-07-26 https://scifaro.com/en/abs/dynamic-range-reporting-in-external-memory-1006.40932010-06-22 https://scifaro.com/en/abs/competitive-boolean-function-evaluation-beyond-monotonicity-and-the-symmetric-case-1006.41362014-02-11 https://scifaro.com/en/abs/better-size-estimation-for-sparse-matrix-products-1006.41732011-02-23 https://scifaro.com/en/abs/prize-collecting-network-design-on-planar-graphs-1006.43392010-06-23 https://scifaro.com/en/abs/prize-collecting-steiner-tree-and-forest-in-planar-graphs-1006.43572010-06-23 https://scifaro.com/en/abs/faster-algorithms-for-feedback-arc-set-tournament-kemeny-rank-aggregation-and-betweenness-tournament-1006.43962010-06-24 https://scifaro.com/en/abs/vertex-sparsifiers-and-abstract-rounding-algorithms-1006.45362010-06-24 https://scifaro.com/en/abs/vertex-sparsifiers-new-results-from-old-techniques-1006.45862016-02-04 https://scifaro.com/en/abs/metric-extension-operators-vertex-sparsifiers-and-lipschitz-extendability-1006.46072010-12-10 https://scifaro.com/en/abs/an-efficient-algorithm-for-chinese-postman-walk-on-bi-directed-de-bruijn-graphs-1006.48282015-05-19 https://scifaro.com/en/abs/algorithmic-solutions-for-several-offline-constrained-resource-processing-and-data-transfer-multicriteria-optimization-problems-1006.50382010-06-28 https://scifaro.com/en/abs/mining-top-k-frequent-itemsets-through-progressive-sampling-1006.52352012-04-23 https://scifaro.com/en/abs/optimal-trade-off-for-succinct-string-indexes-1006.53542010-06-29 https://scifaro.com/en/abs/listing-all-maximal-cliques-in-sparse-graphs-in-near-optimal-time-1006.54402010-06-29 https://scifaro.com/en/abs/the-computational-complexity-of-estimating-convergence-time-1007.00892010-07-02 https://scifaro.com/en/abs/a-bound-on-the-sum-of-weighted-pairwise-distances-of-points-constrained-to-balls-1007.02172010-07-02 https://scifaro.com/en/abs/randomized-rounding-for-routing-and-covering-problems-experiments-and-improvements-1007.03722010-07-05 https://scifaro.com/en/abs/an-improved-neighbourhood-for-the-traveling-tournament-problem-1007.05012010-07-06 https://scifaro.com/en/abs/narrow-sieves-for-parameterized-paths-and-packings-1007.11612010-07-08 https://scifaro.com/en/abs/using-csp-to-improve-deterministic-3-sat-1007.11662010-07-27 https://scifaro.com/en/abs/efficient-sketches-for-the-set-query-problem-1007.12532010-11-22 https://scifaro.com/en/abs/privacy-preserving-access-of-outsourced-data-via-oblivious-ram-simulation-1007.12592011-05-04 https://scifaro.com/en/abs/online-vertex-weighted-bipartite-matching-and-single-bid-budgeted-allocations-1007.12712010-07-09 https://scifaro.com/en/abs/improved-approximation-bounds-for-vector-bin-packing-1007.13452010-07-09 https://scifaro.com/en/abs/top-k-color-queries-for-document-retrieval-1007.13612010-10-19 https://scifaro.com/en/abs/flows-in-one-crossing-minor-free-graphs-1007.14842015-07-16 https://scifaro.com/en/abs/quantum-search-by-partial-adiabatic-evolution-1007.15282015-05-19 https://scifaro.com/en/abs/an-optimal-lower-bound-for-buffer-management-in-multi-queue-switches-1007.15352012-08-15 https://scifaro.com/en/abs/a-fast-algorithm-for-three-dimensional-layers-of-maxima-problem-1007.15932011-05-04 https://scifaro.com/en/abs/submodular-maximization-by-simulated-annealing-1007.16322010-07-12 https://scifaro.com/en/abs/online-stochastic-matching-online-actions-based-on-offline-statistics-1007.16732011-08-03 https://scifaro.com/en/abs/vsep-new-heuristic-and-exact-algorithms-for-graph-automorphism-group-computation-1007.17262016-07-27 https://scifaro.com/en/abs/complexity-of-splits-reconstruction-for-low-degree-trees-1007.17332011-12-09 https://scifaro.com/en/abs/maximum-bipartite-matching-size-and-application-to-cuckoo-hashing-1007.19462011-08-10 https://scifaro.com/en/abs/parameterizing-by-the-number-of-numbers-1007.20212015-05-19 https://scifaro.com/en/abs/symmetric-submodular-function-minimization-under-hereditary-family-constraints-1007.21402013-10-08 https://scifaro.com/en/abs/matroid-secretary-problem-in-the-random-assignment-model-1007.21522010-07-27 https://scifaro.com/en/abs/faster-replacement-paths-1007.22162010-07-15 https://scifaro.com/en/abs/heapable-sequences-and-subsequences-1007.23652010-07-15 https://scifaro.com/en/abs/ranking-with-submodular-valuations-1007.25032010-07-16 https://scifaro.com/en/abs/sublinear-time-motif-discovery-from-multiple-sequences-1007.26182012-03-14 https://scifaro.com/en/abs/xml-reconstruction-view-selection-in-xml-databases-complexity-analysis-and-approximation-scheme-1007.26712015-05-19 https://scifaro.com/en/abs/greedy-algorithm-for-stochastic-matching-is-a-2-approximation-1007.30362013-11-06 https://scifaro.com/en/abs/enhanced-random-walk-with-choice-an-empirical-study-1007.31572010-07-20 https://scifaro.com/en/abs/lower-bounds-on-query-complexity-for-testing-bounded-degree-csps-1007.32922010-07-21 https://scifaro.com/en/abs/searching-in-dynamic-catalogs-on-a-tree-1007.34152010-07-21 https://scifaro.com/en/abs/efficient-submodular-function-maximization-under-linear-packing-constraints-1007.36042012-05-01 https://scifaro.com/en/abs/lp-rounding-algorithms-for-facility-location-problems-1007.36112012-03-09 https://scifaro.com/en/abs/scheduling-to-minimize-energy-and-flow-time-in-broadcast-scheduling-1007.37472010-07-23 https://scifaro.com/en/abs/on-the-non-existence-of-polynomial-kernels-for-pl-free-edge-modification-problems-1007.40112015-05-19 https://scifaro.com/en/abs/fast-moment-estimation-in-data-streams-in-optimal-space-1007.41912010-07-26 https://scifaro.com/en/abs/finding-cycles-and-trees-in-sublinear-time-1007.42302012-04-04 https://scifaro.com/en/abs/antijam-efficient-medium-access-despite-adaptive-and-reactive-jamming-1007.43892011-03-04 https://scifaro.com/en/abs/approximation-algorithms-for-secondary-spectrum-auctions-1007.50322011-04-29 https://scifaro.com/en/abs/intrinsic-dimensionality-1007.53182010-11-08 https://scifaro.com/en/abs/tree-structure-compression-with-repair-1007.54062010-08-02 https://scifaro.com/en/abs/known-algorithms-on-graphs-of-bounded-treewidth-are-probably-optimal-1007.54502010-08-02 https://scifaro.com/en/abs/balanced-combinations-of-solutions-in-multi-objective-optimization-1007.54752010-08-02 https://scifaro.com/en/abs/improved-parameterized-algorithms-for-constraint-satisfaction-1008.02132011-10-17 https://scifaro.com/en/abs/quasi-random-rumor-spreading-reducing-randomness-can-be-costly-1008.05012010-08-04 https://scifaro.com/en/abs/determinant-sums-for-undirected-hamiltonicity-1008.05412010-08-04 https://scifaro.com/en/abs/row-sampling-for-matrix-algorithms-via-a-non-commutative-bernstein-bound-1008.05872010-08-04 https://scifaro.com/en/abs/is-submodularity-testable-1008.08312010-08-05 https://scifaro.com/en/abs/fast-precise-and-dynamic-distance-queries-1008.14802010-08-10 https://scifaro.com/en/abs/on-a-game-theoretic-approach-to-capacity-maximization-in-wireless-networks-1008.15562010-11-23 https://scifaro.com/en/abs/a-deterministic-polynomial-time-approximation-scheme-for-counting-knapsack-solutions-1008.16872010-08-11 https://scifaro.com/en/abs/fast-approximation-algorithms-for-cut-based-problems-in-undirected-graphs-1008.19752010-11-09 https://scifaro.com/en/abs/submodular-functions-learnability-structure-and-optimization-1008.21592012-08-24 https://scifaro.com/en/abs/faster-radix-sort-via-virtual-memory-and-write-combining-1008.28492010-09-07 https://scifaro.com/en/abs/runtime-flexible-multi-dimensional-arrays-and-views-for-c-98-and-c-0x-1008.29092010-08-18 https://scifaro.com/en/abs/minimum-entropy-combinatorial-optimization-problems-1008.29282013-05-24 https://scifaro.com/en/abs/2-free-flood-it-is-polynomial-1008.30912010-08-19 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-knapsack-and-related-counting-problems-using-branching-programs-1008.31872010-08-20 https://scifaro.com/en/abs/an-approximation-algorithm-for-the-total-cover-problem-1008.32162010-08-20 https://scifaro.com/en/abs/celer-an-efficient-program-for-genotype-elimination-1008.33052010-08-20 https://scifaro.com/en/abs/maximum-betweenness-centrality-approximability-and-tractable-cases-1008.35032010-08-23 https://scifaro.com/en/abs/homogeneous-and-non-homogeneous-algorithms-1008.35462010-08-23 https://scifaro.com/en/abs/prediction-strategies-without-loss-1008.36722012-10-11 https://scifaro.com/en/abs/fully-automatic-trunk-packing-with-free-placements-1008.37732010-08-24 https://scifaro.com/en/abs/consecutive-ones-property-testing-cut-or-swap-1008.37862010-08-24 https://scifaro.com/en/abs/combinatorial-approximation-algorithms-for-maxcut-using-random-walks-1008.39382010-08-25 https://scifaro.com/en/abs/a-full-derandomization-of-schoening-s-k-sat-algorithm-1008.40672010-08-25 https://scifaro.com/en/abs/cluster-editing-kernelization-based-on-edge-cuts-1008.42502015-05-19 https://scifaro.com/en/abs/evacuation-of-rectilinear-polygons-1008.44202015-05-19 https://scifaro.com/en/abs/the-geometry-of-scheduling-1008.48892010-08-31 https://scifaro.com/en/abs/indexability-concentration-and-vc-theory-1008.51052012-04-13 https://scifaro.com/en/abs/multiple-source-single-sink-maximum-flow-in-directed-planar-graphs-in-o-n-1-5-log-n-time-1008.53322010-09-15 https://scifaro.com/en/abs/when-lp-is-the-cure-for-your-matching-woes-improved-bounds-for-stochastic-matchings-1008.53562010-09-01 https://scifaro.com/en/abs/grammar-based-geodesics-in-semantic-networks-1009.06702010-09-06 https://scifaro.com/en/abs/extended-h-index-parameterized-data-structures-for-computing-dynamic-subgraph-statistics-1009.07832012-07-18 https://scifaro.com/en/abs/a-quartic-kernel-for-pathwidth-one-vertex-deletion-1009.08062010-09-07 https://scifaro.com/en/abs/online-advertisement-optimization-and-stochastic-networks-1009.08702012-09-10 https://scifaro.com/en/abs/comparing-pedigree-graphs-1009.09092011-10-19 https://scifaro.com/en/abs/social-interaction-as-a-heuristic-for-combinatorial-optimization-problems-1009.11142010-12-01 https://scifaro.com/en/abs/a-branch-and-reduce-algorithm-for-finding-a-minimum-independent-dominating-set-1009.13812010-09-08 https://scifaro.com/en/abs/one-method-of-storing-information-1009.16972010-09-10 https://scifaro.com/en/abs/maximizing-the-total-resolution-of-graphs-1009.21092010-09-28 https://scifaro.com/en/abs/clustering-encoding-and-diameter-computation-algorithms-for-multidimensional-data-1009.21602010-09-14 https://scifaro.com/en/abs/deterministic-online-call-control-in-cellular-networks-and-triangle-free-cellular-networks-1009.23222010-09-14 https://scifaro.com/en/abs/facility-location-with-client-latencies-linear-programming-based-techniques-for-minimum-latency-problems-1009.24522010-09-14 https://scifaro.com/en/abs/small-vertex-cover-makes-petri-net-coverability-and-boundedness-easier-1009.25772015-05-19 https://scifaro.com/en/abs/popularity-at-minimum-cost-1009.25912010-09-15 https://scifaro.com/en/abs/simultaneous-interval-graphs-1009.35022010-09-21 https://scifaro.com/en/abs/center-based-clustering-under-perturbation-stability-1009.35942011-08-12 https://scifaro.com/en/abs/one-two-three-and-n-dimensional-string-search-algorithms-1009.38092010-11-03 https://scifaro.com/en/abs/a-memory-efficient-data-structure-representing-exact-match-overlap-graphs-with-application-for-next-generation-dna-assembly-1009.39842010-09-22 https://scifaro.com/en/abs/the-lazy-flipper-map-inference-in-higher-order-graphical-models-by-depth-limited-exhaustive-search-1009.41022010-09-22 https://scifaro.com/en/abs/a-versatile-algorithm-to-generate-various-combinatorial-structures-1009.42142010-10-01 https://scifaro.com/en/abs/the-sorting-buffer-problem-is-np-hard-1009.43552010-09-23 https://scifaro.com/en/abs/testing-simultaneous-planarity-when-the-common-graph-is-2-connected-1009.45172011-12-12 https://scifaro.com/en/abs/a-ptas-for-scheduling-with-tree-assignment-restrictions-1009.45292010-09-24 https://scifaro.com/en/abs/improving-ppsz-for-3-sat-using-critical-variables-1009.48302011-05-20 https://scifaro.com/en/abs/an-efficient-implementation-of-the-robust-tabu-search-heuristic-for-sparse-quadratic-assignment-problems-1009.48802010-09-27 https://scifaro.com/en/abs/fast-kernelization-based-on-graph-modular-decomposition-1009.51432010-10-04 https://scifaro.com/en/abs/efficient-clustering-with-limited-distance-information-1009.51682011-05-10 https://scifaro.com/en/abs/the-straight-line-rac-drawing-problem-is-np-hard-1009.52272015-05-20 https://scifaro.com/en/abs/testing-closeness-of-discrete-distributions-1009.53972010-11-05 https://scifaro.com/en/abs/priority-queues-with-multiple-time-fingers-1009.55382010-09-29 https://scifaro.com/en/abs/approximability-of-capacitated-network-design-1009.57342010-09-30 https://scifaro.com/en/abs/list-factoring-and-relative-worst-order-analysis-1009.57872015-03-17 https://scifaro.com/en/abs/fast-pseudo-random-fingerprints-1009.57912010-09-30 https://scifaro.com/en/abs/lrm-trees-compressed-indices-adaptive-sorting-and-compressed-permutations-1009.58632010-09-30 https://scifaro.com/en/abs/exact-analysis-of-pattern-matching-algorithms-with-probabilistic-arithmetic-automata-1009.61142010-10-01 https://scifaro.com/en/abs/l1-projections-with-box-constraints-1010.01412010-10-04 https://scifaro.com/en/abs/comparative-performance-of-tabu-search-and-simulated-annealing-heuristics-for-the-quadratic-assignment-problem-1010.01572010-10-04 https://scifaro.com/en/abs/polynomial-time-sortable-stacks-of-burnt-pancakes-1010.02192011-02-07 https://scifaro.com/en/abs/oblivious-buy-at-bulk-in-planar-graphs-1010.04012015-03-17 https://scifaro.com/en/abs/oblivious-algorithms-for-the-maximum-directed-cut-problem-1010.04062010-10-05 https://scifaro.com/en/abs/implementing-regularization-implicitly-via-approximate-eigenvector-computation-1010.07032011-04-28 https://scifaro.com/en/abs/methods-for-accelerating-conway-s-doomsday-algorithm-part-2-1010.07652011-08-09 https://scifaro.com/en/abs/engineering-time-dependent-one-to-all-computation-1010.08092010-10-06 https://scifaro.com/en/abs/superselectors-efficient-constructions-and-applications-1010.10242010-10-07 https://scifaro.com/en/abs/cut-matching-games-on-directed-graphs-1010.10472015-03-17 https://scifaro.com/en/abs/searching-in-dynamic-tree-like-partial-orders-1010.13162011-05-03 https://scifaro.com/en/abs/hitting-forbidden-minors-approximation-and-kernelization-1010.13652010-10-08 https://scifaro.com/en/abs/algorithmic-and-statistical-perspectives-on-large-scale-data-analysis-1010.16092010-10-11 https://scifaro.com/en/abs/transdichotomous-results-in-computational-geometry-ii-offline-search-1010.19482010-10-12 https://scifaro.com/en/abs/on-finding-frequent-patterns-in-event-sequences-1010.23582010-10-13 https://scifaro.com/en/abs/on-finding-similar-items-in-a-stream-of-transactions-1010.23712010-10-13 https://scifaro.com/en/abs/indexing-finite-language-representation-of-population-genotypes-1010.26562011-09-08 https://scifaro.com/en/abs/improved-complexity-bound-of-vertex-cover-for-low-degree-graph-1010.28332015-03-17 https://scifaro.com/en/abs/improved-approximations-for-robust-mincut-and-shortest-path-1010.28852010-10-15 https://scifaro.com/en/abs/electrical-flows-laplacian-systems-and-faster-approximation-of-maximum-flow-in-undirected-graphs-1010.29212010-10-20 https://scifaro.com/en/abs/fixed-parameter-tractability-of-multicut-parameterized-by-the-size-of-the-cutset-1010.36332015-03-17 https://scifaro.com/en/abs/the-set-of-realizations-of-a-max-plus-linear-sequence-is-semi-polyhedral-1010.36852011-03-14 https://scifaro.com/en/abs/unifying-the-landscape-of-cell-probe-lower-bounds-1010.37832010-10-20 https://scifaro.com/en/abs/random-projection-trees-revisited-1010.38122012-11-01 https://scifaro.com/en/abs/on-graph-crossing-number-and-edge-planarization-1010.39762010-10-20 https://scifaro.com/en/abs/towards-an-sdp-based-approach-to-spectral-methods-a-nearly-linear-time-algorithm-for-graph-partitioning-and-decomposition-1010.41082010-10-21 https://scifaro.com/en/abs/energy-efficient-multiprocessor-scheduling-for-flow-time-and-makespan-1010.41102014-10-14 https://scifaro.com/en/abs/wireless-capacity-with-oblivious-power-in-general-metrics-1010.42492012-03-15 https://scifaro.com/en/abs/online-square-packing-1010.45022010-10-22 https://scifaro.com/en/abs/property-testing-via-set-theoretic-operations-1010.49252010-10-26 https://scifaro.com/en/abs/a-unified-framework-for-testing-linear-invariant-properties-1010.50162010-10-26 https://scifaro.com/en/abs/multicut-is-fpt-1010.51972010-11-24 https://scifaro.com/en/abs/ppz-for-more-than-two-truth-values-an-algorithm-for-constraint-satisfaction-problems-1010.57172010-10-28 https://scifaro.com/en/abs/kernels-for-below-upper-bound-parameterizations-of-the-hitting-set-and-directed-dominating-set-problems-1010.58812011-07-11 https://scifaro.com/en/abs/python-for-education-the-exact-cover-problem-1010.58902014-06-17 https://scifaro.com/en/abs/upward-point-set-embeddability-1010.59372015-05-20 https://scifaro.com/en/abs/feedback-vertex-set-in-mixed-graphs-1010.59742015-03-17 https://scifaro.com/en/abs/approximating-subdense-instances-of-covering-problems-1011.00782010-11-10 https://scifaro.com/en/abs/an-active-learning-algorithm-for-ranking-from-pairwise-preferences-with-an-almost-optimal-query-complexity-1011.01082011-05-18 https://scifaro.com/en/abs/on-the-complexity-of-real-root-isolation-1011.03442015-03-17 https://scifaro.com/en/abs/cur-from-a-sparse-optimization-viewpoint-1011.04132010-11-02 https://scifaro.com/en/abs/efficient-triangle-counting-in-large-graphs-via-degree-based-vertex-partitioning-1011.04682015-05-20 https://scifaro.com/en/abs/a-better-tester-for-bipartiteness-1011.05312010-11-03 https://scifaro.com/en/abs/sorting-by-transpositions-is-difficult-1011.11572012-09-05 https://scifaro.com/en/abs/multiarmed-bandit-problems-with-delayed-feedback-1011.11612015-03-17 https://scifaro.com/en/abs/santa-claus-schedules-jobs-on-unrelated-machines-1011.11682011-03-22 https://scifaro.com/en/abs/hardness-and-approximation-of-the-asynchronous-border-minimization-problem-1011.12022010-11-05 https://scifaro.com/en/abs/streaming-algorithms-from-precision-sampling-1011.12632011-04-26 https://scifaro.com/en/abs/privately-releasing-conjunctions-and-the-statistical-query-barrier-1011.12962011-10-28 https://scifaro.com/en/abs/optimal-binary-search-trees-with-near-minimal-height-1011.13372010-11-08 https://scifaro.com/en/abs/cram-compressed-random-access-memory-1011.17082015-03-17 https://scifaro.com/en/abs/finding-topological-subgraphs-is-fixed-parameter-tractable-1011.18272015-03-17 https://scifaro.com/en/abs/asymptotically-optimal-randomized-rumor-spreading-1011.18682015-03-17 https://scifaro.com/en/abs/a-lower-bound-for-the-tree-width-of-planar-graphs-with-vital-linkages-1011.21362010-11-10 https://scifaro.com/en/abs/online-scheduling-on-identical-machines-using-srpt-1011.21872010-11-10 https://scifaro.com/en/abs/pareto-optimal-solutions-for-smoothed-analysts-1011.22492010-11-11 https://scifaro.com/en/abs/spin-the-bottle-sort-and-annealing-sort-oblivious-sorting-via-round-robin-random-comparisons-1011.24802015-03-17 https://scifaro.com/en/abs/recursive-sketching-for-frequency-moments-1011.25712015-03-17 https://scifaro.com/en/abs/rademacher-chaos-random-eulerian-graphs-and-the-sparse-johnson-lindenstrauss-transform-1011.25902010-11-12 https://scifaro.com/en/abs/improved-minimum-cuts-and-maximum-flows-in-undirected-planar-graphs-1011.28432010-11-23 https://scifaro.com/en/abs/worst-case-efficient-single-and-multiple-string-matching-in-the-word-ram-model-1011.34412015-05-20 https://scifaro.com/en/abs/counting-colours-in-compressed-strings-1011.34802010-11-16 https://scifaro.com/en/abs/pattern-kits-1011.34912011-04-05 https://scifaro.com/en/abs/fast-multiplication-of-matrices-with-decay-1011.35342010-11-17 https://scifaro.com/en/abs/directed-spanners-via-flow-based-linear-programs-1011.37012010-11-23 https://scifaro.com/en/abs/optimal-lower-bounds-for-universal-and-differentially-private-steiner-tree-and-tsp-1011.37702010-11-18 https://scifaro.com/en/abs/non-orthodox-combinatorial-models-based-on-discordant-structures-1011.39442011-01-13 https://scifaro.com/en/abs/combinatorial-geometry-of-graph-partitioning-i-1011.44012010-11-22 https://scifaro.com/en/abs/compressed-transmission-of-route-descriptions-1011.44652010-11-22 https://scifaro.com/en/abs/new-algorithms-on-wavelet-trees-and-applications-to-information-retrieval-1011.45322010-11-23 https://scifaro.com/en/abs/the-power-of-simple-tabulation-hashing-1011.52002011-05-10 https://scifaro.com/en/abs/layered-label-propagation-a-multiresolution-coordinate-free-ordering-for-compressing-social-networks-1011.54252011-10-17 https://scifaro.com/en/abs/proof-of-concept-fast-solutions-to-np-problems-by-using-sat-and-integer-programming-solvers-1011.54472010-11-25 https://scifaro.com/en/abs/exact-distance-oracles-for-planar-graphs-1011.55492011-11-11 https://scifaro.com/en/abs/hyperanf-approximating-the-neighbourhood-function-of-very-large-graphs-on-a-budget-1011.55992011-01-27 https://scifaro.com/en/abs/enumerative-lattice-algorithms-in-any-norm-via-m-ellipsoid-coverings-1011.56662011-06-14 https://scifaro.com/en/abs/steiner-transitive-closure-spanners-of-d-dimensional-posets-1011.61002010-11-30 https://scifaro.com/en/abs/computing-the-diameter-polynomially-faster-than-apsp-1011.61812011-01-14 https://scifaro.com/en/abs/contractions-removals-and-how-to-certify-3-connectivity-in-linear-time-1011.61872010-11-30 https://scifaro.com/en/abs/dominating-set-is-fixed-parameter-tractable-in-claw-free-graphs-1011.62392015-03-17 https://scifaro.com/en/abs/computing-multiway-cut-within-the-given-excess-over-the-largest-minimum-isolating-cut-1011.62672010-11-30 https://scifaro.com/en/abs/almost-optimal-explicit-johnson-lindenstrauss-transformations-1011.63972015-03-17 https://scifaro.com/en/abs/engineering-multilevel-graph-partitioning-algorithms-1012.00062011-04-05 https://scifaro.com/en/abs/domination-when-the-stars-are-out-1012.00122019-01-16 https://scifaro.com/en/abs/testing-of-sequences-by-simulation-1012.00322015-03-17 https://scifaro.com/en/abs/modelling-dynamic-programming-problems-by-generalized-d-graphs-1012.00582010-12-07 https://scifaro.com/en/abs/an-algorithm-for-the-graph-crossing-number-problem-1012.02552010-12-02 https://scifaro.com/en/abs/weighted-random-sampling-over-data-streams-1012.02562015-07-29 https://scifaro.com/en/abs/alpha-beta-fibonacci-search-1012.02592010-12-02 https://scifaro.com/en/abs/string-matching-with-inversions-and-translocations-in-linear-average-time-most-of-the-time-1012.02802013-05-09 https://scifaro.com/en/abs/infinite-computable-version-of-lovasz-local-lemma-1012.05572010-12-03 https://scifaro.com/en/abs/a-tight-bound-on-the-worst-case-number-of-comparisons-for-floyd-s-heap-construction-algorithm-1012.09562015-03-17 https://scifaro.com/en/abs/weighted-random-generation-of-context-free-languages-analysis-of-collisions-in-random-urn-occupancy-models-1012.11292010-12-07 https://scifaro.com/en/abs/lower-bounds-for-the-smoothed-number-of-pareto-optimal-solutions-1012.11632015-03-17 https://scifaro.com/en/abs/on-tuning-the-bad-character-rule-the-worst-character-rule-1012.13382010-12-08 https://scifaro.com/en/abs/sparser-johnson-lindenstrauss-transforms-1012.15772014-02-07 https://scifaro.com/en/abs/single-producer-single-consumer-queues-on-shared-cache-multi-core-systems-1012.18242010-12-09 https://scifaro.com/en/abs/capacitated-vehicle-routing-with-non-uniform-speeds-1012.18502010-12-09 https://scifaro.com/en/abs/sublinear-time-measurement-optimal-sparse-recovery-for-all-1012.18862011-07-15 https://scifaro.com/en/abs/transforming-a-random-graph-drawing-into-a-lombardi-drawing-1012.22022010-12-14 https://scifaro.com/en/abs/covering-cubes-and-the-closest-vector-problem-1012.22892010-12-13 https://scifaro.com/en/abs/the-exact-string-matching-problem-a-comprehensive-experimental-evaluation-1012.25472010-12-14 https://scifaro.com/en/abs/approximating-vertex-cover-in-dense-hypergraphs-1012.25732010-12-14 https://scifaro.com/en/abs/improved-distance-queries-in-planar-graphs-1012.28252011-02-23 https://scifaro.com/en/abs/an-improved-algorithm-for-bipartite-correlation-clustering-1012.30112010-12-15 https://scifaro.com/en/abs/e-i-t-the-internal-extent-formula-for-compacted-tries-1012.30242010-12-15 https://scifaro.com/en/abs/how-to-catch-l-2-heavy-hitters-on-sliding-windows-1012.31302014-07-29 https://scifaro.com/en/abs/maximizing-expected-utility-for-stochastic-combinatorial-optimization-problems-1012.31892016-11-18 https://scifaro.com/en/abs/validating-xml-documents-in-the-streaming-model-with-external-memory-1012.33112011-08-19 https://scifaro.com/en/abs/analysis-of-agglomerative-clustering-1012.36972014-03-10 https://scifaro.com/en/abs/balanced-interval-coloring-1012.39322010-12-20 https://scifaro.com/en/abs/improved-approximation-for-the-directed-spanner-problem-1012.40622010-12-21 https://scifaro.com/en/abs/computation-in-large-scale-scientific-and-internet-data-applications-is-a-focus-of-mmds-2010-1012.42312010-12-21 https://scifaro.com/en/abs/lightweight-lcp-array-construction-in-linear-time-1012.42632010-12-21 https://scifaro.com/en/abs/non-redundant-random-generation-from-weighted-context-free-languages-1012.45602010-12-22 https://scifaro.com/en/abs/vertex-cover-kernelization-revisited-upper-and-lower-bounds-for-a-refined-parameter-1012.47012015-03-17 https://scifaro.com/en/abs/a-simple-and-practical-algorithm-for-differentially-private-data-release-1012.47632012-03-16 https://scifaro.com/en/abs/tight-bounds-for-lp-samplers-finding-duplicates-in-streams-and-related-problems-1012.48892010-12-23 https://scifaro.com/en/abs/join-reachability-problems-in-directed-graphs-1012.49382010-12-23 https://scifaro.com/en/abs/robust-and-maxmin-optimization-under-matroid-and-knapsack-uncertainty-sets-1012.49622011-02-25 https://scifaro.com/en/abs/shortest-paths-with-pairwise-distinct-edge-labels-finding-biochemical-pathways-in-metabolic-networks-1012.50242010-12-23 https://scifaro.com/en/abs/no-break-dynamic-defragmentation-of-reconfigurable-devices-1012.53302011-11-14 https://scifaro.com/en/abs/quasirandom-rumor-spreading-1012.53512015-03-17 https://scifaro.com/en/abs/quasirandom-rumor-spreading-an-experimental-analysis-1012.53572015-03-17 https://scifaro.com/en/abs/near-approximation-of-maximum-weight-matching-through-efficient-weight-reduction-1012.59112011-01-12 https://scifaro.com/en/abs/popular-b-matchings-1101.00212011-01-04 https://scifaro.com/en/abs/an-algorithm-to-reduce-the-time-complexity-of-earliest-deadline-first-scheduling-algorithm-in-real-time-system-1101.00562011-01-04 https://scifaro.com/en/abs/a-searchable-compressed-edit-sensitive-parsing-1101.00802015-03-17 https://scifaro.com/en/abs/the-complexity-of-euclidian-2-dimension-travelling-salesman-problem-versus-general-assign-problem-np-is-not-p-1101.01602011-01-04 https://scifaro.com/en/abs/tight-cell-probe-bounds-for-online-integer-multiplication-and-convolution-1101.07682012-02-27 https://scifaro.com/en/abs/non-clairvoyant-scheduling-games-1101.12562011-01-07 https://scifaro.com/en/abs/extending-bron-kerbosch-for-solving-the-maximum-weight-clique-problem-1101.12662011-01-07 https://scifaro.com/en/abs/on-parsimonious-explanations-for-2-d-tree-and-linearly-ordered-data-1101.19412011-01-11 https://scifaro.com/en/abs/invertible-bloom-lookup-tables-1101.22452015-10-06 https://scifaro.com/en/abs/minimum-covering-with-travel-cost-1101.23602015-03-17 https://scifaro.com/en/abs/approximations-for-monotone-and-non-monotone-submodular-maximization-with-knapsack-constraints-1101.29402011-01-18 https://scifaro.com/en/abs/maximizing-non-monotone-submodular-set-functions-subject-to-different-constraints-combined-algorithms-1101.29732016-03-01 https://scifaro.com/en/abs/multi-stage-improved-route-planning-approach-theoretical-foundations-1101.31822011-11-16 https://scifaro.com/en/abs/multi-objective-optimization-for-the-dynamic-multi-pickup-and-delivery-problem-with-time-windows-1101.33962013-02-03 https://scifaro.com/en/abs/inducing-the-lcp-array-1101.34482011-01-19 https://scifaro.com/en/abs/clustering-protein-sequences-given-the-approximation-stability-of-the-min-sum-objective-function-1101.36202015-03-17 https://scifaro.com/en/abs/estimating-the-average-of-a-lipschitz-continuous-function-from-one-sample-1101.38042011-01-21 https://scifaro.com/en/abs/two-multivehicle-routing-problems-with-unit-time-windows-1101.39532011-01-21 https://scifaro.com/en/abs/speedup-in-the-traveling-repairman-problem-with-constrained-time-windows-1101.39602011-01-21 https://scifaro.com/en/abs/self-index-based-on-lz77-1101.40652011-01-24 https://scifaro.com/en/abs/linear-space-data-structures-for-range-mode-query-in-arrays-1101.40682011-01-24 https://scifaro.com/en/abs/high-confidence-predictions-under-adversarial-uncertainty-1101.44462011-01-25 https://scifaro.com/en/abs/adaptive-submodular-optimization-under-matroid-constraints-1101.44502015-03-17 https://scifaro.com/en/abs/conflict-packing-an-unifying-technique-to-obtain-polynomial-kernels-for-editing-problems-on-dense-instances-1101.44912014-01-31 https://scifaro.com/en/abs/approximating-the-influence-of-a-monotone-boolean-function-in-o-sqrt-n-query-complexity-1101.53452011-01-28 https://scifaro.com/en/abs/succincter-text-indexing-with-wildcards-1101.53762011-01-28 https://scifaro.com/en/abs/maintaining-arrays-of-contiguous-objects-1101.54072011-01-31 https://scifaro.com/en/abs/connection-errors-in-networks-of-linear-features-and-the-application-of-geometrical-reduction-in-spatial-data-algorithms-1101.54102015-04-07 https://scifaro.com/en/abs/compressed-string-dictionaries-1101.55062011-01-31 https://scifaro.com/en/abs/the-complexity-of-free-flood-it-on-2xn-boards-1101.55182015-03-18 https://scifaro.com/en/abs/a-4-3-approximation-for-tsp-on-cubic-3-edge-connected-graphs-1101.55862011-01-31 https://scifaro.com/en/abs/fault-tolerant-spanners-better-and-simpler-1101.57532011-02-01 https://scifaro.com/en/abs/the-complexity-of-flood-filling-games-on-graphs-1101.58762015-03-18 https://scifaro.com/en/abs/random-walk-on-directed-dynamic-graphs-1101.59442011-02-02 https://scifaro.com/en/abs/consecutive-ones-property-and-pq-trees-for-multisets-hardness-of-counting-their-orderings-1102.00412015-03-18 https://scifaro.com/en/abs/combined-data-structure-for-previous-and-next-smaller-values-1102.03952011-02-03 https://scifaro.com/en/abs/matrix-method-for-the-multi-salesmen-problem-tsp-with-several-vehicles-1102.04712011-02-04 https://scifaro.com/en/abs/adaptive-population-models-for-offspring-populations-and-parallel-evolutionary-algorithms-1102.05882011-03-03 https://scifaro.com/en/abs/linear-time-algorithms-for-graphs-of-bounded-rankwidth-a-fresh-look-using-game-theory-1102.09082011-02-07 https://scifaro.com/en/abs/a-new-data-layout-for-set-intersection-on-gpus-1102.10032011-02-07 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-a-special-case-of-linear-integer-programming-1102.11242015-03-18 https://scifaro.com/en/abs/one-to-rule-them-all-a-general-randomized-algorithm-for-buffer-management-with-bounded-delay-1102.12732011-02-08 https://scifaro.com/en/abs/algorithms-for-implicit-hitting-set-problems-1102.14722011-02-09 https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-boxicity-of-circular-arc-graphs-1102.15442011-02-09 https://scifaro.com/en/abs/restructuring-in-combinatorial-optimization-1102.17452011-02-10 https://scifaro.com/en/abs/algorithms-for-jumbled-pattern-matching-in-strings-1102.17462015-03-18 https://scifaro.com/en/abs/graph-coalition-structure-generation-1102.17472011-02-10 https://scifaro.com/en/abs/don-t-rush-into-a-union-take-time-to-find-your-roots-1102.17832011-03-29 https://scifaro.com/en/abs/multicriteria-steiner-tree-problem-for-communication-network-1102.25242011-02-15 https://scifaro.com/en/abs/algorithms-for-internal-validation-clustering-measures-in-the-post-genomic-era-1102.29152011-02-16 https://scifaro.com/en/abs/analysis-of-multi-stage-open-shop-processing-systems-1102.30292011-02-16 https://scifaro.com/en/abs/better-bounds-for-incremental-frequency-allocation-in-bipartite-graphs-1102.33932011-02-17 https://scifaro.com/en/abs/a-simple-ptas-for-weighted-matroid-matching-on-strongly-base-orderable-matroids-1102.34912011-02-18 https://scifaro.com/en/abs/even-better-framework-for-min-wise-based-algorithms-1102.35372011-02-18 https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-unsplittable-flow-on-paths-1102.36432015-03-19 https://scifaro.com/en/abs/approximation-algorithms-for-correlated-knapsacks-and-non-martingale-bandits-1102.37492011-02-21 https://scifaro.com/en/abs/efficient-algorithms-for-dualizing-large-scale-hypergraphs-1102.38132011-02-23 https://scifaro.com/en/abs/approximating-the-online-set-multicover-problems-via-randomized-winnowing-1102.40052015-03-19 https://scifaro.com/en/abs/antilope-a-lagrangian-relaxation-approach-to-the-de-novo-peptide-sequencing-problem-1102.40162011-03-29 https://scifaro.com/en/abs/an-fptas-for-the-lead-based-multiple-video-transmission-lmvt-problem-1102.41292011-10-06 https://scifaro.com/en/abs/improved-rip-analysis-of-orthogonal-matching-pursuit-1102.43112011-02-22 https://scifaro.com/en/abs/lgm-mining-frequent-subgraphs-from-linear-graphs-1102.44802011-03-08 https://scifaro.com/en/abs/digraph-description-of-k-interchange-technique-for-optimization-over-permutations-and-adaptive-algorithm-system-1102.44982011-02-23 https://scifaro.com/en/abs/on-dynamic-optimality-for-binary-search-trees-1102.45232011-02-23 https://scifaro.com/en/abs/a-nearly-mlogn-time-solver-for-sdd-linear-systems-1102.48422011-08-22 https://scifaro.com/en/abs/upper-bounds-for-maximally-greedy-binary-search-trees-1102.48842011-05-02 https://scifaro.com/en/abs/physical-expander-in-virtual-tree-overlay-1102.49812011-02-25 https://scifaro.com/en/abs/approximation-algorithms-for-union-and-intersection-covering-problems-1102.51052011-02-28 https://scifaro.com/en/abs/structure-aware-sampling-flexible-and-accurate-summarization-1102.51462011-02-28 https://scifaro.com/en/abs/sqfreeeval-an-almost-optimal-real-root-isolation-algorithm-1102.52662011-02-28 https://scifaro.com/en/abs/a-nearly-quadratic-gap-between-adaptive-and-non-adaptive-property-testers-1102.53092011-06-27 https://scifaro.com/en/abs/obtaining-a-bipartite-graph-by-contracting-few-edges-1102.54412011-03-08 https://scifaro.com/en/abs/minimum-makespan-multi-vehicle-dial-a-ride-1102.54502011-03-01 https://scifaro.com/en/abs/minimum-multicuts-and-steiner-forests-for-okamura-seymour-graphs-1102.54782011-03-01 https://scifaro.com/en/abs/pseudo-random-graphs-and-bit-probe-schemes-with-one-sided-error-1102.55382011-09-16 https://scifaro.com/en/abs/hierarchical-heavy-hitters-with-the-space-saving-algorithm-1102.55402011-08-10 https://scifaro.com/en/abs/hypergraph-partitioning-through-vertex-separators-on-graphs-1103.01062015-03-19 https://scifaro.com/en/abs/an-exact-and-o-1-time-heaviest-and-lightest-hitters-algorithm-for-sliding-window-data-streams-1103.01162011-03-02 https://scifaro.com/en/abs/a-linear-approximation-algorithm-for-2-dimensional-vector-packing-1103.02602011-03-02 https://scifaro.com/en/abs/listing-all-maximal-cliques-in-large-sparse-real-world-graphs-1103.03182011-03-03 https://scifaro.com/en/abs/refinements-of-miller-s-algorithm-over-weierstrass-curves-revisited-1103.03372011-03-03 https://scifaro.com/en/abs/solving-connectivity-problems-parameterized-by-treewidth-in-single-exponential-time-1103.05342011-03-03 https://scifaro.com/en/abs/locating-depots-for-capacitated-vehicle-routing-1103.09852011-03-08 https://scifaro.com/en/abs/near-optimal-column-based-matrix-reconstruction-1103.09952015-03-19 https://scifaro.com/en/abs/a-generalization-of-hopcroft-karp-algorithm-for-semi-matchings-and-covers-in-bipartite-graphs-maximum-semi-matching-problem-in-bipartite-graphs-1103.10912018-03-28 https://scifaro.com/en/abs/fully-dynamic-maximal-matching-in-o-log-n-update-time-1103.11092016-08-03 https://scifaro.com/en/abs/an-exact-algorithm-for-side-chain-placement-in-protein-design-1103.15032011-03-29 https://scifaro.com/en/abs/efficient-algorithms-for-distributed-detection-of-holes-and-boundaries-in-wireless-networks-1103.17712011-03-10 https://scifaro.com/en/abs/hereditary-biclique-helly-graphs-recognition-and-maximal-biclique-enumeration-1103.19172013-09-18 https://scifaro.com/en/abs/a-randomized-algorithm-based-on-threshold-accepting-to-approximate-the-star-discrepancy-1103.21022021-09-21 https://scifaro.com/en/abs/improved-space-time-tradeoffs-for-approximate-full-text-indexing-with-one-edit-error-1103.21672014-08-25 https://scifaro.com/en/abs/channel-assignment-via-fast-zeta-transform-1103.22752011-03-14 https://scifaro.com/en/abs/direction-reversing-quasi-random-rumor-spreading-with-restarts-1103.24292015-03-19 https://scifaro.com/en/abs/optimal-query-update-tradeoffs-in-versioned-dictionaries-1103.25662015-03-19 https://scifaro.com/en/abs/constant-time-algorithms-for-sparsity-matroids-1103.25812011-03-15 https://scifaro.com/en/abs/linear-pattern-matching-on-sparse-suffix-trees-1103.26132015-03-19 https://scifaro.com/en/abs/a-matrix-hyperbolic-cosine-algorithm-and-applications-1103.27932015-03-19 https://scifaro.com/en/abs/fast-q-gram-mining-on-slp-compressed-strings-1103.31142011-07-14 https://scifaro.com/en/abs/incremental-dimension-reduction-of-tensors-with-random-index-1103.35852017-03-16 https://scifaro.com/en/abs/gossip-pca-1103.41952011-03-23 https://scifaro.com/en/abs/stratified-b-trees-and-versioning-dictionaries-1103.42822015-03-19 https://scifaro.com/en/abs/an-implementation-of-range-trees-with-fractional-cascading-in-c-1103.45212011-03-24 https://scifaro.com/en/abs/the-topology-of-wireless-communication-1103.45662011-03-25 https://scifaro.com/en/abs/constructing-and-sampling-graphs-with-a-prescribed-joint-degree-distribution-1103.48752011-09-01 https://scifaro.com/en/abs/data-oblivious-external-memory-algorithms-for-the-compaction-selection-and-sorting-of-outsourced-data-1103.51022011-03-29 https://scifaro.com/en/abs/using-a-non-commutative-bernstein-bound-to-approximate-some-matrix-algorithms-in-the-spectral-norm-1103.54532011-03-29 https://scifaro.com/en/abs/acyclic-and-star-colorings-of-cographs-1103.55312011-03-30 https://scifaro.com/en/abs/polynomial-kernels-for-proper-interval-completion-and-related-problems-1103.55992011-04-18 https://scifaro.com/en/abs/recoverable-values-for-independent-sets-1103.56092011-03-30 https://scifaro.com/en/abs/buffer-overflow-management-with-class-segregation-1103.60492013-02-13 https://scifaro.com/en/abs/colorful-triangle-counting-and-a-mapreduce-implementation-1103.60732011-04-01 https://scifaro.com/en/abs/sparse-vector-distributions-and-recovery-from-compressed-sensing-1103.62462011-07-18 https://scifaro.com/en/abs/a-note-on-algorithms-for-connected-set-cover-problem-and-fault-tolerant-connected-set-cover-problem-1104.07332015-03-19 https://scifaro.com/en/abs/potent-tree-codes-and-their-applications-coding-for-interactive-communication-revisited-1104.07392011-04-06 https://scifaro.com/en/abs/streaming-algorithms-for-language-recognition-problems-1104.08482011-04-06 https://scifaro.com/en/abs/xheal-localized-self-healing-using-expanders-1104.08822011-04-06 https://scifaro.com/en/abs/locating-regions-in-a-sequence-under-density-constraints-1104.09192013-08-15 https://scifaro.com/en/abs/fixed-parameter-tractable-algorithm-for-firefighting-problem-1104.10442015-03-19 https://scifaro.com/en/abs/approximating-the-balanced-minimum-evolution-problem-1104.10802012-01-31 https://scifaro.com/en/abs/simultaneously-satisfying-linear-equations-over-mathbb-f-2-maxlin2-and-max-r-lin2-parameterized-above-average-1104.11352011-05-17 https://scifaro.com/en/abs/multi-hop-routing-and-scheduling-in-wireless-networks-in-the-sinr-model-1104.13302015-03-19 https://scifaro.com/en/abs/fast-local-computation-algorithms-1104.13772011-04-08 https://scifaro.com/en/abs/on-line-construction-of-position-heaps-1104.16012015-03-19 https://scifaro.com/en/abs/optimal-column-based-low-rank-matrix-reconstruction-1104.17322015-03-19 https://scifaro.com/en/abs/dimensionality-decrease-heuristics-for-np-complete-problems-1104.18222011-04-12 https://scifaro.com/en/abs/randomized-delta-edge-coloring-via-quaternion-of-complex-colors-1104.18522011-04-12 https://scifaro.com/en/abs/a-note-on-estimating-the-spectral-norm-of-a-matrix-efficiently-1104.20762011-04-13 https://scifaro.com/en/abs/subexponential-parameterized-algorithm-for-minimum-fill-in-1104.22302011-04-13 https://scifaro.com/en/abs/approximate-tree-decompositions-of-planar-graphs-in-linear-time-1104.22752016-05-17 https://scifaro.com/en/abs/linear-programming-in-the-semi-streaming-model-with-application-to-the-maximum-matching-problem-1104.23152015-03-19 https://scifaro.com/en/abs/dynamic-programming-for-graphs-on-surfaces-1104.24862015-03-19 https://scifaro.com/en/abs/faster-information-dissemination-in-dynamic-networks-via-network-coding-1104.25272011-04-14 https://scifaro.com/en/abs/using-hashing-to-solve-the-dictionary-problem-in-external-memory-1104.27992011-04-15 https://scifaro.com/en/abs/minimum-weight-cycles-and-triangles-equivalences-and-algorithms-1104.28822011-04-15 https://scifaro.com/en/abs/confluent-persistence-revisited-1104.30452011-04-18 https://scifaro.com/en/abs/problems-parameterized-by-treewidth-tractable-in-single-exponential-time-a-logical-approach-1104.30572011-04-18 https://scifaro.com/en/abs/i-o-efficient-data-structures-for-colored-range-and-prefix-reporting-1104.30842015-03-19 https://scifaro.com/en/abs/approximating-graphic-tsp-by-matchings-1104.30902015-03-19 https://scifaro.com/en/abs/on-stabilization-in-herman-s-algorithm-1104.31002011-04-18 https://scifaro.com/en/abs/parallel-recursive-state-compression-for-free-1104.31192011-05-17 https://scifaro.com/en/abs/improved-approximation-guarantees-for-lower-bounded-facility-location-1104.31282012-08-31 https://scifaro.com/en/abs/efficient-seeds-computation-revisited-1104.31532011-04-19 https://scifaro.com/en/abs/practical-and-efficient-split-decomposition-via-graph-labelled-trees-1104.32832012-11-01 https://scifaro.com/en/abs/practical-and-efficient-circle-graph-recognition-1104.32842012-11-01 https://scifaro.com/en/abs/contracting-graphs-to-paths-and-trees-1104.36772011-04-20 https://scifaro.com/en/abs/solving-the-closest-vector-problem-with-respect-to-l-p-norms-1104.37202011-09-27 https://scifaro.com/en/abs/how-to-play-unique-games-against-a-semi-random-adversary-1104.38062011-04-20 https://scifaro.com/en/abs/fixed-block-compression-boosting-in-fm-indexes-1104.38102011-04-20 https://scifaro.com/en/abs/courcelle-s-theorem-a-game-theoretic-approach-1104.39052011-04-21 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-minimum-cost-subset-k-connected-subgraph-problem-1104.39232013-01-21 https://scifaro.com/en/abs/laminar-families-and-metric-embeddings-non-bipartite-maximum-matching-problem-in-the-semi-streaming-model-1104.40582015-03-19 https://scifaro.com/en/abs/on-variants-of-the-matroid-secretary-problem-1104.40812011-12-13 https://scifaro.com/en/abs/pattern-matching-in-lempel-ziv-compressed-strings-fast-simple-and-deterministic-1104.42032011-04-22 https://scifaro.com/en/abs/preprocessing-for-treewidth-a-combinatorial-analysis-through-kernelization-1104.42172015-03-19 https://scifaro.com/en/abs/data-reduction-for-graph-coloring-problems-1104.42292015-03-19 https://scifaro.com/en/abs/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-1104.42792013-04-04 https://scifaro.com/en/abs/random-input-helps-searching-predecessors-1104.43532011-04-25 https://scifaro.com/en/abs/the-maximum-disjoint-paths-problem-on-multi-relations-social-networks-1104.43702012-03-22 https://scifaro.com/en/abs/towards-a-data-reduction-for-the-minimum-flip-supertree-problem-1104.44712011-04-25 https://scifaro.com/en/abs/polynomial-estimators-for-high-frequency-moments-1104.45522015-03-19 https://scifaro.com/en/abs/the-entropy-rounding-method-in-approximation-algorithms-1104.45972011-04-26 https://scifaro.com/en/abs/finding-light-spanners-in-bounded-pathwidth-graphs-1104.46692012-08-14 https://scifaro.com/en/abs/k-median-clustering-model-based-compressive-sensing-and-sparse-recovery-for-earth-mover-distance-1104.46742012-10-12 https://scifaro.com/en/abs/rounding-semidefinite-programming-hierarchies-via-global-correlation-1104.46802011-04-26 https://scifaro.com/en/abs/min-cuts-and-shortest-cycles-in-planar-graphs-in-o-n-log-log-n-time-1104.48902016-08-14 https://scifaro.com/en/abs/computing-the-girth-of-a-planar-graph-in-linear-time-1104.48922015-02-06 https://scifaro.com/en/abs/cuckoo-hashing-with-pages-1104.51112011-04-28 https://scifaro.com/en/abs/nearly-optimal-bounds-for-distributed-wireless-scheduling-in-the-sinr-model-1104.52002014-05-02 https://scifaro.com/en/abs/linear-space-approximate-distance-oracles-for-planar-bounded-genus-and-minor-free-graphs-1104.52142011-11-11 https://scifaro.com/en/abs/a-cuckoo-hashing-variant-with-improved-memory-utilization-and-insertion-time-1104.54002011-11-16 https://scifaro.com/en/abs/dynamic-range-majority-data-structures-1104.55172012-12-05 https://scifaro.com/en/abs/external-memory-multimaps-1104.55332011-09-19 https://scifaro.com/en/abs/randomized-algorithms-for-matrices-and-data-1104.55572011-11-16 https://scifaro.com/en/abs/an-improved-move-to-front-imtf-off-line-algorithm-for-the-list-accessing-problem-1105.01872011-05-03 https://scifaro.com/en/abs/improved-low-rank-matrix-decompositions-via-the-subsampled-randomized-hadamard-transform-1105.04642012-04-04 https://scifaro.com/en/abs/the-parameterized-complexity-of-k-edge-induced-subgraphs-1105.04772012-05-02 https://scifaro.com/en/abs/a-simpler-and-more-efficient-algorithm-for-the-next-to-shortest-path-problem-1105.06082012-03-22 https://scifaro.com/en/abs/topics-in-matrix-sampling-algorithms-1105.07092011-05-05 https://scifaro.com/en/abs/on-a-conjecture-of-compatibility-of-multi-states-characters-1105.11092011-05-06 https://scifaro.com/en/abs/testing-odd-cycle-freeness-in-boolean-functions-1105.13252012-07-16 https://scifaro.com/en/abs/practical-and-theoretical-improvements-for-bipartite-matching-using-the-pseudoflow-algorithm-1105.15692011-05-10 https://scifaro.com/en/abs/computing-majority-with-triple-queries-1105.16222011-05-10 https://scifaro.com/en/abs/property-testing-for-cyclic-groups-and-beyond-1105.18422021-10-05 https://scifaro.com/en/abs/practical-verified-computation-with-streaming-interactive-proofs-1105.20032015-03-19 https://scifaro.com/en/abs/submodular-cost-allocation-problem-and-applications-1105.20402011-05-12 https://scifaro.com/en/abs/approximation-algorithms-for-submodular-multiway-partition-1105.20482011-05-12 https://scifaro.com/en/abs/lp-based-approximation-algorithms-for-traveling-salesman-path-problems-1105.23912011-10-31 https://scifaro.com/en/abs/incremental-cycle-detection-topological-ordering-and-strong-component-maintenance-1105.23972011-05-13 https://scifaro.com/en/abs/smoothed-performance-guarantees-for-local-search-1105.26862013-04-29 https://scifaro.com/en/abs/hitting-and-harvesting-pumpkins-1105.27042014-10-10 https://scifaro.com/en/abs/invitation-to-algorithmic-uses-of-inclusion-exclusion-1105.29422015-03-19 https://scifaro.com/en/abs/rigid-components-in-fixed-lattice-and-cone-frameworks-1105.32342015-03-19 https://scifaro.com/en/abs/scalably-scheduling-power-heterogeneous-processors-1105.37482011-05-20 https://scifaro.com/en/abs/hierarchical-recursive-running-median-1105.38292015-03-19 https://scifaro.com/en/abs/approximating-subset-k-connectivity-problems-1105.42502011-05-24 https://scifaro.com/en/abs/quadratic-goldreich-levin-theorems-1105.43722019-06-14 https://scifaro.com/en/abs/a-geometric-approach-to-matrix-ordering-1105.44902011-05-24 https://scifaro.com/en/abs/a-fast-nearest-neighbor-search-algorithm-based-on-vector-quantization-1105.49532011-05-26 https://scifaro.com/en/abs/scheduling-under-precedence-communication-and-energy-constraints-1105.51772011-05-27 https://scifaro.com/en/abs/relational-schema-protocol-rsp-1105.57182011-05-31 https://scifaro.com/en/abs/algorithms-for-the-minimum-non-separating-path-and-the-balanced-connected-bipartition-problems-on-grid-graphs-with-erratum-1105.59152014-02-11 https://scifaro.com/en/abs/the-cell-probe-complexity-of-dynamic-range-counting-1105.59332012-08-28 https://scifaro.com/en/abs/a-polynomial-time-approximation-algorithm-for-the-two-commodity-splittable-flow-problem-1105.59792011-11-22 https://scifaro.com/en/abs/opportunistic-information-dissemination-in-mobile-ad-hoc-networks-adaptiveness-vs-obliviousness-and-randomization-vs-determinism-1105.61512011-06-01 https://scifaro.com/en/abs/lower-bounds-for-sparse-recovery-1106.03652011-06-06 https://scifaro.com/en/abs/physarum-can-compute-shortest-paths-1106.04232019-07-01 https://scifaro.com/en/abs/towards-p-np-via-k-sat-a-k-sat-algorithm-using-linear-algebra-on-finite-fields-1106.06832015-03-19 https://scifaro.com/en/abs/a-simple-characterization-of-the-minimal-obstruction-sets-for-three-state-perfect-phylogenies-1106.08742011-06-07 https://scifaro.com/en/abs/a-library-for-implementing-the-multiple-hypothesis-tracking-algorithm-1106.22632011-06-14 https://scifaro.com/en/abs/unconstrained-and-constrained-fault-tolerant-resource-allocation-1106.22942011-06-14 https://scifaro.com/en/abs/a-simple-algorithm-for-the-evaluation-of-the-hypergeometric-series-using-quasi-linear-time-and-linear-space-1106.23012012-08-08 https://scifaro.com/en/abs/on-vertex-covers-and-matching-number-of-trapezoid-graphs-1106.23512011-06-14 https://scifaro.com/en/abs/relative-lempel-ziv-factorization-for-efficient-storage-and-retrieval-of-web-collections-1106.25872015-03-19 https://scifaro.com/en/abs/sparseassembler-de-novo-assembly-with-the-sparse-de-bruijn-graph-1106.26032011-07-11 https://scifaro.com/en/abs/approximating-the-closest-vector-problem-using-an-approximate-shortest-vector-oracle-1106.26192011-06-20 https://scifaro.com/en/abs/geometric-simultaneous-rac-drawings-of-graphs-1106.26942011-06-15 https://scifaro.com/en/abs/efficient-algorithm-for-the-vertex-connectivity-of-trapezoid-graphs-1106.30372011-06-16 https://scifaro.com/en/abs/testing-list-h-homomorphisms-1106.31262011-06-17 https://scifaro.com/en/abs/parameterized-complexity-results-for-general-factors-in-bipartite-graphs-with-an-application-to-constraint-programming-1106.35272015-03-19 https://scifaro.com/en/abs/kernel-bounds-for-path-and-cycle-problems-1106.41412015-03-19 https://scifaro.com/en/abs/space-lower-bounds-for-online-pattern-matching-1106.44122011-06-23 https://scifaro.com/en/abs/parameterized-eulerian-strong-component-arc-deletion-problem-on-tournaments-1106.44542011-11-24 https://scifaro.com/en/abs/fast-isomorphism-testing-of-graphs-with-regularly-connected-components-1106.44892011-06-23 https://scifaro.com/en/abs/an-efficient-partitioning-oracle-for-bounded-treewidth-graphs-1106.45872011-06-24 https://scifaro.com/en/abs/space-efficient-data-analysis-queries-on-grids-1106.46492012-04-03 https://scifaro.com/en/abs/optimal-bi-valued-auctions-1106.46772011-06-24 https://scifaro.com/en/abs/algorithms-for-solving-rubik-s-cubes-1106.57362011-06-29 https://scifaro.com/en/abs/minimum-certificate-dispersal-with-tree-structures-1106.58452011-06-30 https://scifaro.com/en/abs/black-hole-search-with-finite-automata-scattered-in-a-synchronous-torus-1106.60372011-07-29 https://scifaro.com/en/abs/a-comparison-of-performance-measures-via-online-search-1106.61362015-03-19 https://scifaro.com/en/abs/external-memory-orthogonal-range-reporting-with-fast-updates-1106.62612011-07-01 https://scifaro.com/en/abs/external-memory-network-analysis-algorithms-for-naturally-sparse-graphs-1106.63362011-07-01 https://scifaro.com/en/abs/quadratic-time-algorithm-for-the-string-constrained-lcs-problem-1106.63422011-07-01 https://scifaro.com/en/abs/applications-of-discrepancy-theory-in-multiobjective-approximation-1107.06342011-07-05 https://scifaro.com/en/abs/generalized-maneuvers-in-route-planning-1107.07982011-11-07 https://scifaro.com/en/abs/the-traveling-salesman-problem-on-cubic-and-subcubic-graphs-1107.10522011-07-07 https://scifaro.com/en/abs/genome-halving-by-block-interchange-1107.10762011-07-07 https://scifaro.com/en/abs/not-so-easy-problems-for-tree-decomposable-graphs-1107.11772015-03-19 https://scifaro.com/en/abs/lift-and-project-integrality-gaps-for-the-traveling-salesperson-problem-1107.12652011-07-08 https://scifaro.com/en/abs/on-multiway-cut-parameterized-above-lower-bounds-1107.15852011-07-11 https://scifaro.com/en/abs/a-proof-of-the-boyd-carr-conjecture-1107.16282011-07-11 https://scifaro.com/en/abs/on-the-integrality-gap-of-the-subtour-lp-for-the-1-2-tsp-1107.16302014-02-26 https://scifaro.com/en/abs/hamiltonian-paths-in-two-classes-of-grid-graphs-1107.17802011-07-12 https://scifaro.com/en/abs/linear-index-coding-via-semidefinite-programming-1107.19582015-03-19 https://scifaro.com/en/abs/tight-approximation-bounds-for-vertex-cover-on-dense-k-partite-hypergraphs-1107.20002011-07-12 https://scifaro.com/en/abs/an-approximation-algorithm-for-k-sat-1107.20012011-07-12 https://scifaro.com/en/abs/a-note-on-the-generalized-min-sum-set-cover-problem-1107.20332011-07-12 https://scifaro.com/en/abs/speed-scaling-on-parallel-processors-with-migration-1107.21052011-07-13 https://scifaro.com/en/abs/the-simulated-greedy-algorithm-for-several-submodular-matroid-secretary-problems-1107.21882013-02-27 https://scifaro.com/en/abs/bidimensionality-and-geometric-graphs-1107.22212011-11-08 https://scifaro.com/en/abs/ibgp-and-constrained-connectivity-1107.22992011-07-13 https://scifaro.com/en/abs/a-linear-time-algorithm-for-seeds-computation-1107.24222019-03-15 https://scifaro.com/en/abs/on-the-approximability-and-hardness-of-minimum-topic-connected-overlay-and-its-special-instances-1107.24432016-11-25 https://scifaro.com/en/abs/maximum-matchings-via-glauber-dynamics-1107.24822011-08-18 https://scifaro.com/en/abs/matching-pursuits-with-random-sequential-subdictionaries-1107.25092012-04-06 https://scifaro.com/en/abs/routing-in-undirected-graphs-with-constant-congestion-1107.25542011-07-14 https://scifaro.com/en/abs/a-higher-order-cheeger-s-inequality-1107.26862011-12-09 https://scifaro.com/en/abs/learning-k-modal-distributions-via-testing-1107.27002014-09-16 https://scifaro.com/en/abs/learning-poisson-binomial-distributions-1107.27022015-02-18 https://scifaro.com/en/abs/restructuring-compressed-texts-without-explicit-decompression-1107.27292011-07-15 https://scifaro.com/en/abs/computing-q-gram-frequencies-on-collage-systems-1107.30192011-07-18 https://scifaro.com/en/abs/computing-q-gram-non-overlapping-frequencies-on-slp-compressed-texts-1107.30222011-07-18 https://scifaro.com/en/abs/compression-via-matroids-a-randomized-polynomial-kernel-for-odd-cycle-transversal-1107.30682015-03-19 https://scifaro.com/en/abs/compressive-mechanism-utilizing-sparse-representation-in-differential-privacy-1107.33502011-11-01 https://scifaro.com/en/abs/k-sort-a-new-sorting-algorithm-that-beats-heap-sort-for-n-70-lakhs-1107.36222011-07-20 https://scifaro.com/en/abs/on-polynomial-kernels-for-structural-parameterizations-of-odd-cycle-transversal-1107.36582011-07-20 https://scifaro.com/en/abs/co-nondeterminism-in-compositions-a-kernelization-lower-bound-for-a-ramsey-type-problem-1107.37042015-03-19 https://scifaro.com/en/abs/haplotype-inference-on-pedigrees-with-recombinations-errors-and-missing-genotypes-via-sat-solvers-1107.37242013-11-20 https://scifaro.com/en/abs/iterative-constructions-and-private-data-release-1107.37312011-07-26 https://scifaro.com/en/abs/lower-bounds-for-the-average-and-smoothed-number-of-pareto-optima-1107.38762011-07-21 https://scifaro.com/en/abs/detecting-2-joins-faster-1107.39772016-08-14 https://scifaro.com/en/abs/interference-minimization-in-physical-model-of-wireless-networks-1107.42222011-07-22 https://scifaro.com/en/abs/sorting-algorithms-with-restrictions-1107.42232011-07-22 https://scifaro.com/en/abs/fully-de-amortized-cuckoo-hashing-for-cache-oblivious-dictionaries-and-multimaps-1107.43782011-07-25 https://scifaro.com/en/abs/counting-perfect-matchings-as-fast-as-ryser-1107.44662011-10-17 https://scifaro.com/en/abs/approximation-algorithms-for-digraph-width-parameters-1107.48242026-05-22 https://scifaro.com/en/abs/approximating-minimum-power-edge-multicovers-1107.48932011-07-26 https://scifaro.com/en/abs/drawing-graphs-with-vertices-at-specified-positions-and-crossings-at-large-angles-1107.49702011-07-26 https://scifaro.com/en/abs/matroidal-degree-bounded-minimum-spanning-trees-1107.53292011-07-28 https://scifaro.com/en/abs/edge-coloring-series-parallel-multigraphs-1107.53702011-08-01 https://scifaro.com/en/abs/the-solution-space-geometry-of-random-linear-equations-1107.55502015-10-12 https://scifaro.com/en/abs/adaptive-drift-analysis-1108.02952012-04-20 https://scifaro.com/en/abs/a-comprehensive-study-of-an-online-packet-scheduling-algorithm-1108.03882011-08-02 https://scifaro.com/en/abs/towards-an-optimal-space-and-query-time-index-for-top-k-document-retrieval-1108.05542012-04-03 https://scifaro.com/en/abs/distributed-agreement-in-dynamic-peer-to-peer-networks-1108.08092015-03-19 https://scifaro.com/en/abs/scheduling-partially-ordered-jobs-faster-than-2-n-1108.08102012-07-02 https://scifaro.com/en/abs/towards-optimal-sorting-of-16-elements-1108.08662015-03-17 https://scifaro.com/en/abs/wireless-capacity-with-arbitrary-gain-matrix-1108.10552012-03-15 https://scifaro.com/en/abs/conauto-2-0-fast-isomorphism-testing-and-automorphism-group-computation-1108.10602011-08-05 https://scifaro.com/en/abs/13-9-approximation-for-graphic-tsp-1108.11302011-10-05 https://scifaro.com/en/abs/combinatorial-algorithms-for-capacitated-network-design-1108.11762015-03-19 https://scifaro.com/en/abs/compressed-matrix-multiplication-1108.13202015-03-19 https://scifaro.com/en/abs/fast-k-means-algorithm-clustering-1108.13512011-08-08 https://scifaro.com/en/abs/weak-dominance-drawings-and-linear-extension-diameter-1108.14392011-08-09 https://scifaro.com/en/abs/efficient-sum-based-hierarchical-smoothing-under-ell-1-norm-1108.17512011-08-09 https://scifaro.com/en/abs/succinct-representations-of-permutations-and-functions-1108.19832011-08-10 https://scifaro.com/en/abs/optimal-indexes-for-sparse-bit-vectors-1108.21572015-03-19 https://scifaro.com/en/abs/grothendieck-type-inequalities-in-combinatorial-optimization-1108.24642011-08-12 https://scifaro.com/en/abs/fast-approximation-algorithms-for-near-optimal-large-scale-network-monitoring-1108.30482013-12-04 https://scifaro.com/en/abs/upward-point-set-embeddability-for-convex-point-sets-is-in-p-1108.30922015-03-19 https://scifaro.com/en/abs/randomized-algorithms-for-tracking-distributed-count-frequencies-and-ranks-1108.34132011-12-05 https://scifaro.com/en/abs/model-for-networks-of-spatial-objects-and-simulation-of-geographical-phenomena-propagation-1108.35162021-12-14 https://scifaro.com/en/abs/sparseassembler2-sparse-k-mer-graph-for-memory-efficient-genome-assembly-1108.35562013-01-10 https://scifaro.com/en/abs/substring-range-reporting-1108.36832011-08-19 https://scifaro.com/en/abs/prismatic-algorithm-for-discrete-d-c-programming-problems-1108.42172011-08-23 https://scifaro.com/en/abs/lagrangian-relaxation-applied-to-sparse-global-network-alignment-1108.43582011-08-23 https://scifaro.com/en/abs/on-compressing-permutations-and-adaptive-sorting-1108.44082011-08-23 https://scifaro.com/en/abs/capacitated-domination-constant-factor-approximation-for-planar-graphs-1108.46062011-08-24 https://scifaro.com/en/abs/constraint-satisfaction-problems-parameterized-above-or-below-tight-bounds-a-survey-1108.48032011-08-25 https://scifaro.com/en/abs/a-k-3-2-approximation-algorithm-for-monotone-submodular-maximization-over-a-k-exchange-system-1108.49832012-03-13 https://scifaro.com/en/abs/rbo-protocol-broadcasting-huge-databases-for-tiny-receivers-1108.50952011-08-26 https://scifaro.com/en/abs/solving-hard-computational-problems-efficiently-asymptotic-parametric-complexity-3-coloring-algorithm-1108.54052015-03-19 https://scifaro.com/en/abs/linear-time-inference-of-strings-from-cover-arrays-using-a-binary-alphabet-1108.54222011-08-30 https://scifaro.com/en/abs/deciding-first-order-logic-properties-of-matroids-1108.54572011-08-30 https://scifaro.com/en/abs/new-results-on-the-fault-tolerant-facility-placement-problem-1108.54712011-08-30 https://scifaro.com/en/abs/the-update-complexity-of-selection-and-related-problems-1108.55252015-03-19 https://scifaro.com/en/abs/private-decayed-sum-estimation-under-continual-observation-1108.61232013-08-05 https://scifaro.com/en/abs/dna-lossless-differential-compression-algorithm-based-on-similarity-of-genomic-sequence-database-1109.00942011-09-05 https://scifaro.com/en/abs/a-tight-bound-on-the-length-of-odd-cycles-in-the-incompatibility-graph-of-a-non-c1p-matrix-1109.05622011-09-06 https://scifaro.com/en/abs/approximate-counting-via-correlation-decay-in-spin-systems-1109.06042011-11-09 https://scifaro.com/en/abs/maximum-segment-sum-monadically-distilled-tutorial-with-solutions-1109.07822011-11-21 https://scifaro.com/en/abs/specific-scientific-data-structures-and-their-processing-1109.07832011-09-06 https://scifaro.com/en/abs/a-deterministic-algorithm-for-fitting-a-step-function-to-a-weighted-point-set-1109.11522012-10-12 https://scifaro.com/en/abs/the-open-graph-archive-a-community-driven-effort-1109.14652011-11-10 https://scifaro.com/en/abs/pattern-matching-under-polynomial-transformation-1109.14942015-03-19 https://scifaro.com/en/abs/graph-expansion-and-communication-costs-of-fast-matrix-multiplication-1109.16932011-09-12 https://scifaro.com/en/abs/a-learning-theory-approach-to-non-interactive-database-privacy-1109.22292011-09-13 https://scifaro.com/en/abs/characterization-of-request-sequences-for-list-accessing-problem-and-new-theoretical-results-for-mtf-algorithm-1109.22312015-05-30 https://scifaro.com/en/abs/a-new-proposed-cost-model-for-list-accessing-problem-using-buffering-1109.22322015-05-30 https://scifaro.com/en/abs/efficient-minimization-of-higher-order-submodular-functions-using-monotonic-boolean-functions-1109.23042017-01-25 https://scifaro.com/en/abs/lossless-data-compression-on-gpgpu-architectures-1109.23482011-09-13 https://scifaro.com/en/abs/a-o-1-eps-2-n-time-sieving-algorithm-for-approximate-integer-programming-1109.24772011-10-03 https://scifaro.com/en/abs/more-compact-oracles-for-approximate-distances-in-planar-graphs-1109.26412011-11-01 https://scifaro.com/en/abs/encoding-2-d-range-maximum-queries-1109.28852012-04-26 https://scifaro.com/en/abs/faster-approximate-pattern-matching-in-compressed-repetitive-texts-1109.29302012-11-01 https://scifaro.com/en/abs/quantum-algorithms-of-solving-the-backtracking-of-one-dimensional-cellular-automata-1109.29982011-09-15 https://scifaro.com/en/abs/improved-distance-oracles-and-spanners-for-vertex-labeled-graphs-1109.31142012-02-10 https://scifaro.com/en/abs/max-throughput-for-conservative-k-of-n-testing-1109.34012012-10-31 https://scifaro.com/en/abs/packing-based-approximation-algorithm-for-the-k-set-cover-problem-1109.34182015-03-03 https://scifaro.com/en/abs/approximation-algorithms-for-variable-sized-and-generalized-bin-covering-1109.35442012-02-29 https://scifaro.com/en/abs/fast-approximation-of-matrix-coherence-and-statistical-leverage-1109.38432012-12-06 https://scifaro.com/en/abs/a-dynamic-stabbing-max-data-structure-with-sub-logarithmic-query-time-1109.38902011-09-20 https://scifaro.com/en/abs/concave-generalized-flows-with-applications-to-market-equilibria-1109.38932012-04-06 https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-strong-chromatic-index-of-halin-graphs-1109.39342011-09-20 https://scifaro.com/en/abs/a-faster-grammar-based-self-index-1109.39542012-09-28 https://scifaro.com/en/abs/tying-up-the-loose-ends-in-fully-lzw-compressed-pattern-matching-1109.40342011-09-20 https://scifaro.com/en/abs/a-simple-linear-space-data-structure-for-constant-time-range-minimum-query-1109.44602011-09-22 https://scifaro.com/en/abs/a-brief-overview-on-the-biopax-and-sbml-standards-for-formal-presentation-of-complex-biological-knowledge-1109.49192011-09-23 https://scifaro.com/en/abs/parameterized-matching-in-the-streaming-model-1109.52692012-09-25 https://scifaro.com/en/abs/online-sum-radii-clustering-1109.53252015-03-19 https://scifaro.com/en/abs/approximating-edit-distance-in-near-linear-time-1109.56352011-09-27 https://scifaro.com/en/abs/online-primal-dual-for-non-linear-optimization-with-applications-to-speed-scaling-1109.59312011-09-28 https://scifaro.com/en/abs/lsrn-a-parallel-iterative-solver-for-strongly-over-or-under-determined-systems-1109.59812012-02-21 https://scifaro.com/en/abs/space-efficient-local-computation-algorithms-1109.61782011-12-01 https://scifaro.com/en/abs/optimal-eviction-policies-for-stochastic-address-traces-1109.66432013-12-04 https://scifaro.com/en/abs/an-efficient-algorithm-to-find-a-set-of-nearest-elements-in-a-mesh-1110.01802011-10-04 https://scifaro.com/en/abs/fixed-parameter-tractability-of-directed-multiway-cut-parameterized-by-the-size-of-the-cutset-1110.02592015-03-19 https://scifaro.com/en/abs/algorithms-for-the-strong-chromatic-index-of-halin-graphs-distance-hereditary-graphs-and-maximal-outerplanar-graphs-1110.05832011-10-05 https://scifaro.com/en/abs/a-2-75-approximation-algorithm-for-the-unconstrained-traveling-tournament-problem-1110.06202016-01-15 https://scifaro.com/en/abs/wireless-connectivity-and-capacity-1110.09382012-03-15 https://scifaro.com/en/abs/the-query-commit-problem-1110.09902011-10-06 https://scifaro.com/en/abs/approximating-csps-with-global-cardinality-constraints-using-sdp-hierarchies-1110.10642011-10-06 https://scifaro.com/en/abs/a-near-optimal-sublinear-time-algorithm-for-approximating-the-minimum-vertex-cover-size-1110.10792011-10-06 https://scifaro.com/en/abs/optimal-deadline-scheduling-with-commitment-1110.11242011-10-07 https://scifaro.com/en/abs/efficient-encoding-of-watermark-numbers-as-reducible-permutation-graphs-1110.11942011-10-07 https://scifaro.com/en/abs/an-efficient-polynomial-time-approximation-scheme-for-steiner-forest-in-planar-graphs-1110.13202011-10-26 https://scifaro.com/en/abs/runtime-guarantees-for-regression-problems-1110.13582012-09-10 https://scifaro.com/en/abs/polynomial-integrality-gaps-for-strong-sdp-relaxations-of-densest-k-subgraph-1110.13602011-10-07 https://scifaro.com/en/abs/a-polylogarithmic-competitive-algorithm-for-the-k-server-problem-1110.15802011-10-10 https://scifaro.com/en/abs/on-the-strong-chromatic-index-and-maximum-induced-matching-of-tree-cographs-and-permutation-graphs-1110.16932011-10-11 https://scifaro.com/en/abs/regularized-laplacian-estimation-and-fast-eigenvector-approximation-1110.17572011-10-13 https://scifaro.com/en/abs/on-the-efficiency-of-influence-and-exploit-strategies-for-revenue-maximization-under-positive-externalities-1110.18942011-10-11 https://scifaro.com/en/abs/towards-optimal-kernel-for-connected-vertex-cover-in-planar-graphs-1110.19642011-10-11 https://scifaro.com/en/abs/minimum-latency-submodular-cover-1110.22072013-03-05 https://scifaro.com/en/abs/string-matching-with-variable-length-gaps-1110.28932011-10-14 https://scifaro.com/en/abs/randomized-dimensionality-reduction-for-k-means-clustering-1110.28972015-03-19 https://scifaro.com/en/abs/telling-two-distributions-apart-a-tight-characterization-1110.31002011-10-17 https://scifaro.com/en/abs/mining-patterns-in-networks-using-homomorphism-1110.32252015-03-19 https://scifaro.com/en/abs/partial-data-compression-and-text-indexing-via-optimal-suffix-multi-selection-1110.33812011-10-18 https://scifaro.com/en/abs/playing-mastermind-with-constant-size-memory-1110.36192015-03-19 https://scifaro.com/en/abs/on-the-power-of-adaptivity-in-sparse-recovery-1110.38502011-10-19 https://scifaro.com/en/abs/the-general-traveling-salesman-problem-version-5-1110.40522013-10-01 https://scifaro.com/en/abs/traffic-redundancy-aware-network-design-1110.41502011-10-20 https://scifaro.com/en/abs/min-max-graph-partitioning-and-small-set-expansion-1110.43192011-10-21 https://scifaro.com/en/abs/taking-roots-over-high-extensions-of-finite-fields-1110.43502011-10-20 https://scifaro.com/en/abs/1-eps-approximate-sparse-recovery-1110.44142011-12-30 https://scifaro.com/en/abs/improved-upper-bounds-for-pairing-heaps-1110.44282014-01-23 https://scifaro.com/en/abs/improved-grammar-based-compressed-indexes-1110.44932011-10-21 https://scifaro.com/en/abs/improving-christofides-algorithm-for-the-s-t-path-tsp-1110.46042011-11-03 https://scifaro.com/en/abs/finding-small-separators-in-linear-time-via-treewidth-reduction-1110.47652015-03-19 https://scifaro.com/en/abs/symmetry-and-approximability-of-submodular-maximization-problems-1110.48602013-01-31 https://scifaro.com/en/abs/strongly-polynomial-algorithm-for-a-class-of-minimum-cost-flow-problems-with-separable-convex-objectives-1110.48822016-06-07 https://scifaro.com/en/abs/string-indexing-for-patterns-with-wildcards-1110.52362012-09-07 https://scifaro.com/en/abs/computing-a-longest-common-palindromic-subsequence-1110.52962011-10-25 https://scifaro.com/en/abs/is-it-possible-to-find-the-maximum-clique-in-general-graphs-1110.53552012-02-21 https://scifaro.com/en/abs/secondary-spectrum-auctions-for-symmetric-and-submodular-bidders-1110.57532011-10-27 https://scifaro.com/en/abs/backdoors-to-acyclic-sat-1110.63842012-02-22 https://scifaro.com/en/abs/backdoors-to-satisfaction-1110.63872011-11-01 https://scifaro.com/en/abs/the-generalized-work-function-algorithm-is-competitive-for-the-generalized-2-server-problem-1110.66002013-11-28 https://scifaro.com/en/abs/the-binary-perfect-phylogeny-with-persistent-characters-1110.67392012-06-29 https://scifaro.com/en/abs/multicommodity-flows-and-cuts-in-polymatroidal-networks-1110.68322011-11-01 https://scifaro.com/en/abs/anonymous-meeting-in-networks-1111.03212016-03-15 https://scifaro.com/en/abs/outlier-detection-for-dna-fragment-assembly-1111.03762011-11-09 https://scifaro.com/en/abs/evaluating-geometric-queries-using-few-arithmetic-operations-1111.04992011-11-03 https://scifaro.com/en/abs/clique-cover-and-graph-separation-new-incompressibility-results-1111.05702011-11-03 https://scifaro.com/en/abs/beating-randomized-response-on-incoherent-matrices-1111.06232012-11-06 https://scifaro.com/en/abs/multidimensional-balanced-allocation-for-multiple-choice-1-beta-processes-1111.07622011-11-30 https://scifaro.com/en/abs/on-the-value-of-job-migration-in-online-makespan-minimization-1111.07732012-03-09 https://scifaro.com/en/abs/perfectly-balanced-allocation-with-estimated-average-using-expected-constant-retries-1111.08012011-12-30 https://scifaro.com/en/abs/active-property-testing-1111.08972012-04-18 https://scifaro.com/en/abs/computing-a-nonnegative-matrix-factorization-provably-1111.09522011-11-04 https://scifaro.com/en/abs/many-sparse-cuts-via-higher-eigenvalues-1111.09652015-03-19 https://scifaro.com/en/abs/structure-theorem-and-isomorphism-test-for-graphs-with-excluded-topological-subgraphs-1111.11092015-03-19 https://scifaro.com/en/abs/a-compressed-self-index-for-genomic-databases-1111.13552011-11-08 https://scifaro.com/en/abs/approximating-the-exponential-the-lanczos-method-and-an-tilde-o-m-time-spectral-algorithm-for-balanced-separator-1111.14912011-11-08 https://scifaro.com/en/abs/improved-smoothed-analysis-of-multiobjective-optimization-1111.15462015-01-16 https://scifaro.com/en/abs/de-amortizing-binary-search-trees-1111.16652011-11-08 https://scifaro.com/en/abs/a-systematic-approach-to-bound-factor-revealing-lps-and-its-application-to-the-metric-and-squared-metric-facility-location-problems-1111.16722015-03-19 https://scifaro.com/en/abs/tight-approximation-of-image-matching-1111.17132011-11-09 https://scifaro.com/en/abs/near-linear-work-parallel-sdd-solvers-low-diameter-decomposition-and-low-stretch-subgraphs-1111.17502011-11-09 https://scifaro.com/en/abs/generic-multiplicative-methods-for-implementing-machine-learning-algorithms-on-mapreduce-1111.21112011-12-05 https://scifaro.com/en/abs/representative-sets-and-irrelevant-vertices-new-tools-for-kernelization-1111.21952015-03-19 https://scifaro.com/en/abs/space-round-tradeoffs-for-mapreduce-computations-1111.22282013-06-13 https://scifaro.com/en/abs/testing-the-connectivity-of-networks-1111.25272014-02-12 https://scifaro.com/en/abs/optimal-lower-and-upper-bounds-for-representing-sequences-1111.26212013-08-26 https://scifaro.com/en/abs/the-tile-assembly-model-is-intrinsically-universal-1111.30972012-04-10 https://scifaro.com/en/abs/faster-fully-compressed-pattern-matching-by-recompression-1111.32442013-06-26 https://scifaro.com/en/abs/mining-biclusters-of-similar-values-with-triadic-concept-analysis-1111.32702011-11-15 https://scifaro.com/en/abs/cache-optimized-linear-sieve-1111.32972011-11-15 https://scifaro.com/en/abs/speed-scaling-with-power-down-scheduling-for-agreeable-deadlines-1111.33982012-10-23 https://scifaro.com/en/abs/fully-dynamic-recognition-of-proper-circular-arc-graphs-1111.35482014-08-18 https://scifaro.com/en/abs/the-debts-clearing-problem-a-new-approach-1111.36632011-11-17 https://scifaro.com/en/abs/modular-exponentiation-of-matrices-on-fpga-s-1111.36682015-03-19 https://scifaro.com/en/abs/large-primes-in-generalized-pascal-triangles-1111.36702011-11-17 https://scifaro.com/en/abs/the-feedback-arc-set-problem-with-triangle-inequality-is-a-vertex-cover-problem-1111.42992015-03-19 https://scifaro.com/en/abs/practical-top-k-document-retrieval-in-reduced-space-1111.43952011-11-21 https://scifaro.com/en/abs/integer-feasibility-of-random-polytopes-1111.46492013-08-27 https://scifaro.com/en/abs/on-strong-graph-partitions-and-universal-steiner-trees-1111.47662015-03-03 https://scifaro.com/en/abs/a-weighted-message-passing-algorithm-to-estimate-volume-related-properties-of-random-polytopes-1111.48412011-11-23 https://scifaro.com/en/abs/a-simple-optimal-binary-representation-of-mosaic-floorplans-and-baxter-permutations-1111.49372011-11-23 https://scifaro.com/en/abs/wireless-capacity-and-admission-control-in-cognitive-radio-1111.52002012-01-20 https://scifaro.com/en/abs/fast-compressed-tries-through-path-decompositions-1111.52202011-12-06 https://scifaro.com/en/abs/edit-distance-to-monotonicity-in-sliding-windows-1111.53862011-11-24 https://scifaro.com/en/abs/randomized-speedup-of-the-bellman-ford-algorithm-1111.54142011-11-24 https://scifaro.com/en/abs/directed-steiner-tree-and-the-lasserre-hierarchy-1111.54732012-06-13 https://scifaro.com/en/abs/energy-aware-scheduling-under-reliability-and-makespan-constraints-1111.55282012-08-03 https://scifaro.com/en/abs/faster-and-more-accurate-sequence-alignment-with-snap-1111.55722011-11-24 https://scifaro.com/en/abs/threshold-phenomena-in-k-dominant-skylines-of-random-samples-1111.62242011-11-29 https://scifaro.com/en/abs/a-combinatorial-algorithm-for-all-pairs-shortest-paths-in-directed-vertex-weighted-graphs-with-applications-to-disc-graphs-1111.65192014-01-28 https://scifaro.com/en/abs/on-the-integrality-gap-of-the-directed-component-relaxation-for-steiner-tree-1111.66982011-12-06 https://scifaro.com/en/abs/fast-private-data-release-algorithms-for-sparse-queries-1111.68422011-11-30 https://scifaro.com/en/abs/efficient-discovery-of-association-rules-and-frequent-itemsets-through-sampling-with-tight-performance-guarantees-1111.69372015-03-19 https://scifaro.com/en/abs/correlation-decay-up-to-uniqueness-in-spin-systems-1111.70642021-05-10 https://scifaro.com/en/abs/maximum-matching-in-semi-streaming-with-few-passes-1112.01842014-04-11 https://scifaro.com/en/abs/simultaneous-pq-ordering-with-applications-to-constrained-embedding-problems-1112.02452011-12-02 https://scifaro.com/en/abs/computing-on-binary-strings-1112.02782012-01-04 https://scifaro.com/en/abs/on-the-complexity-of-approximate-sum-of-sorted-list-1112.05202012-01-24 https://scifaro.com/en/abs/the-interval-ordering-problem-1112.05342011-12-05 https://scifaro.com/en/abs/a-new-approach-to-incremental-cycle-detection-and-related-problems-1112.07842011-12-06 https://scifaro.com/en/abs/scaling-algorithms-for-approximate-and-exact-maximum-weight-matching-1112.07902011-12-06 https://scifaro.com/en/abs/i-o-efficient-bisimulation-partitioning-on-very-large-directed-acyclic-graphs-1112.08572018-03-05 https://scifaro.com/en/abs/worst-case-optimal-priority-queues-via-extended-regular-counters-1112.09932011-12-06 https://scifaro.com/en/abs/approximating-the-diameter-of-planar-graphs-in-near-linear-time-1112.11162013-04-23 https://scifaro.com/en/abs/secretary-problems-with-convex-costs-1112.11362011-12-07 https://scifaro.com/en/abs/highly-concurrent-doubly-linked-lists-1112.11412011-12-07 https://scifaro.com/en/abs/efficient-computation-of-distance-sketches-in-distributed-networks-1112.12102011-12-07 https://scifaro.com/en/abs/on-the-complexity-of-strongly-connected-components-in-directed-hypergraphs-1112.14442014-04-08 https://scifaro.com/en/abs/jungles-bundles-and-fixed-parameter-tractability-1112.15382012-08-03 https://scifaro.com/en/abs/approximation-algorithms-for-edge-partitioned-vertex-cover-problems-1112.19452015-03-19 https://scifaro.com/en/abs/experiments-on-density-constrained-graph-clustering-1112.21432011-12-12 https://scifaro.com/en/abs/steiner-forest-orientation-problems-1112.22732012-07-19 https://scifaro.com/en/abs/on-problems-as-hard-as-cnfsat-1112.22752018-04-24 https://scifaro.com/en/abs/multiple-traveling-salesmen-in-asymmetric-metrics-1112.29302011-12-15 https://scifaro.com/en/abs/k-gap-interval-graphs-1112.32442011-12-19 https://scifaro.com/en/abs/independence-of-tabulation-based-hash-classes-1112.33232011-12-15 https://scifaro.com/en/abs/max-cut-parameterized-above-the-edwards-erd-h-o-s-bound-1112.35062013-11-07 https://scifaro.com/en/abs/approximation-algorithms-and-hardness-of-the-k-route-cut-problem-1112.36112015-03-19 https://scifaro.com/en/abs/root-finding-with-threshold-circuits-1112.39252012-10-24 https://scifaro.com/en/abs/approximating-non-uniform-sparsest-cut-via-generalized-spectra-1112.41092015-03-19 https://scifaro.com/en/abs/self-index-based-on-lz77-thesis-1112.45782011-12-21 https://scifaro.com/en/abs/random-generation-of-combinatorial-structures-boltzmann-samplers-and-beyond-1112.50712011-12-23 https://scifaro.com/en/abs/tight-bounds-for-distributed-functional-monitoring-1112.51532013-06-13 https://scifaro.com/en/abs/adcell-ad-allocation-in-cellular-networks-1112.53962012-01-10 https://scifaro.com/en/abs/cache-oblivious-implicit-predecessor-dictionaries-with-the-working-set-property-1112.54722012-07-05 https://scifaro.com/en/abs/tight-lower-bounds-for-online-labeling-problem-1112.56362015-03-19 https://scifaro.com/en/abs/testing-k-modal-distributions-optimal-algorithms-via-reductions-1112.56592011-12-26 https://scifaro.com/en/abs/partially-symmetric-functions-are-efficiently-isomorphism-testable-1112.57412011-12-30 https://scifaro.com/en/abs/on-group-feedback-vertex-set-parameterized-by-the-size-of-the-cutset-1112.62552011-12-30 https://scifaro.com/en/abs/1-epsilon-distance-oracle-for-planar-labeled-graph-1112.62562012-02-01 https://scifaro.com/en/abs/on-truncated-svd-like-sparse-solutions-to-least-squares-problems-of-arbitrary-dimensions-1201.00732014-11-05 https://scifaro.com/en/abs/faster-subset-selection-for-matrices-and-applications-1201.01272013-06-25 https://scifaro.com/en/abs/a-lower-bound-for-estimating-high-moments-of-a-data-stream-1201.02532015-03-19 https://scifaro.com/en/abs/there-is-no-16-clue-sudoku-solving-the-sudoku-minimum-number-of-clues-problem-1201.07492013-09-03 https://scifaro.com/en/abs/method-of-the-multidimensional-sieve-in-the-practical-realization-of-some-combinatorial-algorithms-1201.11572012-01-06 https://scifaro.com/en/abs/abstract-unordered-and-ordered-trees-crdt-1201.17842012-01-10 https://scifaro.com/en/abs/sitting-closer-to-friends-than-enemies-revisited-1201.18692012-01-10 https://scifaro.com/en/abs/dynamic-scope-based-dijkstra-s-algorithm-1201.20002012-01-11 https://scifaro.com/en/abs/relationships-in-large-scale-graph-computing-1201.22612015-03-12 https://scifaro.com/en/abs/nearly-optimal-sparse-fourier-transform-1201.25012012-04-09 https://scifaro.com/en/abs/dynamic-3-sided-planar-range-queries-with-expected-doubly-logarithmic-time-1201.27022012-01-16 https://scifaro.com/en/abs/faster-approximate-distance-queries-and-compact-routing-in-sparse-graphs-1201.27032012-01-16 https://scifaro.com/en/abs/linear-kernels-on-graphs-excluding-topological-minors-1201.27802012-07-16 https://scifaro.com/en/abs/a-bijective-string-sorting-transform-1201.30772012-01-17 https://scifaro.com/en/abs/using-neighborhood-diversity-to-solve-hard-problems-1201.30912012-01-18 https://scifaro.com/en/abs/multi-scale-community-detection-using-stability-optimisation-within-greedy-algorithms-1201.33072015-03-20 https://scifaro.com/en/abs/notes-on-bit-reversal-broadcast-scheduling-1201.33182012-01-17 https://scifaro.com/en/abs/compact-binary-relation-representations-with-rich-functionality-1201.36022012-01-18 https://scifaro.com/en/abs/tripnet-a-heuristic-algorithm-for-constructing-rooted-phylogenetic-networks-from-triplets-1201.37222012-01-19 https://scifaro.com/en/abs/a-simple-d-2-sampling-based-ptas-for-k-means-and-other-clustering-problems-1201.42062012-01-23 https://scifaro.com/en/abs/an-efficient-parallel-algorithm-for-the-longest-path-problem-in-meshes-1201.44592012-01-24 https://scifaro.com/en/abs/matroid-prophet-inequalities-1201.47642012-01-24 https://scifaro.com/en/abs/finding-endogenously-formed-communities-1201.48992012-03-02 https://scifaro.com/en/abs/online-multi-commodity-flow-with-high-demands-1201.50302012-04-24 https://scifaro.com/en/abs/faster-and-simpler-width-independent-parallel-algorithms-for-positive-semidefinite-programming-1201.51352016-02-23 https://scifaro.com/en/abs/faster-and-simpler-minimal-conflicting-set-identification-1201.55132012-01-27 https://scifaro.com/en/abs/limiting-byzantien-influence-in-multihop-asynchronous-networks-1201.58242012-01-30 https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-boxicity-1201.59582014-03-06 https://scifaro.com/en/abs/implementation-of-exponential-and-parametrized-algorithms-in-the-agape-project-1201.59852012-01-31 https://scifaro.com/en/abs/a-parallel-approximation-algorithm-for-mixed-packing-and-covering-semidefinite-programs-1201.60902012-01-31 https://scifaro.com/en/abs/k-probe-dh-graphs-1201.62072012-02-03 https://scifaro.com/en/abs/deterministic-polynomial-time-algorithms-for-designing-short-dna-words-1201.63582012-02-01 https://scifaro.com/en/abs/the-black-and-white-coloring-problem-on-permutation-graphs-1201.64212012-02-01 https://scifaro.com/en/abs/advanced-coarsening-schemes-for-graph-partitioning-1201.64882012-04-04 https://scifaro.com/en/abs/dynamic-shortest-path-algorithms-for-hypergraphs-1202.00822012-02-02 https://scifaro.com/en/abs/multiple-source-shortest-paths-in-embedded-graphs-1202.03142013-05-13 https://scifaro.com/en/abs/real-time-monitoring-of-undirected-networks-articulation-points-bridges-and-connected-and-biconnected-components-1202.03192020-06-16 https://scifaro.com/en/abs/a-note-on-probe-cographs-1202.03642012-02-03 https://scifaro.com/en/abs/packing-interval-graphs-with-vertex-disjoint-triangles-1202.10412012-02-07 https://scifaro.com/en/abs/the-covert-set-cover-problem-with-application-to-network-discovery-1202.10902015-03-20 https://scifaro.com/en/abs/thresholds-for-extreme-orientability-1202.11112012-02-16 https://scifaro.com/en/abs/fastsir-algorithm-a-fast-algorithm-for-simulation-of-epidemic-spread-in-large-networks-by-using-sir-compartment-model-1202.16392015-03-20 https://scifaro.com/en/abs/multi-scale-matrix-sampling-and-sublinear-time-pagerank-computation-1202.27712015-03-20 https://scifaro.com/en/abs/on-the-hardness-of-welfare-maximization-in-combinatorial-auctions-with-submodular-valuations-1202.27922015-03-20 https://scifaro.com/en/abs/on-approximating-string-selection-problems-with-outliers-1202.28202012-02-14 https://scifaro.com/en/abs/computing-resolution-path-dependencies-in-linear-time-1202.30972012-05-08 https://scifaro.com/en/abs/communication-optimal-parallel-algorithm-for-strassen-s-matrix-multiplication-1202.31732012-02-16 https://scifaro.com/en/abs/strong-scaling-of-matrix-multiplication-algorithms-and-memory-independent-communication-lower-bounds-1202.31772012-02-16 https://scifaro.com/en/abs/greedy-sequential-maximal-independent-set-and-matching-are-parallel-on-average-1202.32052012-02-16 https://scifaro.com/en/abs/linear-space-substring-range-counting-over-polylogarithmic-alphabets-1202.32082012-02-16 https://scifaro.com/en/abs/quick-detection-of-nodes-with-large-degrees-1202.32612012-02-16 https://scifaro.com/en/abs/speeding-up-q-gram-mining-on-grammar-based-compressed-texts-1202.33112013-05-27 https://scifaro.com/en/abs/faster-approximate-multicommodity-flow-using-quadratically-coupled-flows-1202.33672012-05-09 https://scifaro.com/en/abs/pattern-matching-in-multiple-streams-1202.34702012-04-26 https://scifaro.com/en/abs/near-optimal-coresets-for-least-squares-regression-1202.35052016-11-18 https://scifaro.com/en/abs/finding-a-most-biased-coin-with-fewest-flips-1202.36392013-09-10 https://scifaro.com/en/abs/an-efficient-polynomial-time-approximation-scheme-for-load-balancing-on-uniformly-related-machines-1202.40722015-03-20 https://scifaro.com/en/abs/cross-document-pattern-matching-1202.40762012-06-21 https://scifaro.com/en/abs/interval-routing-schemes-for-circular-arc-graphs-1202.41602016-06-28 https://scifaro.com/en/abs/space-constrained-interval-selection-1202.43262015-03-20 https://scifaro.com/en/abs/strong-backdoors-to-nested-satisfiability-1202.43312012-03-07 https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-reordering-buffer-management-1202.45042012-02-22 https://scifaro.com/en/abs/algorithms-and-almost-tight-results-for-3-colorability-of-small-diameter-graphs-1202.46652012-10-18 https://scifaro.com/en/abs/distributed-private-heavy-hitters-1202.49102018-03-16 https://scifaro.com/en/abs/algorithms-for-sampling-3-orientations-of-planar-triangulations-1202.49452012-02-23 https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-computing-the-supremum-of-gaussian-processes-1202.49702015-03-27 https://scifaro.com/en/abs/a-planarity-test-via-construction-sequences-1202.50032012-02-23 https://scifaro.com/en/abs/solving-single-digit-sudoku-subproblems-1202.50742012-03-06 https://scifaro.com/en/abs/computing-lempel-ziv-factorization-online-1202.52332012-12-03 https://scifaro.com/en/abs/persistent-monitoring-in-discrete-environments-minimizing-the-maximum-weighted-latency-between-observations-1202.56192012-10-17 https://scifaro.com/en/abs/really-tight-bounds-for-dispatching-binary-methods-1202.56702012-02-28 https://scifaro.com/en/abs/preserving-terminal-distances-using-minors-1202.56752012-08-21 https://scifaro.com/en/abs/fixed-parameter-tractability-of-multicut-in-directed-acyclic-graphs-1202.57492012-02-28 https://scifaro.com/en/abs/stochastic-vehicle-routing-with-recourse-1202.57972012-03-02 https://scifaro.com/en/abs/approximate-counting-of-matchings-in-sparse-hypergraphs-1202.58852012-04-06 https://scifaro.com/en/abs/fast-computation-of-the-performance-evaluation-of-biometric-systems-application-to-multibiometric-1202.59852012-02-28 https://scifaro.com/en/abs/diagonalization-matrix-method-of-solving-the-first-problem-of-hidden-markov-model-in-speech-recognition-system-1202.62562012-02-29 https://scifaro.com/en/abs/dictionary-learning-under-global-sparsity-constraint-1202.65622013-05-14 https://scifaro.com/en/abs/sublinear-time-approximate-sum-via-uniform-random-sampling-1202.65982012-03-01 https://scifaro.com/en/abs/deterministic-parameterized-connected-vertex-cover-1202.66422012-03-01 https://scifaro.com/en/abs/how-does-the-shift-insertion-sort-behave-when-the-sorting-elements-follow-a-normal-distribution-1203.01202012-03-02 https://scifaro.com/en/abs/label-cover-instances-with-large-girth-and-the-hardness-of-approximating-basic-k-spanner-1203.02242012-03-06 https://scifaro.com/en/abs/a-rearrangement-step-with-potential-uses-in-priority-queues-1203.02592012-03-02 https://scifaro.com/en/abs/secure-multi-party-computation-in-large-networks-1203.02892015-09-29 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-optimal-large-scale-network-monitoring-1203.05432016-08-02 https://scifaro.com/en/abs/approximate-computation-and-implicit-regularization-for-very-large-scale-data-analysis-1203.07862012-03-06 https://scifaro.com/en/abs/faster-parameterized-algorithms-using-linear-programming-1203.08332012-03-14 https://scifaro.com/en/abs/an-exploratory-study-of-critical-factors-affecting-the-efficiency-of-sorting-techniques-shell-heap-and-treap-1203.12502012-03-07 https://scifaro.com/en/abs/known-algorithms-for-edge-clique-cover-are-probably-optimal-1203.17542012-09-27 https://scifaro.com/en/abs/partition-sort-revisited-reconfirming-the-robustness-in-average-case-and-much-more-1203.18302012-03-28 https://scifaro.com/en/abs/an-optimal-algorithm-for-conflict-free-coloring-for-tree-of-rings-1203.24142012-03-13 https://scifaro.com/en/abs/on-an-optimization-technique-using-binary-decision-diagram-1203.25052012-03-29 https://scifaro.com/en/abs/spanning-trees-and-the-complexity-of-flood-filling-games-1203.25382013-06-14 https://scifaro.com/en/abs/biclique-colouring-verification-complexity-and-biclique-colouring-power-graphs-1203.25432013-04-03 https://scifaro.com/en/abs/efficient-enumeration-of-the-directed-binary-perfect-phylogenies-from-incomplete-data-1203.32842012-03-16 https://scifaro.com/en/abs/acc-motif-detection-tool-1203.34152013-04-22 https://scifaro.com/en/abs/iterative-rounding-approximation-algorithms-for-degree-bounded-node-connectivity-network-design-1203.35782015-08-11 https://scifaro.com/en/abs/ad-serving-using-a-compact-allocation-plan-1203.35932012-03-19 https://scifaro.com/en/abs/picture-hanging-puzzles-1203.36022014-04-29 https://scifaro.com/en/abs/shale-an-efficient-algorithm-for-allocation-of-guaranteed-display-advertising-1203.36192012-03-19 https://scifaro.com/en/abs/how-to-attack-the-np-complete-dag-realization-problem-in-practice-1203.36362012-03-19 https://scifaro.com/en/abs/a-note-on-the-fast-power-series-exponential-1203.38832012-03-20 https://scifaro.com/en/abs/a-more-reliable-greedy-heuristic-for-maximum-matchings-in-sparse-random-graphs-1203.41172012-03-20 https://scifaro.com/en/abs/online-load-balancing-on-unrelated-machines-with-startup-costs-1203.46192012-03-22 https://scifaro.com/en/abs/isomorphism-of-graph-classes-related-to-the-circular-ones-property-1203.48222013-09-18 https://scifaro.com/en/abs/on-a-new-method-of-storing-a-variable-size-array-1203.48362012-03-23 https://scifaro.com/en/abs/single-pass-sparsification-in-the-streaming-model-with-edge-deletions-1203.49002012-03-23 https://scifaro.com/en/abs/distance-queries-from-sampled-data-accurate-and-efficient-1203.49032015-03-20 https://scifaro.com/en/abs/work-function-algorithm-can-forget-history-without-losing-competitiveness-1203.49202012-03-23 https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-next-to-shortest-path-problem-on-undirected-graphs-with-nonnegative-edge-lengths-1203.52352012-03-26 https://scifaro.com/en/abs/finding-connected-components-on-map-reduce-in-logarithmic-rounds-1203.53872012-11-14 https://scifaro.com/en/abs/optimal-private-halfspace-counting-via-discrepancy-1203.54532012-03-27 https://scifaro.com/en/abs/a-note-on-triangle-partitions-1203.54642012-03-27 https://scifaro.com/en/abs/memory-hierarchy-sensitive-graph-layout-1203.56752012-03-27 https://scifaro.com/en/abs/constructive-discrepancy-minimization-by-walking-on-the-edges-1203.57472012-10-15 https://scifaro.com/en/abs/small-ell-edge-covers-in-k-connected-graphs-1203.62742012-03-29 https://scifaro.com/en/abs/max-sum-diversification-monotone-submodular-functions-and-dynamic-updates-1203.63972016-11-28 https://scifaro.com/en/abs/online-mixed-packing-and-covering-1203.66952012-04-04 https://scifaro.com/en/abs/fast-matrix-rank-algorithms-and-applications-1203.67052015-03-20 https://scifaro.com/en/abs/improved-matrix-algorithms-via-the-subsampled-randomized-hadamard-transform-1204.00622015-03-20 https://scifaro.com/en/abs/improved-approximation-for-orienting-mixed-graphs-1204.02192012-04-03 https://scifaro.com/en/abs/sequential-parallel-algorithms-for-big-integer-numbers-subtraction-1204.02202012-04-03 https://scifaro.com/en/abs/sequential-and-parallel-algorithms-for-the-addition-of-big-integer-numbers-1204.02322012-04-03 https://scifaro.com/en/abs/a-new-approach-to-online-scheduling-approximating-the-optimal-competitive-ratio-1204.08972012-11-01 https://scifaro.com/en/abs/approximability-of-the-vertex-cover-problem-in-power-law-graphs-1204.09822012-04-06 https://scifaro.com/en/abs/fast-multi-scale-detection-of-relevant-communities-1204.10022015-03-20 https://scifaro.com/en/abs/online-submodular-welfare-maximization-greedy-is-optimal-1204.10252013-01-31 https://scifaro.com/en/abs/set-it-and-forget-it-approximating-the-set-once-strip-cover-problem-1204.10822013-08-20 https://scifaro.com/en/abs/space-efficient-streaming-algorithms-for-the-distance-to-monotonicity-and-asymmetric-edit-distance-1204.10982013-04-16 https://scifaro.com/en/abs/faster-algorithms-for-rectangular-matrix-multiplication-1204.11112021-10-05 https://scifaro.com/en/abs/faster-walks-in-graphs-a-tilde-o-n-2-time-space-trade-off-for-undirected-s-t-connectivity-1204.11362012-07-11 https://scifaro.com/en/abs/on-the-value-of-multiple-read-write-streams-for-data-compression-1204.12152012-04-06 https://scifaro.com/en/abs/an-approximation-algorithm-for-the-link-building-problem-1204.13692015-03-20 https://scifaro.com/en/abs/a-single-exponential-fpt-algorithm-for-the-k-4-minor-cover-problem-1204.14172012-04-09 https://scifaro.com/en/abs/learning-fuzzy-beta-certain-and-beta-possible-rules-from-incomplete-quantitative-data-by-rough-sets-1204.14672012-04-09 https://scifaro.com/en/abs/algorithmic-applications-of-baur-strassen-s-theorem-shortest-cycles-diameter-and-matchings-1204.16162012-08-20 https://scifaro.com/en/abs/random-walks-which-prefer-unvisited-edges-exploring-high-girth-even-degree-expanders-in-linear-time-1204.19392015-03-20 https://scifaro.com/en/abs/succinct-posets-1204.19572012-04-24 https://scifaro.com/en/abs/parallel-and-sequential-in-place-permuting-and-perfect-shuffling-using-involutions-1204.19582015-03-20 https://scifaro.com/en/abs/approximating-the-expansion-profile-and-almost-optimal-local-graph-clustering-1204.20212012-11-07 https://scifaro.com/en/abs/on-thresholds-for-the-appearance-of-2-cores-in-mixed-hypergraphs-1204.21312012-04-11 https://scifaro.com/en/abs/the-johnson-lindenstrauss-transform-itself-preserves-differential-privacy-1204.21362012-08-21 https://scifaro.com/en/abs/modeling-relational-data-via-latent-factor-blockmodel-1204.25812012-04-13 https://scifaro.com/en/abs/privacy-via-the-johnson-lindenstrauss-transform-1204.26062018-07-16 https://scifaro.com/en/abs/on-vertex-sparsifiers-with-steiner-nodes-1204.28442012-04-16 https://scifaro.com/en/abs/disconnectivity-and-relative-positions-in-simultaneous-embeddings-1204.29032015-06-22 https://scifaro.com/en/abs/improved-randomized-online-scheduling-of-intervals-and-jobs-1204.29332012-04-16 https://scifaro.com/en/abs/label-guided-graph-exploration-with-adjustable-ratio-of-labels-1204.29552012-05-01 https://scifaro.com/en/abs/algorithms-for-junctions-in-directed-acyclic-graphs-1204.31132012-04-17 https://scifaro.com/en/abs/testing-formula-satisfaction-1204.34132014-03-28 https://scifaro.com/en/abs/efficient-sub-5-approximations-for-minimum-dominating-sets-in-unit-disk-graphs-1204.34882014-02-07 https://scifaro.com/en/abs/the-wavelet-trie-maintaining-an-indexed-sequence-of-strings-in-compressed-space-1204.35812012-04-17 https://scifaro.com/en/abs/access-graphs-results-for-lru-versus-fifo-under-relative-worst-order-analysis-1204.40472012-08-23 https://scifaro.com/en/abs/coalescing-random-walks-and-voting-on-connected-graphs-1204.41062016-12-28 https://scifaro.com/en/abs/connectivity-oracles-for-planar-graphs-1204.41592012-04-24 https://scifaro.com/en/abs/planar-f-deletion-approximation-kernelization-and-optimal-fpt-algorithms-1204.42302020-11-03 https://scifaro.com/en/abs/explicit-and-efficient-hash-families-suffice-for-cuckoo-hashing-with-a-stash-1204.44312012-04-20 https://scifaro.com/en/abs/sorted-range-reporting-1204.45092012-04-26 https://scifaro.com/en/abs/a-tight-combinatorial-algorithm-for-submodular-maximization-subject-to-a-matroid-constraint-1204.45262013-11-20 https://scifaro.com/en/abs/a-tight-linearization-strategy-for-zero-one-quadratic-programming-problems-1204.45622012-04-23 https://scifaro.com/en/abs/finding-small-sparse-cuts-locally-by-random-walk-1204.46662012-04-23 https://scifaro.com/en/abs/markov-chain-methods-for-small-set-expansion-1204.46882013-11-05 https://scifaro.com/en/abs/string-trees-1204.47652015-03-20 https://scifaro.com/en/abs/improved-balas-and-mazzola-linearization-for-quadratic-0-1-programs-with-application-in-a-new-cutting-plane-algorithm-1204.48292012-04-24 https://scifaro.com/en/abs/succinct-indices-for-range-queries-with-applications-to-orthogonal-range-maxima-1204.48352012-04-24 https://scifaro.com/en/abs/a-polynomial-kernel-for-proper-interval-vertex-deletion-1204.48802015-03-20 https://scifaro.com/en/abs/optimal-orthogonal-graph-drawing-with-convex-bend-costs-1204.49972012-04-24 https://scifaro.com/en/abs/the-parameterized-complexity-analysis-of-partition-sort-for-negative-binomial-distribution-inputs-1204.50232012-04-24 https://scifaro.com/en/abs/smart-sort-design-and-analysis-of-a-fast-efficient-and-robust-comparison-based-internal-sort-algorithm-1204.50832012-04-24 https://scifaro.com/en/abs/obtaining-planarity-by-contracting-few-edges-1204.51132012-04-24 https://scifaro.com/en/abs/a-fast-algorithm-for-permutation-pattern-matching-based-on-alternating-runs-1204.52242015-03-17 https://scifaro.com/en/abs/selection-in-the-presence-of-memory-faults-with-applications-to-in-place-resilient-sorting-1204.52292012-08-30 https://scifaro.com/en/abs/approximate-counting-of-matchings-in-sparse-uniform-hypergraphs-1204.53352012-04-25 https://scifaro.com/en/abs/faster-treasure-hunt-and-better-strongly-universal-exploration-sequences-1204.54422012-04-25 https://scifaro.com/en/abs/on-the-complexity-of-the-monte-carlo-method-for-incremental-pagerank-1204.55002014-04-15 https://scifaro.com/en/abs/time-and-space-efficient-lempel-ziv-factorization-based-on-run-length-encoding-1204.55242015-03-20 https://scifaro.com/en/abs/rerouting-shortest-paths-in-planar-graphs-1204.56132015-03-20 https://scifaro.com/en/abs/multi-agent-path-planning-and-network-flow-1204.57172015-03-20 https://scifaro.com/en/abs/optimal-prefix-free-code-in-linear-time-1204.58012017-03-02 https://scifaro.com/en/abs/geometry-of-online-packing-linear-programs-1204.58102012-04-27 https://scifaro.com/en/abs/a-bicriteria-approximation-for-the-reordering-buffer-problem-1204.58232012-04-27 https://scifaro.com/en/abs/efficient-generation-epsilon-close-to-g-n-p-and-generalizations-1204.58342012-07-13 https://scifaro.com/en/abs/simultaneous-embedding-of-planar-graphs-1204.58532015-06-22 https://scifaro.com/en/abs/chain-rotations-a-new-look-at-tree-distance-1204.59292012-04-27 https://scifaro.com/en/abs/clustering-by-hypergraphs-and-dimensionality-of-cluster-systems-1204.59522012-08-01 https://scifaro.com/en/abs/msol-restricted-contractibility-to-planar-graphs-1204.60702017-05-08 https://scifaro.com/en/abs/strong-backdoors-to-bounded-treewidth-sat-1204.62332012-04-30 https://scifaro.com/en/abs/extending-partial-representations-of-function-graphs-and-permutation-graphs-1204.63912012-05-01 https://scifaro.com/en/abs/efficient-cache-oblivious-algorithms-for-randomized-divide-and-conquer-on-the-multicore-model-1204.65082012-05-29 https://scifaro.com/en/abs/a-singly-exponential-time-algorithm-for-computing-nonnegative-rank-1205.00442012-05-02 https://scifaro.com/en/abs/everywhere-sparse-spanners-via-dense-subgraphs-1205.01442012-05-02 https://scifaro.com/en/abs/approximating-sparse-covering-integer-programs-online-1205.01752012-05-02 https://scifaro.com/en/abs/large-scale-compression-of-genomic-sequence-databases-with-the-burrows-wheeler-transform-1205.01922015-03-20 https://scifaro.com/en/abs/th-scalable-distributed-trie-hashing-1205.04392012-05-03 https://scifaro.com/en/abs/better-balance-by-being-biased-a-0-8776-approximation-for-max-bisection-1205.04582012-07-09 https://scifaro.com/en/abs/order-preserving-renaming-in-synchronous-message-passing-systems-with-byzantine-faults-1205.04772013-03-05 https://scifaro.com/en/abs/scalable-mechanisms-for-rational-secret-sharing-1205.05812012-05-04 https://scifaro.com/en/abs/breaking-the-n-log-n-barrier-for-solvable-group-isomorphism-1205.06422013-12-12 https://scifaro.com/en/abs/scheduling-unrelated-machines-of-few-different-types-1205.09742012-05-07 https://scifaro.com/en/abs/a-durable-flash-memory-search-tree-1205.11142012-05-08 https://scifaro.com/en/abs/an-overview-on-clustering-methods-1205.11172012-05-08 https://scifaro.com/en/abs/sequential-access-fm-indexes-1205.11952012-05-08 https://scifaro.com/en/abs/a-rounding-by-sampling-approach-to-the-minimum-size-k-arc-connected-subgraph-problem-1205.12622012-05-09 https://scifaro.com/en/abs/directed-subset-feedback-vertex-set-is-fixed-parameter-tractable-1205.12712014-12-03 https://scifaro.com/en/abs/lp-rounding-algorithms-for-the-fault-tolerant-facility-placement-problem-1205.12812013-04-16 https://scifaro.com/en/abs/converting-online-algorithms-to-local-computation-algorithms-1205.13122012-05-08 https://scifaro.com/en/abs/quasi-polynomial-local-search-for-restricted-max-min-fair-allocation-1205.13732014-01-21 https://scifaro.com/en/abs/approximation-algorithms-for-online-weighted-rank-function-maximization-under-matroid-constraints-1205.14772012-05-08 https://scifaro.com/en/abs/anonymous-card-shuffling-and-its-applications-to-parallel-mixnets-1205.15792012-06-29 https://scifaro.com/en/abs/testing-coverage-functions-1205.15872012-05-09 https://scifaro.com/en/abs/matching-with-commitments-1205.17212015-03-20 https://scifaro.com/en/abs/faster-algorithms-for-privately-releasing-marginals-1205.17582014-03-17 https://scifaro.com/en/abs/strong-conflict-free-coloring-of-intervals-1205.19002015-03-20 https://scifaro.com/en/abs/distributed-algorithms-for-scheduling-on-line-and-tree-networks-1205.19242012-10-08 https://scifaro.com/en/abs/a-note-on-the-pagerank-of-undirected-graphs-1205.19602017-02-09 https://scifaro.com/en/abs/approximation-algorithms-for-semi-random-graph-partitioning-problems-1205.22342015-03-20 https://scifaro.com/en/abs/complex-demand-knapsack-problems-and-incentives-in-ac-power-systems-1205.22852014-01-28 https://scifaro.com/en/abs/improving-compressed-counting-1205.26322012-05-14 https://scifaro.com/en/abs/optimal-listing-of-cycles-and-st-paths-in-undirected-graphs-1205.27662012-07-06 https://scifaro.com/en/abs/a-comparative-study-on-the-performance-of-permutation-algorithms-1205.28882012-05-15 https://scifaro.com/en/abs/1-85-approximation-for-min-power-strong-connectivity-1205.33972012-05-16 https://scifaro.com/en/abs/efficient-parallel-computation-of-nearest-neighbor-interchange-distances-1205.34022012-05-16 https://scifaro.com/en/abs/lower-bounds-for-adaptive-sparse-recovery-1205.35182012-10-23 https://scifaro.com/en/abs/on-min-power-steiner-tree-1205.36052012-05-17 https://scifaro.com/en/abs/parameterized-domination-in-circle-graphs-1205.37282012-05-17 https://scifaro.com/en/abs/scheduling-and-allocation-algorithm-for-an-elliptic-filter-1205.37542012-05-17 https://scifaro.com/en/abs/detours-in-scope-based-route-planning-1205.43632012-05-22 https://scifaro.com/en/abs/subgrad-an-approach-for-subgraph-detection-1205.49682012-05-23 https://scifaro.com/en/abs/pebble-motion-on-graphs-with-rotations-efficient-feasibility-tests-and-planning-algorithms-1205.52632015-03-20 https://scifaro.com/en/abs/an-n-log-n-alogrithm-for-deterministic-kripke-structure-minimization-1205.59282012-05-29 https://scifaro.com/en/abs/extracting-conflict-free-information-from-multi-labeled-trees-1205.63592012-06-29 https://scifaro.com/en/abs/lyndon-words-and-short-superstrings-1205.67872016-11-11 https://scifaro.com/en/abs/minimizing-movement-fixed-parameter-tractability-1205.69602015-03-20 https://scifaro.com/en/abs/tighter-worst-case-bounds-on-algebraic-gossip-1205.69612012-06-01 https://scifaro.com/en/abs/broadcast-throughput-in-radio-networks-routing-vs-network-coding-1205.70142014-08-29 https://scifaro.com/en/abs/beeping-a-maximal-independent-set-1206.01502012-06-04 https://scifaro.com/en/abs/bounds-on-contention-management-in-radio-networks-1206.01542012-10-04 https://scifaro.com/en/abs/o-1-delta-component-computation-technique-for-the-quadratic-assignment-problem-1206.05802012-06-05 https://scifaro.com/en/abs/simple-and-deterministic-matrix-sketching-1206.05942012-07-12 https://scifaro.com/en/abs/demon-a-local-first-discovery-method-for-overlapping-communities-1206.06292012-06-05 https://scifaro.com/en/abs/efficient-algorithms-for-finding-tucker-patterns-1206.18372012-07-03 https://scifaro.com/en/abs/dimension-independent-similarity-computation-1206.20822013-05-24 https://scifaro.com/en/abs/better-bounds-for-matchings-in-the-streaming-model-1206.22692021-03-18 https://scifaro.com/en/abs/binary-jumbled-string-matching-for-highly-run-length-compressible-texts-1206.25232013-06-03 https://scifaro.com/en/abs/adaptive-inference-on-general-graphical-models-1206.32342012-06-18 https://scifaro.com/en/abs/complexity-of-inference-in-graphical-models-1206.32402016-11-11 https://scifaro.com/en/abs/tightening-lp-relaxations-for-map-using-message-passing-1206.32882012-06-18 https://scifaro.com/en/abs/additive-approximation-for-near-perfect-phylogeny-construction-1206.33342012-06-18 https://scifaro.com/en/abs/constrained-multilinear-detection-for-faster-functional-motif-discovery-1206.34832012-08-24 https://scifaro.com/en/abs/comparison-of-bucket-sort-and-radix-sort-1206.35112012-06-18 https://scifaro.com/en/abs/approximation-algorithm-for-non-boolean-max-k-csp-1206.36032012-06-19 https://scifaro.com/en/abs/balls-into-bins-strict-capacities-and-edge-weights-1206.36342012-06-19 https://scifaro.com/en/abs/a-simpler-proof-for-o-congestion-dilation-packet-routing-1206.37182012-07-04 https://scifaro.com/en/abs/block-iterative-eigensolvers-for-sequences-of-correlated-eigenvalue-problems-1206.37682015-03-20 https://scifaro.com/en/abs/on-the-combinatorics-of-suffix-arrays-1206.38772012-06-19 https://scifaro.com/en/abs/on-epsilon-nets-distance-oracles-and-metric-embeddings-1206.41642012-06-20 https://scifaro.com/en/abs/clustering-to-maximize-the-ratio-of-split-to-diameter-1206.46052012-06-22 https://scifaro.com/en/abs/fast-computation-of-subpath-kernel-for-trees-1206.46422012-06-22 https://scifaro.com/en/abs/planarizing-an-unknown-surface-1206.48982012-06-22 https://scifaro.com/en/abs/preprocessing-subgraph-and-minor-problems-when-does-a-small-vertex-cover-help-1206.49122013-09-27 https://scifaro.com/en/abs/reachability-under-uncertainty-1206.52532012-06-26 https://scifaro.com/en/abs/the-mcdougal-cave-and-counting-issues-1206.53352012-06-28 https://scifaro.com/en/abs/near-optimal-online-multiselection-in-internal-and-external-memory-1206.53362018-11-16 https://scifaro.com/en/abs/nonuniform-vote-aggregation-algorithms-1206.53432012-06-26 https://scifaro.com/en/abs/metrical-service-systems-with-multiple-servers-1206.53922014-05-22 https://scifaro.com/en/abs/on-deterministic-sketching-and-streaming-for-sparse-recovery-and-norm-estimation-1206.57252012-12-12 https://scifaro.com/en/abs/the-online-replacement-path-problem-1206.59592012-06-27 https://scifaro.com/en/abs/performance-evaluation-of-a-proposed-variant-of-frequency-count-vfc-list-accessing-algorithm-1206.61852012-06-28 https://scifaro.com/en/abs/some-novel-results-from-analysis-of-move-to-front-mtf-list-accessing-algorithm-1206.61872012-06-28 https://scifaro.com/en/abs/data-structures-on-event-graphs-1206.61932015-03-10 https://scifaro.com/en/abs/mining-preserving-structures-in-a-graph-sequence-1206.62022012-06-28 https://scifaro.com/en/abs/estimation-of-simultaneously-sparse-and-low-rank-matrices-1206.64742012-07-03 https://scifaro.com/en/abs/tandem-halving-problems-by-dcj-1206.68992016-09-09 https://scifaro.com/en/abs/optimal-dynamic-sequence-representations-1206.69822013-02-04 https://scifaro.com/en/abs/routing-regardless-of-network-stability-1207.00432013-01-17 https://scifaro.com/en/abs/approximating-soft-capacitated-facility-location-problem-with-uncertainty-1207.02712013-05-13 https://scifaro.com/en/abs/algorithmic-aspects-of-homophyly-of-networks-1207.03162012-07-03 https://scifaro.com/en/abs/a-new-path-algorithm-for-the-weighted-multi-graphs-wmgpa-application-to-the-direct-topological-method-1207.03702012-07-03 https://scifaro.com/en/abs/algorithms-for-approximate-minimization-of-the-difference-between-submodular-functions-with-applications-1207.05602013-08-27 https://scifaro.com/en/abs/playing-mastermind-with-many-colors-1207.07732013-01-18 https://scifaro.com/en/abs/linear-kernels-and-single-exponential-algorithms-via-protrusion-decompositions-1207.08352012-08-02 https://scifaro.com/en/abs/incubators-vs-zombies-fault-tolerant-short-thin-and-lanky-spanners-for-doubling-metrics-1207.08922012-07-05 https://scifaro.com/en/abs/optimal-cuts-and-bisections-on-the-real-line-in-polynomial-time-1207.09332012-07-05 https://scifaro.com/en/abs/sparse-suffix-tree-construction-with-small-space-1207.11352012-07-06 https://scifaro.com/en/abs/the-longest-queue-drop-policy-for-shared-memory-switches-is-1-5-competitive-1207.11412023-02-09 https://scifaro.com/en/abs/locally-stable-marriage-with-strict-preferences-1207.12652016-11-22 https://scifaro.com/en/abs/simple-deterministic-algorithms-for-fully-dynamic-maximal-matching-1207.12772013-02-19 https://scifaro.com/en/abs/identifying-all-abelian-periods-of-a-string-in-quadratic-time-and-relevant-problems-1207.13072015-03-20 https://scifaro.com/en/abs/advances-on-matroid-secretary-problems-free-order-model-and-laminar-case-1207.13332014-06-24 https://scifaro.com/en/abs/on-privacy-preserving-histograms-1207.13712012-07-09 https://scifaro.com/en/abs/fast-constructions-of-light-weight-spanners-for-general-graphs-1207.16682012-07-09 https://scifaro.com/en/abs/improved-bounds-for-online-preemptive-matching-1207.17882015-03-20 https://scifaro.com/en/abs/design-evaluation-and-analysis-of-combinatorial-optimization-heuristic-algorithms-1207.17942012-07-10 https://scifaro.com/en/abs/optimal-euclidean-spanners-really-short-thin-and-lanky-1207.18312012-11-28 https://scifaro.com/en/abs/tight-cell-probe-bounds-for-online-hamming-distance-computation-1207.18852012-10-16 https://scifaro.com/en/abs/stackelberg-shortest-path-tree-game-revisited-1207.23172012-07-11 https://scifaro.com/en/abs/i-o-efficient-dynamic-planar-range-skyline-queries-1207.23412012-07-11 https://scifaro.com/en/abs/collective-additive-tree-spanners-of-bounded-tree-breadth-graphs-with-generalizations-and-consequences-1207.25062012-07-13 https://scifaro.com/en/abs/hitting-sets-online-and-unique-max-coloring-1207.25982012-07-12 https://scifaro.com/en/abs/on-optimal-top-k-string-retrieval-1207.26322012-11-20 https://scifaro.com/en/abs/search-algorithms-for-conceptual-graph-databases-1207.28372012-07-13 https://scifaro.com/en/abs/a-time-and-space-efficient-algorithm-for-contextual-linear-bandits-1207.30242014-07-08 https://scifaro.com/en/abs/reference-point-methods-and-approximation-in-multicriteria-optimization-1207.31652013-03-12 https://scifaro.com/en/abs/a-unified-approach-to-truthful-scheduling-on-related-machines-1207.35232015-03-20 https://scifaro.com/en/abs/memory-efficient-de-bruijn-graph-construction-1207.35322012-07-17 https://scifaro.com/en/abs/approximate-counting-via-correlation-decay-on-planar-graphs-1207.35642012-07-17 https://scifaro.com/en/abs/directed-acyclic-subgraph-problem-parameterized-above-the-poljak-turzik-bound-1207.35862012-10-01 https://scifaro.com/en/abs/approximating-the-diameter-of-a-graph-1207.36222012-07-17 https://scifaro.com/en/abs/light-spanner-and-monotone-tree-1207.38072012-10-16 https://scifaro.com/en/abs/maintaining-approximate-maximum-weighted-matching-in-fully-dynamic-graphs-1207.39762012-12-13 https://scifaro.com/en/abs/designing-fpt-algorithms-for-cut-problems-using-randomized-contractions-1207.40792016-07-20 https://scifaro.com/en/abs/a-complete-anytime-algorithm-for-treewidth-1207.41092012-07-19 https://scifaro.com/en/abs/on-finding-minimal-w-cutset-1207.41272012-07-19 https://scifaro.com/en/abs/approximating-minimum-cost-edge-covers-of-crossing-biset-families-1207.43662012-07-19 https://scifaro.com/en/abs/faster-sdp-hierarchy-solvers-for-local-rounding-algorithms-1207.43722015-03-20 https://scifaro.com/en/abs/the-space-complexity-of-2-dimensional-approximate-range-counting-1207.43822016-05-24 https://scifaro.com/en/abs/equivalence-between-priority-queues-and-sorting-in-external-memory-1207.43832012-07-19 https://scifaro.com/en/abs/efficient-algorithms-for-zeckendorf-arithmetic-1207.44972012-07-20 https://scifaro.com/en/abs/efficient-core-maintenance-in-large-dynamic-graphs-1207.45672012-07-20 https://scifaro.com/en/abs/quick-hypervolume-1207.45982012-11-30 https://scifaro.com/en/abs/efficient-lz78-factorization-of-grammar-compressed-text-1207.46072013-05-27 https://scifaro.com/en/abs/exact-algorithms-for-maximum-clique-a-computational-study-1207.46162012-07-20 https://scifaro.com/en/abs/a-9k-kernel-for-nonseparating-independent-set-in-planar-graphs-1207.46662012-07-20 https://scifaro.com/en/abs/nonblocker-in-h-minor-free-graphs-kernelization-meets-discharging-1207.46812012-07-20 https://scifaro.com/en/abs/the-fast-cauchy-transform-and-faster-robust-linear-regression-1207.46842014-04-08 https://scifaro.com/en/abs/a-new-upper-bound-for-the-traveling-salesman-problem-in-cubic-graphs-1207.46942012-12-03 https://scifaro.com/en/abs/testing-permanent-oracles-revisited-1207.47832012-07-20 https://scifaro.com/en/abs/a-new-algorithm-for-extracting-a-small-representative-subgraph-from-a-very-large-graph-1207.48252012-07-23 https://scifaro.com/en/abs/kernel-bounds-for-structural-parameterizations-of-pathwidth-1207.49002015-03-20 https://scifaro.com/en/abs/matroid-secretary-for-regular-and-decomposable-matroids-1207.51462012-07-24 https://scifaro.com/en/abs/improved-concentration-bounds-for-count-sketch-1207.52002013-10-22 https://scifaro.com/en/abs/density-functions-subject-to-a-co-matroid-constraint-1207.52152012-07-31 https://scifaro.com/en/abs/effective-computation-of-immersion-obstructions-for-unions-of-graph-classes-1207.56362015-03-20 https://scifaro.com/en/abs/bin-packing-covering-with-delivery-some-variations-theoretical-results-and-efficient-offline-algorithms-1207.56722015-03-20 https://scifaro.com/en/abs/beyond-max-cut-lambda-extendible-properties-parameterized-above-the-poljak-turz-i-k-bound-1207.56962012-07-25 https://scifaro.com/en/abs/approximating-minimum-cost-connected-t-joins-1207.57222012-07-25 https://scifaro.com/en/abs/the-cutting-plane-method-is-polynomial-for-perfect-matchings-1207.58132014-01-24 https://scifaro.com/en/abs/tight-analysis-of-priority-queuing-policy-for-egress-traffic-1207.59592014-09-02 https://scifaro.com/en/abs/achieving-approximate-soft-clustering-in-data-streams-1207.61992015-03-20 https://scifaro.com/en/abs/mimicking-networks-and-succinct-representations-of-terminal-cuts-1207.62462012-07-27 https://scifaro.com/en/abs/low-rank-approximation-and-regression-in-input-sparsity-time-1207.63652013-04-08 https://scifaro.com/en/abs/on-mimicking-networks-representing-minimum-terminal-cuts-1207.63712012-07-27 https://scifaro.com/en/abs/sketch-star-metric-comparing-data-streams-via-sketching-1207.64652012-08-01 https://scifaro.com/en/abs/two-embedding-theorems-for-data-with-equivalences-under-finite-group-action-1207.69862012-10-16 https://scifaro.com/en/abs/fault-tolerant-spanners-for-doubling-metrics-better-and-simpler-1207.70402013-01-01 https://scifaro.com/en/abs/improved-approximation-algorithms-for-low-density-instances-of-the-minimum-entropy-set-cover-problem-1207.71342012-08-01 https://scifaro.com/en/abs/graph-isomorphism-for-graph-classes-characterized-by-two-forbidden-induced-subgraphs-1208.01422015-03-20 https://scifaro.com/en/abs/a-model-for-minimizing-active-processor-time-1208.03122012-08-02 https://scifaro.com/en/abs/solving-cyclic-longest-common-subsequence-in-quadratic-time-1208.03962012-08-17 https://scifaro.com/en/abs/a-constructive-algorithm-to-prove-p-np-1208.05422012-08-03 https://scifaro.com/en/abs/fast-monotone-summation-over-disjoint-sets-1208.05542012-08-03 https://scifaro.com/en/abs/biff-bloom-filter-codes-fast-error-correction-for-large-data-sets-1208.07982015-03-20 https://scifaro.com/en/abs/on-fixed-parameter-algorithms-for-split-vertex-deletion-1208.12482012-08-07 https://scifaro.com/en/abs/a-polylogarithimic-approximation-algorithm-for-edge-disjoint-paths-with-congestion-2-1208.12722012-08-08 https://scifaro.com/en/abs/fuel-efficient-computation-in-passive-self-assembly-1208.15652012-08-09 https://scifaro.com/en/abs/don-t-be-strict-in-local-search-1208.16882012-08-20 https://scifaro.com/en/abs/on-finding-optimal-polytrees-1208.16922012-08-16 https://scifaro.com/en/abs/a-novel-feature-based-approach-to-characterize-algorithm-performance-for-the-traveling-salesman-problem-1208.23182012-08-14 https://scifaro.com/en/abs/a-new-direction-for-counting-perfect-matchings-1208.23292012-08-14 https://scifaro.com/en/abs/doing-more-for-less-cache-aware-parallel-contraction-hierarchies-preprocessing-1208.25432012-08-14 https://scifaro.com/en/abs/near-optimal-online-algorithms-for-dynamic-resource-allocation-problems-1208.25962015-03-20 https://scifaro.com/en/abs/caching-with-rental-cost-and-zapping-1208.27242012-10-19 https://scifaro.com/en/abs/time-and-space-efficient-evaluation-of-the-complex-exponential-function-using-series-expansion-1208.28322012-08-15 https://scifaro.com/en/abs/adapt-or-die-polynomial-lower-bounds-for-non-adaptive-dynamic-data-structures-1208.28462012-08-16 https://scifaro.com/en/abs/local-reconstructors-and-tolerant-testers-for-connectivity-and-diameter-1208.29562013-06-24 https://scifaro.com/en/abs/lp-rounding-for-k-centers-with-non-uniform-hard-capacities-1208.30542012-08-16 https://scifaro.com/en/abs/a-note-on-efficient-computation-of-all-abelian-periods-in-a-string-1208.33132015-03-20 https://scifaro.com/en/abs/sublinear-time-algorithms-for-monomer-dimer-systems-on-bounded-degree-graphs-1208.36292013-09-05 https://scifaro.com/en/abs/on-money-as-a-means-of-coordination-between-network-packets-1208.37472012-08-21 https://scifaro.com/en/abs/on-line-indexing-for-general-alphabets-via-predecessor-queries-on-subsets-of-an-ordered-list-1208.37982012-08-21 https://scifaro.com/en/abs/constrained-fault-tolerant-resource-allocation-1208.38352015-03-20 https://scifaro.com/en/abs/upper-bounds-for-the-formula-size-of-the-majority-function-1208.38742012-08-21 https://scifaro.com/en/abs/reducing-a-target-interval-to-a-few-exact-queries-1208.42252012-08-22 https://scifaro.com/en/abs/fast-and-sensitive-read-mapping-with-approximate-seeds-and-multiple-backtracking-1208.42382012-08-22 https://scifaro.com/en/abs/finding-a-maximum-induced-degenerate-subgraph-faster-than-2-n-1208.44492012-08-23 https://scifaro.com/en/abs/optimal-planar-range-skyline-reporting-with-linear-space-in-external-memory-1208.45112013-07-17 https://scifaro.com/en/abs/a-dynamic-i-o-efficient-structure-for-one-dimensional-top-k-range-reporting-1208.45162014-03-27 https://scifaro.com/en/abs/the-simplex-method-is-strongly-polynomial-for-deterministic-markov-decision-processes-1208.50832013-02-01 https://scifaro.com/en/abs/faster-clustering-via-preprocessing-1208.52472012-08-28 https://scifaro.com/en/abs/generating-all-minimal-edge-dominating-sets-with-incremental-polynomial-delay-1208.53452012-10-24 https://scifaro.com/en/abs/choose-outsiders-first-a-mean-2-approximation-random-algorithm-for-covering-problems-1208.59072013-05-14 https://scifaro.com/en/abs/lower-bounds-on-information-dissemination-in-dynamic-networks-1208.60512012-08-31 https://scifaro.com/en/abs/conflict-anticipation-in-the-search-for-graph-automorphisms-1208.62692012-08-31 https://scifaro.com/en/abs/graph-symmetry-detection-and-canonical-labeling-differences-and-synergies-1208.62712013-05-01 https://scifaro.com/en/abs/a-dynamic-data-structure-for-counting-subgraphs-in-sparse-graphs-1209.03752013-01-04 https://scifaro.com/en/abs/in-place-associative-integer-sorting-1209.05722012-11-02 https://scifaro.com/en/abs/implementing-a-partitioned-2-page-book-embedding-testing-algorithm-1209.05982012-09-05 https://scifaro.com/en/abs/a-simple-test-on-2-vertex-and-2-edge-connectivity-1209.07002012-09-05 https://scifaro.com/en/abs/data-oblivious-graph-drawing-model-and-algorithms-1209.07562012-09-05 https://scifaro.com/en/abs/a-new-algorithm-for-data-compression-optimization-1209.10452012-09-06 https://scifaro.com/en/abs/constrained-multilinear-detection-and-generalized-graph-motifs-1209.10822013-05-15 https://scifaro.com/en/abs/on-additive-complexity-of-a-sequence-of-matrices-1209.16452012-09-11 https://scifaro.com/en/abs/sorting-distinct-integer-keys-using-in-place-associative-sort-1209.19422012-09-18 https://scifaro.com/en/abs/graph-expansion-analysis-for-communication-costs-of-fast-rectangular-matrix-multiplication-1209.21842012-11-30 https://scifaro.com/en/abs/efficient-dimensionality-reduction-for-canonical-correlation-analysis-1209.21852013-05-03 https://scifaro.com/en/abs/a-greedy-approximation-algorithm-for-the-longest-path-problem-in-undirected-graphs-1209.25032014-09-15 https://scifaro.com/en/abs/slow-down-sleep-for-profit-in-online-deadline-scheduling-1209.28482012-09-14 https://scifaro.com/en/abs/graphs-associated-markov-chains-1209.33872012-09-18 https://scifaro.com/en/abs/improved-in-place-associative-integer-sorting-1209.36682012-09-18 https://scifaro.com/en/abs/profitable-scheduling-on-multiple-speed-scalable-processors-1209.38682012-09-19 https://scifaro.com/en/abs/a-combinatorial-algorithm-to-generate-all-spanning-trees-of-a-weighted-graph-in-order-of-increasing-cost-1209.42062012-09-20 https://scifaro.com/en/abs/quickheapsort-modifications-and-improved-analysis-1209.42142013-07-12 https://scifaro.com/en/abs/minimum-weight-spanning-trees-of-weighted-scale-free-networks-1209.44932012-09-21 https://scifaro.com/en/abs/deterministic-algorithms-for-skewed-matrix-products-1209.45082012-09-21 https://scifaro.com/en/abs/bouma2-a-quasi-stateless-tunable-multiple-string-match-algorithm-1209.45542012-09-21 https://scifaro.com/en/abs/distributing-an-exact-algorithm-for-maximum-clique-maximising-the-costup-1209.45602013-03-22 https://scifaro.com/en/abs/one-side-energy-costs-of-the-rbo-receiver-1209.46052012-09-21 https://scifaro.com/en/abs/counting-inequivalent-monotone-boolean-functions-1209.46232012-09-21 https://scifaro.com/en/abs/sorting-distinct-integers-using-improved-in-place-associative-sort-1209.47142012-09-24 https://scifaro.com/en/abs/algorithms-of-fast-search-of-center-radius-and-diameter-on-weighted-graphs-1209.47612012-09-24 https://scifaro.com/en/abs/counting-common-substrings-effectively-1209.47712012-09-24 https://scifaro.com/en/abs/streaming-complexity-of-checking-priority-queues-1209.49712012-09-25 https://scifaro.com/en/abs/detecting-and-characterizing-small-dense-bipartite-like-subgraphs-by-the-bipartiteness-ratio-measure-1209.50452013-09-19 https://scifaro.com/en/abs/testing-small-set-expansion-in-general-graphs-1209.50522015-01-06 https://scifaro.com/en/abs/balanced-allocations-and-double-hashing-1209.53602014-01-30 https://scifaro.com/en/abs/predecessor-search-with-distance-sensitive-query-time-1209.54412012-09-26 https://scifaro.com/en/abs/feasible-sampling-of-non-strict-turnstile-data-streams-1209.55662012-09-26 https://scifaro.com/en/abs/faster-deterministic-fully-dynamic-graph-connectivity-1209.56082012-09-26 https://scifaro.com/en/abs/additive-update-algorithm-for-nonnegative-matrix-factorization-1209.56472012-12-27 https://scifaro.com/en/abs/fast-point-feature-label-placement-for-dynamic-visualizations-2007-1209.57652012-09-27 https://scifaro.com/en/abs/fast-point-feature-label-placement-for-dynamic-visualizations-thesis-1209.57662012-09-27 https://scifaro.com/en/abs/windows-into-relational-events-data-structures-for-contiguous-subsequences-of-edges-1209.57912012-09-27 https://scifaro.com/en/abs/fast-algorithms-for-the-maximum-clique-problem-on-massive-sparse-graphs-1209.58182012-11-15 https://scifaro.com/en/abs/faster-spectral-sparsification-and-numerical-algorithms-for-sdd-matrices-1209.58212013-11-19 https://scifaro.com/en/abs/approximating-the-expected-values-for-combinatorial-optimization-problems-over-stochastic-points-1209.58282015-02-18 https://scifaro.com/en/abs/first-principles-multiway-spectral-partitioning-of-graphs-1209.59692014-08-04 https://scifaro.com/en/abs/shattering-and-compressing-networks-for-centrality-analysis-1209.60072012-09-27 https://scifaro.com/en/abs/a-new-middle-path-approach-for-alignements-in-blast-1209.61292012-09-28 https://scifaro.com/en/abs/simple-and-optimal-randomized-fault-tolerant-rumor-spreading-1209.61582015-01-06 https://scifaro.com/en/abs/chernoff-hoeffding-inequality-and-applications-1209.63962013-02-20 https://scifaro.com/en/abs/improved-approximation-algorithms-for-the-non-preemptive-speed-scaling-problem-1209.64812012-11-26 https://scifaro.com/en/abs/comparative-analysis-of-dynamic-graph-techniques-and-data-strucutre-1209.64862012-10-01 https://scifaro.com/en/abs/comparison-of-advance-tree-data-structures-1209.64952015-06-11 https://scifaro.com/en/abs/parameterizations-of-test-cover-with-bounded-test-sizes-1209.65282013-02-18 https://scifaro.com/en/abs/kernels-for-connected-dominating-set-on-graphs-with-excluded-topological-subgraphs-1210.02572017-10-26 https://scifaro.com/en/abs/parameterized-complexity-of-directed-steiner-tree-on-sparse-graphs-1210.02602012-10-02 https://scifaro.com/en/abs/pilot-rollout-and-monte-carlo-tree-search-methods-for-job-shop-scheduling-1210.03742012-10-02 https://scifaro.com/en/abs/on-parallelizing-matrix-multiplication-by-the-column-row-method-1210.04612012-11-20 https://scifaro.com/en/abs/think-locally-act-globally-perfectly-balanced-graph-partitioning-1210.04772012-10-02 https://scifaro.com/en/abs/simple-fast-and-deterministic-gossip-and-rumor-spreading-1210.11932014-04-08 https://scifaro.com/en/abs/better-space-bounds-for-parameterized-range-majority-and-minority-1210.17652014-07-15 https://scifaro.com/en/abs/in-place-associative-permutation-sort-1210.17712012-10-08 https://scifaro.com/en/abs/local-search-is-better-than-random-assignment-for-bounded-occurrence-ordering-k-csps-1210.18902013-03-05 https://scifaro.com/en/abs/the-power-of-linear-reconstruction-attacks-1210.23812012-10-09 https://scifaro.com/en/abs/sudoku-as-a-special-transportation-problem-1210.25842012-10-10 https://scifaro.com/en/abs/sequence-annotation-with-hmms-new-problems-and-their-complexity-1210.25872012-10-10 https://scifaro.com/en/abs/inferring-species-trees-from-incongruent-multi-copy-gene-trees-using-the-robinson-foulds-distance-1210.26652012-10-10 https://scifaro.com/en/abs/scheduling-resources-for-executing-a-partial-set-of-jobs-1210.29062012-10-11 https://scifaro.com/en/abs/low-distortion-subspace-embeddings-in-input-sparsity-time-and-applications-to-robust-linear-regression-1210.31352013-03-22 https://scifaro.com/en/abs/on-online-labeling-with-polynomially-many-labels-1210.31972012-10-12 https://scifaro.com/en/abs/pseudo-scheduling-a-new-approach-to-the-broadcast-scheduling-problem-1210.33192012-10-12 https://scifaro.com/en/abs/the-power-of-non-uniform-wireless-power-1210.33712013-10-04 https://scifaro.com/en/abs/a-flexible-mixed-integer-programming-framework-for-nurse-scheduling-1210.36522012-10-16 https://scifaro.com/en/abs/improved-upper-and-lower-bounds-for-the-point-placement-problem-1210.38332012-10-16 https://scifaro.com/en/abs/joint-cache-partition-and-job-assignment-on-multi-core-processors-1210.40532012-11-26 https://scifaro.com/en/abs/the-recognition-of-simple-triangle-graphs-and-of-linear-interval-orders-is-polynomial-1210.43522014-01-29 https://scifaro.com/en/abs/a-simplification-of-the-mv-matching-algorithm-and-its-proof-1210.45942013-08-27 https://scifaro.com/en/abs/approximation-algorithms-for-energy-reliability-and-makespan-optimization-problems-1210.46732012-10-18 https://scifaro.com/en/abs/approximating-source-location-and-star-survivable-network-problems-1210.47282014-11-06 https://scifaro.com/en/abs/sublinear-bounds-for-randomized-leader-election-1210.48222013-05-16 https://scifaro.com/en/abs/efficiently-searching-for-frustrated-cycles-in-map-inference-1210.49022012-10-19 https://scifaro.com/en/abs/creating-a-level-playing-field-for-all-symbols-in-a-discretization-1210.51182012-10-19 https://scifaro.com/en/abs/approximate-maximum-flow-on-separable-undirected-graphs-1210.52272012-10-19 https://scifaro.com/en/abs/computing-cutwidth-and-pathwidth-of-semi-complete-digraphs-via-degree-orderings-1210.53632012-10-22 https://scifaro.com/en/abs/characterizing-properties-for-q-clustering-1210.56642012-10-23 https://scifaro.com/en/abs/survival-network-design-of-doubling-dimension-metrics-1210.57292012-10-23 https://scifaro.com/en/abs/optimizing-tile-concentrations-to-minimize-errors-and-time-for-dna-tile-self-assembly-systems-1210.57862012-10-23 https://scifaro.com/en/abs/insertion-and-sorting-in-a-sequence-of-numbers-minimizing-the-maximum-sum-of-a-contiguous-subsequence-1210.59552013-03-21 https://scifaro.com/en/abs/a-pair-of-universal-sequence-set-betting-strategies-1210.59682015-12-23 https://scifaro.com/en/abs/proceedings-first-workshop-on-graph-inspection-and-traversal-engineering-1210.61182012-10-24 https://scifaro.com/en/abs/new-algorithms-for-binary-jumbled-pattern-matching-1210.61762013-05-09 https://scifaro.com/en/abs/fast-exact-max-kernel-search-1210.62872012-10-29 https://scifaro.com/en/abs/black-box-complexity-breaking-the-o-n-log-n-barrier-of-leadingones-1210.64652012-10-25 https://scifaro.com/en/abs/on-solving-large-scale-polynomial-convex-problems-by-randomized-first-order-algorithms-1210.68532014-05-22 https://scifaro.com/en/abs/list-coloring-embedded-graphs-1210.76052012-10-30 https://scifaro.com/en/abs/finding-efficient-region-in-the-plane-with-line-segments-1210.76382018-07-04 https://scifaro.com/en/abs/efficient-rounding-for-the-noncommutative-grothendieck-inequality-1210.76562022-02-24 https://scifaro.com/en/abs/tree-t-spanners-in-outerplanar-graphs-via-supply-demand-partition-1210.79192013-10-17 https://scifaro.com/en/abs/volume-rendering-of-amr-simulations-1210.80142013-01-03 https://scifaro.com/en/abs/dominator-tree-certification-and-independent-spanning-trees-1210.83032013-03-08 https://scifaro.com/en/abs/on-the-power-of-conditional-samples-in-distribution-testing-1210.83382014-04-09 https://scifaro.com/en/abs/grammar-based-construction-of-indexes-for-binary-jumbled-pattern-matching-1210.83862012-11-16 https://scifaro.com/en/abs/near-optimal-leader-election-in-multi-hop-radio-networks-1210.84392014-04-04 https://scifaro.com/en/abs/improved-time-complexity-of-bandwidth-approximation-in-dense-graphs-1211.01772012-11-02 https://scifaro.com/en/abs/approximating-k-median-via-pseudo-approximation-1211.02432012-11-02 https://scifaro.com/en/abs/time-space-trade-offs-for-longest-common-extensions-1211.02702013-04-23 https://scifaro.com/en/abs/a-note-on-circular-arc-online-coloring-using-first-fit-1211.02972013-12-05 https://scifaro.com/en/abs/below-all-subsets-for-some-permutational-counting-problems-1211.03912013-08-27 https://scifaro.com/en/abs/parameterized-complexity-and-kernel-bounds-for-hard-planning-problems-1211.04792013-07-16 https://scifaro.com/en/abs/a-simple-algorithm-for-computing-bocp-1211.07292018-07-04 https://scifaro.com/en/abs/differential-privacy-for-the-analyst-via-private-equilibrium-computation-1211.08772018-03-16 https://scifaro.com/en/abs/beyond-worst-case-analysis-in-private-singular-vector-computation-1211.09752012-11-06 https://scifaro.com/en/abs/a-linear-kernel-for-planar-total-dominating-set-1211.09782023-06-22 https://scifaro.com/en/abs/new-constructions-of-rip-matrices-with-fast-multiplication-and-fewer-rows-1211.09862012-11-07 https://scifaro.com/en/abs/sparsity-lower-bounds-for-dimensionality-reducing-maps-1211.09952012-11-07 https://scifaro.com/en/abs/osnap-faster-numerical-linear-algebra-algorithms-via-sparser-subspace-embeddings-1211.10022012-11-07 https://scifaro.com/en/abs/how-robust-are-linear-sketches-to-adaptive-inputs-1211.10562012-11-07 https://scifaro.com/en/abs/stochastic-combinatorial-optimization-via-poisson-approximation-1211.11492013-03-20 https://scifaro.com/en/abs/shattering-graph-orientations-and-connectivity-1211.13192012-11-07 https://scifaro.com/en/abs/derivation-of-fast-dct-algorithms-using-algebraic-technique-based-on-galois-theory-1211.13402012-11-07 https://scifaro.com/en/abs/solving-weighted-and-counting-variants-of-connectivity-problems-parameterized-by-treewidth-deterministically-in-single-exponential-time-1211.15052012-11-08 https://scifaro.com/en/abs/fast-hamiltonicity-checking-via-bases-of-perfect-matchings-1211.15062012-11-08 https://scifaro.com/en/abs/a-one-vertex-decomposition-algorithm-for-generating-algebraic-expressions-of-square-rhomboids-1211.16612012-11-08 https://scifaro.com/en/abs/simple-i-o-efficient-flow-accumulation-on-grid-terrains-1211.18572012-11-09 https://scifaro.com/en/abs/on-the-convergence-of-the-hegselmann-krause-system-1211.19092012-11-09 https://scifaro.com/en/abs/i-o-optimal-algorithms-on-grid-graphs-1211.20662012-11-12 https://scifaro.com/en/abs/graph-isomorphism-and-automorphism-problems-are-polynomial-1211.23222012-11-14 https://scifaro.com/en/abs/strong-bounds-for-evolution-in-undirected-graphs-1211.23842018-05-02 https://scifaro.com/en/abs/a-memory-versus-compression-ratio-trade-off-in-ppm-via-compressed-context-modeling-1211.26362012-11-13 https://scifaro.com/en/abs/recognizing-interval-bigraphs-by-forbidden-patterns-1211.26622018-05-22 https://scifaro.com/en/abs/testing-probability-distributions-using-conditional-samples-1211.26642015-01-19 https://scifaro.com/en/abs/a-mazing-2-eps-approximation-for-unsplittable-flow-on-a-path-1211.26702012-11-13 https://scifaro.com/en/abs/online-stochastic-bin-packing-1211.26872022-03-15 https://scifaro.com/en/abs/iterative-row-sampling-1211.27132013-04-05 https://scifaro.com/en/abs/enumeration-of-sequences-with-large-alphabets-1211.29262012-11-14 https://scifaro.com/en/abs/smoothed-analysis-of-belief-propagation-for-minimum-cost-flow-and-matching-1211.32992012-11-15 https://scifaro.com/en/abs/simpler-and-faster-lempel-ziv-factorization-1211.36422013-01-21 https://scifaro.com/en/abs/an-algorithm-for-optimized-searching-using-non-overlapping-iterative-neighbor-intervals-1211.43702012-11-20 https://scifaro.com/en/abs/single-exponential-fpt-algorithm-for-interval-vertex-deletion-and-interval-completion-problem-1211.46292016-02-09 https://scifaro.com/en/abs/reducing-the-rank-of-a-matroid-1211.48532021-12-23 https://scifaro.com/en/abs/beyond-the-vizing-s-bound-for-at-most-seven-colors-1211.50312014-03-04 https://scifaro.com/en/abs/the-rightmost-equal-cost-position-problem-1211.51082012-11-22 https://scifaro.com/en/abs/note-on-the-greedy-parsing-optimality-for-dictionary-based-text-compression-1211.53502012-11-26 https://scifaro.com/en/abs/faster-compact-top-k-document-retrieval-1211.53532012-11-26 https://scifaro.com/en/abs/algorithms-for-computing-abelian-periods-of-words-1211.53892013-12-05 https://scifaro.com/en/abs/analysis-of-a-randomized-approximation-scheme-for-matrix-multiplication-1211.54142012-11-26 https://scifaro.com/en/abs/approximate-pattern-matching-with-k-mismatches-in-packed-text-1211.54332013-08-01 https://scifaro.com/en/abs/interval-deletion-is-fixed-parameter-tractable-1211.59332014-05-07 https://scifaro.com/en/abs/time-darts-a-data-structure-for-verification-of-closed-timed-automata-1211.61952012-11-28 https://scifaro.com/en/abs/dual-techniques-for-scheduling-on-a-machine-with-varying-speed-1211.62162014-03-06 https://scifaro.com/en/abs/certifying-3-edge-connectivity-1211.65532015-10-08 https://scifaro.com/en/abs/exploiting-metric-structure-for-efficient-private-query-release-1211.73022012-12-03 https://scifaro.com/en/abs/fixed-parameter-tractability-of-satisfying-beyond-the-number-of-variables-1212.01062012-12-04 https://scifaro.com/en/abs/parameterized-study-of-the-test-cover-problem-1212.01172012-12-04 https://scifaro.com/en/abs/approximating-large-frequency-moments-with-pick-and-drop-sampling-1212.02022012-12-05 https://scifaro.com/en/abs/the-geometry-of-differential-privacy-the-sparse-and-approximate-cases-1212.02972013-08-05 https://scifaro.com/en/abs/random-matrix-over-a-dvr-and-lu-factorization-1212.03082012-12-05 https://scifaro.com/en/abs/the-cost-of-address-translation-1212.07032014-04-15 https://scifaro.com/en/abs/maximizing-social-influence-in-nearly-optimal-time-1212.08842016-06-23 https://scifaro.com/en/abs/a-combinatorial-polynomial-algorithm-for-the-linear-arrow-debreu-market-1212.09792014-03-25 https://scifaro.com/en/abs/streaming-balanced-graph-partitioning-for-random-graphs-1212.11212012-12-06 https://scifaro.com/en/abs/the-2-valued-case-of-makespan-minimization-with-assignment-constraints-1212.16092012-12-10 https://scifaro.com/en/abs/split-scheduling-with-uniform-setup-times-1212.17542012-12-11 https://scifaro.com/en/abs/a-new-regularity-lemma-and-faster-approximation-algorithms-for-low-threshold-rank-graphs-1212.18312012-12-11 https://scifaro.com/en/abs/deciding-monotone-duality-and-identifying-frequent-itemsets-in-quadratic-logspace-1212.18812013-08-23 https://scifaro.com/en/abs/a-space-efficient-streaming-algorithm-for-triangle-counting-using-the-birthday-paradox-1212.22642013-12-05 https://scifaro.com/en/abs/layerwidth-analysis-of-a-new-metric-for-directed-acyclic-graphs-1212.24792012-12-12 https://scifaro.com/en/abs/feasibility-tests-for-recurrent-real-time-tasks-in-the-sporadic-dag-model-1212.27782019-07-01 https://scifaro.com/en/abs/linear-time-lempel-ziv-factorization-simple-fast-small-1212.29522020-12-11 https://scifaro.com/en/abs/new-invariants-for-the-graph-isomorphism-problem-1212.30552015-08-24 https://scifaro.com/en/abs/approximation-algorithms-for-the-joint-replenishment-problem-with-deadlines-1212.32332015-12-04 https://scifaro.com/en/abs/a-parameterized-approximation-algorithm-for-the-shallow-light-steiner-tree-problem-1212.34032013-09-04 https://scifaro.com/en/abs/optimal-cuts-and-partitions-in-tree-metrics-in-polynomial-time-1212.34712012-12-17 https://scifaro.com/en/abs/partial-degree-bounded-edge-packing-problem-with-arbitrary-bounds-1212.38892012-12-18 https://scifaro.com/en/abs/online-bin-packing-with-advice-1212.40162013-12-24 https://scifaro.com/en/abs/new-algorithms-for-position-heaps-1212.46132013-01-15 https://scifaro.com/en/abs/one-tile-to-rule-them-all-simulating-any-turing-machine-tile-assembly-system-or-tiling-system-with-a-single-puzzle-piece-1212.47562012-12-20 https://scifaro.com/en/abs/necklaces-convolutions-and-x-y-1212.47712012-12-20 https://scifaro.com/en/abs/polynomial-time-factoring-algorithm-using-bayesian-arithmetic-1212.49692012-12-21 https://scifaro.com/en/abs/algorithm-to-compute-squares-of-1st-n-natural-numbers-without-using-multiplication-1212.56452012-12-27 https://scifaro.com/en/abs/on-the-optimization-of-dijkstras-algorithm-1212.60552012-12-27 https://scifaro.com/en/abs/secluded-connectivity-problems-1212.61762012-12-27 https://scifaro.com/en/abs/speeding-up-shortest-path-algorithms-1212.63272013-01-01 https://scifaro.com/en/abs/lattice-sparsification-and-the-approximate-closest-vector-problem-1212.67812013-01-01 https://scifaro.com/en/abs/an-exact-algorithm-for-tsp-in-degree-3-graphs-via-circuit-procedure-and-amortization-on-connectivity-structure-1212.68312017-08-08 https://scifaro.com/en/abs/maximizing-a-nonnegative-monotone-submodular-function-constrained-to-matchings-1212.68462013-01-14 https://scifaro.com/en/abs/maximum-balanced-subgraph-problem-parameterized-above-lower-bound-1212.68482013-04-23 https://scifaro.com/en/abs/2d-lyndon-words-and-applications-1301.01032013-01-03 https://scifaro.com/en/abs/on-randomized-memoryless-algorithms-for-the-weighted-k-server-problem-1301.01232016-11-15 https://scifaro.com/en/abs/a-nonenumerative-algorithm-to-find-the-k-longest-shortest-paths-in-a-dag-1301.01812013-01-03 https://scifaro.com/en/abs/optimal-time-bounds-for-approximate-clustering-1301.05872013-01-07 https://scifaro.com/en/abs/matroid-and-knapsack-center-problems-1301.07452013-01-16 https://scifaro.com/en/abs/improved-qft-algorithm-for-power-of-two-fft-1301.07632013-01-07 https://scifaro.com/en/abs/the-complexity-of-scheduling-for-p-norms-of-flow-and-stretch-1301.07932013-01-07 https://scifaro.com/en/abs/an-efficient-algorithm-for-clustering-of-large-scale-mass-spectrometry-data-1301.08342013-01-08 https://scifaro.com/en/abs/popular-matchings-structure-and-cheating-strategies-1301.09022013-01-08 https://scifaro.com/en/abs/fast-multi-scale-community-detection-based-on-local-criteria-within-a-multi-threaded-algorithm-1301.09552013-02-06 https://scifaro.com/en/abs/on-the-complexity-of-connectivity-in-cognitive-radio-networks-through-spectrum-assignment-1301.09952013-01-08 https://scifaro.com/en/abs/abusing-the-tutte-matrix-an-algebraic-instance-compression-for-the-k-set-cycle-problem-1301.15172013-01-09 https://scifaro.com/en/abs/on-the-complexity-of-t-closeness-anonymization-and-related-problems-1301.17512013-01-10 https://scifaro.com/en/abs/on-pairwise-spanners-1301.19992013-01-11 https://scifaro.com/en/abs/in-situ-associative-permuting-1301.20462013-01-11 https://scifaro.com/en/abs/efficient-approximation-for-triangulation-of-minimum-treewidth-1301.22532013-01-14 https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-feasibility-of-pebble-motion-on-graphs-1301.23422013-01-22 https://scifaro.com/en/abs/completely-positive-formulation-of-the-graph-isomorphism-problem-1301.23902013-01-14 https://scifaro.com/en/abs/a-simple-online-competitive-adaptation-of-lempel-ziv-compression-with-efficient-random-access-support-1301.24952013-01-14 https://scifaro.com/en/abs/connecting-terminals-and-2-disjoint-connected-subgraphs-1301.25062013-01-14 https://scifaro.com/en/abs/active-self-assembly-of-algorithmic-shapes-and-patterns-in-polylogarithmic-time-1301.26262013-01-15 https://scifaro.com/en/abs/on-byzantine-broadcast-in-planar-graphs-1301.28752013-12-10 https://scifaro.com/en/abs/a-dp-approach-to-hamiltonian-path-problem-1301.30932013-01-16 https://scifaro.com/en/abs/approximating-metrics-by-tree-metrics-of-small-distance-weighted-average-stretch-1301.32522013-01-16 https://scifaro.com/en/abs/confluently-persistent-sets-and-maps-1301.33882013-01-16 https://scifaro.com/en/abs/constraint-expressions-and-workflow-satisfiability-1301.34022013-03-14 https://scifaro.com/en/abs/many-to-many-matching-with-demands-and-capacities-1301.34822013-01-16 https://scifaro.com/en/abs/various-improvements-to-text-fingerprinting-1301.34882013-01-16 https://scifaro.com/en/abs/kidney-exchange-in-dynamic-sparse-heterogenous-pools-1301.35092013-04-03 https://scifaro.com/en/abs/efficient-identification-of-equivalences-in-dynamic-graphs-and-pedigree-structures-1301.39462013-02-20 https://scifaro.com/en/abs/approximating-bin-packing-within-o-log-opt-log-log-opt-bins-1301.40102014-03-11 https://scifaro.com/en/abs/energy-efficient-scheduling-with-time-and-processors-eligibility-restrictions-1301.41312013-09-17 https://scifaro.com/en/abs/local-search-based-approximation-algorithms-for-mobile-facility-location-problems-1301.44782013-01-21 https://scifaro.com/en/abs/average-case-performance-of-rollout-algorithms-for-knapsack-problems-1301.45292013-11-27 https://scifaro.com/en/abs/single-and-multiple-consecutive-permutation-motif-search-1301.49522013-04-29 https://scifaro.com/en/abs/improved-approximation-algorithms-for-computing-k-disjoint-paths-subject-to-two-constraints-1301.50702013-04-04 https://scifaro.com/en/abs/approximately-counting-semismooth-integers-1301.52932018-11-16 https://scifaro.com/en/abs/broadword-implementation-of-parenthesis-queries-1301.54682013-01-25 https://scifaro.com/en/abs/improved-cheeger-s-inequality-analysis-of-spectral-partitioning-algorithms-through-higher-order-spectral-gap-1301.55842013-01-24 https://scifaro.com/en/abs/approximation-of-grammar-based-compression-via-recompression-1301.58422013-11-08 https://scifaro.com/en/abs/computing-bounded-width-tree-and-branch-decompositions-of-k-outerplanar-graphs-1301.58962013-01-25 https://scifaro.com/en/abs/linear-time-algorithms-for-scattering-number-and-hamilton-connectivity-of-interval-graphs-1301.59532013-01-28 https://scifaro.com/en/abs/binary-jumbled-pattern-matching-on-trees-and-tree-like-structures-1301.61272014-07-01 https://scifaro.com/en/abs/fault-tolerant-shortest-paths-beyond-the-uniform-failure-model-1301.62992013-01-29 https://scifaro.com/en/abs/engineering-small-space-dictionary-matching-1301.64282013-01-29 https://scifaro.com/en/abs/nearly-optimal-private-convolution-1301.64472013-01-29 https://scifaro.com/en/abs/a-simple-combinatorial-algorithm-for-solving-sdd-systems-in-nearly-linear-time-1301.66282013-01-29 https://scifaro.com/en/abs/reconstructing-a-graph-from-path-traces-1301.69162013-01-30 https://scifaro.com/en/abs/how-to-meet-asynchronously-at-polynomial-cost-1301.71192015-04-24 https://scifaro.com/en/abs/a-dynamic-programming-solution-to-a-generalized-lcs-problem-1301.71832013-01-31 https://scifaro.com/en/abs/the-parity-of-directed-hamiltonian-cycles-1301.72502013-08-09 https://scifaro.com/en/abs/subexponential-parameterized-algorithm-for-computing-the-cutwidth-of-a-semi-complete-digraph-1301.73142013-01-31 https://scifaro.com/en/abs/dynamic-2d-dictionary-matching-in-small-space-1302.00722013-02-04 https://scifaro.com/en/abs/a-bound-on-the-throughput-of-radio-networks-1302.02642013-02-04 https://scifaro.com/en/abs/search-using-queries-on-indistinguishable-items-1302.08922013-02-06 https://scifaro.com/en/abs/lightweight-lempel-ziv-parsing-1302.10642020-12-11 https://scifaro.com/en/abs/a-new-greedy-randomized-adaptive-search-procedure-for-multiobjective-rna-structural-alignment-1302.14002013-02-07 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-lossy-population-recovery-1302.15152013-07-11 https://scifaro.com/en/abs/randomized-partition-trees-for-exact-nearest-neighbor-search-1302.19482013-02-11 https://scifaro.com/en/abs/an-lmp-o-log-n-approximation-algorithm-for-node-weighted-prize-collecting-steiner-tree-1302.21272013-04-11 https://scifaro.com/en/abs/on-the-tradeoff-between-stability-and-fit-1302.21372013-02-11 https://scifaro.com/en/abs/the-two-edge-connectivity-survivable-network-design-problem-in-planar-graphs-1302.21842015-10-01 https://scifaro.com/en/abs/no-wait-flowshop-scheduling-is-as-hard-as-asymmetric-traveling-salesman-problem-1302.25512013-04-26 https://scifaro.com/en/abs/minimum-length-path-decompositions-1302.27882021-03-05 https://scifaro.com/en/abs/randomized-online-computation-with-high-probability-guarantees-1302.28052013-02-15 https://scifaro.com/en/abs/yet-another-approach-to-the-maximum-flow-1302.30352013-02-14 https://scifaro.com/en/abs/an-improved-integrality-gap-for-asymmetric-tsp-paths-1302.31452015-01-07 https://scifaro.com/en/abs/alphabet-dependent-string-searching-with-wexponential-search-trees-1302.33472013-02-15 https://scifaro.com/en/abs/the-min-max-edge-q-coloring-problem-1302.34042013-02-15 https://scifaro.com/en/abs/a-quasi-polynomial-time-partition-oracle-for-graphs-with-an-excluded-minor-1302.34172013-02-15 https://scifaro.com/en/abs/modulated-string-searching-1302.34372021-01-01 https://scifaro.com/en/abs/a-sufficiently-fast-algorithm-for-finding-close-to-optimal-junction-trees-1302.35582013-02-18 https://scifaro.com/en/abs/energy-aware-checkpointing-of-divisible-tasks-with-soft-or-hard-deadlines-1302.37202013-02-18 https://scifaro.com/en/abs/improved-upper-and-lower-bound-techniques-for-monotone-switching-networks-for-directed-connectivity-1302.37262013-12-17 https://scifaro.com/en/abs/faster-exponential-time-algorithms-in-graphs-of-bounded-average-degree-1302.37632013-02-18 https://scifaro.com/en/abs/power-strip-packing-of-malleable-demands-in-smart-grid-1302.38892013-02-19 https://scifaro.com/en/abs/approximating-the-optimal-competitive-ratio-for-an-ancient-online-scheduling-problem-1302.39462013-02-19 https://scifaro.com/en/abs/full-fledged-real-time-indexing-for-constant-size-alphabets-1302.40162013-07-09 https://scifaro.com/en/abs/order-preserving-matching-1302.40642013-02-19 https://scifaro.com/en/abs/a-robust-afptas-for-online-bin-packing-with-polynomial-migration-1302.42132013-02-19 https://scifaro.com/en/abs/online-checkpointing-with-improved-worst-case-guarantees-1302.42162013-05-01 https://scifaro.com/en/abs/large-neighborhood-local-search-for-the-maximum-set-packing-problem-1302.43472013-02-19 https://scifaro.com/en/abs/a-new-algorithm-for-many-to-many-matching-with-demands-and-capacities-1302.44262013-02-19 https://scifaro.com/en/abs/efficient-parallel-and-external-matching-1302.45872014-02-04 https://scifaro.com/en/abs/on-the-k-independence-required-by-linear-probing-and-minwise-independence-1302.51272014-12-25 https://scifaro.com/en/abs/testing-uniformity-of-stationary-distribution-1302.53662016-03-11 https://scifaro.com/en/abs/sparse-fault-tolerant-bfs-trees-1302.54012013-02-22 https://scifaro.com/en/abs/thrifty-algorithms-for-multistage-robust-optimization-1302.54452013-02-25 https://scifaro.com/en/abs/transit-node-routing-reconsidered-1302.56112013-02-25 https://scifaro.com/en/abs/an-exact-algorithm-with-the-time-complexity-of-o-1-299-m-for-the-weighed-mutually-exclusive-set-cover-problem-1302.58202013-02-26 https://scifaro.com/en/abs/the-budgeted-transportation-problem-1302.58712013-02-26 https://scifaro.com/en/abs/a-stochastic-probing-problem-with-applications-1302.59132013-02-26 https://scifaro.com/en/abs/why-some-heaps-support-constant-amortized-time-decrease-key-operations-and-others-do-not-1302.66412013-07-17 https://scifaro.com/en/abs/large-scale-real-time-ridesharing-with-service-guarantee-on-road-networks-1302.66662013-02-28 https://scifaro.com/en/abs/kernelization-using-structural-parameters-on-sparse-graph-classes-1302.68632016-08-08 https://scifaro.com/en/abs/exploiting-independent-subformulas-a-faster-approximation-scheme-for-k-sat-1302.69002014-06-06 https://scifaro.com/en/abs/the-fresh-finger-property-1302.69142013-02-28 https://scifaro.com/en/abs/parallel-peeling-algorithms-1302.70142014-08-04 https://scifaro.com/en/abs/using-cascading-bloom-filters-to-improve-the-memory-usage-for-de-brujin-graphs-1302.72782013-05-22 https://scifaro.com/en/abs/an-o-1-1939-n-time-algorithm-for-minimum-weighted-dominating-induced-matching-1303.00352013-03-07 https://scifaro.com/en/abs/scalable-cost-aware-multi-way-influence-maximization-1303.01572015-06-29 https://scifaro.com/en/abs/computable-compressed-matrices-1303.02702013-03-04 https://scifaro.com/en/abs/efficient-long-division-via-montgomery-multiply-1303.03282016-08-23 https://scifaro.com/en/abs/new-online-algorithm-for-dynamic-speed-scaling-with-sleep-state-1303.03772015-07-13 https://scifaro.com/en/abs/incremental-algorithms-for-network-management-and-analysis-based-on-closeness-centrality-1303.04222013-03-05 https://scifaro.com/en/abs/space-time-tradeoffs-for-subset-sum-an-improved-worst-case-algorithm-1303.06092013-03-05 https://scifaro.com/en/abs/approximation-algorithms-for-stochastic-boolean-function-evaluation-and-stochastic-submodular-set-cover-1303.07262013-08-12 https://scifaro.com/en/abs/computing-minimum-cycle-bases-in-weighted-partial-2-trees-in-linear-time-1303.07282014-01-13 https://scifaro.com/en/abs/space-efficient-las-vegas-algorithms-for-k-sum-1303.10162013-03-12 https://scifaro.com/en/abs/sample-optimal-average-case-sparse-fourier-transform-in-two-dimensions-1303.12092013-03-07 https://scifaro.com/en/abs/on-resilient-graph-spanners-1303.15592014-05-30 https://scifaro.com/en/abs/testing-mutual-duality-of-planar-graphs-1303.16402013-03-08 https://scifaro.com/en/abs/d-cos-r-is-fpt-via-interval-deletion-1303.16432013-03-08 https://scifaro.com/en/abs/another-disjoint-compression-algorithm-for-oct-1303.16712013-03-08 https://scifaro.com/en/abs/meta-kernelization-with-structural-parameters-1303.17862013-04-22 https://scifaro.com/en/abs/an-efficient-dynamic-programming-algorithm-for-the-generalized-lcs-problem-with-multiple-substring-exclusion-constrains-1303.18722013-03-11 https://scifaro.com/en/abs/competitive-ratio-approximation-schemes-for-minimizing-the-makespan-in-the-online-list-model-1303.19122013-03-11 https://scifaro.com/en/abs/extended-fourier-analysis-of-signals-1303.20332026-01-21 https://scifaro.com/en/abs/efficient-parallel-computation-of-the-estimated-covariance-matrix-1303.22852013-03-12 https://scifaro.com/en/abs/fast-arithmetic-in-algorithmic-self-assembly-1303.24162013-08-06 https://scifaro.com/en/abs/a-local-constant-factor-approximation-algorithm-for-mds-problem-in-anonymous-network-1303.25142013-03-14 https://scifaro.com/en/abs/on-the-complexity-of-maximum-clique-algorithms-usage-of-coloring-heuristics-leads-to-the-2-n-5-algorithm-running-time-lower-bound-1303.25462013-03-12 https://scifaro.com/en/abs/is-cheeger-type-approximation-possible-for-nonuniform-sparsest-cut-1303.27302013-03-13 https://scifaro.com/en/abs/further-analysis-of-the-binary-euclidean-algorithm-1303.27722013-03-13 https://scifaro.com/en/abs/approximating-1-dimensional-tsp-requires-omega-n-log-n-comparisons-1303.29202013-03-28 https://scifaro.com/en/abs/a-competitive-ratio-approximation-scheme-for-the-k-server-problem-in-fixed-finite-metrics-1303.29632013-03-13 https://scifaro.com/en/abs/string-submodular-functions-with-curvature-constraints-1303.30182016-11-17 https://scifaro.com/en/abs/a-new-type-of-judgement-theorems-for-attribute-characters-in-information-system-1303.33192015-03-13 https://scifaro.com/en/abs/an-optimal-randomized-online-algorithm-for-reordering-buffer-management-1303.33862013-03-15 https://scifaro.com/en/abs/new-modular-multiplication-and-division-algorithms-based-on-continued-fraction-expansion-1303.34452013-03-15 https://scifaro.com/en/abs/distributed-dominating-sets-on-grids-1303.35642013-03-15 https://scifaro.com/en/abs/ultra-fast-multiple-genome-sequence-matching-using-gpu-1303.36922015-05-05 https://scifaro.com/en/abs/computing-convolution-on-grammar-compressed-text-1303.39452013-03-19 https://scifaro.com/en/abs/two-exact-algorithms-for-the-generalized-assignment-problem-1303.40312013-03-19 https://scifaro.com/en/abs/a-relation-between-additive-and-multiplicative-complexity-of-boolean-functions-1303.41772013-03-19 https://scifaro.com/en/abs/about-inverse-3-sat-1303.43242013-08-27 https://scifaro.com/en/abs/finding-all-convex-cuts-of-a-plane-graph-in-polynomial-time-1303.43492014-01-17 https://scifaro.com/en/abs/geospatial-optimization-problems-1303.46322013-03-20 https://scifaro.com/en/abs/multi-dimensional-sparse-structured-signal-approximation-using-split-bregman-iterations-1303.51972015-03-11 https://scifaro.com/en/abs/optimal-partitioning-for-dual-pivot-quicksort-1303.52172015-10-14 https://scifaro.com/en/abs/bottom-k-and-priority-sampling-set-similarity-and-subset-sums-with-minimal-independence-1303.54792013-06-12 https://scifaro.com/en/abs/novel-o-h-n-n-h-n-algorithmic-techniques-for-several-types-of-queries-and-updates-on-rooted-trees-and-lists-1303.54812013-03-25 https://scifaro.com/en/abs/line-constrained-geometric-server-placement-1303.58002013-03-26 https://scifaro.com/en/abs/improved-approximation-algorithm-for-the-number-of-queries-necessary-to-identify-a-permutation-1303.58622013-03-27 https://scifaro.com/en/abs/a-fully-polynomial-time-approximation-scheme-for-approximating-a-sum-of-random-variables-1303.60712014-02-25 https://scifaro.com/en/abs/large-scale-pattern-search-using-reduced-space-on-disk-suffix-arrays-1303.64812013-03-27 https://scifaro.com/en/abs/dynamic-provisioning-in-next-generation-data-centers-with-on-site-power-production-1303.67752013-04-19 https://scifaro.com/en/abs/latency-bounded-target-set-selection-in-social-networks-1303.67852014-04-18 https://scifaro.com/en/abs/parameterized-algorithms-for-the-2-clustering-problem-with-minimum-sum-and-minimum-sum-of-squares-objective-functions-1303.68672014-04-11 https://scifaro.com/en/abs/order-preserving-suffix-trees-and-their-algorithmic-applications-1303.68722013-03-28 https://scifaro.com/en/abs/parameterized-approximability-of-maximizing-the-spread-of-influence-in-networks-1303.69072014-08-19 https://scifaro.com/en/abs/operational-concurrency-control-in-the-face-of-arbitrary-scale-and-latency-1303.74622023-06-12 https://scifaro.com/en/abs/faster-algorithms-for-markov-decision-processes-with-low-treewidth-1304.00842016-08-11 https://scifaro.com/en/abs/fully-dynamic-1-epsilon-approximate-matchings-1304.03782013-04-11 https://scifaro.com/en/abs/algorithms-for-routing-an-unmanned-aerial-vehicle-in-the-presence-of-refueling-depots-1304.04942013-04-03 https://scifaro.com/en/abs/efficient-repeat-finding-via-suffix-arrays-1304.05282013-04-03 https://scifaro.com/en/abs/bose-einstein-condensation-in-satisfiability-problems-1304.08102013-04-04 https://scifaro.com/en/abs/a-succinct-grammar-compression-1304.09172013-06-18 https://scifaro.com/en/abs/average-case-and-distributional-analysis-of-dual-pivot-quicksort-1304.09882015-02-16 https://scifaro.com/en/abs/how-to-approximate-a-set-without-knowing-its-size-in-advance-1304.11882013-04-12 https://scifaro.com/en/abs/solving-linear-programming-with-constraints-unknown-1304.12472013-11-14 https://scifaro.com/en/abs/randomness-efficient-rumor-spreading-1304.13592013-11-13 https://scifaro.com/en/abs/improved-approximation-for-3-dimensional-matching-via-bounded-pathwidth-local-search-1304.14242013-08-21 https://scifaro.com/en/abs/cutting-corners-cheaply-or-how-to-remove-steiner-points-1304.14492015-08-21 https://scifaro.com/en/abs/how-hard-is-counting-triangles-in-the-streaming-model-1304.14582013-04-05 https://scifaro.com/en/abs/dimension-independent-matrix-square-using-mapreduce-1304.14672016-03-28 https://scifaro.com/en/abs/large-treewidth-graph-decompositions-and-applications-1304.15772013-04-08 https://scifaro.com/en/abs/online-power-managing-strategy-with-hard-real-time-guarantees-1304.15902013-04-09 https://scifaro.com/en/abs/a-near-optimal-approximation-algorithm-for-asymmetric-tsp-on-embedded-graphs-1304.18102013-05-14 https://scifaro.com/en/abs/optimal-discrete-uniform-generation-from-coin-flips-and-applications-1304.19162013-04-09 https://scifaro.com/en/abs/improved-arv-rounding-in-small-set-expanders-and-graphs-of-bounded-threshold-rank-1304.20602013-04-12 https://scifaro.com/en/abs/nearly-maximum-flows-in-nearly-linear-time-1304.20772013-04-09 https://scifaro.com/en/abs/an-improved-gef-fast-addition-algorithm-1304.21102013-04-09 https://scifaro.com/en/abs/backward-path-growth-for-efficient-mobile-sequential-recommendation-1304.21442013-04-09 https://scifaro.com/en/abs/an-almost-linear-time-algorithm-for-approximate-max-flow-in-undirected-graphs-and-its-multicommodity-generalizations-1304.23382013-09-24 https://scifaro.com/en/abs/approximation-algorithms-for-euler-genus-and-related-problems-1304.24162013-11-04 https://scifaro.com/en/abs/shortest-path-and-distance-queries-on-road-networks-towards-bridging-theory-and-practice-1304.25762013-04-25 https://scifaro.com/en/abs/centrality-of-trees-for-capacitated-k-center-1304.29832013-04-11 https://scifaro.com/en/abs/exact-algorithms-for-weighted-and-unweighted-borda-manipulation-problems-1304.31452013-04-12 https://scifaro.com/en/abs/principal-component-analysis-and-higher-correlations-for-distributed-data-1304.31622014-07-01 https://scifaro.com/en/abs/buffer-management-of-multi-queue-qos-switches-with-class-segregation-1304.31722016-03-09 https://scifaro.com/en/abs/towards-a-better-approximation-for-sparsest-cut-1304.33652013-04-12 https://scifaro.com/en/abs/on-model-based-rip-1-matrices-1304.36042014-04-29 https://scifaro.com/en/abs/algorithms-for-cut-problems-on-trees-1304.36532013-04-15 https://scifaro.com/en/abs/faster-private-release-of-marginals-on-small-databases-1304.37542013-09-04 https://scifaro.com/en/abs/network-design-with-coverage-costs-1304.38682013-07-31 https://scifaro.com/en/abs/bidirectional-collision-detection-and-faster-deterministic-isomorphism-testing-1304.39352013-05-17 https://scifaro.com/en/abs/simultaneous-approximation-for-scheduling-problems-1304.40732013-04-16 https://scifaro.com/en/abs/navigability-on-networks-a-graph-theoretic-perspective-1304.42802013-05-08 https://scifaro.com/en/abs/tree-independent-dual-tree-algorithms-1304.43272013-04-17 https://scifaro.com/en/abs/efficient-computation-of-mean-truncated-hitting-times-on-very-large-graphs-1304.43712013-04-17 https://scifaro.com/en/abs/efficient-computation-of-representative-sets-with-applications-in-parameterized-and-exact-algorithms-1304.46262016-02-23 https://scifaro.com/en/abs/pac-quasi-automatizability-of-resolution-over-restricted-distributions-1304.46332013-04-18 https://scifaro.com/en/abs/when-distributed-computation-is-communication-expensive-1304.46362013-07-29 https://scifaro.com/en/abs/personalized-pagerank-to-a-target-node-1304.46582014-04-15 https://scifaro.com/en/abs/fast-exact-shortest-path-distance-queries-on-large-networks-by-pruned-landmark-labeling-1304.46612013-04-18 https://scifaro.com/en/abs/a-new-analysis-of-compressive-sensing-by-stochastic-proximal-gradient-descent-1304.46802013-04-19 https://scifaro.com/en/abs/on-the-approximation-of-submodular-functions-1304.49482013-04-19 https://scifaro.com/en/abs/minmax-profiles-a-unifying-view-of-common-intervals-nested-common-intervals-and-conserved-intervals-of-k-permutations-1304.51402013-06-18 https://scifaro.com/en/abs/an-optimal-lower-bound-for-monotonicity-testing-over-hypergrids-1304.52642013-04-22 https://scifaro.com/en/abs/compact-q-gram-profiling-of-compressed-strings-1304.53732014-06-09 https://scifaro.com/en/abs/a-sat-approach-to-clique-width-1304.54982013-09-30 https://scifaro.com/en/abs/upper-and-lower-bounds-for-weak-backdoor-set-detection-1304.55182013-07-16 https://scifaro.com/en/abs/indexes-for-jumbled-pattern-matching-in-strings-trees-and-graphs-1304.55602013-04-23 https://scifaro.com/en/abs/parameterized-complexity-of-1-planarity-1304.55912018-12-18 https://scifaro.com/en/abs/online-makespan-minimization-with-parallel-schedules-1304.56252013-04-23 https://scifaro.com/en/abs/tree-compression-with-top-trees-1304.57022014-05-13 https://scifaro.com/en/abs/long-circuits-and-large-euler-subgraphs-1304.57462013-04-23 https://scifaro.com/en/abs/chain-minors-are-fpt-1304.58492013-04-23 https://scifaro.com/en/abs/parameterized-complexity-of-the-anchored-k-core-problem-for-directed-graphs-1304.58702013-09-18 https://scifaro.com/en/abs/sliding-bloom-filters-1304.58722013-10-10 https://scifaro.com/en/abs/solving-the-minimum-sum-coloring-problem-via-binary-quadratic-programming-1304.58762013-04-23 https://scifaro.com/en/abs/a-competitive-strategy-for-distance-aware-online-shape-allocation-1304.59712013-04-23 https://scifaro.com/en/abs/separating-hierarchical-and-general-hub-labelings-1304.59732013-06-25 https://scifaro.com/en/abs/approximation-algorithms-for-vehicle-routing-problems-with-stochastic-demands-on-trees-1304.59912013-04-23 https://scifaro.com/en/abs/paging-with-dynamic-memory-capacity-1304.60072013-04-23 https://scifaro.com/en/abs/the-local-global-conjecture-for-scheduling-with-non-linear-cost-1304.61882015-12-22 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-cutting-a-few-vertices-from-a-graph-1304.61892013-10-02 https://scifaro.com/en/abs/l2-l2-foreach-sparse-recovery-with-low-risk-1304.62322013-04-24 https://scifaro.com/en/abs/a-o-c-k-n-5-approximation-algorithm-for-treewidth-1304.63212013-04-24 https://scifaro.com/en/abs/maximizing-barrier-coverage-lifetime-with-mobile-sensors-1304.63582013-04-24 https://scifaro.com/en/abs/efficient-algorithms-for-approximate-triangle-counting-1304.63932013-04-24 https://scifaro.com/en/abs/graph-reconstruction-via-distance-oracles-1304.65882013-04-25 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-minimum-cost-edge-connectivity-augmentation-1304.65932013-08-27 https://scifaro.com/en/abs/counting-approximately-shortest-paths-in-directed-acyclic-graphs-1304.67072013-10-14 https://scifaro.com/en/abs/algebraic-algorithms-for-b-matching-shortest-undirected-paths-and-f-factors-1304.67402013-04-26 https://scifaro.com/en/abs/the-power-and-limitations-of-static-binary-search-trees-with-lazy-finger-1304.68972013-04-26 https://scifaro.com/en/abs/approximating-semi-matchings-in-streaming-and-in-two-party-communication-1304.69062013-04-26 https://scifaro.com/en/abs/an-lp-based-3-2-approximation-algorithm-for-the-graphic-s-t-path-tsp-1304.70552013-04-29 https://scifaro.com/en/abs/efficient-lyndon-factorization-of-grammar-compressed-text-1304.70612013-04-29 https://scifaro.com/en/abs/detecting-regularities-on-grammar-compressed-strings-1304.70672013-04-29 https://scifaro.com/en/abs/power-efficient-assignment-of-virtual-machines-to-physical-machines-1304.71212014-06-11 https://scifaro.com/en/abs/finding-short-paths-on-polytopes-by-the-shadow-vertex-algorithm-1304.72352013-04-29 https://scifaro.com/en/abs/web-graph-compression-with-fast-access-1304.73552013-05-02 https://scifaro.com/en/abs/np-hardness-of-speed-scaling-with-a-sleep-state-1304.73732019-12-03 https://scifaro.com/en/abs/improved-approximation-algorithms-for-the-min-max-selecting-items-problem-1304.74032013-04-30 https://scifaro.com/en/abs/counting-hypergraphs-in-data-streams-1304.74562013-04-30 https://scifaro.com/en/abs/linear-time-parameterized-algorithms-via-skew-symmetric-multicuts-1304.75052013-04-30 https://scifaro.com/en/abs/improved-approximation-algorithms-for-budgeted-node-weighted-steiner-problems-1304.75302013-04-30 https://scifaro.com/en/abs/exact-weight-subgraphs-and-the-k-sum-conjecture-1304.75582013-04-30 https://scifaro.com/en/abs/approximating-0-1-2-survivable-networks-with-minimum-number-of-steiner-points-1304.75712013-04-30 https://scifaro.com/en/abs/combining-binary-search-trees-1304.76042013-04-30 https://scifaro.com/en/abs/counting-small-cuts-in-a-graph-1304.76322013-04-30 https://scifaro.com/en/abs/a-nonmonotone-analysis-with-the-primal-dual-approach-online-routing-of-virtual-circuits-with-unknown-durations-1304.76872013-06-11 https://scifaro.com/en/abs/the-beachcombers-problem-walking-and-searching-with-mobile-robots-1304.76932013-04-30 https://scifaro.com/en/abs/co-scheduling-algorithms-for-high-throughput-workload-execution-1304.77932013-05-01 https://scifaro.com/en/abs/producibility-in-hierarchical-self-assembly-1304.78042013-05-02 https://scifaro.com/en/abs/optimal-planar-orthogonal-skyline-counting-queries-1304.79592014-04-28 https://scifaro.com/en/abs/on-semantic-word-cloud-representation-1304.80162013-05-01 https://scifaro.com/en/abs/uniqueness-of-tensor-decompositions-with-applications-to-polynomial-identifiability-1304.80872013-05-01 https://scifaro.com/en/abs/entropy-optimization-and-counting-1304.81082013-05-02 https://scifaro.com/en/abs/local-graph-clustering-beyond-cheeger-s-inequality-1304.81322013-11-08 https://scifaro.com/en/abs/from-hierarchical-partitions-to-hierarchical-covers-optimal-fault-tolerant-spanners-for-doubling-metrics-1304.81352013-05-09 https://scifaro.com/en/abs/ordering-metro-lines-by-block-crossings-1305.00692013-06-25 https://scifaro.com/en/abs/quantile-regression-for-large-scale-applications-1305.00872014-01-08 https://scifaro.com/en/abs/combinatorial-pair-testing-distinguishing-workers-from-slackers-1305.01102013-05-02 https://scifaro.com/en/abs/lightweight-lcp-construction-for-next-generation-sequencing-datasets-1305.01602013-05-02 https://scifaro.com/en/abs/treewidth-and-pathwidth-parameterized-by-vertex-cover-1305.04332013-05-03 https://scifaro.com/en/abs/fixed-parameter-and-approximation-algorithms-for-maximum-agreement-forests-of-multifurcating-trees-1305.05122013-05-03 https://scifaro.com/en/abs/matrix-inversion-is-as-easy-as-exponentiation-1305.05262016-08-23 https://scifaro.com/en/abs/minimum-common-string-partition-parameterized-by-partition-size-is-fixed-parameter-tractable-1305.06492013-10-29 https://scifaro.com/en/abs/relative-interval-analysis-of-paging-algorithms-on-access-graphs-1305.06692013-05-06 https://scifaro.com/en/abs/lz-compressed-string-dictionaries-1305.06742013-05-06 https://scifaro.com/en/abs/hierarchies-of-predominantly-connected-communities-1305.07572013-05-06 https://scifaro.com/en/abs/computing-a-k-sparse-n-length-discrete-fourier-transform-using-at-most-4k-samples-and-o-k-log-k-complexity-1305.08702015-01-27 https://scifaro.com/en/abs/parallel-string-sample-sort-1305.11572013-05-07 https://scifaro.com/en/abs/a-note-on-parallel-depth-and-breadth-first-search-by-arc-elimination-1305.12222013-11-13 https://scifaro.com/en/abs/tight-lower-bounds-for-greedy-routing-in-higher-dimensional-small-world-grids-1305.12952013-05-08 https://scifaro.com/en/abs/optimal-noise-adding-mechanisms-for-approximate-differential-privacy-1305.13302013-12-20 https://scifaro.com/en/abs/sparsest-cut-on-bounded-treewidth-graphs-algorithms-and-hardness-results-1305.13472013-05-08 https://scifaro.com/en/abs/interdiction-problems-on-planar-graphs-1305.14072013-10-02 https://scifaro.com/en/abs/bilu-linial-stable-instances-of-max-cut-and-minimum-multiway-cut-1305.16812013-11-13 https://scifaro.com/en/abs/online-vertex-cover-and-matching-beating-the-greedy-algorithm-1305.16942013-05-09 https://scifaro.com/en/abs/suffix-tree-of-alignment-an-efficient-index-for-similar-data-1305.17442013-05-09 https://scifaro.com/en/abs/efficient-accelerated-coordinate-descent-methods-and-faster-algorithms-for-solving-linear-systems-1305.19222013-05-09 https://scifaro.com/en/abs/on-advice-complexity-of-the-k-server-problem-under-sparse-metrics-1305.21082013-05-10 https://scifaro.com/en/abs/finding-distinct-subpalindromes-online-1305.25402013-05-14 https://scifaro.com/en/abs/bandits-with-knapsacks-1305.25452017-09-06 https://scifaro.com/en/abs/full-square-rhomboids-and-their-algebraic-expressions-1305.26362013-05-14 https://scifaro.com/en/abs/on-the-optimal-representation-of-algebraic-expressions-of-fibonacci-graphs-1305.26452013-05-14 https://scifaro.com/en/abs/fibonacci-graphs-and-their-expressions-1305.26472013-05-14 https://scifaro.com/en/abs/a-faster-fpt-algorithm-for-bipartite-contraction-1305.27432013-09-05 https://scifaro.com/en/abs/obdd-based-representation-of-interval-graphs-1305.27722013-05-14 https://scifaro.com/en/abs/fingerprints-in-compressed-strings-1305.27772013-05-17 https://scifaro.com/en/abs/heaviest-induced-ancestors-and-longest-common-substrings-1305.31642013-07-16 https://scifaro.com/en/abs/approximate-distance-oracle-with-constant-query-time-1305.33142013-05-16 https://scifaro.com/en/abs/new-greedy-heuristics-for-set-cover-and-set-packing-1305.35842013-05-16 https://scifaro.com/en/abs/exploiting-non-constant-safe-memory-in-resilient-algorithms-and-data-structures-1305.38282015-04-03 https://scifaro.com/en/abs/connected-domatic-packings-in-node-capacitated-graphs-1305.43082013-07-09 https://scifaro.com/en/abs/implementation-of-linear-maps-with-circulant-matrices-via-modulo-2-rectifier-circuits-of-bounded-depth-1305.43892013-05-21 https://scifaro.com/en/abs/algorithms-for-self-healing-networks-1305.46752013-05-22 https://scifaro.com/en/abs/tight-bounds-for-set-disjointness-in-the-message-passing-model-1305.46962013-05-22 https://scifaro.com/en/abs/easy-identification-of-generalized-common-and-conserved-nested-intervals-1305.47472013-12-03 https://scifaro.com/en/abs/tight-kernel-bounds-for-problems-on-graphs-with-small-degeneracy-1305.49142013-06-25 https://scifaro.com/en/abs/combinatorial-optimization-problems-with-uncertain-costs-and-the-owa-criterion-1305.53392014-11-17 https://scifaro.com/en/abs/distributed-minimum-cut-approximation-1305.55202013-11-21 https://scifaro.com/en/abs/algorithms-of-an-optimal-integer-tree-labeling-1305.55512013-05-27 https://scifaro.com/en/abs/subspace-embeddings-and-ell-p-regression-using-exponential-random-variables-1305.55802014-03-19 https://scifaro.com/en/abs/showcasing-straight-line-programs-with-memory-via-matrix-bruhat-decomposition-1305.56172024-04-24 https://scifaro.com/en/abs/memory-size-bounds-of-prefix-dags-1305.56622016-08-11 https://scifaro.com/en/abs/tree-decomposition-based-steiner-tree-computation-over-large-graphs-1305.57572013-05-27 https://scifaro.com/en/abs/maximum-st-flow-in-directed-planar-graphs-via-shortest-paths-1305.58232013-05-27 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-the-hamilton-circuit-problem-1305.59762014-02-07 https://scifaro.com/en/abs/integrality-gaps-for-strengthened-lp-relaxations-of-capacitated-and-lower-bounded-facility-location-1305.59982013-07-19 https://scifaro.com/en/abs/faster-compact-on-line-lempel-ziv-factorization-1305.60952013-05-28 https://scifaro.com/en/abs/reallocation-problems-in-scheduling-1305.65552013-05-29 https://scifaro.com/en/abs/polynomial-bounds-for-the-grid-minor-theorem-1305.65772016-08-11 https://scifaro.com/en/abs/speeding-up-dynamic-programming-with-representative-sets-an-experimental-evaluation-of-algorithms-for-steiner-tree-on-tree-decompositions-1305.74482013-06-03 https://scifaro.com/en/abs/in-pursuit-of-the-dynamic-optimality-conjecture-1306.02072013-06-04 https://scifaro.com/en/abs/managing-unbounded-length-keys-in-comparison-driven-data-structures-with-applications-to-on-line-indexing-1306.04062013-06-04 https://scifaro.com/en/abs/orthogonal-range-searching-for-text-indexing-1306.06152017-01-08 https://scifaro.com/en/abs/the-frequent-items-problem-in-online-streaming-under-various-performance-measures-1306.07712013-06-05 https://scifaro.com/en/abs/arithmetic-algorithms-for-hereditarily-binary-natural-numbers-1306.11282013-06-06 https://scifaro.com/en/abs/improvements-and-generalizations-of-stochastic-knapsack-and-multi-armed-bandit-approximation-algorithms-full-version-1306.11492016-09-14 https://scifaro.com/en/abs/a-graphical-transformation-for-belief-propagation-maximum-weight-matchings-and-odd-sized-cycles-1306.11672018-01-03 https://scifaro.com/en/abs/sorting-suffixes-of-a-text-via-its-lyndon-factorization-1306.13662013-06-07 https://scifaro.com/en/abs/threshold-load-balancing-in-networks-1306.14022013-06-07 https://scifaro.com/en/abs/beyond-locality-sensitive-hashing-1306.15472013-10-09 https://scifaro.com/en/abs/a-raindrop-algorithm-for-searching-the-global-optimal-solution-in-non-linear-programming-1306.20432013-06-11 https://scifaro.com/en/abs/happy-edges-threshold-coloring-of-regular-lattices-1306.20532014-03-07 https://scifaro.com/en/abs/metro-line-crossing-minimization-hardness-approximations-and-tractable-cases-1306.20792013-06-19 https://scifaro.com/en/abs/motif-matching-using-gapped-patterns-1306.24832014-07-08 https://scifaro.com/en/abs/space-efficient-parallel-algorithms-for-combinatorial-search-problems-1306.25522014-03-27 https://scifaro.com/en/abs/a-note-on-small-cuts-for-a-terminal-1306.25782014-03-06 https://scifaro.com/en/abs/i-o-efficient-planar-range-skyline-and-attrition-priority-queues-1306.28152013-06-13 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-maximum-edge-coloring-problem-1306.29312013-06-13 https://scifaro.com/en/abs/matching-with-our-eyes-closed-1306.29882013-08-26 https://scifaro.com/en/abs/cole-s-parametric-search-technique-made-practical-1306.30002013-06-14 https://scifaro.com/en/abs/random-shortest-paths-non-euclidean-instances-for-metric-optimization-problems-1306.30302014-05-26 https://scifaro.com/en/abs/an-efficient-branching-algorithm-for-interval-completion-1306.31812013-06-14 https://scifaro.com/en/abs/all-distances-sketches-revisited-hip-estimators-for-massive-graphs-analysis-1306.32842015-01-20 https://scifaro.com/en/abs/set-difference-range-queries-1306.34822013-06-17 https://scifaro.com/en/abs/approximation-algorithms-for-bayesian-multi-armed-bandit-problems-1306.35252013-07-18 https://scifaro.com/en/abs/exact-and-fixed-parameter-algorithms-for-metro-line-crossing-minimization-problems-1306.35382013-06-18 https://scifaro.com/en/abs/faster-deterministic-feedback-vertex-set-1306.35662013-06-18 https://scifaro.com/en/abs/approximate-nearest-neighbor-search-in-ell-p-1306.36012013-06-18 https://scifaro.com/en/abs/faster-deterministic-algorithms-for-packing-matching-and-t-dominating-set-problems-1306.36022013-06-18 https://scifaro.com/en/abs/iterative-plan-construction-for-the-workflow-satisfiability-problem-1306.36492015-05-18 https://scifaro.com/en/abs/approximation-algorithms-for-movement-repairmen-1306.37392013-06-19 https://scifaro.com/en/abs/minimal-indices-for-successor-search-1306.37722013-06-18 https://scifaro.com/en/abs/analysis-of-quickselect-under-yaroslavskiy-s-dual-pivoting-algorithm-1306.38192014-11-18 https://scifaro.com/en/abs/computing-tree-depth-faster-than-2-n-1306.38572013-06-18 https://scifaro.com/en/abs/fast-branching-algorithm-for-cluster-vertex-deletion-1306.38772013-06-18 https://scifaro.com/en/abs/hybrid-indexes-for-repetitive-datasets-1306.40372015-06-16 https://scifaro.com/en/abs/counting-thin-subgraphs-via-packings-faster-than-meet-in-the-middle-time-1306.41112015-08-17 https://scifaro.com/en/abs/a-bad-2-dimensional-instance-for-k-means-1306.42072013-06-19 https://scifaro.com/en/abs/succinct-data-structures-for-representing-equivalence-classes-1306.42872013-06-19 https://scifaro.com/en/abs/hypergraph-covering-problems-motivated-by-genome-assembly-questions-1306.43532013-06-21 https://scifaro.com/en/abs/approximation-algorithm-for-sparsest-k-partitioning-1306.43842013-10-09 https://scifaro.com/en/abs/empirical-evaluation-of-the-parallel-distribution-sweeping-framework-on-multicore-architectures-1306.45212013-06-20 https://scifaro.com/en/abs/parallel-algorithm-for-longest-common-subsequence-in-a-string-1306.46272013-06-20 https://scifaro.com/en/abs/efficient-two-stage-group-testing-algorithms-for-genetic-screening-1306.46642018-07-03 https://scifaro.com/en/abs/a-local-computation-approximation-scheme-to-maximum-matching-1306.50032013-06-24 https://scifaro.com/en/abs/optimal-color-range-reporting-in-one-dimension-1306.50292013-06-24 https://scifaro.com/en/abs/total-vector-domination-for-graphs-with-bounded-branchwidth-1306.50412013-10-01 https://scifaro.com/en/abs/bank-conflict-free-comparison-based-sorting-on-gpus-1306.50762016-10-12 https://scifaro.com/en/abs/boundary-to-boundary-flows-in-planar-graphs-1306.53912013-06-25 https://scifaro.com/en/abs/expanding-the-expressive-power-of-monadic-second-order-logic-on-restricted-graph-classes-1306.55712013-06-25 https://scifaro.com/en/abs/on-the-resilience-of-bipartite-networks-1306.57202018-01-10 https://scifaro.com/en/abs/some-extensions-of-the-all-pairs-bottleneck-paths-problem-1306.58152013-06-26 https://scifaro.com/en/abs/a-cubic-algorithm-for-computing-gaussian-volume-1306.58292013-07-12 https://scifaro.com/en/abs/an-optimal-heuristic-for-sum-of-all-prime-numbers-logic-for-large-inputs-using-raptor-1306.61932013-06-27 https://scifaro.com/en/abs/tight-lower-bound-for-linear-sketches-of-moments-1306.62952013-06-27 https://scifaro.com/en/abs/network-sparsification-for-steiner-problems-on-planar-and-bounded-genus-graphs-1306.65932017-07-12 https://scifaro.com/en/abs/a-ptas-for-the-classical-ising-spin-glass-problem-on-the-chimera-graph-structure-1306.69432013-07-02 https://scifaro.com/en/abs/investigation-of-enhancing-flexibility-and-robustness-in-multi-agent-task-scheduling-1307.00242013-07-02 https://scifaro.com/en/abs/an-experimental-comparison-of-speed-scaling-algorithms-with-deadline-feasibility-constraints-1307.05312013-07-03 https://scifaro.com/en/abs/efficient-sequential-and-parallel-algorithms-for-planted-motif-search-1307.05712013-07-03 https://scifaro.com/en/abs/a-primal-dual-continuous-lp-method-on-the-multi-choice-multi-best-secretary-problem-1307.06242013-07-03 https://scifaro.com/en/abs/on-string-matching-with-k-mismatches-1307.14062013-07-05 https://scifaro.com/en/abs/an-elegant-algorithm-for-the-construction-of-suffix-arrays-1307.14172013-07-05 https://scifaro.com/en/abs/a-branch-and-cut-algorithm-for-minimum-spanning-trees-under-conflict-constraints-1307.14242014-07-01 https://scifaro.com/en/abs/lempel-ziv-parsing-in-external-memory-1307.14282020-12-11 https://scifaro.com/en/abs/linear-time-computation-of-the-maximal-linear-and-circular-sums-of-multiple-independent-insertions-into-a-sequence-1307.14472017-01-09 https://scifaro.com/en/abs/dynamic-decremental-approximate-distance-oracles-with-1-epsilon-2-stretch-1307.15162013-07-08 https://scifaro.com/en/abs/compressed-pattern-matching-with-ranked-variables-in-zimin-words-1307.15602013-07-08 https://scifaro.com/en/abs/an-efficient-reconciliation-algorithm-for-social-networks-1307.16902013-11-21 https://scifaro.com/en/abs/linear-time-generation-of-specifiable-combinatorial-structures-general-theory-and-first-examples-1307.17282013-07-09 https://scifaro.com/en/abs/simpler-sequential-and-parallel-biconnectivity-augmentation-1307.17722013-07-09 https://scifaro.com/en/abs/approximation-schemes-for-maximum-weight-independent-set-of-rectangles-1307.17742013-07-09 https://scifaro.com/en/abs/communication-lower-bounds-for-distributed-memory-computations-1307.18052013-09-24 https://scifaro.com/en/abs/complexity-of-the-fifo-stack-up-problem-1307.19152015-10-16 https://scifaro.com/en/abs/everything-you-always-wanted-to-know-about-the-parameterized-complexity-of-subgraph-isomorphism-but-were-afraid-to-ask-1307.21872013-08-27 https://scifaro.com/en/abs/navigating-central-path-with-electrical-flows-from-flows-to-matchings-and-back-1307.22052013-10-25 https://scifaro.com/en/abs/approximate-the-k-set-packing-problem-by-local-improvements-1307.22622014-06-12 https://scifaro.com/en/abs/pipage-rounding-pessimistic-estimators-and-matrix-concentration-1307.22742013-07-10 https://scifaro.com/en/abs/improved-submatrix-maximum-queries-in-monge-matrices-1307.23132017-10-13 https://scifaro.com/en/abs/combinatorial-decomposition-approaches-for-efficient-counting-and-random-generation-fptases-1307.23472013-11-19 https://scifaro.com/en/abs/finding-the-minimum-weight-k-path-1307.24152013-07-10 https://scifaro.com/en/abs/fault-tolerant-clustering-revisited-1307.25202013-07-10 https://scifaro.com/en/abs/point-line-cover-the-easy-kernel-is-essentially-tight-1307.25212013-07-10 https://scifaro.com/en/abs/better-approximation-bounds-for-the-joint-replenishment-problem-1307.25312013-07-10 https://scifaro.com/en/abs/greedy-online-bipartite-matching-on-random-graphs-1307.25362013-07-10 https://scifaro.com/en/abs/ranking-on-arbitrary-graphs-rematch-via-continuous-lp-with-monotone-and-boundary-condition-constraints-1307.26962013-07-12 https://scifaro.com/en/abs/the-technique-of-in-place-associative-sorting-1307.27242013-07-11 https://scifaro.com/en/abs/an-efficient-multiplication-algorithm-using-nikhilam-method-1307.27352014-07-25 https://scifaro.com/en/abs/packing-a-knapsack-of-unknown-capacity-1307.28062013-07-11 https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-fault-tolerant-k-median-1307.28082014-01-27 https://scifaro.com/en/abs/flow-based-algorithms-for-local-graph-clustering-1307.28552014-11-07 https://scifaro.com/en/abs/dynamic-data-structure-for-tree-depth-decomposition-1307.28632013-07-11 https://scifaro.com/en/abs/quickxsort-efficient-sorting-with-n-log-n-1-399n-o-n-comparisons-on-average-1307.30332013-07-12 https://scifaro.com/en/abs/finding-small-patterns-in-permutations-in-linear-time-1307.30732013-11-01 https://scifaro.com/en/abs/online-independent-set-beyond-the-worst-case-secretaries-prophets-and-periods-1307.31922013-07-12 https://scifaro.com/en/abs/optimal-bounds-on-approximation-of-submodular-and-xos-functions-by-juntas-1307.33012015-03-31 https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-fault-tolerant-distributed-storage-1307.36212013-07-16 https://scifaro.com/en/abs/scheduling-arc-shut-downs-in-a-network-to-maximize-flow-over-time-with-a-bounded-number-of-jobs-per-time-period-1307.36502017-02-09 https://scifaro.com/en/abs/parallel-graph-decompositions-using-random-shifts-1307.36922013-07-16 https://scifaro.com/en/abs/prophet-inequalities-with-limited-information-1307.37362013-07-16 https://scifaro.com/en/abs/the-power-of-deferral-maintaining-a-constant-competitive-steiner-tree-online-1307.37572013-10-23 https://scifaro.com/en/abs/a-simple-approximation-algorithm-for-the-internal-steiner-minimum-tree-1307.38222013-07-18 https://scifaro.com/en/abs/idempotent-permutations-1307.38772013-07-16 https://scifaro.com/en/abs/approximating-minimum-cost-connectivity-orientation-and-augmentation-1307.41642017-11-17 https://scifaro.com/en/abs/a-qptas-for-maximum-weight-independent-set-of-polygons-with-polylogarithmically-many-vertices-1307.42572013-07-17 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-the-traveling-repairman-and-other-minimum-latency-problems-1307.42892014-09-22 https://scifaro.com/en/abs/computing-similarity-distances-between-rankings-1307.43392014-11-20 https://scifaro.com/en/abs/near-linear-time-approximation-schemes-for-uncapacitated-and-capacitated-b-matching-problems-in-nonbipartite-graphs-1307.43552018-06-19 https://scifaro.com/en/abs/access-to-data-and-number-of-iterations-dual-primal-algorithms-for-maximum-matching-under-resource-constraints-1307.43592015-04-21 https://scifaro.com/en/abs/approximating-the-minimum-cycle-mean-1307.44732013-07-18 https://scifaro.com/en/abs/ranking-with-diverse-intents-and-correlated-contents-1307.45182013-07-19 https://scifaro.com/en/abs/bottleneck-combinatorial-optimization-problems-with-uncertain-costs-and-the-owa-criterion-1307.45212013-07-19 https://scifaro.com/en/abs/complete-solutions-for-a-combinatorial-puzzle-in-linear-time-1307.45432013-07-18 https://scifaro.com/en/abs/linear-time-fpt-algorithms-via-network-flow-1307.49272013-07-19 https://scifaro.com/en/abs/polynomiality-for-bin-packing-with-a-constant-number-of-item-types-1307.51082020-05-01 https://scifaro.com/en/abs/jamming-resistant-learning-in-wireless-networks-1307.52902013-07-24 https://scifaro.com/en/abs/first-come-first-served-for-online-slot-allocation-and-huffman-coding-1307.52962013-10-09 https://scifaro.com/en/abs/polymatroid-prophet-inequalities-1307.52992013-07-22 https://scifaro.com/en/abs/linear-time-recognition-of-probe-interval-graphs-1307.55472013-07-23 https://scifaro.com/en/abs/random-rates-for-0-extension-and-low-diameter-decompositions-1307.55822013-07-23 https://scifaro.com/en/abs/dimension-reduction-via-colour-refinement-1307.56972014-05-01 https://scifaro.com/en/abs/optimal-hierarchical-layouts-for-cache-oblivious-search-trees-1307.58992013-07-29 https://scifaro.com/en/abs/a-near-optimal-dynamic-learning-algorithm-for-online-matching-problems-with-concave-returns-1307.59342015-06-09 https://scifaro.com/en/abs/alibi-an-alignment-based-index-for-genomic-datasets-1307.64622013-07-25 https://scifaro.com/en/abs/on-the-variable-common-due-date-minimal-tardy-jobs-bicriteria-two-machine-flow-shop-problem-with-ordered-machines-1307.65052015-03-16 https://scifaro.com/en/abs/minimum-d-dimensional-arrangement-with-fixed-points-1307.66272013-07-26 https://scifaro.com/en/abs/optimal-top-k-document-retrieval-1307.67892013-08-02 https://scifaro.com/en/abs/a-strongly-polynomial-algorithm-for-generalized-flow-maximization-1307.68092016-03-01 https://scifaro.com/en/abs/an-approximation-algorithm-for-the-bandpass-2-problem-1307.70892013-07-29 https://scifaro.com/en/abs/the-predecessor-existence-problem-for-k-reversible-processes-1307.72592014-12-01 https://scifaro.com/en/abs/on-active-and-passive-testing-1307.73642016-01-13 https://scifaro.com/en/abs/holographic-algorithms-beyond-matchgates-1307.74302018-01-11 https://scifaro.com/en/abs/relative-errors-for-deterministic-low-rank-matrix-approximations-1307.74542013-08-23 https://scifaro.com/en/abs/on-np-hardness-of-the-paired-de-bruijn-sound-cycle-problem-1307.78062013-07-31 https://scifaro.com/en/abs/algorithms-for-the-majority-rule-consensus-tree-and-the-frequency-difference-consensus-tree-1307.78212013-08-07 https://scifaro.com/en/abs/the-generalized-robinson-foulds-metric-1307.78242013-08-02 https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-minimum-common-string-partition-with-few-duplications-1307.78422013-08-02 https://scifaro.com/en/abs/detecting-superbubbles-in-assembly-graphs-1307.79252013-08-02 https://scifaro.com/en/abs/a-rational-convex-program-for-linear-arrow-debreu-markets-1307.80372013-11-13 https://scifaro.com/en/abs/an-improved-parameterized-algorithm-for-the-independent-feedback-vertex-set-problem-1308.00852013-08-02 https://scifaro.com/en/abs/an-n-ary-constraint-for-the-stable-marriage-problem-1308.01832013-08-02 https://scifaro.com/en/abs/parameterized-complexity-of-k-chinese-postman-problem-1308.04822013-11-25 https://scifaro.com/en/abs/estimating-the-longest-increasing-sequence-in-polylogarithmic-time-1308.06262013-08-06 https://scifaro.com/en/abs/dynamic-approximate-all-pairs-shortest-paths-breaking-the-o-mn-barrier-and-derandomization-1308.07762018-03-02 https://scifaro.com/en/abs/the-complexity-of-resolving-conflicts-on-mac-1308.09072013-08-06 https://scifaro.com/en/abs/fast-semidifferential-based-submodular-function-optimization-1308.10062013-08-13 https://scifaro.com/en/abs/list-h-coloring-a-graph-by-removing-few-vertices-1308.10682013-08-06 https://scifaro.com/en/abs/an-o-1-0821-n-time-algorithm-for-computing-maximum-independent-set-in-graphs-with-bounded-degree-3-1308.13512022-06-20 https://scifaro.com/en/abs/efficient-algorithms-for-privately-releasing-marginals-via-convex-relaxations-1308.13852013-08-07 https://scifaro.com/en/abs/on-the-independent-set-and-common-subgraph-problems-in-random-graphs-1308.15562013-08-08 https://scifaro.com/en/abs/all-pairs-shortest-paths-algorithm-for-high-dimensional-sparse-graphs-1308.15682013-08-08 https://scifaro.com/en/abs/editing-to-a-connected-graph-of-given-degrees-1308.18022014-06-05 https://scifaro.com/en/abs/parameterized-algorithms-for-load-coloring-problem-1308.18202014-04-01 https://scifaro.com/en/abs/tree-dynamics-for-peer-to-peer-streaming-1308.19712013-08-12 https://scifaro.com/en/abs/in-core-computation-of-geometric-centralities-with-hyperball-a-hundred-billion-nodes-and-beyond-1308.21442013-08-13 https://scifaro.com/en/abs/an-adaptable-fast-matrix-multiplication-algorithm-going-beyond-the-myth-of-decimal-war-1308.24002013-08-13 https://scifaro.com/en/abs/a-simple-circle-discretization-algorithm-with-applications-1308.25812013-08-15 https://scifaro.com/en/abs/parameterized-rural-postman-problem-1308.25992014-04-01 https://scifaro.com/en/abs/parameterized-algorithms-for-modular-width-1308.28582013-08-15 https://scifaro.com/en/abs/deterministic-integer-factorization-algorithms-1308.28912022-04-25 https://scifaro.com/en/abs/trace-complexity-of-network-inference-1308.29542013-08-14 https://scifaro.com/en/abs/sorted-range-reporting-revisited-1308.33262013-08-16 https://scifaro.com/en/abs/the-power-of-dynamic-distance-oracles-efficient-dynamic-algorithms-for-the-steiner-tree-1308.33362016-06-27 https://scifaro.com/en/abs/on-some-recent-max-sat-approximation-algorithms-1308.34052013-08-16 https://scifaro.com/en/abs/palindrome-recognition-in-the-streaming-model-1308.34662016-01-29 https://scifaro.com/en/abs/fixed-parameter-and-approximation-algorithms-a-new-look-1308.35202013-08-19 https://scifaro.com/en/abs/sublinear-matching-with-finite-automata-using-reverse-suffix-scanning-1308.38222015-01-16 https://scifaro.com/en/abs/optimal-algorithms-for-testing-closeness-of-discrete-distributions-1308.39462013-08-20 https://scifaro.com/en/abs/an-integer-programming-approach-to-the-hospital-residents-problem-with-ties-1308.40642013-08-21 https://scifaro.com/en/abs/external-memory-algorithms-for-path-traversal-in-graphs-1308.44692013-08-22 https://scifaro.com/en/abs/the-hospitals-residents-problem-with-couples-complexity-and-integer-programming-models-1308.45342014-05-29 https://scifaro.com/en/abs/approximating-the-little-grothendieck-problem-over-the-orthogonal-and-unitary-groups-1308.52072015-10-08 https://scifaro.com/en/abs/multireference-alignment-using-semidefinite-programming-1308.52562013-08-27 https://scifaro.com/en/abs/a-unified-approach-to-online-allocation-algorithms-via-randomized-dual-fitting-1308.54442013-08-27 https://scifaro.com/en/abs/elb-trees-an-efficient-and-lock-free-b-tree-derivative-1308.61452013-08-29 https://scifaro.com/en/abs/adaptive-detection-and-severity-level-characterization-algorithm-for-obstructive-sleep-apnea-hypopnea-syndrome-osahs-via-oximetry-signal-analysis-1308.62032013-08-29 https://scifaro.com/en/abs/new-algorithms-for-learning-incoherent-and-overcomplete-dictionaries-1308.62732014-05-27 https://scifaro.com/en/abs/beating-o-nm-in-approximate-lzw-compressed-pattern-matching-1308.65092013-09-23 https://scifaro.com/en/abs/expand-and-contract-sampling-graphs-with-given-degrees-and-other-combinatorial-families-1308.66272013-09-02 https://scifaro.com/en/abs/efficiently-listing-combinatorial-patterns-in-graphs-1308.66352013-09-02 https://scifaro.com/en/abs/streamed-graph-drawing-and-the-file-maintenance-problem-1308.67112013-09-02 https://scifaro.com/en/abs/achieving-good-angular-resolution-in-3d-arc-diagrams-1308.67302013-09-02 https://scifaro.com/en/abs/a-combination-of-flow-shop-scheduling-and-the-shortest-path-problem-1309.00812013-09-03 https://scifaro.com/en/abs/combinations-of-some-shop-scheduling-problems-and-the-shortest-path-problem-complexity-and-approximation-algorithms-1309.00822013-09-03 https://scifaro.com/en/abs/reconstruction-and-uniqueness-of-moving-obstacles-1309.01922014-01-17 https://scifaro.com/en/abs/colored-packets-with-deadlines-and-metric-space-transition-cost-1309.02512013-09-03 https://scifaro.com/en/abs/on-the-performance-of-a-cavity-method-based-algorithm-for-the-prize-collecting-steiner-tree-problem-on-graphs-1309.03462013-09-03 https://scifaro.com/en/abs/unidirectional-input-output-streaming-complexity-of-reversal-and-sorting-1309.06472014-07-21 https://scifaro.com/en/abs/denoising-using-projection-onto-convex-sets-pocs-based-framework-1309.07002013-09-04 https://scifaro.com/en/abs/efficient-enumeration-of-chordless-cycles-1309.10512014-12-01 https://scifaro.com/en/abs/large-induced-subgraphs-via-triangulations-and-cmso-1309.15592013-09-09 https://scifaro.com/en/abs/fast-ranking-algorithm-for-very-large-data-1309.16452013-09-09 https://scifaro.com/en/abs/throughput-maximization-in-the-speed-scaling-setting-1309.17322013-09-09 https://scifaro.com/en/abs/algorithms-for-group-isomorphism-via-group-extensions-and-cohomology-1309.17762017-04-12 https://scifaro.com/en/abs/approximation-algorithms-for-the-load-balanced-capacitated-vehicle-routing-problem-1309.18462020-07-28 https://scifaro.com/en/abs/the-swap-matching-problem-revisited-1309.19812013-09-19 https://scifaro.com/en/abs/submodular-maximization-meets-streaming-matchings-matroids-and-more-1309.20382013-11-19 https://scifaro.com/en/abs/trans-outperforms-mtf-for-two-special-types-of-request-sequences-without-locality-of-reference-1309.24762013-09-11 https://scifaro.com/en/abs/max-flows-on-sparse-and-dense-networks-1309.25252013-10-30 https://scifaro.com/en/abs/multiway-cut-pairwise-realizable-distributions-and-descending-thresholds-1309.27292014-05-13 https://scifaro.com/en/abs/decision-trees-for-function-evaluation-simultaneous-optimization-of-worst-and-expected-cost-1309.27962014-07-29 https://scifaro.com/en/abs/o-notation-in-algorithm-analysis-1309.32102016-11-01 https://scifaro.com/en/abs/partitioning-into-expanders-1309.32232013-12-09 https://scifaro.com/en/abs/a-parallel-data-distribution-management-algorithm-1309.34582016-05-18 https://scifaro.com/en/abs/improved-parallel-algorithms-for-spanners-and-hopsets-1309.35452015-06-25 https://scifaro.com/en/abs/optimizing-maximum-flow-time-and-maximum-throughput-in-broadcast-scheduling-1309.36752013-09-17 https://scifaro.com/en/abs/efficient-graph-algorithms-for-network-analysis-1309.38492013-09-17 https://scifaro.com/en/abs/exploring-subexponential-parameterized-complexity-of-completion-problems-1309.40222014-05-14 https://scifaro.com/en/abs/routing-directions-keeping-it-fast-and-simple-1309.43962013-09-18 https://scifaro.com/en/abs/approximating-the-maxcover-problem-with-bounded-frequencies-in-fpt-time-1309.44052013-09-18 https://scifaro.com/en/abs/new-approximability-results-for-the-robust-k-median-problem-1309.46022013-09-19 https://scifaro.com/en/abs/sefe-with-no-mapping-via-large-induced-outerplane-graphs-in-plane-graphs-1309.47132013-09-19 https://scifaro.com/en/abs/approximation-theory-and-the-design-of-fast-algorithms-1309.48822013-09-20 https://scifaro.com/en/abs/better-bounds-for-online-k-frame-throughput-maximization-in-network-switches-1309.49192013-09-23 https://scifaro.com/en/abs/a-near-optimal-approximation-algorithm-for-vertex-cover-problem-1309.49532013-09-20 https://scifaro.com/en/abs/approximation-of-smallest-linear-tree-grammar-1309.49582018-10-09 https://scifaro.com/en/abs/distance-oracles-for-time-dependent-networks-1309.49732015-04-21 https://scifaro.com/en/abs/augmenting-graphs-to-minimize-the-diameter-1309.51722013-09-23 https://scifaro.com/en/abs/substring-suffix-selection-1309.56182013-09-24 https://scifaro.com/en/abs/combining-all-pairs-shortest-paths-and-all-pairs-bottleneck-paths-problems-1309.56872013-09-24 https://scifaro.com/en/abs/competitive-design-and-analysis-for-machine-minimizing-job-scheduling-problem-1309.56972013-09-24 https://scifaro.com/en/abs/probi-a-heuristic-for-the-probabilistic-k-median-problem-1309.57812013-09-24 https://scifaro.com/en/abs/xml-compression-via-dags-1309.59272013-09-24 https://scifaro.com/en/abs/applications-of-continuous-amortization-to-bisection-based-root-isolation-1309.59912013-09-25 https://scifaro.com/en/abs/beyond-the-shannon-s-bound-1309.60692013-09-25 https://scifaro.com/en/abs/discordant-compact-logic-arithmetic-structures-in-discrete-optimization-problems-1309.60782013-09-25 https://scifaro.com/en/abs/a-simple-fptas-for-counting-edge-covers-1309.61152014-11-04 https://scifaro.com/en/abs/partition-merge-distributed-inference-and-modularity-optimization-1309.61292013-09-25 https://scifaro.com/en/abs/order-preserving-pattern-matching-with-k-mismatches-1309.64532014-03-07 https://scifaro.com/en/abs/online-bin-covering-expectations-vs-guarantees-1309.64772014-02-28 https://scifaro.com/en/abs/the-random-bit-complexity-of-mobile-robots-scattering-1309.66032015-02-25 https://scifaro.com/en/abs/on-the-connectivity-preserving-minimum-cut-problem-1309.66892013-09-27 https://scifaro.com/en/abs/treedy-a-heuristic-for-counting-and-sampling-subsets-1309.68512013-09-27 https://scifaro.com/en/abs/how-good-is-the-chord-algorithm-1309.70842013-09-30 https://scifaro.com/en/abs/a-general-method-for-common-intervals-1309.71412013-09-30 https://scifaro.com/en/abs/decompositions-of-triangle-dense-graphs-1309.74402014-02-10 https://scifaro.com/en/abs/on-self-avoiding-walks-across-n-dimensional-dice-and-combinatorial-optimization-an-introduction-1309.75082013-10-01 https://scifaro.com/en/abs/improved-bounds-for-the-randomized-decision-tree-complexity-of-recursive-majority-1309.75652013-10-01 https://scifaro.com/en/abs/the-dynamic-longest-increasing-subsequence-problem-1309.77242013-12-17 https://scifaro.com/en/abs/tree-deletion-set-has-a-polynomial-kernel-but-no-opt-o-1-approximation-1309.78912013-10-01 https://scifaro.com/en/abs/dynamic-gomory-hu-tree-construction-fast-and-simple-1310.01782013-10-02 https://scifaro.com/en/abs/protein-threading-based-on-nonlinear-integer-programming-1310.03952013-10-17 https://scifaro.com/en/abs/revisiting-the-problem-of-searching-on-a-line-1310.10482013-10-04 https://scifaro.com/en/abs/approximate-string-matching-using-a-bidirectional-index-1310.14402015-09-08 https://scifaro.com/en/abs/space-efficient-linear-time-lempel-ziv-factorization-on-constant-size-alphabets-1310.14482013-10-08 https://scifaro.com/en/abs/quicklexsort-an-efficient-algorithm-for-lexicographically-sorting-nested-restrictions-of-a-database-1310.16492013-10-08 https://scifaro.com/en/abs/tsp-tours-in-cubic-graphs-beyond-4-3-1310.18962013-10-08 https://scifaro.com/en/abs/solving-3-sat-and-3-dimensional-matching-in-polynomial-time-1310.19712014-02-05 https://scifaro.com/en/abs/finding-dominators-via-disjoint-set-union-1310.21182013-10-09 https://scifaro.com/en/abs/improved-approximation-algorithm-for-k-level-ufl-with-penalties-a-simplistic-view-on-randomizing-the-scaling-parameter-1310.23862016-11-25 https://scifaro.com/en/abs/approximability-of-connected-factors-1310.23872013-10-10 https://scifaro.com/en/abs/half-integrality-lp-branching-and-fpt-algorithms-1310.28412014-06-12 https://scifaro.com/en/abs/towards-1-epsilon-approximate-flow-sparsifiers-1310.32522013-10-14 https://scifaro.com/en/abs/next-generation-cluster-editing-1310.33532013-10-15 https://scifaro.com/en/abs/quorums-quicken-queries-efficient-asynchronous-secure-multiparty-computation-1310.34862013-10-15 https://scifaro.com/en/abs/online-coordinated-charging-decision-algorithm-for-electric-vehicles-without-future-information-1310.35802013-12-02 https://scifaro.com/en/abs/scalable-verification-of-markov-decision-processes-1310.36092014-09-18 https://scifaro.com/en/abs/extending-common-intervals-searching-from-permutations-to-sequences-1310.42902013-10-17 https://scifaro.com/en/abs/submodular-stochastic-probing-on-matroids-1310.44152014-02-19 https://scifaro.com/en/abs/a-dynamic-programming-solution-to-the-monotonic-path-of-minimal-cost-in-a-3-rows-matrix-1310.45412013-10-18 https://scifaro.com/en/abs/scalable-boolean-tensor-factorizations-using-random-walks-1310.48432013-10-21 https://scifaro.com/en/abs/covering-pairs-in-directed-acyclic-graphs-1310.50372014-03-06 https://scifaro.com/en/abs/spider-covers-for-prize-collecting-network-activation-problem-1310.54222014-09-29 https://scifaro.com/en/abs/parameterized-algorithms-for-finding-square-roots-1310.54692013-10-22 https://scifaro.com/en/abs/contracting-graphs-to-split-graphs-and-threshold-graphs-1310.57862013-10-23 https://scifaro.com/en/abs/graph-clustering-with-surprise-complexity-and-exact-solutions-1310.60192013-10-23 https://scifaro.com/en/abs/mining-maximal-cliques-from-an-uncertain-graph-1310.67802014-10-23 https://scifaro.com/en/abs/maximizing-revenues-for-online-dial-a-ride-1310.72322013-10-29 https://scifaro.com/en/abs/average-case-analysis-of-java-7-s-dual-pivot-quicksort-1310.74092013-10-29 https://scifaro.com/en/abs/counting-triangles-in-real-world-graph-streams-dealing-with-repeated-edges-and-time-windows-1310.76652014-10-16 https://scifaro.com/en/abs/greedy-graph-colouring-is-a-misleading-heuristic-1310.77412013-10-30 https://scifaro.com/en/abs/improved-approximation-algorithms-for-matroid-and-knapsack-median-problems-and-applications-1310.78342016-09-30 https://scifaro.com/en/abs/a-new-push-relabel-algorithm-for-sparse-networks-1310.78402014-06-12 https://scifaro.com/en/abs/list-sort-a-new-approach-for-sorting-list-to-reduce-execution-time-1310.78902013-10-30 https://scifaro.com/en/abs/moving-in-temporal-graphs-with-very-sparse-random-availability-of-edges-1310.78982013-10-30 https://scifaro.com/en/abs/replacement-paths-via-row-minima-of-concise-matrices-1310.80622014-03-04 https://scifaro.com/en/abs/a-labeling-approach-to-incremental-cycle-detection-1310.83812013-11-01 https://scifaro.com/en/abs/a-faster-algorithm-to-recognize-even-hole-free-graphs-1311.03582015-02-13 https://scifaro.com/en/abs/a-linear-time-and-space-algorithm-for-optimal-traffic-signal-durations-at-an-intersection-1311.03622014-07-22 https://scifaro.com/en/abs/on-the-lattice-isomorphism-problem-1311.03662013-11-05 https://scifaro.com/en/abs/deterministic-parameterized-algorithms-for-matching-and-packing-problems-1311.04842013-11-19 https://scifaro.com/en/abs/edge-covering-with-budget-constrains-1311.07132013-11-05 https://scifaro.com/en/abs/mondshein-sequences-a-k-a-2-1-orders-1311.07502016-08-22 https://scifaro.com/en/abs/the-composition-theorem-for-differential-privacy-1311.07762015-12-08 https://scifaro.com/en/abs/from-theory-to-practice-plug-and-play-with-succinct-data-structures-1311.12492013-11-07 https://scifaro.com/en/abs/algorithmic-and-hardness-results-for-the-colorful-components-problems-1311.12982013-11-07 https://scifaro.com/en/abs/significance-relations-for-the-benchmarking-of-meta-heuristic-algorithms-1311.13382013-11-07 https://scifaro.com/en/abs/suffix-trays-and-suffix-trists-structures-for-faster-text-indexing-1311.17622013-11-08 https://scifaro.com/en/abs/simple-dfs-on-the-complement-of-a-graph-and-on-partially-complemented-digraphs-1311.18592013-11-11 https://scifaro.com/en/abs/simple-multi-party-set-reconciliation-1311.20372015-04-23 https://scifaro.com/en/abs/submodular-optimization-with-submodular-cover-and-submodular-knapsack-constraints-1311.21062013-11-12 https://scifaro.com/en/abs/curvature-and-optimal-algorithms-for-learning-and-minimizing-submodular-functions-1311.21102013-11-12 https://scifaro.com/en/abs/betweenness-centrality-incremental-and-faster-1311.21472013-11-19 https://scifaro.com/en/abs/analyzing-the-optimal-neighborhood-algorithms-for-budgeted-and-partial-connected-dominating-set-problems-1311.23092013-11-12 https://scifaro.com/en/abs/families-with-infants-a-general-approach-to-solve-hard-partition-problems-1311.24562014-10-13 https://scifaro.com/en/abs/parameterized-approximation-schemes-using-graph-widths-1311.24662014-02-18 https://scifaro.com/en/abs/the-noisy-power-method-a-meta-algorithm-with-applications-1311.24952015-02-05 https://scifaro.com/en/abs/toward-a-unified-theory-of-sparse-dimensionality-reduction-in-euclidean-space-1311.25422015-08-27 https://scifaro.com/en/abs/efficiently-computing-edit-distance-to-dyck-language-1311.25572013-11-13 https://scifaro.com/en/abs/minimum-bisection-is-fixed-parameter-tractable-1311.25632014-03-19 https://scifaro.com/en/abs/primal-beats-dual-on-online-packing-lps-in-the-random-order-model-1311.25782013-11-12 https://scifaro.com/en/abs/common-due-date-problem-exact-polynomial-algorithms-for-a-given-job-sequence-1311.28792013-11-13 https://scifaro.com/en/abs/aircraft-landing-problem-efficient-algorithm-for-a-given-landing-sequence-1311.28802016-11-18 https://scifaro.com/en/abs/cops-robbers-and-threatening-skeletons-padded-decomposition-for-minor-free-graphs-1311.30482021-01-12 https://scifaro.com/en/abs/simple-tabulation-fast-expanders-double-tabulation-and-high-independence-1311.31212016-11-15 https://scifaro.com/en/abs/recent-advances-in-graph-partitioning-1311.31442015-02-04 https://scifaro.com/en/abs/on-the-adaptivity-gap-of-stochastic-orienteering-1311.36232014-05-12 https://scifaro.com/en/abs/a-9-7-approximation-algorithm-for-graphic-tsp-in-cubic-bipartite-graphs-1311.36402014-11-04 https://scifaro.com/en/abs/smoothed-analysis-of-tensor-decompositions-1311.36512014-01-21 https://scifaro.com/en/abs/fptas-for-counting-monotone-cnf-1311.37282014-04-03 https://scifaro.com/en/abs/chapter-10-algebraic-algorithms-1311.37312013-11-18 https://scifaro.com/en/abs/scheduling-meets-fixed-parameter-tractability-1311.40212013-11-19 https://scifaro.com/en/abs/largest-chordal-and-interval-subgraphs-faster-than-2-n-1311.40552013-11-19 https://scifaro.com/en/abs/encoding-range-minimum-queries-1311.43942013-11-19 https://scifaro.com/en/abs/efficient-algorithms-for-the-longest-common-subsequence-in-k-length-substrings-1311.45522013-11-20 https://scifaro.com/en/abs/approximation-algorithms-for-the-incremental-knapsack-problem-via-disjunctive-programming-1311.45632013-11-20 https://scifaro.com/en/abs/an-o-m-log-m-algorithm-for-bipartite-matching-with-roadmap-distances-1311.46092013-11-20 https://scifaro.com/en/abs/optimal-approximation-for-submodular-and-supermodular-optimization-with-bounded-curvature-1311.47282014-12-15 https://scifaro.com/en/abs/approximation-algorithms-for-hard-capacitated-k-facility-location-problems-1311.47592014-09-15 https://scifaro.com/en/abs/editing-to-a-graph-of-given-degrees-1311.47682014-12-24 https://scifaro.com/en/abs/combining-the-shortest-paths-and-the-bottleneck-paths-problems-1311.50812013-11-21 https://scifaro.com/en/abs/influence-diffusion-in-social-networks-under-time-window-constraints-1311.51932013-11-21 https://scifaro.com/en/abs/distributed-connectivity-decomposition-1311.53172013-11-22 https://scifaro.com/en/abs/bi-criteria-and-approximation-algorithms-for-restricted-matchings-1311.54812013-11-22 https://scifaro.com/en/abs/a-continuous-refinement-strategy-for-the-multilevel-computation-of-vertex-separators-1311.59302013-11-26 https://scifaro.com/en/abs/approximation-algorithms-for-regret-bounded-vehicle-routing-and-applications-to-distance-constrained-vehicle-routing-1311.60242013-11-26 https://scifaro.com/en/abs/a-new-algorithm-for-updating-and-querying-sub-arrays-of-multidimensional-arrays-1311.60932016-08-05 https://scifaro.com/en/abs/an-energy-function-and-its-application-to-the-periodic-behavior-of-k-reversible-processes-1311.61262018-06-06 https://scifaro.com/en/abs/approximating-hereditary-discrepancy-via-small-width-ellipsoids-1311.62042014-07-24 https://scifaro.com/en/abs/internal-pattern-matching-queries-in-a-text-and-applications-1311.62352023-05-03 https://scifaro.com/en/abs/reputationpro-the-efficient-approaches-to-contextual-transaction-trust-computation-in-e-commerce-environments-1311.65432015-01-27 https://scifaro.com/en/abs/improved-approximation-algorithm-for-fault-tolerant-facility-placement-1311.66152014-02-12 https://scifaro.com/en/abs/theories-of-hypergraph-graph-hg-2-data-structure-1311.72012013-12-02 https://scifaro.com/en/abs/integrating-rdf-into-hypergraph-graph-hg-2-data-structure-1311.72022013-12-02 https://scifaro.com/en/abs/on-the-list-update-problem-with-advice-1311.73572016-06-07 https://scifaro.com/en/abs/worst-case-analysis-of-weber-s-algorithm-1311.73692013-12-02 https://scifaro.com/en/abs/online-algorithms-with-advice-for-bin-packing-and-scheduling-problems-1311.75892015-08-06 https://scifaro.com/en/abs/boosting-the-basic-counting-on-distributed-streams-1312.00422013-12-03 https://scifaro.com/en/abs/on-an-algorithm-for-obtaining-all-binary-matrices-of-special-class-related-to-v-e-tarakanov-s-formula-1312.01862013-12-03 https://scifaro.com/en/abs/some-combinatorial-problems-on-binary-matrices-in-programming-courses-1312.01942013-12-03 https://scifaro.com/en/abs/property-testing-in-sparse-directed-graphs-3-star-freeness-and-connectivity-1312.04972013-12-03 https://scifaro.com/en/abs/cache-oblivious-peeling-of-random-hypergraphs-1312.05262013-12-03 https://scifaro.com/en/abs/sherali-adams-gaps-flow-cover-inequalities-and-generalized-configurations-for-capacity-constrained-facility-location-1312.07222014-06-17 https://scifaro.com/en/abs/the-input-output-complexity-of-triangle-enumeration-1312.07232014-03-25 https://scifaro.com/en/abs/faster-and-sample-near-optimal-algorithms-for-proper-learning-mixtures-of-gaussians-1312.10542014-05-20 https://scifaro.com/en/abs/design-and-analysis-of-an-estimation-of-distribution-approximation-algorithm-for-single-machine-scheduling-in-uncertain-environments-1312.12732013-12-05 https://scifaro.com/en/abs/bandits-and-experts-in-metric-spaces-1312.12772019-04-16 https://scifaro.com/en/abs/orienting-fully-dynamic-graphs-with-worst-case-time-bounds-1312.13822013-12-06 https://scifaro.com/en/abs/efficient-construction-of-the-lattice-of-frequent-closed-patterns-and-simultaneous-extraction-of-generic-bases-of-rules-1312.15582013-12-12 https://scifaro.com/en/abs/beating-the-generator-enumeration-bound-for-p-group-isomorphism-1312.17552013-12-09 https://scifaro.com/en/abs/optimal-error-rates-for-interactive-coding-ii-efficiency-and-list-decoding-1312.17632014-04-17 https://scifaro.com/en/abs/optimal-error-rates-for-interactive-coding-i-adaptivity-and-other-settings-1312.17642022-08-09 https://scifaro.com/en/abs/exponential-lower-bounds-on-the-size-of-approximate-formulations-in-the-natural-encoding-for-capacitated-facility-location-1312.18192013-12-09 https://scifaro.com/en/abs/approximating-the-stationary-probability-of-a-single-state-in-a-markov-chain-1312.19862015-12-11 https://scifaro.com/en/abs/ram-efficient-external-memory-sorting-1312.20182013-12-11 https://scifaro.com/en/abs/bounds-on-double-sided-myopic-algorithms-for-unconstrained-non-monotone-submodular-maximization-1312.21732014-04-25 https://scifaro.com/en/abs/new-tabulation-and-sparse-dynamic-programming-based-techniques-for-sequence-similarity-problems-1312.22172014-05-22 https://scifaro.com/en/abs/a-note-on-the-longest-common-compatible-prefix-problem-for-partial-words-1312.23812013-12-10 https://scifaro.com/en/abs/improved-integrality-gap-upper-bounds-for-tsp-with-distances-one-and-two-1312.25022015-03-27 https://scifaro.com/en/abs/shortest-unique-substring-query-revisited-1312.27382014-01-14 https://scifaro.com/en/abs/the-role-of-planarity-in-connectivity-problems-parameterized-by-treewidth-1312.28892013-12-11 https://scifaro.com/en/abs/rounding-lasserre-sdps-using-column-selection-and-spectrum-based-approximation-schemes-for-graph-partitioning-and-quadratic-ips-1312.30242013-12-12 https://scifaro.com/en/abs/approximate-least-squares-1312.31342016-11-15 https://scifaro.com/en/abs/worst-case-performance-analysis-of-some-approximation-algorithms-for-minimizing-makespan-and-flow-time-1312.33452013-12-18 https://scifaro.com/en/abs/compressed-spaced-suffix-arrays-1312.34222014-03-11 https://scifaro.com/en/abs/counting-popular-matchings-in-house-allocation-problems-1312.35522013-12-13 https://scifaro.com/en/abs/on-the-complexity-of-making-a-distinguished-vertex-minimum-or-maximum-degree-by-vertex-deletion-1312.37792014-01-15 https://scifaro.com/en/abs/a-combinatorial-tilde-o-m-3-2-time-algorithm-for-the-min-cost-flow-problem-1312.39052014-02-19 https://scifaro.com/en/abs/adaptive-protocols-for-interactive-communication-1312.41822015-08-10 https://scifaro.com/en/abs/near-optimal-labeling-schemes-for-nearest-common-ancestors-1312.44132015-04-21 https://scifaro.com/en/abs/a-functional-approach-to-standard-binary-heaps-1312.46662013-12-18 https://scifaro.com/en/abs/simple-compact-and-robust-approximate-string-dictionary-1312.46782014-08-26 https://scifaro.com/en/abs/a-statistical-peek-into-average-case-complexity-1312.48022013-12-18 https://scifaro.com/en/abs/on-r-simple-k-path-1312.48632014-01-23 https://scifaro.com/en/abs/local-correlation-clustering-1312.51052013-12-19 https://scifaro.com/en/abs/bar-1-visibility-graphs-and-their-relation-to-other-nearly-planar-graphs-1312.55202013-12-20 https://scifaro.com/en/abs/succinct-representation-of-labeled-trees-1312.60392013-12-23 https://scifaro.com/en/abs/exact-algorithms-for-maximum-independent-set-1312.62602017-08-08 https://scifaro.com/en/abs/the-lasserre-hierarchy-in-almost-diagonal-form-1312.64932014-04-03 https://scifaro.com/en/abs/bi-factor-approximation-algorithms-for-hard-capacitated-k-median-problems-1312.65502017-04-25 https://scifaro.com/en/abs/explicit-linear-kernels-via-dynamic-programming-1312.65852014-11-21 https://scifaro.com/en/abs/rounding-sum-of-squares-relaxations-1312.66522013-12-24 https://scifaro.com/en/abs/path-finding-i-solving-linear-programs-with-o-sqrt-rank-linear-system-solves-1312.66772015-03-06 https://scifaro.com/en/abs/faster-all-pairs-shortest-paths-via-circuit-complexity-1312.66802014-05-23 https://scifaro.com/en/abs/path-finding-ii-an-o-m-sqrt-n-algorithm-for-the-minimum-cost-flow-problem-1312.67132015-03-06 https://scifaro.com/en/abs/local-algorithms-for-interactive-clustering-1312.67242015-03-23 https://scifaro.com/en/abs/a-fast-greedy-algorithm-for-generalized-column-subset-selection-1312.68202013-12-25 https://scifaro.com/en/abs/greedy-column-subset-selection-for-large-scale-data-sets-1312.68382013-12-27 https://scifaro.com/en/abs/proceedings-2nd-workshop-on-graph-inspection-and-traversal-engineering-1312.70622013-12-30 https://scifaro.com/en/abs/distributed-and-parallel-algorithms-for-set-cover-problems-with-small-neighborhood-covers-1312.72172013-12-30 https://scifaro.com/en/abs/minimum-dominating-set-for-a-point-set-in-ir-2-1312.72432014-01-07 https://scifaro.com/en/abs/online-steiner-tree-with-deletions-1312.72962013-12-30 https://scifaro.com/en/abs/a-note-on-sparse-least-squares-regression-1312.74992013-12-31 https://scifaro.com/en/abs/parallel-algorithms-for-geometric-graph-problems-1401.00422014-01-07 https://scifaro.com/en/abs/probabilistic-spectral-sparsification-in-sublinear-time-1401.00852014-01-03 https://scifaro.com/en/abs/expected-time-complexity-of-the-auction-algorithm-and-the-push-relabel-algorithm-for-maximal-bipartite-matching-on-random-graphs-1401.01192017-04-07 https://scifaro.com/en/abs/fast-algorithm-for-partial-covers-in-words-1401.01632014-01-03 https://scifaro.com/en/abs/faster-3-periodic-merging-networks-1401.03962014-01-03 https://scifaro.com/en/abs/faster-svd-truncated-least-squares-regression-1401.04172014-05-29 https://scifaro.com/en/abs/on-minimum-average-stretch-spanning-trees-in-polygonal-2-trees-1401.04322014-04-15 https://scifaro.com/en/abs/more-algorithms-for-provable-dictionary-learning-1401.05792014-01-06 https://scifaro.com/en/abs/space-efficient-string-indexing-for-wildcard-pattern-matching-1401.06252014-01-06 https://scifaro.com/en/abs/nonuniform-graph-partitioning-with-unrelated-weights-1401.06992014-04-29 https://scifaro.com/en/abs/a-parallel-space-saving-algorithm-for-frequent-items-and-the-hurwitz-zeta-distribution-1401.07022015-09-29 https://scifaro.com/en/abs/a-search-procedure-for-cyclic-subsets-1401.09062014-01-07 https://scifaro.com/en/abs/maintaining-partial-sums-in-logarithmic-time-1401.09212014-01-07 https://scifaro.com/en/abs/linear-time-construction-of-compressed-text-indices-in-compact-space-1401.09362016-05-24 https://scifaro.com/en/abs/efficient-random-sampling-of-binary-and-unary-binary-trees-via-holonomic-equations-1401.11402018-02-20 https://scifaro.com/en/abs/a-recursive-algorithmic-approach-to-the-finding-of-permutations-for-the-combination-of-any-two-sets-1401.14502014-01-08 https://scifaro.com/en/abs/approximating-large-frequency-moments-with-o-n-1-2-k-bits-1401.17632014-01-28 https://scifaro.com/en/abs/simple-linear-algorithms-for-mining-graph-cores-1401.17712014-01-09 https://scifaro.com/en/abs/temporal-graph-traversals-definitions-algorithms-and-applications-1401.19192014-01-10 https://scifaro.com/en/abs/binary-jumbled-pattern-matching-via-all-pairs-shortest-paths-1401.20652014-07-01 https://scifaro.com/en/abs/on-the-nearest-neighbor-rule-for-the-metric-traveling-salesman-problem-1401.20712014-01-10 https://scifaro.com/en/abs/nextbestonce-achieving-polylog-routing-despite-non-greedy-embeddings-1401.21652014-01-13 https://scifaro.com/en/abs/a-second-look-at-counting-triangles-in-graph-streams-revised-1401.21752016-03-10 https://scifaro.com/en/abs/a-lower-bound-for-metric-1-median-selection-1401.21952014-01-13 https://scifaro.com/en/abs/bpp-large-graph-storage-for-efficient-disk-based-processing-1401.23272014-01-13 https://scifaro.com/en/abs/approximation-algorithm-project-1401.23932014-01-13 https://scifaro.com/en/abs/stretching-stretch-1401.24542014-02-07 https://scifaro.com/en/abs/linear-time-compression-of-bounded-genus-graphs-into-information-theoretically-optimal-number-of-bits-1401.25382014-04-24 https://scifaro.com/en/abs/constant-factor-approximation-for-capacitated-k-center-with-outliers-1401.28742014-01-14 https://scifaro.com/en/abs/a-tight-lower-bound-instance-for-k-means-in-constant-dimension-1401.29122014-01-15 https://scifaro.com/en/abs/an-iterative-merging-placement-algorithm-for-the-fixed-outline-floorplanning-1401.31722014-01-15 https://scifaro.com/en/abs/a-milp-model-for-an-extended-version-of-the-flexible-job-shop-problem-1401.36542014-01-16 https://scifaro.com/en/abs/better-approximation-algorithms-for-maximum-asymmetric-traveling-salesman-and-shortest-superstring-1401.36702014-01-16 https://scifaro.com/en/abs/improved-analysis-of-d2-sampling-based-ptas-for-k-means-and-other-clustering-problems-1401.36852014-01-16 https://scifaro.com/en/abs/an-experimental-evaluation-of-list-coloring-algorithms-1401.37622014-06-24 https://scifaro.com/en/abs/large-neighborhoods-with-implicit-customer-selection-for-vehicle-routing-problems-with-profits-1401.37942014-07-29 https://scifaro.com/en/abs/preserving-the-basic-property-of-stable-matching-by-deleting-a-pair-1401.42452014-01-20 https://scifaro.com/en/abs/computing-all-pairs-shortest-paths-by-leveraging-low-treewidth-1401.46092014-01-21 https://scifaro.com/en/abs/finding-minimum-tucker-submatrices-1401.47392014-01-21 https://scifaro.com/en/abs/a-domination-algorithm-for-0-1-instances-of-the-travelling-salesman-problem-1401.49312015-05-27 https://scifaro.com/en/abs/fully-online-grammar-compression-in-constant-space-1401.51432014-01-30 https://scifaro.com/en/abs/stable-roommates-problem-with-random-preferences-1401.52692015-01-22 https://scifaro.com/en/abs/a-distributed-minimum-cut-approximation-scheme-1401.53162014-01-22 https://scifaro.com/en/abs/relations-between-automata-and-the-simple-k-path-problem-1401.57072014-01-28 https://scifaro.com/en/abs/solving-the-pricing-problem-in-a-branch-and-price-algorithm-for-graph-coloring-using-zero-suppressed-binary-decision-diagrams-1401.58202015-07-09 https://scifaro.com/en/abs/on-computing-the-2-vertex-connected-components-of-directed-graphs-1401.60002014-01-24 https://scifaro.com/en/abs/on-fence-patrolling-by-mobile-agents-1401.60702014-01-25 https://scifaro.com/en/abs/preconditioning-in-expectation-1401.62362014-01-27 https://scifaro.com/en/abs/on-combinatorial-generation-of-prefix-normal-words-1401.63462014-06-23 https://scifaro.com/en/abs/an-exact-algorithm-for-the-weighed-mutually-exclusive-maximum-set-cover-problem-1401.63852014-01-27 https://scifaro.com/en/abs/a-algorithm-for-the-hamilton-circuit-problem-1401.64232018-11-01 https://scifaro.com/en/abs/coalition-structure-generation-over-graphs-1401.64282014-01-27 https://scifaro.com/en/abs/branch-and-price-and-cut-for-the-split-collection-vehicle-routing-problem-with-time-windows-and-linear-weight-related-cost-1401.64832014-01-28 https://scifaro.com/en/abs/a-novel-string-distance-function-based-on-most-frequent-k-characters-1401.65962014-01-28 https://scifaro.com/en/abs/a-linear-time-algorithm-for-trust-region-problems-1401.67572014-01-28 https://scifaro.com/en/abs/an-n-body-solution-to-the-problem-of-fock-exchange-1401.69612015-06-18 https://scifaro.com/en/abs/scalable-online-betweenness-centrality-in-evolving-graphs-1401.69812015-04-29 https://scifaro.com/en/abs/a-fast-string-matching-algorithm-based-on-lowlight-characters-in-the-pattern-1401.71102014-01-29 https://scifaro.com/en/abs/superconcentration-on-a-pair-of-butterflies-1401.72632014-01-29 https://scifaro.com/en/abs/minimizing-flow-time-on-unrelated-machines-1401.72842015-06-11 https://scifaro.com/en/abs/how-best-to-handle-a-dicey-situation-1401.73042014-01-29 https://scifaro.com/en/abs/a-comparative-study-on-string-matching-algorithm-of-biological-sequences-1401.74162014-01-30 https://scifaro.com/en/abs/a-faster-parameterized-algorithm-for-treedepth-1401.75402014-08-21 https://scifaro.com/en/abs/experimental-evaluation-of-algorithms-for-the-food-selection-problem-1401.75912014-01-30 https://scifaro.com/en/abs/linear-time-algorithms-for-the-paired-domination-problem-in-interval-graphs-and-circular-arc-graphs-1401.75942014-01-30 https://scifaro.com/en/abs/a-new-approach-to-analyzing-robin-hood-hashing-1401.76162014-07-14 https://scifaro.com/en/abs/graph-matching-relax-or-not-1401.76232014-10-14 https://scifaro.com/en/abs/powers-of-tensors-and-fast-matrix-multiplication-1401.77142021-10-05 https://scifaro.com/en/abs/reducedcbt-and-supercbt-two-new-and-improved-complete-binary-tree-structures-1401.77412014-01-31 https://scifaro.com/en/abs/balancing-lists-a-proof-pearl-1401.78862014-06-16 https://scifaro.com/en/abs/competitive-learning-of-monotone-boolean-functions-1401.81352014-02-03 https://scifaro.com/en/abs/popular-conjectures-imply-strong-lower-bounds-for-dynamic-problems-1402.00542014-02-04 https://scifaro.com/en/abs/graph-cuts-with-interacting-edge-costs-examples-approximations-and-algorithms-1402.02402016-03-29 https://scifaro.com/en/abs/customizable-contraction-hierarchies-1402.04022015-08-24 https://scifaro.com/en/abs/a-bound-on-the-expected-optimality-of-random-feasible-solutions-to-combinatorial-optimization-problems-1402.04232014-02-04 https://scifaro.com/en/abs/symblicit-algorithms-for-optimal-strategy-synthesis-in-monotonic-markov-decision-processes-extended-version-1402.10762014-06-23 https://scifaro.com/en/abs/approximation-algorithms-for-covering-and-packing-problems-on-paths-1402.11072015-02-20 https://scifaro.com/en/abs/the-analysis-of-kademlia-for-random-ids-1402.11912020-04-21 https://scifaro.com/en/abs/compressing-ip-forwarding-tables-towards-entropy-bounds-and-beyond-1402.11942014-02-07 https://scifaro.com/en/abs/a-three-phase-search-approach-for-the-quadratic-minimum-spanning-tree-problem-1402.13792014-02-07 https://scifaro.com/en/abs/dual-query-practical-private-query-release-for-high-dimensional-data-1402.15262018-03-16 https://scifaro.com/en/abs/a-note-on-exact-and-approximate-methods-for-a-one-dimensional-minimax-bin-packing-problem-annals-of-operations-research-2013-206-611-626-1402.16162014-02-10 https://scifaro.com/en/abs/for-all-sparse-recovery-in-near-optimal-time-1402.17262017-03-08 https://scifaro.com/en/abs/a-natural-generalization-of-bounded-tree-width-and-bounded-clique-width-1402.18102014-02-11 https://scifaro.com/en/abs/tactical-fixed-job-scheduling-with-spread-time-constraints-1402.18812014-02-12 https://scifaro.com/en/abs/reduction-of-maximum-flow-network-interdiction-problem-from-the-clique-problem-1402.20222014-02-11 https://scifaro.com/en/abs/longest-common-subsequence-in-k-length-substrings-1402.20972014-02-11 https://scifaro.com/en/abs/hybridization-number-on-three-rooted-binary-trees-is-ept-1402.21362016-06-01 https://scifaro.com/en/abs/parameterized-directed-k-chinese-postman-problem-and-k-arc-disjoint-cycles-problem-on-euler-digraphs-1402.21372014-02-11 https://scifaro.com/en/abs/on-line-approach-to-off-line-coloring-problems-on-graphs-with-geometric-representations-1402.24372016-12-30 https://scifaro.com/en/abs/data-compaction-compression-without-decompression-1402.25082014-02-12 https://scifaro.com/en/abs/optimal-gossip-with-direct-addressing-1402.27012014-02-13 https://scifaro.com/en/abs/direction-finding-algorithms-with-joint-iterative-subspace-optimization-1402.27102016-11-17 https://scifaro.com/en/abs/dynamic-partial-sorting-1402.27122014-04-21 https://scifaro.com/en/abs/static-level-ancestors-in-practice-1402.27412021-10-26 https://scifaro.com/en/abs/rendezvous-in-networks-in-spite-of-delay-faults-1402.27602018-12-10 https://scifaro.com/en/abs/tree-based-coarsening-and-partitioning-of-complex-networks-1402.27822014-02-14 https://scifaro.com/en/abs/optimal-alphabetic-ternary-trees-1402.30362014-02-14 https://scifaro.com/en/abs/subgraph-enumeration-in-massive-graphs-1402.34442015-11-13 https://scifaro.com/en/abs/processing-succinct-matrices-and-vectors-1402.34522014-02-17 https://scifaro.com/en/abs/a-subexponential-parameterized-algorithm-for-proper-interval-completion-1402.34722014-02-17 https://scifaro.com/en/abs/a-subexponential-parameterized-algorithm-for-interval-completion-1402.34732014-11-11 https://scifaro.com/en/abs/a-unifying-model-for-representing-time-varying-graphs-1402.34882015-09-18 https://scifaro.com/en/abs/representative-families-a-unified-tradeoff-based-approach-1402.35472014-04-22 https://scifaro.com/en/abs/local-algorithms-for-sparse-spanning-graphs-1402.36092021-04-28 https://scifaro.com/en/abs/privately-solving-linear-programs-1402.36312018-03-16 https://scifaro.com/en/abs/throughput-maximization-in-multiprocessor-speed-scaling-1402.37822014-02-18 https://scifaro.com/en/abs/best-of-two-local-models-local-centralized-and-local-distributed-algorithms-1402.37962014-11-12 https://scifaro.com/en/abs/testing-probability-distributions-underlying-aggregated-data-1402.38352014-02-18 https://scifaro.com/en/abs/simple-parallel-and-distributed-algorithms-for-spectral-graph-sparsification-1402.38512014-04-21 https://scifaro.com/en/abs/representative-sets-of-product-families-1402.39092014-02-18 https://scifaro.com/en/abs/near-linear-query-complexity-for-graph-inference-1402.40372015-02-19 https://scifaro.com/en/abs/energy-efficient-algorithms-for-non-preemptive-speed-scaling-1402.41112014-02-19 https://scifaro.com/en/abs/a-reclaimer-scheduling-problem-arising-in-coal-stockyard-management-1402.41782018-04-25 https://scifaro.com/en/abs/an-improved-algorithm-for-fixed-hub-single-allocation-problem-1402.41832014-02-19 https://scifaro.com/en/abs/minimum-entropy-submodular-optimization-and-fairness-in-cooperative-games-1402.43432014-02-19 https://scifaro.com/en/abs/morphing-planar-graph-drawings-optimally-1402.43642014-02-20 https://scifaro.com/en/abs/fptas-for-weighted-fibonacci-gates-and-its-applications-1402.43702014-02-19 https://scifaro.com/en/abs/symbiosis-of-search-and-heuristics-for-random-3-sat-1402.44552014-02-19 https://scifaro.com/en/abs/concurrent-cube-and-conquer-1402.44652014-02-19 https://scifaro.com/en/abs/spatial-mixing-of-coloring-random-graphs-1402.45562014-02-20 https://scifaro.com/en/abs/turing-kernelization-for-finding-long-paths-and-cycles-in-restricted-graph-classes-1402.47182017-04-21 https://scifaro.com/en/abs/shifting-coresets-obtaining-linear-time-approximations-for-unit-disk-graphs-and-other-geometric-intersection-graphs-1402.47222016-11-08 https://scifaro.com/en/abs/arbitrary-transmission-power-in-the-sinr-model-local-broadcasting-coloring-and-mis-1402.49942014-04-29 https://scifaro.com/en/abs/an-analysis-of-rank-aggregation-algorithms-1402.52592014-05-06 https://scifaro.com/en/abs/cache-oblivious-persistence-1402.54922014-07-02 https://scifaro.com/en/abs/a-tabu-search-path-relinking-algorithm-to-solve-the-job-shop-scheduling-problem-1402.56132014-02-25 https://scifaro.com/en/abs/fractional-programming-formulation-for-the-vertex-coloring-problem-1402.57692015-01-12 https://scifaro.com/en/abs/deconvolution-using-projections-onto-the-epigraph-set-of-a-convex-cost-function-1402.58182014-02-25 https://scifaro.com/en/abs/the-complexity-of-repairing-adjusting-and-aggregating-of-extensions-in-abstract-argumentation-1402.61092014-02-26 https://scifaro.com/en/abs/an-experimental-exploration-of-marsaglia-s-xorshift-generators-scrambled-1402.62462016-10-14 https://scifaro.com/en/abs/sample-complexity-bounds-on-differentially-private-learning-via-communication-complexity-1402.62782015-09-15 https://scifaro.com/en/abs/solving-maxsat-and-sat-on-structured-cnf-formulas-1402.64852014-02-27 https://scifaro.com/en/abs/parameterized-algorithms-for-graph-partitioning-problems-1403.00992014-03-04 https://scifaro.com/en/abs/additive-spanners-a-simple-construction-1403.01782014-11-25 https://scifaro.com/en/abs/experimental-study-of-a-novel-variant-of-fiduccia-mattheyses-fm-partitioning-algorithm-1403.02242014-03-04 https://scifaro.com/en/abs/a-back-to-basics-empirical-study-of-priority-queues-1403.02522014-03-04 https://scifaro.com/en/abs/a-4-approximation-for-scheduling-on-a-single-machine-with-general-cost-function-1403.02982016-12-14 https://scifaro.com/en/abs/efficient-representation-for-online-suffix-tree-construction-1403.04572014-07-15 https://scifaro.com/en/abs/a-packing-problem-approach-to-energy-aware-load-distribution-in-clouds-1403.04932014-03-04 https://scifaro.com/en/abs/profile-based-optimal-matchings-in-the-student-project-allocation-problem-1403.07512015-07-06 https://scifaro.com/en/abs/induced-disjoint-paths-in-circular-arc-graphs-in-linear-time-1403.07892014-03-05 https://scifaro.com/en/abs/most-recent-match-queries-in-on-line-suffix-trees-with-appendix-1403.08002014-07-15 https://scifaro.com/en/abs/counting-the-number-of-minimum-roman-dominating-functions-of-a-graph-1403.10192014-03-11 https://scifaro.com/en/abs/compressed-subsequence-matching-and-packed-tree-coloring-1403.10652014-06-06 https://scifaro.com/en/abs/a-polynomial-time-solution-to-the-clique-problem-1403.11782020-01-01 https://scifaro.com/en/abs/design-implementation-and-evaluation-of-mtbdd-based-fuzzy-sets-and-binary-fuzzy-relations-1403.12792014-03-07 https://scifaro.com/en/abs/a-suffix-tree-or-not-a-suffix-tree-1403.13642014-09-02 https://scifaro.com/en/abs/how-unsplittable-flow-covering-helps-scheduling-with-job-dependent-cost-functions-1403.13762014-03-07 https://scifaro.com/en/abs/parameterized-complexity-of-the-k-arc-chinese-postman-problem-1403.15122016-09-13 https://scifaro.com/en/abs/corrections-to-the-results-derived-in-a-unified-approach-to-algorithms-generating-unrestricted-and-restricted-integer-compositions-and-integer-partitions-and-a-comparison-of-four-restricted-integer-composition-generation-algorithms-1403.15562014-03-07 https://scifaro.com/en/abs/massively-parallel-read-mapping-on-gpus-with-peanut-1403.17062014-03-10 https://scifaro.com/en/abs/on-the-ordered-list-subgraph-embedding-problems-1403.20092014-03-11 https://scifaro.com/en/abs/parameterized-edge-hamiltonicity-1403.20412014-03-11 https://scifaro.com/en/abs/engineering-parallel-string-sorting-1403.20562014-03-11 https://scifaro.com/en/abs/blind-friendly-von-neumann-s-heads-or-tails-1403.20922014-03-11 https://scifaro.com/en/abs/a-subquadratic-algorithm-for-minimum-palindromic-factorization-1403.24312020-12-15 https://scifaro.com/en/abs/zig-zag-sort-a-simple-deterministic-data-oblivious-sorting-algorithm-running-in-o-n-log-n-time-1403.27772014-05-19 https://scifaro.com/en/abs/the-input-output-complexity-of-sparse-matrix-multiplication-1403.35512014-03-17 https://scifaro.com/en/abs/a-really-simple-approximation-of-smallest-grammar-1403.44452014-03-19 https://scifaro.com/en/abs/improved-approximation-algorithms-for-box-contact-representations-1403.48612018-09-10 https://scifaro.com/en/abs/energy-efficient-scheduling-and-routing-via-randomized-rounding-1403.49912014-03-21 https://scifaro.com/en/abs/on-solving-the-maximum-k-club-problem-1403.51112014-04-04 https://scifaro.com/en/abs/distributed-approximation-algorithms-for-weighted-shortest-paths-1403.51712014-05-23 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-outerplanar-diameter-improvement-1403.57022014-05-26 https://scifaro.com/en/abs/sample-optimal-fourier-sampling-in-any-constant-dimension-part-i-1403.58042014-05-14 https://scifaro.com/en/abs/probabilistic-analysis-of-power-assignments-1403.58822014-03-25 https://scifaro.com/en/abs/revisiting-size-based-scheduling-with-estimated-job-sizes-1403.59962014-07-28 https://scifaro.com/en/abs/brief-announcement-almost-tight-approximation-distributed-algorithm-for-minimum-cut-1403.61882014-05-16 https://scifaro.com/en/abs/cluster-before-you-hallucinate-approximating-node-capacitated-network-design-and-energy-efficient-routing-1403.62072024-03-12 https://scifaro.com/en/abs/on-the-computational-complexity-of-vertex-integrity-and-component-order-connectivity-1403.63312014-12-05 https://scifaro.com/en/abs/pivot-sampling-in-dual-pivot-quicksort-1403.66022014-06-16 https://scifaro.com/en/abs/the-sketching-complexity-of-graph-cuts-1403.70582014-11-11 https://scifaro.com/en/abs/o-log-log-rank-competitive-ratio-for-the-matroid-secretary-problem-1403.73432014-09-03 https://scifaro.com/en/abs/on-the-configuration-lp-for-maximum-budgeted-allocation-1403.75192014-03-31 https://scifaro.com/en/abs/structure-of-conflict-graphs-in-constraint-alignment-problems-and-algorithms-1403.79482023-06-22 https://scifaro.com/en/abs/computing-discrete-logarithm-by-interval-valued-paradigm-1404.00782014-04-02 https://scifaro.com/en/abs/sampling-a-uniform-random-solution-of-a-quadratic-equation-modulo-p-k-1404.02812014-09-23 https://scifaro.com/en/abs/wear-minimization-for-cuckoo-hashing-how-not-to-throw-a-lot-of-eggs-into-one-basket-1404.02862014-04-02 https://scifaro.com/en/abs/layout-decomposition-for-quadruple-patterning-lithography-and-beyond-1404.03212014-04-02 https://scifaro.com/en/abs/further-scramblings-of-marsaglia-s-xorshift-generators-1404.03902016-05-24 https://scifaro.com/en/abs/new-shortest-lattice-vector-problems-of-polynomial-complexity-1404.05642014-04-03 https://scifaro.com/en/abs/the-complexity-of-the-simplex-method-1404.06052014-04-18 https://scifaro.com/en/abs/the-secretary-returns-1404.06142014-07-08 https://scifaro.com/en/abs/separate-measure-and-conquer-faster-algorithms-for-max-2-csp-and-counting-dominating-sets-1404.07532017-11-20 https://scifaro.com/en/abs/randomized-broadcast-in-radio-networks-with-collision-detection-1404.07802014-04-04 https://scifaro.com/en/abs/task-assignment-in-tree-like-hierarchical-structures-1404.07832014-04-04 https://scifaro.com/en/abs/threesomes-degenerates-and-love-triangles-1404.07992014-06-02 https://scifaro.com/en/abs/fixed-parameter-tractable-canonization-and-isomorphism-test-for-graphs-of-bounded-treewidth-1404.08182014-12-11 https://scifaro.com/en/abs/the-quest-for-optimal-sorting-networks-efficient-generation-of-two-layer-prefixes-1404.09482016-11-30 https://scifaro.com/en/abs/faster-shortest-paths-in-dense-distance-graphs-with-applications-1404.09772014-04-04 https://scifaro.com/en/abs/spectral-concentration-and-greedy-k-clustering-1404.10082018-09-13 https://scifaro.com/en/abs/online-bin-packing-with-cardinality-constraints-revisited-1404.10562014-04-04 https://scifaro.com/en/abs/minimum-total-weighted-completion-time-faster-approximation-schemes-1404.10592014-04-04 https://scifaro.com/en/abs/dynamic-windows-scheduling-with-reallocation-1404.10872014-04-07 https://scifaro.com/en/abs/competitive-algorithms-from-competitive-equilibria-non-clairvoyant-scheduling-under-polyhedral-constraints-1404.10972014-04-07 https://scifaro.com/en/abs/lower-bounds-for-testing-digraph-connectivity-with-one-pass-streaming-algorithms-1404.13232014-04-09 https://scifaro.com/en/abs/provable-deterministic-leverage-score-sampling-1404.15302014-06-04 https://scifaro.com/en/abs/fast-sequential-summation-algorithms-using-augmented-data-structures-1404.15602014-04-08 https://scifaro.com/en/abs/geometric-random-edge-1404.15682016-03-22 https://scifaro.com/en/abs/detecting-a-corrupted-area-in-a-2-dimensional-space-1404.15772014-04-08 https://scifaro.com/en/abs/streaming-algorithms-for-partitioning-integer-sequences-1404.17322014-07-08 https://scifaro.com/en/abs/a-class-of-am-qft-algorithms-for-power-of-two-fft-1404.18102014-04-08 https://scifaro.com/en/abs/sublinear-algorithms-for-local-graph-centrality-estimation-1404.18642018-08-07 https://scifaro.com/en/abs/selfishmigrate-a-scalable-algorithm-for-non-clairvoyantly-scheduling-heterogeneous-processors-1404.19432014-04-09 https://scifaro.com/en/abs/cost-oblivious-storage-reallocation-1404.20192017-03-28 https://scifaro.com/en/abs/approximating-the-regular-graphic-tsp-in-near-linear-time-1404.23962014-06-16 https://scifaro.com/en/abs/quantum-annealing-1404.24652014-04-10 https://scifaro.com/en/abs/optimal-encodings-for-range-majority-queries-1404.26772014-10-07 https://scifaro.com/en/abs/a-simple-algorithm-for-hamiltonicity-1404.28272014-04-11 https://scifaro.com/en/abs/orthogonal-graph-drawing-with-inflexible-edges-1404.29432015-01-08 https://scifaro.com/en/abs/fast-ppr-scaling-personalized-pagerank-estimation-for-large-graphs-1404.31812014-08-25 https://scifaro.com/en/abs/optimization-problems-with-diseconomies-of-scale-via-decoupling-1404.32482015-01-26 https://scifaro.com/en/abs/network-oblivious-algorithms-1404.33182014-04-15 https://scifaro.com/en/abs/supremum-norm-convergence-for-step-asynchronous-successive-overrelaxation-on-m-matrices-1404.33272014-04-15 https://scifaro.com/en/abs/adjacency-labeling-schemes-and-induced-universal-graphs-1404.33912014-04-15 https://scifaro.com/en/abs/polynomial-delay-algorithm-for-listing-minimal-edge-dominating-sets-in-graphs-1404.35012014-07-09 https://scifaro.com/en/abs/cache-oblivious-vat-algorithms-1404.35772014-04-15 https://scifaro.com/en/abs/constant-factor-approximations-for-capacitated-arc-routing-without-triangle-inequality-1404.36602014-07-15 https://scifaro.com/en/abs/changing-bases-multistage-optimization-for-matroids-and-matchings-1404.37682014-04-16 https://scifaro.com/en/abs/boltzmann-samplers-for-random-generation-of-lambda-terms-1404.38752014-04-29 https://scifaro.com/en/abs/algorithms-parameterized-by-vertex-cover-and-modular-width-through-potential-maximal-cliques-1404.38822014-04-16 https://scifaro.com/en/abs/on-the-error-resilience-of-ordered-binary-decision-diagrams-1404.39192015-02-05 https://scifaro.com/en/abs/colorful-bin-packing-1404.39902014-04-16 https://scifaro.com/en/abs/covering-problems-in-edge-and-node-weighted-graphs-1404.41232014-04-17 https://scifaro.com/en/abs/improved-analysis-of-deterministic-load-balancing-schemes-1404.43442015-02-24 https://scifaro.com/en/abs/preach-a-fast-lightweight-reachability-index-using-pruning-and-contraction-hierarchies-1404.44652014-04-18 https://scifaro.com/en/abs/a-simple-o-log-log-mathrm-rank-competitive-algorithm-for-the-matroid-secretary-problem-1404.44732014-07-07 https://scifaro.com/en/abs/on-the-tree-search-problem-with-non-uniform-costs-1404.45042016-12-16 https://scifaro.com/en/abs/deterministic-truncation-of-linear-matroids-1404.45062014-04-18 https://scifaro.com/en/abs/an-all-around-near-optimal-solution-for-the-classic-bin-packing-problem-1404.45262014-04-18 https://scifaro.com/en/abs/approximation-algorithms-for-hypergraph-small-set-expansion-and-small-set-vertex-expansion-1404.45752014-04-18 https://scifaro.com/en/abs/consistent-subset-sampling-1404.46932014-04-21 https://scifaro.com/en/abs/triangle-counting-in-dynamic-graph-streams-1404.46962015-07-15 https://scifaro.com/en/abs/scheduling-over-scenarios-on-two-machines-1404.47662014-04-21 https://scifaro.com/en/abs/reusing-an-fm-index-1404.48142014-05-12 https://scifaro.com/en/abs/semi-external-algorithms-for-graph-partitioning-and-clustering-1404.48872014-09-24 https://scifaro.com/en/abs/a-matheuristic-approach-for-the-pollution-routing-problem-1404.48952014-04-22 https://scifaro.com/en/abs/document-retrieval-on-repetitive-collections-1404.49092014-07-02 https://scifaro.com/en/abs/improved-esp-index-a-practical-self-index-for-highly-repetitive-texts-1404.49722014-04-29 https://scifaro.com/en/abs/dynamic-and-multi-functional-labeling-schemes-1404.49822014-04-22 https://scifaro.com/en/abs/sum-of-squares-proofs-and-the-quest-toward-optimal-algorithms-1404.52362014-05-28 https://scifaro.com/en/abs/new-techniques-and-tighter-bounds-for-local-computation-algorithms-1404.53982014-04-23 https://scifaro.com/en/abs/sequential-resource-allocation-with-positional-costs-1404.54282014-04-23 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-minimax-regret-evacuation-on-a-dynamic-path-1404.54482014-04-23 https://scifaro.com/en/abs/toward-online-mobile-facility-location-on-general-metrics-1404.55102023-10-16 https://scifaro.com/en/abs/l-p-testers-for-bounded-derivative-properties-on-product-distributions-1404.55452014-05-02 https://scifaro.com/en/abs/online-colored-bin-packing-1404.55482014-12-05 https://scifaro.com/en/abs/vertex-cover-gets-faster-and-harder-on-low-degree-graphs-1404.55662014-04-24 https://scifaro.com/en/abs/the-power-of-an-example-hidden-set-size-approximation-using-group-queries-and-conditional-sampling-1404.55682014-04-23 https://scifaro.com/en/abs/online-bin-stretching-with-three-bins-1404.55692016-02-02 https://scifaro.com/en/abs/fast-algorithms-for-constructing-maximum-entropy-summary-trees-1404.56602014-04-24 https://scifaro.com/en/abs/forward-backward-greedy-algorithms-for-atomic-norm-regularization-1404.56922015-10-28 https://scifaro.com/en/abs/certificates-in-data-structures-1404.57432014-04-29 https://scifaro.com/en/abs/linear-time-lexdfs-on-cocomparability-graphs-1404.59962014-04-25 https://scifaro.com/en/abs/improved-approximation-algorithms-for-earth-mover-distance-in-data-streams-1404.62872014-04-28 https://scifaro.com/en/abs/a-hybrid-graph-representation-for-exact-graph-algorithms-1404.63992014-04-28 https://scifaro.com/en/abs/on-an-algorithm-for-isomorphism-free-generations-of-combinatorial-objects-1404.64512014-04-28 https://scifaro.com/en/abs/total-stretch-minimization-on-single-and-identical-parallel-machines-1404.65022014-06-27 https://scifaro.com/en/abs/a-decomposition-algorithm-for-nested-resource-allocation-problems-1404.66942014-04-29 https://scifaro.com/en/abs/approximately-minwise-independence-with-twisted-tabulation-1404.67242014-05-02 https://scifaro.com/en/abs/multiplicative-bidding-in-online-advertising-1404.67272014-04-29 https://scifaro.com/en/abs/semi-streaming-set-cover-1404.67632014-05-09 https://scifaro.com/en/abs/bypassing-erd-h-o-s-girth-conjecture-hybrid-stretch-and-sourcewise-spanners-1404.68352014-04-29 https://scifaro.com/en/abs/precedence-constrained-scheduling-of-malleable-jobs-with-preemption-1404.68502014-04-29 https://scifaro.com/en/abs/analysis-of-d-hop-dominating-set-problem-for-directed-graph-with-indegree-bounded-by-one-1404.68902017-01-27 https://scifaro.com/en/abs/parameterized-complexity-dichotomy-for-steiner-multicut-1404.70062015-06-24 https://scifaro.com/en/abs/testing-forest-isomorphism-in-the-adjacency-list-model-1404.70602014-04-29 https://scifaro.com/en/abs/fast-dynamic-graph-algorithms-for-parameterized-problems-1404.73072014-04-30 https://scifaro.com/en/abs/tight-bounds-for-restricted-grid-scheduling-1404.73252018-06-05 https://scifaro.com/en/abs/the-power-of-two-choices-in-distributed-voting-1404.74792016-11-02 https://scifaro.com/en/abs/near-optimal-distributed-approximation-of-minimum-weight-connected-dominating-set-1404.75592014-05-01 https://scifaro.com/en/abs/on-the-metric-s-t-path-traveling-salesman-problem-1404.75692015-03-17 https://scifaro.com/en/abs/an-efficient-algorithm-for-enumerating-chordless-cycles-and-chordless-paths-1404.76102014-05-01 https://scifaro.com/en/abs/testing-temporal-connectivity-in-sparse-dynamic-graphs-1404.76342014-08-06 https://scifaro.com/en/abs/an-optimal-offline-algorithm-for-list-update-1404.76382014-05-01 https://scifaro.com/en/abs/light-spanners-1404.77032014-05-01 https://scifaro.com/en/abs/between-treewidth-and-clique-width-1404.77582014-05-01 https://scifaro.com/en/abs/parameterized-complexity-of-bandwidth-on-trees-1404.78102014-05-01 https://scifaro.com/en/abs/parameterized-streaming-algorithms-for-vertex-cover-1405.00932014-07-25 https://scifaro.com/en/abs/un-algorithme-de-test-pour-la-connexit-e-temporelle-des-graphes-dynamiques-de-faible-densit-e-1405.01702014-05-02 https://scifaro.com/en/abs/on-hardness-of-jumbled-indexing-1405.01892014-05-02 https://scifaro.com/en/abs/an-lp-rounding-2-sqrt-2-approximation-for-restricted-maximum-acyclic-subgraph-1405.04562014-05-05 https://scifaro.com/en/abs/single-machine-slack-due-window-assignment-and-scheduling-of-linear-time-dependent-deteriorating-jobs-and-a-deteriorating-maintenance-activity-1405.07122014-05-06 https://scifaro.com/en/abs/hardness-of-graph-pricing-through-generalized-max-dicut-1405.07402014-11-06 https://scifaro.com/en/abs/on-integrality-ratios-for-asymmetric-tsp-in-the-sherali-adams-hierarchy-1405.09452014-05-06 https://scifaro.com/en/abs/on-computing-maximal-independent-sets-of-hypergraphs-in-parallel-1405.11332014-08-14 https://scifaro.com/en/abs/efficient-compressed-wavelet-trees-over-large-alphabets-1405.12202014-05-07 https://scifaro.com/en/abs/a-novel-approach-to-the-common-due-date-problem-on-single-and-parallel-machines-1405.12342014-05-07 https://scifaro.com/en/abs/classic-lagrangian-may-not-be-applicable-to-the-traveling-salesman-problem-1405.12982014-05-07 https://scifaro.com/en/abs/a-unified-framework-for-linear-dimensionality-reduction-in-l1-1405.13322015-06-03 https://scifaro.com/en/abs/streaming-kernelization-1405.13562014-05-07 https://scifaro.com/en/abs/a-novel-approach-to-finding-near-cliques-the-triangle-densest-subgraph-problem-1405.14772014-05-22 https://scifaro.com/en/abs/approximation-algorithms-for-the-asymmetric-traveling-salesman-problem-describing-two-recent-methods-1405.17812014-05-09 https://scifaro.com/en/abs/tighter-bounds-for-makespan-minimization-on-unrelated-machines-1405.25302014-06-24 https://scifaro.com/en/abs/an-efficient-local-search-for-partial-latin-square-extension-problem-1405.25712015-03-06 https://scifaro.com/en/abs/adaptive-contract-design-for-crowdsourcing-markets-bandit-algorithms-for-repeated-principal-agent-problems-1405.28752015-09-03 https://scifaro.com/en/abs/fast-dynamic-pointer-following-via-link-cut-trees-1405.37392014-05-16 https://scifaro.com/en/abs/online-edge-coloring-of-paths-and-trees-with-a-fixed-number-of-colors-1405.38172016-10-26 https://scifaro.com/en/abs/polynomial-time-approximation-algorithm-for-finding-highly-comfortable-team-in-any-given-social-network-1405.45342014-05-20 https://scifaro.com/en/abs/alternative-algorithms-for-lyndon-factorization-1405.48922014-07-14 https://scifaro.com/en/abs/bounds-on-herman-s-algorithm-1405.52092020-08-12 https://scifaro.com/en/abs/single-machine-scheduling-problems-with-uncertain-parameters-and-the-owa-criterion-1405.53712014-12-01 https://scifaro.com/en/abs/complexity-of-the-robust-weighted-independent-set-problems-on-interval-graphs-1405.53762014-05-22 https://scifaro.com/en/abs/approximability-of-the-robust-representatives-selection-problem-1405.53812014-11-14 https://scifaro.com/en/abs/multiple-pattern-matching-revisited-1405.54832021-12-07 https://scifaro.com/en/abs/improved-algorithms-for-multiple-sink-location-problems-in-dynamic-path-networks-1405.56132014-05-23 https://scifaro.com/en/abs/two-simple-full-text-indexes-based-on-the-suffix-array-1405.59192016-05-24 https://scifaro.com/en/abs/solving-multi-choice-secretary-problem-in-parallel-an-optimal-observation-selection-protocol-1405.59752014-09-18 https://scifaro.com/en/abs/a-more-efficient-way-of-finding-hamiltonian-cycle-1405.63472022-08-25 https://scifaro.com/en/abs/optimal-algorithms-for-l-1-subspace-signal-processing-1405.67852015-06-19 https://scifaro.com/en/abs/exact-algorithms-for-0-1-integer-programs-with-linear-equality-constraints-1405.68512014-11-04 https://scifaro.com/en/abs/disk-based-genome-sequencing-data-compression-1405.68742014-09-19 https://scifaro.com/en/abs/fast-responsive-decentralised-graph-colouring-1405.69872017-09-05 https://scifaro.com/en/abs/algorithms-for-the-constrained-perfect-phylogeny-with-persistent-characters-1405.74972014-05-30 https://scifaro.com/en/abs/an-external-memory-algorithm-for-string-graph-construction-1405.75202015-06-12 https://scifaro.com/en/abs/a-forward-backward-single-source-shortest-paths-algorithm-1405.76192014-05-30 https://scifaro.com/en/abs/chordal-editing-is-fixed-parameter-tractable-1405.78592014-06-02 https://scifaro.com/en/abs/optimal-cur-matrix-decompositions-1405.79102014-07-17 https://scifaro.com/en/abs/team-selection-for-prediction-tasks-1406.01402015-04-28 https://scifaro.com/en/abs/dijkstra-meets-steiner-a-fast-exact-goal-oriented-steiner-tree-algorithm-1406.04922015-09-09 https://scifaro.com/en/abs/navigating-in-a-sea-of-repeats-in-rna-seq-without-drowning-1406.10222014-06-05 https://scifaro.com/en/abs/how-inefficient-can-a-sort-algorithm-be-1406.10772014-06-05 https://scifaro.com/en/abs/kernelization-lower-bound-for-permutation-pattern-matching-1406.11582015-01-13 https://scifaro.com/en/abs/modified-binary-search-algorithm-1406.16772014-06-09 https://scifaro.com/en/abs/median-filtering-is-equivalent-to-sorting-1406.17172014-06-09 https://scifaro.com/en/abs/rendezvous-of-heterogeneous-mobile-agents-in-edge-weighted-networks-1406.20082014-06-10 https://scifaro.com/en/abs/optimizing-budget-allocation-in-graphs-1406.21072014-06-10 https://scifaro.com/en/abs/euclidean-tsp-with-few-inner-points-in-linear-space-1406.21542014-06-10 https://scifaro.com/en/abs/arc-sort-enhanced-and-time-efficient-sorting-algorithm-1406.22622014-06-10 https://scifaro.com/en/abs/a-fast-minimal-memory-consistent-hash-algorithm-1406.22942014-06-10 https://scifaro.com/en/abs/sampling-the-suffix-array-with-minimizers-1406.23482014-12-04 https://scifaro.com/en/abs/rendezvous-of-distance-aware-mobile-agents-in-unknown-graphs-1406.27952014-06-12 https://scifaro.com/en/abs/an-improved-approximation-for-k-median-and-positive-correlation-in-budgeted-optimization-1406.29512016-04-26 https://scifaro.com/en/abs/multilevel-polynomial-partitions-and-simplified-range-searching-1406.30582015-07-20 https://scifaro.com/en/abs/a-note-on-the-largest-number-of-red-nodes-in-red-black-trees-1406.30922014-06-13 https://scifaro.com/en/abs/compact-indexes-for-flexible-top-k-retrieval-1406.31702014-06-13 https://scifaro.com/en/abs/on-the-complexity-of-list-ranking-in-the-parallel-external-memory-model-1406.32792014-09-08 https://scifaro.com/en/abs/an-error-correcting-parser-for-context-free-grammars-that-takes-less-than-cubic-time-1406.34052014-06-16 https://scifaro.com/en/abs/space-saving-by-dynamic-algebraization-1406.34142014-06-16 https://scifaro.com/en/abs/limits-of-csp-problems-and-efficient-parameter-testing-1406.35142016-08-05 https://scifaro.com/en/abs/trading-off-worst-and-expected-cost-in-decision-tree-problems-and-a-value-dependent-model-1406.36552014-06-17 https://scifaro.com/en/abs/hadwiger-number-of-graphs-with-small-chordality-1406.38122014-06-17 https://scifaro.com/en/abs/counting-perfect-matchings-in-graphs-that-exclude-a-single-crossing-minor-1406.40562014-06-17 https://scifaro.com/en/abs/a-divide-and-conquer-algorithm-for-betweenness-centrality-1406.41732015-06-05 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-hard-uniform-capacitated-k-median-problem-1406.44542014-06-18 https://scifaro.com/en/abs/an-algorithm-for-boolean-satisfiability-based-on-generalized-orthonormal-expansion-1406.47122014-07-16 https://scifaro.com/en/abs/graph-isomorphism-parameterized-by-elimination-distance-to-bounded-degree-1406.47182014-10-17 https://scifaro.com/en/abs/a-tight-bound-on-the-speed-up-through-storage-for-quickest-multi-commodity-flows-1406.47992014-06-19 https://scifaro.com/en/abs/analyzing-traffic-problem-model-with-graph-theory-algorithms-1406.48282015-09-17 https://scifaro.com/en/abs/low-autocorrelation-binary-sequences-on-improved-merit-factors-and-runtime-predictions-to-achieve-them-1406.53012017-05-09 https://scifaro.com/en/abs/average-case-optimal-approximate-circular-string-matching-1406.54802016-04-26 https://scifaro.com/en/abs/constant-factor-approximation-for-balanced-cut-in-the-pie-model-1406.56652014-06-24 https://scifaro.com/en/abs/correlation-clustering-with-noisy-partial-information-1406.56672015-05-13 https://scifaro.com/en/abs/the-asymptotic-complexity-of-matrix-reduction-over-finite-fields-1406.58262014-06-25 https://scifaro.com/en/abs/efficient-algorithms-for-de-novo-assembly-of-alternative-splicing-events-from-rna-seq-data-1406.60472014-06-25 https://scifaro.com/en/abs/from-black-scholes-to-online-learning-dynamic-hedging-under-adversarial-environments-1406.60842014-06-25 https://scifaro.com/en/abs/fault-tolerant-approximate-bfs-structures-1406.61692014-06-25 https://scifaro.com/en/abs/linear-time-computation-of-minimal-absent-words-using-suffix-array-1406.63412014-07-01 https://scifaro.com/en/abs/on-the-complexity-of-clustered-level-planarity-and-t-level-planarity-1406.65332014-06-26 https://scifaro.com/en/abs/a-branch-and-price-procedure-for-the-container-premarshalling-problem-1406.71072014-06-30 https://scifaro.com/en/abs/guruswami-sinop-rounding-without-higher-level-lasserre-1406.72792014-06-30 https://scifaro.com/en/abs/streaming-graph-partitioning-in-the-planted-partition-model-1406.75702014-08-21 https://scifaro.com/en/abs/weighted-ancestors-in-suffix-trees-1406.77162014-07-01 https://scifaro.com/en/abs/a-note-on-hierarchical-hubbing-for-a-generalization-of-the-vpn-problem-1406.78412014-07-01 https://scifaro.com/en/abs/suffix-arrays-for-spaced-snp-databases-1407.01142014-07-02 https://scifaro.com/en/abs/mathematical-and-algorithmic-analysis-of-network-and-biological-data-1407.03752014-07-02 https://scifaro.com/en/abs/sublinear-space-algorithms-for-the-longest-common-substring-problem-1407.05222014-07-03 https://scifaro.com/en/abs/exact-and-approximate-algorithms-for-movement-problems-on-special-classes-of-graphs-1407.06282014-07-03 https://scifaro.com/en/abs/fault-tolerant-approximate-shortest-path-trees-1407.06372016-11-07 https://scifaro.com/en/abs/enumeration-of-spanning-trees-using-edge-exchange-with-minimal-partitioning-1407.06992014-07-04 https://scifaro.com/en/abs/a-fully-polynomial-time-approximation-scheme-for-speed-scaling-with-sleep-state-1407.08922014-07-04 https://scifaro.com/en/abs/on-the-average-case-complexity-of-pattern-matching-with-wildcards-1407.09502016-01-15 https://scifaro.com/en/abs/an-enhanced-multiway-sorting-network-based-on-n-sorters-1407.09612014-07-04 https://scifaro.com/en/abs/a-bit-parallel-russian-dolls-search-for-a-maximum-cardinality-clique-in-a-graph-1407.12092015-05-29 https://scifaro.com/en/abs/single-pass-spectral-sparsification-in-dynamic-streams-1407.12892015-04-17 https://scifaro.com/en/abs/fast-rendezvous-with-advice-1407.14282014-10-07 https://scifaro.com/en/abs/kmc-2-fast-and-resource-frugal-k-mer-counting-1407.15072017-03-03 https://scifaro.com/en/abs/information-gathering-in-ad-hoc-radio-networks-with-tree-topology-1407.15212014-07-08 https://scifaro.com/en/abs/computing-the-flip-distance-between-triangulations-1407.15252016-10-05 https://scifaro.com/en/abs/linear-coupling-an-ultimate-unification-of-gradient-and-mirror-descent-1407.15372016-11-08 https://scifaro.com/en/abs/dictionary-learning-and-tensor-decomposition-via-the-sum-of-squares-method-1407.15432014-11-11 https://scifaro.com/en/abs/private-multiplicative-weights-beyond-linear-queries-1407.15712015-03-17 https://scifaro.com/en/abs/sampling-in-space-restricted-settings-1407.16892015-01-19 https://scifaro.com/en/abs/improved-fpt-algorithms-for-weighted-independent-set-in-bull-free-graphs-1407.17062014-07-08 https://scifaro.com/en/abs/sum-of-squares-hierarchy-lower-bounds-for-symmetric-formulations-1407.17462016-02-11 https://scifaro.com/en/abs/sensitivity-analysis-of-minimum-spanning-trees-in-sub-inverse-ackermann-time-1407.19102014-07-09 https://scifaro.com/en/abs/using-optimization-to-solve-positive-lps-faster-in-parallel-1407.19252016-11-15 https://scifaro.com/en/abs/a-multivariate-framework-for-weighted-fpt-algorithms-1407.20332015-02-24 https://scifaro.com/en/abs/a-polynomial-delay-algorithm-for-enumerating-minimal-dominating-sets-in-chordal-graphs-1407.20362014-07-09 https://scifaro.com/en/abs/planar-graphs-random-walks-and-bipartiteness-testing-1407.21092018-12-27 https://scifaro.com/en/abs/time-lower-bounds-for-nonadaptive-turnstile-streaming-algorithms-1407.21512014-07-09 https://scifaro.com/en/abs/restricted-isometry-property-for-general-p-norms-1407.21782015-02-24 https://scifaro.com/en/abs/lcsk-practical-similarity-metric-for-long-strings-1407.24072019-08-27 https://scifaro.com/en/abs/an-improved-analysis-of-the-m-omke-svensson-algorithm-for-graph-tsp-on-subquartic-graphs-1407.25242020-03-04 https://scifaro.com/en/abs/replacing-mark-bits-with-randomness-in-fibonacci-heaps-1407.25692015-02-19 https://scifaro.com/en/abs/balanced-allocation-on-graphs-a-random-walk-approach-1407.25752016-03-01 https://scifaro.com/en/abs/subsampled-power-iteration-a-unified-algorithm-for-block-models-and-planted-csp-s-1407.27742015-04-30 https://scifaro.com/en/abs/graph-tsp-from-steiner-cycles-1407.28442014-07-11 https://scifaro.com/en/abs/approximate-range-emptiness-in-constant-time-and-optimal-space-1407.29072014-07-11 https://scifaro.com/en/abs/bigtable-merge-compaction-1407.30082021-05-03 https://scifaro.com/en/abs/nearly-linear-work-algorithms-for-mixed-packing-covering-and-facility-location-linear-programs-1407.30152014-11-06 https://scifaro.com/en/abs/2-edge-connectivity-in-directed-graphs-1407.30412014-08-01 https://scifaro.com/en/abs/boolean-algebraic-programs-as-a-methodology-for-symbolically-demonstrating-lower-and-upper-bounds-of-algorithms-and-determinism-1407.32392014-07-14 https://scifaro.com/en/abs/density-adaptive-parallel-clustering-1407.32422014-07-14 https://scifaro.com/en/abs/lp-based-algorithms-for-capacitated-facility-location-1407.32632014-09-16 https://scifaro.com/en/abs/selection-from-read-only-memory-with-limited-workspace-1407.33422014-07-15 https://scifaro.com/en/abs/strengthened-lazy-heaps-surpassing-the-lower-bounds-for-binary-heaps-1407.33772014-07-15 https://scifaro.com/en/abs/semi-streaming-algorithms-for-annotated-graph-streams-1407.34622015-08-11 https://scifaro.com/en/abs/space-lower-bounds-for-itemset-frequency-sketches-1407.37402016-03-10 https://scifaro.com/en/abs/a-new-approach-to-efficient-enumeration-by-push-out-amortization-1407.38572014-07-16 https://scifaro.com/en/abs/ignorance-is-almost-bliss-near-optimal-stochastic-matching-with-few-queries-1407.40942015-04-30 https://scifaro.com/en/abs/the-list-coloring-reconfiguration-problem-for-bounded-pathwidth-graphs-1407.42352016-01-20 https://scifaro.com/en/abs/constructing-small-tree-grammars-and-small-circuits-for-formulas-1407.42862015-09-22 https://scifaro.com/en/abs/online-packet-routing-in-grids-with-bounded-buffers-1407.44982014-09-02 https://scifaro.com/en/abs/a-new-algorithm-for-solving-the-rsum-problem-1407.46402015-02-10 https://scifaro.com/en/abs/a-simple-and-optimal-ancestry-labeling-scheme-for-trees-1407.50112015-04-28 https://scifaro.com/en/abs/multiple-depot-ring-star-problem-a-polyhedral-study-and-exact-algorithm-1407.50802021-04-27 https://scifaro.com/en/abs/design-and-analysis-of-rs-sort-1407.51112014-07-23 https://scifaro.com/en/abs/how-the-experts-algorithm-can-help-solve-lps-online-1407.52982015-11-30 https://scifaro.com/en/abs/complexity-of-grundy-coloring-and-its-variants-1407.53362015-11-03 https://scifaro.com/en/abs/efficient-algorithms-for-the-closest-pair-problem-and-applications-1407.56092014-07-22 https://scifaro.com/en/abs/fibonacci-heaps-revisited-1407.57502014-07-23 https://scifaro.com/en/abs/efficient-enumeration-of-induced-subtrees-in-a-k-degenerate-graph-1407.61402015-10-06 https://scifaro.com/en/abs/on-the-string-consensus-problem-and-the-manhattan-sequence-consensus-problem-1407.61442014-07-24 https://scifaro.com/en/abs/computing-the-2-blocks-of-directed-graphs-1407.61782014-07-24 https://scifaro.com/en/abs/neatsort-a-practical-adaptive-algorithm-1407.61832014-07-24 https://scifaro.com/en/abs/compressed-representation-of-learning-spaces-1407.63272017-08-14 https://scifaro.com/en/abs/constrained-monotone-function-maximization-and-the-supermodular-degree-1407.63282014-08-29 https://scifaro.com/en/abs/cell-probe-bounds-for-online-edit-distance-and-other-pattern-matching-problems-1407.65592014-07-25 https://scifaro.com/en/abs/a-tight-lower-bound-for-decrease-key-in-the-pure-heap-model-1407.66652014-07-25 https://scifaro.com/en/abs/new-routing-techniques-and-their-applications-1407.67302014-08-05 https://scifaro.com/en/abs/ordena-c-c-ao-baseada-em-arvores-de-fus-ao-1407.67532014-10-07 https://scifaro.com/en/abs/dynamic-set-intersection-1407.67552015-05-06 https://scifaro.com/en/abs/higher-lower-bounds-from-the-3sum-conjecture-1407.67562019-01-15 https://scifaro.com/en/abs/near-linear-time-constant-factor-approximation-algorithm-for-branch-decomposition-of-planar-graphs-1407.67612016-08-23 https://scifaro.com/en/abs/gcd-computation-of-n-integers-1407.67942014-08-19 https://scifaro.com/en/abs/faster-fully-dynamic-minimum-spanning-forest-1407.68322014-07-28 https://scifaro.com/en/abs/the-power-of-two-choices-with-simple-tabulation-1407.68462016-01-26 https://scifaro.com/en/abs/faster-separators-for-shallow-minor-free-graphs-via-dynamic-approximate-distance-oracles-1407.68692014-07-28 https://scifaro.com/en/abs/a-parallel-branch-and-bound-algorithm-for-the-maximum-labelled-clique-problem-1407.70612014-11-18 https://scifaro.com/en/abs/a-3-factor-approximation-algorithm-for-a-maximum-acyclic-agreement-forest-on-k-rooted-binary-phylogenetic-trees-1407.71252016-09-07 https://scifaro.com/en/abs/on-polynomial-kernelization-of-mathcal-h-free-edge-deletion-1407.71562014-11-19 https://scifaro.com/en/abs/assigning-channels-via-the-meet-in-the-middle-approach-1407.71612014-08-05 https://scifaro.com/en/abs/tight-lower-bound-for-the-channel-assignment-problem-1407.71622014-07-29 https://scifaro.com/en/abs/ptas-for-minimax-approval-voting-1407.72162016-06-23 https://scifaro.com/en/abs/online-learning-and-profit-maximization-from-revealed-preferences-1407.72942014-12-02 https://scifaro.com/en/abs/a-note-on-multipivot-quicksort-1407.74592018-09-05 https://scifaro.com/en/abs/directed-multicut-with-linearly-ordered-terminals-1407.74982014-07-29 https://scifaro.com/en/abs/speed-scaling-with-no-preemptions-1407.76542014-07-30 https://scifaro.com/en/abs/privacy-and-truthful-equilibrium-selection-for-aggregative-games-1407.77402015-02-26 https://scifaro.com/en/abs/simultaneous-approximation-of-constraint-satisfaction-problems-1407.77592014-07-30 https://scifaro.com/en/abs/going-for-speed-sublinear-algorithms-for-dense-r-csps-1407.78872014-07-31 https://scifaro.com/en/abs/top-down-skiplists-1407.79172014-07-31 https://scifaro.com/en/abs/entity-linking-via-graph-distance-minimization-1407.79302014-07-31 https://scifaro.com/en/abs/new-results-on-online-resource-minimization-1407.79982015-12-09 https://scifaro.com/en/abs/parallel-wavelet-tree-construction-1407.81422016-11-15 https://scifaro.com/en/abs/pruning-techniques-for-the-stochastic-on-time-arrival-problem-texorpdfstring-an-experimental-study-1407.82952014-08-01 https://scifaro.com/en/abs/sparse-fast-fourier-transform-for-exactly-and-generally-k-sparse-signals-by-downsampling-and-sparse-recovery-1407.83152015-05-25 https://scifaro.com/en/abs/voronoi-game-on-graphs-1407.84742014-08-01 https://scifaro.com/en/abs/a-real-time-spatial-index-for-in-vehicle-units-1408.01142014-08-04 https://scifaro.com/en/abs/stochastic-shortest-paths-and-risk-measures-1408.02722014-09-29 https://scifaro.com/en/abs/vertex-fault-tolerant-additive-spanners-1408.04092014-08-05 https://scifaro.com/en/abs/online-pattern-matching-for-string-edit-distance-with-moves-1408.04672014-08-27 https://scifaro.com/en/abs/improved-randomized-rounding-using-random-walks-1408.04882014-08-12 https://scifaro.com/en/abs/parameterized-tsp-beating-the-average-1408.05312014-08-05 https://scifaro.com/en/abs/almost-tight-distributed-minimum-cut-algorithms-1408.05572014-08-05 https://scifaro.com/en/abs/approximation-bounds-for-minimum-degree-matching-1408.05962015-11-03 https://scifaro.com/en/abs/spectral-approaches-to-nearest-neighbor-search-1408.07512014-08-05 https://scifaro.com/en/abs/lagrangian-duality-based-algorithms-in-online-scheduling-1408.09652014-08-06 https://scifaro.com/en/abs/amortized-tilde-o-v-delay-algorithm-for-listing-chordless-cycles-in-undirected-graphs-1408.12652014-08-07 https://scifaro.com/en/abs/maximum-atsp-with-weights-zero-and-one-via-half-edges-1408.14312014-08-08 https://scifaro.com/en/abs/interactive-channel-capacity-revisited-1408.14672014-11-04 https://scifaro.com/en/abs/asymptotically-exact-streaming-algorithms-1408.18472014-08-11 https://scifaro.com/en/abs/generating-k-independent-variables-in-constant-time-1408.21572014-08-12 https://scifaro.com/en/abs/complex-contagions-in-kleinberg-s-small-world-model-1408.21592014-08-12 https://scifaro.com/en/abs/a-sub-constant-improvement-in-approximating-the-positive-semidefinite-grothendieck-problem-1408.22702014-08-12 https://scifaro.com/en/abs/the-family-holiday-gathering-problem-or-fair-and-periodic-scheduling-of-independent-sets-1408.22792014-08-12 https://scifaro.com/en/abs/splz-an-efficient-algorithm-for-single-source-shortest-path-problem-using-compression-method-1408.22922015-01-13 https://scifaro.com/en/abs/dictionary-matching-with-one-gap-1408.23502014-08-12 https://scifaro.com/en/abs/advances-on-testing-c-planarity-of-embedded-flat-clustered-graphs-1408.25952014-08-13 https://scifaro.com/en/abs/universal-streaming-1408.26042014-08-13 https://scifaro.com/en/abs/hashing-for-similarity-search-a-survey-1408.29272014-08-14 https://scifaro.com/en/abs/dynamic-integer-sets-with-optimal-rank-select-and-predecessor-search-1408.30452014-10-28 https://scifaro.com/en/abs/rank-select-and-access-in-grammar-compressed-strings-1408.30932014-08-15 https://scifaro.com/en/abs/an-algorithm-for-canonical-forms-of-finite-subsets-of-mathbb-z-d-up-to-affinities-1408.33102018-09-28 https://scifaro.com/en/abs/robust-adaptive-routing-under-uncertainty-1408.33742016-02-23 https://scifaro.com/en/abs/complexity-of-nondeterministic-graph-parameter-testing-1408.35902016-08-05 https://scifaro.com/en/abs/improved-approximation-algorithms-for-projection-games-1408.40482015-11-17 https://scifaro.com/en/abs/fast-shortest-path-routing-in-transportation-networks-with-time-dependent-road-speeds-1408.41132016-01-08 https://scifaro.com/en/abs/efficient-online-strategies-for-renting-servers-in-the-cloud-1408.41562014-08-20 https://scifaro.com/en/abs/fast-approximate-matrix-multiplication-by-solving-linear-systems-1408.42302014-08-21 https://scifaro.com/en/abs/on-unconstrained-quasi-submodular-function-optimization-1408.43892014-11-14 https://scifaro.com/en/abs/tractable-pathfinding-for-the-stochastic-on-time-arrival-problem-1408.44902016-10-07 https://scifaro.com/en/abs/speeding-up-graph-algorithms-via-switching-classes-1408.49002014-08-22 https://scifaro.com/en/abs/approximation-algorithms-for-capacitated-facility-location-problem-with-penalties-1408.49442014-09-15 https://scifaro.com/en/abs/universal-sketches-for-the-frequency-negative-moments-and-other-decreasing-streaming-sums-1408.50962015-02-17 https://scifaro.com/en/abs/uniform-sampling-for-matrix-approximation-1408.50992014-08-22 https://scifaro.com/en/abs/on-the-complexity-of-role-colouring-planar-graphs-trees-and-cographs-1408.54122014-08-26 https://scifaro.com/en/abs/analysis-of-string-sorting-using-heapsort-1408.54222014-08-26 https://scifaro.com/en/abs/faster-construction-of-asymptotically-good-unit-cost-error-correcting-codes-in-the-ram-model-1408.55182014-09-16 https://scifaro.com/en/abs/iped2-inheritance-path-based-pedigree-reconstruction-algorithm-for-complicated-pedigrees-1408.55302014-08-26 https://scifaro.com/en/abs/planar-octilinear-drawings-with-one-bend-per-edge-1408.59202014-08-27 https://scifaro.com/en/abs/an-o-n-2-algorithm-for-computing-optimal-continuous-voltage-schedules-1408.59952014-08-27 https://scifaro.com/en/abs/approximating-upper-degree-constrained-partial-orientations-1408.61572014-10-13 https://scifaro.com/en/abs/wavelet-trees-meet-suffix-trees-1408.61822015-05-18 https://scifaro.com/en/abs/exact-algorithms-for-dominating-induced-matching-based-on-graph-partition-1408.61962017-08-08 https://scifaro.com/en/abs/remarks-on-quantum-modular-exponentiation-and-some-experimental-demonstrations-of-shor-s-algorithm-1408.62522014-10-09 https://scifaro.com/en/abs/sketch-based-influence-maximization-and-computation-scaling-up-with-guarantees-1408.62822014-08-28 https://scifaro.com/en/abs/crossing-minimization-for-1-page-and-2-page-drawings-of-graphs-with-bounded-treewidth-1408.63212018-12-18 https://scifaro.com/en/abs/a-linear-kernel-for-planar-red-blue-dominating-set-1408.63882017-05-02 https://scifaro.com/en/abs/finding-maximum-k-cliques-faster-using-lazy-global-domination-1408.64852014-08-28 https://scifaro.com/en/abs/towards-a-general-framework-for-searching-on-a-line-and-searching-on-m-rays-1408.68122014-11-05 https://scifaro.com/en/abs/the-advice-complexity-of-a-class-of-hard-online-problems-1408.70332016-05-26 https://scifaro.com/en/abs/faster-computation-of-expected-hypervolume-improvement-1408.71142014-09-01 https://scifaro.com/en/abs/computing-classic-closeness-centrality-at-scale-1409.00352014-09-02 https://scifaro.com/en/abs/an-optimal-algorithm-for-the-weighted-backup-2-center-problem-on-a-tree-1409.00982015-07-09 https://scifaro.com/en/abs/a-variant-of-the-maximum-weight-independent-set-problem-1409.01732014-09-30 https://scifaro.com/en/abs/data-oblivious-graph-algorithms-in-outsourced-external-memory-1409.05972014-09-03 https://scifaro.com/en/abs/combinatorial-algorithm-for-restricted-max-min-fair-allocation-1409.06072016-11-24 https://scifaro.com/en/abs/efficient-scheme-for-active-particle-selection-in-n-body-simulations-1409.07062014-09-16 https://scifaro.com/en/abs/generation-and-analysis-of-constrained-random-sampling-patterns-1409.10022015-10-08 https://scifaro.com/en/abs/the-planar-minimum-linear-arrangement-problem-is-different-from-the-minimum-linear-arrangement-problem-1409.10052014-09-04 https://scifaro.com/en/abs/maximizing-k-submodular-functions-and-beyond-1409.13992016-08-05 https://scifaro.com/en/abs/a-quantum-algorithm-for-approximating-the-influences-of-boolean-functions-and-its-applications-1409.14162015-01-21 https://scifaro.com/en/abs/longest-common-substrings-with-k-mismatches-1409.16942015-04-08 https://scifaro.com/en/abs/online-multi-coloring-with-advice-1409.17222014-09-08 https://scifaro.com/en/abs/faster-small-constant-periodic-merging-networks-1409.17492014-09-08 https://scifaro.com/en/abs/smart-sampling-for-lightweight-verification-of-markov-decision-processes-1409.21162016-11-15 https://scifaro.com/en/abs/streaming-lower-bounds-for-approximating-max-cut-1409.21382014-09-09 https://scifaro.com/en/abs/online-bipartite-matching-with-decomposable-weights-1409.21392014-09-09 https://scifaro.com/en/abs/a-framework-for-automated-competitive-analysis-of-on-line-scheduling-of-firm-deadline-tasks-1409.22912014-09-16 https://scifaro.com/en/abs/sketching-cuts-in-graphs-and-hypergraphs-1409.23912026-02-23 https://scifaro.com/en/abs/linear-time-algorithms-for-proportional-apportionment-1409.26032014-09-10 https://scifaro.com/en/abs/efficient-algorithms-for-discrepancy-minimization-in-convex-sets-1409.29132014-09-11 https://scifaro.com/en/abs/path-algebra-algorithm-for-finding-longest-increasing-subsequence-1409.29282014-09-11 https://scifaro.com/en/abs/graph-orientation-and-flows-over-time-1409.30812014-10-03 https://scifaro.com/en/abs/two-phase-bicriterion-search-for-finding-fast-and-efficient-electric-vehicle-routes-1409.31922014-09-11 https://scifaro.com/en/abs/selection-algorithms-with-small-groups-1409.36002019-04-09 https://scifaro.com/en/abs/a-4-3-approximation-algorithm-for-finding-a-spanning-tree-to-maximize-its-internal-vertices-1409.37002014-09-15 https://scifaro.com/en/abs/data-reductions-and-combinatorial-bounds-for-improved-approximation-algorithms-1409.37422014-09-15 https://scifaro.com/en/abs/facility-location-problems-in-the-constant-work-space-read-only-memory-model-1409.40922014-09-22 https://scifaro.com/en/abs/the-ordered-weighted-ell-1-norm-atomic-formulation-projections-and-algorithms-1409.42712015-04-13 https://scifaro.com/en/abs/fast-algorithmic-self-assembly-of-simple-shapes-using-random-agitation-1409.48282014-09-18 https://scifaro.com/en/abs/improved-algorithms-for-distributed-entropy-monitoring-1409.48432016-08-04 https://scifaro.com/en/abs/finding-even-subgraphs-even-faster-1409.49352014-09-18 https://scifaro.com/en/abs/rank-maximal-matchings-structure-and-algorithms-1409.49772014-09-18 https://scifaro.com/en/abs/robust-a-crash-failure-resistant-distributed-storage-system-1409.49912015-02-24 https://scifaro.com/en/abs/identifying-sparse-and-dense-sub-graphs-in-large-graphs-with-a-fast-algorithm-1409.50002015-06-22 https://scifaro.com/en/abs/solving-the-maximum-weight-connected-subgraph-problem-to-optimality-1409.53082014-12-03 https://scifaro.com/en/abs/differentially-private-linear-algebra-in-the-streaming-model-1409.54142017-10-26 https://scifaro.com/en/abs/windows-into-geometric-events-data-structures-for-time-windowed-querying-of-temporal-point-sets-1409.54522014-09-22 https://scifaro.com/en/abs/approximating-the-generalized-terminal-backup-problem-via-half-integral-multiflow-relaxation-1409.55612015-01-20 https://scifaro.com/en/abs/lempel-ziv-factorization-may-be-harder-than-computing-all-runs-1409.56412014-09-22 https://scifaro.com/en/abs/maximizing-symmetric-submodular-functions-1409.59002016-04-19 https://scifaro.com/en/abs/gaussian-cooling-and-o-n-3-algorithms-for-volume-and-gaussian-volume-1409.60112016-12-06 https://scifaro.com/en/abs/computing-the-p-adic-canonical-quadratic-form-in-polynomial-time-1409.61992014-09-23 https://scifaro.com/en/abs/2-vertex-connectivity-in-directed-graphs-1409.62772015-02-20 https://scifaro.com/en/abs/lift-project-systems-performing-on-the-partial-vertex-cover-polytope-1409.63652023-11-14 https://scifaro.com/en/abs/network-design-problems-with-bounded-distances-via-shallow-light-steiner-trees-1409.65512014-09-24 https://scifaro.com/en/abs/on-uniform-capacitated-k-median-beyond-the-natural-lp-relaxation-1409.67392014-10-21 https://scifaro.com/en/abs/document-counting-in-practice-1409.67802015-10-02 https://scifaro.com/en/abs/generating-a-quadratic-forms-from-a-given-genus-1409.69132015-03-27 https://scifaro.com/en/abs/a-0-821-ratio-purely-combinatorial-algorithm-for-maximum-k-vertex-cover-in-bipartite-graphs-1409.69522015-04-07 https://scifaro.com/en/abs/symmetric-submodular-clustering-with-actionable-constraint-1409.69672014-11-21 https://scifaro.com/en/abs/shortest-paths-in-nearly-conservative-digraphs-1409.70332014-09-26 https://scifaro.com/en/abs/a-note-on-the-longest-common-substring-with-k-mismatches-problem-1409.72172014-10-15 https://scifaro.com/en/abs/optimal-decremental-connectivity-in-planar-graphs-1409.72402014-09-26 https://scifaro.com/en/abs/stream-quantiles-via-maximal-entropy-histograms-1409.72892014-09-26 https://scifaro.com/en/abs/on-shor-s-factoring-algorithm-with-more-registers-and-the-problem-to-certify-quantum-computers-1409.73522014-09-26 https://scifaro.com/en/abs/irrelevant-components-and-exact-computation-of-the-diameter-constrained-reliability-1409.76882014-10-02 https://scifaro.com/en/abs/on-the-closest-vector-problem-with-a-distance-guarantee-1409.80632019-01-28 https://scifaro.com/en/abs/a-note-on-the-minimum-norm-point-algorithm-1409.81352014-10-02 https://scifaro.com/en/abs/strong-steiner-tree-approximations-in-practice-1409.83182015-12-10 https://scifaro.com/en/abs/line-distortion-bandwidth-and-path-length-of-a-graph-1409.83892014-10-01 https://scifaro.com/en/abs/near-optimum-online-ad-allocation-for-targeted-advertising-1409.86702015-04-30 https://scifaro.com/en/abs/askit-approximate-skeletonization-kernel-independent-treecode-in-high-dimensions-1410.02602015-03-16 https://scifaro.com/en/abs/improved-bounds-for-the-flat-wall-theorem-1410.02762014-10-02 https://scifaro.com/en/abs/an-improved-easily-computable-combinatorial-lower-bound-for-weighted-graph-bipartitioning-1410.04622014-10-03 https://scifaro.com/en/abs/a-massively-parallel-algorithm-for-constructing-the-bwt-of-large-string-sets-1410.05622014-10-03 https://scifaro.com/en/abs/an-algorithmic-metatheorem-for-directed-treewidth-1410.05892015-10-09 https://scifaro.com/en/abs/fast-memory-efficient-low-rank-approximation-of-simrank-1410.07172014-10-06 https://scifaro.com/en/abs/space-efficient-path-reporting-approximate-distance-oracles-1410.07682014-10-06 https://scifaro.com/en/abs/comparing-apples-and-oranges-query-tradeoff-in-submodular-maximization-1410.07732014-10-06 https://scifaro.com/en/abs/improved-algorithms-for-parity-and-streett-objectives-1410.08332019-03-14 https://scifaro.com/en/abs/characterizing-the-easy-to-find-subgraphs-from-the-viewpoint-of-polynomial-time-algorithms-kernels-and-turing-kernels-1410.08552014-10-06 https://scifaro.com/en/abs/degree-3-treewidth-sparsifiers-1410.10162014-10-07 https://scifaro.com/en/abs/approximation-algorithms-for-the-transportation-problem-with-market-choice-and-related-models-1410.14092016-08-23 https://scifaro.com/en/abs/notes-on-dual-critical-graphs-1410.16532014-10-08 https://scifaro.com/en/abs/rejecting-jobs-to-minimize-load-and-maximum-flow-time-1410.18392014-10-08 https://scifaro.com/en/abs/families-with-infants-speeding-up-algorithms-for-np-hard-problems-using-fft-1410.22092014-10-09 https://scifaro.com/en/abs/minimum-forcing-sets-for-miura-folding-patterns-1410.22312017-03-21 https://scifaro.com/en/abs/testing-identity-of-structured-distributions-1410.22662014-10-10 https://scifaro.com/en/abs/randomness-efficient-fast-johnson-lindenstrauss-transform-with-applications-in-differential-privacy-and-compressed-sensing-1410.24702015-07-17 https://scifaro.com/en/abs/efficient-on-line-detection-of-temporal-patterns-1410.24802015-05-28 https://scifaro.com/en/abs/spatial-mixing-and-the-connective-constant-optimal-bounds-1410.25952014-10-10 https://scifaro.com/en/abs/algorithm-engineering-for-a-quantum-annealing-platform-1410.26282014-10-21 https://scifaro.com/en/abs/optimal-lower-bound-for-itemset-frequency-indicator-sketches-1410.26402014-10-13 https://scifaro.com/en/abs/multi-party-set-reconciliation-using-characteristic-polynomials-1410.26452014-10-13 https://scifaro.com/en/abs/a-note-on-a-sports-league-scheduling-problem-1410.27212014-10-13 https://scifaro.com/en/abs/faster-sorting-networks-for-17-19-and-20-inputs-1410.27362014-10-13 https://scifaro.com/en/abs/encodings-of-range-maximum-sum-segment-queries-and-applications-1410.28472015-06-12 https://scifaro.com/en/abs/an-easy-subexponential-bound-for-online-chain-partitioning-1410.32472018-04-17 https://scifaro.com/en/abs/testing-poisson-binomial-distributions-1410.33862014-10-15 https://scifaro.com/en/abs/an-o-n-3-time-algorithm-for-the-maximum-weight-limited-capacity-many-to-many-matching-1410.34082025-10-28 https://scifaro.com/en/abs/efficient-and-compact-representations-of-prefix-codes-1410.34382015-06-30 https://scifaro.com/en/abs/a-lazy-approach-to-on-line-bipartite-matching-1410.37642018-05-21 https://scifaro.com/en/abs/tighter-low-rank-approximation-via-sampling-the-leveraged-element-1410.38862014-10-16 https://scifaro.com/en/abs/cheeger-type-approximation-for-sparsest-st-cut-1410.38892016-09-26 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-k-median-problem-using-a-new-factor-revealing-lp-1410.41612015-09-23 https://scifaro.com/en/abs/models-for-the-k-metric-dimension-1410.42092014-10-17 https://scifaro.com/en/abs/online-network-design-algorithms-via-hierarchical-decompositions-1410.42402014-10-17 https://scifaro.com/en/abs/consistent-weighted-sampling-made-fast-small-and-easy-1410.42662014-10-17 https://scifaro.com/en/abs/an-efficient-algorithm-for-unweighted-spectral-graph-sparsification-1410.42732014-12-16 https://scifaro.com/en/abs/weighted-sampling-of-outer-products-1410.44292014-10-17 https://scifaro.com/en/abs/optimal-time-random-access-to-grammar-compressed-strings-in-small-space-1410.47012015-01-27 https://scifaro.com/en/abs/a-multilevel-bilinear-programming-algorithm-for-the-vertex-separator-problem-1410.48852016-07-19 https://scifaro.com/en/abs/settling-the-randomized-k-sever-conjecture-on-some-special-metrics-1410.49552015-10-28 https://scifaro.com/en/abs/on-succinct-representations-of-binary-trees-1410.49632014-10-21 https://scifaro.com/en/abs/mixing-color-coding-related-techniques-1410.50622015-04-21 https://scifaro.com/en/abs/improved-region-growing-and-combinatorial-algorithms-for-k-route-cut-problems-1410.51052014-10-21 https://scifaro.com/en/abs/on-the-influence-of-graph-density-on-randomized-gossiping-1410.53552014-12-10 https://scifaro.com/en/abs/scalable-parallel-factorizations-of-sdd-matrices-and-efficient-sampling-for-gaussian-graphical-models-1410.53922014-10-21 https://scifaro.com/en/abs/rearrangement-problems-with-duplicated-genomic-markers-1410.54152014-10-22 https://scifaro.com/en/abs/building-a-balanced-k-d-tree-in-o-kn-log-n-time-1410.54202025-12-30 https://scifaro.com/en/abs/polynomials-a-new-tool-for-length-reduction-in-binary-discrete-convolutions-1410.56072014-10-22 https://scifaro.com/en/abs/simple-ptas-s-for-families-of-graphs-excluding-a-minor-1410.57782016-01-07 https://scifaro.com/en/abs/a-unified-approach-to-linear-probing-hashing-with-buckets-1410.59672014-10-23 https://scifaro.com/en/abs/posimodular-function-optimization-1410.60302014-10-23 https://scifaro.com/en/abs/on-the-average-case-complexity-of-parameterized-clique-1410.64002014-10-24 https://scifaro.com/en/abs/tight-tradeoffs-for-approximating-palindromes-in-streams-1410.64332016-04-08 https://scifaro.com/en/abs/some-combinatorial-problems-on-halin-graphs-1410.66212014-10-27 https://scifaro.com/en/abs/optimal-online-and-offline-algorithms-for-robot-assisted-restoration-of-barrier-coverage-1410.67262014-10-27 https://scifaro.com/en/abs/practical-massively-parallel-sorting-1410.67542015-02-26 https://scifaro.com/en/abs/dimensionality-reduction-for-k-means-clustering-and-low-rank-approximation-1410.68012015-04-06 https://scifaro.com/en/abs/a-hardware-oriented-algorithm-for-complex-valued-constant-matrix-vector-multiplication-1410.69372014-10-28 https://scifaro.com/en/abs/a-ptas-for-agnostically-learning-halfspaces-1410.70502015-06-26 https://scifaro.com/en/abs/scheduling-with-gaps-new-models-and-algorithms-1410.70922020-07-21 https://scifaro.com/en/abs/on-1-epsilon-restricted-assignment-makespan-minimization-1410.75062014-10-29 https://scifaro.com/en/abs/random-facet-and-random-bland-require-subexponential-time-even-for-shortest-paths-1410.75302014-10-29 https://scifaro.com/en/abs/approximation-algorithms-for-steiner-tree-problems-based-on-universal-solution-frameworks-1410.75342014-10-29 https://scifaro.com/en/abs/errata-for-a-subexponential-lower-bound-for-the-random-facet-algorithm-for-parity-games-1410.78712014-10-30 https://scifaro.com/en/abs/online-top-k-position-monitoring-of-distributed-data-streams-1410.79122016-10-28 https://scifaro.com/en/abs/optimal-online-edge-coloring-of-planar-graphs-with-advice-1410.79232015-02-13 https://scifaro.com/en/abs/a-13k-kernel-for-planar-feedback-vertex-set-via-region-decomposition-1410.83362014-10-31 https://scifaro.com/en/abs/fusion-tree-sorting-1411.00482014-11-04 https://scifaro.com/en/abs/algorithms-for-maximum-agreement-forest-of-multiple-general-trees-1411.00622014-11-04 https://scifaro.com/en/abs/provable-submodular-minimization-using-wolfe-s-algorithm-1411.00952014-11-04 https://scifaro.com/en/abs/epsilon-kernel-coresets-for-stochastic-points-1411.01942016-05-24 https://scifaro.com/en/abs/salt-a-unified-framework-for-all-shortest-path-query-variants-on-road-networks-1411.02572014-11-04 https://scifaro.com/en/abs/optimizing-expected-utility-in-a-multinomial-logit-model-with-position-bias-and-social-influence-1411.02792021-10-01 https://scifaro.com/en/abs/towards-tight-lower-bounds-for-range-reporting-on-the-ram-1411.06442014-11-04 https://scifaro.com/en/abs/a-weighted-common-subgraph-matching-algorithm-1411.07632014-11-05 https://scifaro.com/en/abs/an-exact-characterization-of-tractable-demand-patterns-for-maximum-disjoint-path-problems-1411.08712014-11-05 https://scifaro.com/en/abs/algorithms-for-mapping-parallel-processes-onto-grid-and-torus-architectures-1411.09212015-03-03 https://scifaro.com/en/abs/fully-dynamic-bin-packing-revisited-1411.09602015-01-15 https://scifaro.com/en/abs/more-tight-bounds-for-active-self-assembly-using-an-insertion-primitive-1411.09732015-10-29 https://scifaro.com/en/abs/jointly-private-convex-programming-1411.09982018-03-16 https://scifaro.com/en/abs/nearly-linear-time-packing-and-covering-lp-solvers-1411.11242018-02-28 https://scifaro.com/en/abs/multiqueues-simpler-faster-and-better-relaxed-concurrent-priority-queues-1411.12092014-11-06 https://scifaro.com/en/abs/tree-decompositions-and-social-graphs-1411.15462016-05-04 https://scifaro.com/en/abs/metric-and-non-metric-proximity-transformations-at-linear-costs-1411.16462014-11-07 https://scifaro.com/en/abs/optimal-data-structures-for-farthest-point-queries-in-cactus-networks-1411.18792015-03-17 https://scifaro.com/en/abs/scaling-algorithms-for-weighted-matching-in-general-graphs-1411.19192017-10-10 https://scifaro.com/en/abs/partitioning-well-clustered-graphs-spectral-clustering-works-1411.20212017-02-01 https://scifaro.com/en/abs/online-square-detection-1411.20222014-11-10 https://scifaro.com/en/abs/analysis-of-branch-misses-in-quicksort-1411.20592015-01-20 https://scifaro.com/en/abs/two-maximum-entropy-based-algorithms-for-running-quantile-estimation-in-non-stationary-data-streams-1411.22502014-11-11 https://scifaro.com/en/abs/a-polynomial-delay-algorithm-for-generating-connected-induced-subgraphs-of-a-given-cardinality-1411.22622016-08-23 https://scifaro.com/en/abs/an-explicit-sparse-recovery-scheme-in-the-l1-norm-1411.23442014-11-11 https://scifaro.com/en/abs/sketching-and-embedding-are-equivalent-for-norms-1411.25772017-02-16 https://scifaro.com/en/abs/asynchronous-approximation-of-a-single-component-of-the-solution-to-a-linear-system-1411.26472019-01-23 https://scifaro.com/en/abs/branch-and-reduce-exponential-fpt-algorithms-in-practice-a-case-study-of-vertex-cover-1411.26802014-11-12 https://scifaro.com/en/abs/variable-order-de-bruijn-graphs-1411.27182014-11-18 https://scifaro.com/en/abs/faster-compressed-quadtrees-1411.27852021-12-10 https://scifaro.com/en/abs/improving-robustness-of-next-hop-routing-1411.28732014-11-12 https://scifaro.com/en/abs/tight-bounds-for-online-vector-scheduling-1411.38872015-08-19 https://scifaro.com/en/abs/decremental-all-pairs-all-shortest-paths-and-betweenness-centrality-1411.40732014-11-18 https://scifaro.com/en/abs/hitting-forbidden-subgraphs-in-graphs-of-bounded-treewidth-1411.41842014-11-18 https://scifaro.com/en/abs/online-clique-clustering-1411.42742016-10-18 https://scifaro.com/en/abs/sketching-as-a-tool-for-numerical-linear-algebra-1411.43572015-02-11 https://scifaro.com/en/abs/welfare-maximization-with-production-costs-a-primal-dual-approach-1411.43842014-11-18 https://scifaro.com/en/abs/dynamic-facility-location-via-exponential-clocks-1411.44762014-11-18 https://scifaro.com/en/abs/scalable-wake-up-of-multi-channel-single-hop-radio-networks-1411.44982018-12-31 https://scifaro.com/en/abs/linear-programming-based-approximation-algorithms-for-multi-vehicle-minimum-latency-problems-1411.45732014-11-18 https://scifaro.com/en/abs/kernelization-and-sparseness-the-case-of-dominating-set-1411.45752015-09-22 https://scifaro.com/en/abs/effective-resistance-reducing-flows-spectrally-thin-trees-and-asymmetric-tsp-1411.46132015-09-03 https://scifaro.com/en/abs/sunflowers-and-testing-triangle-freeness-of-functions-1411.46922014-11-19 https://scifaro.com/en/abs/path-sampling-a-fast-and-provable-method-for-estimating-4-vertex-subgraph-counts-1411.49422014-11-19 https://scifaro.com/en/abs/sample-x-a-x-t-is-a-distinguisher-with-probability-1-8-1411.49822015-08-04 https://scifaro.com/en/abs/approximation-schemes-for-binary-quadratic-programming-problems-with-low-cp-rank-decompositions-1411.50502014-11-20 https://scifaro.com/en/abs/deterministic-edge-connectivity-in-near-linear-time-1411.51232018-10-30 https://scifaro.com/en/abs/pivotcompress-compression-by-sorting-1411.51272014-11-24 https://scifaro.com/en/abs/approximating-capacitated-k-median-with-1-epsilon-k-open-facilities-1411.56302015-07-14 https://scifaro.com/en/abs/the-online-disjoint-set-cover-problem-and-its-applications-1411.57392016-11-18 https://scifaro.com/en/abs/packing-while-traveling-mixed-integer-programming-for-a-class-of-nonlinear-knapsack-problems-1411.57682015-04-16 https://scifaro.com/en/abs/solving-hamiltonian-cycle-by-an-ept-algorithm-for-a-non-sparse-parameter-1411.58492014-11-24 https://scifaro.com/en/abs/planar-reachability-in-linear-space-and-constant-time-1411.58672015-04-07 https://scifaro.com/en/abs/folding-a-paper-strip-to-minimize-thickness-1411.63712016-03-22 https://scifaro.com/en/abs/sorting-networks-the-end-game-1411.64082016-11-30 https://scifaro.com/en/abs/efficient-storage-of-pareto-points-in-biobjective-mixed-integer-programming-1411.65382018-09-17 https://scifaro.com/en/abs/optimal-encodings-for-range-top-k-selection-and-min-max-1411.65812015-06-16 https://scifaro.com/en/abs/counting-cliques-and-clique-covers-in-random-graphs-1411.66732015-03-03 https://scifaro.com/en/abs/fast-algorithms-for-parameterized-problems-with-relaxed-disjointness-constraints-1411.67562015-04-27 https://scifaro.com/en/abs/reconstructing-phylogenetic-level-1-networks-from-nondense-binet-and-trinet-sets-1411.68042014-11-26 https://scifaro.com/en/abs/improved-algorithmic-results-for-unsplittable-stable-allocation-problems-1411.68182014-11-26 https://scifaro.com/en/abs/efficiently-listing-bounded-length-st-paths-1411.68522014-11-26 https://scifaro.com/en/abs/simple-strategies-versus-optimal-schedules-in-multi-agent-patrolling-1411.68532021-01-20 https://scifaro.com/en/abs/kernelization-algorithms-for-packing-problems-allowing-overlaps-extended-version-1411.69152015-01-27 https://scifaro.com/en/abs/hashing-for-statistics-over-k-partitions-1411.71912016-02-16 https://scifaro.com/en/abs/efficient-simrank-computation-via-linearization-1411.72282014-11-27 https://scifaro.com/en/abs/language-edit-distance-scored-parsing-faster-algorithms-connection-to-fundamental-graph-problems-1411.73152024-10-25 https://scifaro.com/en/abs/a-chasm-between-identity-and-equivalence-testing-with-conditional-queries-1411.73462018-12-10 https://scifaro.com/en/abs/algorithms-in-the-ultra-wide-word-model-1411.73592014-12-09 https://scifaro.com/en/abs/fast-algorithms-for-the-maximum-clique-problem-on-massive-graphs-with-applications-to-overlapping-community-detection-1411.74602014-12-01 https://scifaro.com/en/abs/approximate-undirected-maximum-flows-in-o-m-polylog-n-time-1411.76312015-11-18 https://scifaro.com/en/abs/the-complexity-of-finding-effectors-1411.78382015-12-03 https://scifaro.com/en/abs/fptas-for-bis-with-degree-bounds-on-one-side-1412.00732015-04-09 https://scifaro.com/en/abs/analysis-of-pivot-sampling-in-dual-pivot-quicksort-1412.01932015-08-11 https://scifaro.com/en/abs/bounded-quadrant-system-error-bounded-trajectory-compression-on-the-go-1412.03212014-12-09 https://scifaro.com/en/abs/approximate-map-estimation-for-pairwise-potentials-via-baker-s-technique-1412.03402018-04-18 https://scifaro.com/en/abs/strategic-deployment-in-graphs-1412.05382014-12-02 https://scifaro.com/en/abs/ell-p-row-sampling-by-lewis-weights-1412.05882014-12-02 https://scifaro.com/en/abs/beating-the-generator-enumeration-bound-for-solvable-group-isomorphism-1412.06392014-12-02 https://scifaro.com/en/abs/computationally-efficient-stochastic-cluster-dynamics-method-for-modeling-damage-accumulation-in-irradiated-materials-1412.06402016-05-04 https://scifaro.com/en/abs/still-simpler-way-of-introducing-interior-point-method-for-linear-programming-1412.06522015-01-15 https://scifaro.com/en/abs/near-optimal-lp-rounding-algorithm-for-correlation-clustering-on-complete-and-complete-k-partite-graphs-1412.06812015-06-25 https://scifaro.com/en/abs/queries-on-lz-bounded-encodings-1412.09672014-12-03 https://scifaro.com/en/abs/the-kadison-singer-problem-for-strongly-rayleigh-measures-and-applications-to-asymmetric-tsp-1412.11432015-07-23 https://scifaro.com/en/abs/matrix-multiplication-trilinear-decompositions-apa-algorithms-and-summation-1412.11452015-02-09 https://scifaro.com/en/abs/longest-common-extensions-in-trees-1412.12542015-07-10 https://scifaro.com/en/abs/on-the-complexity-of-various-parameterizations-of-common-induced-subgraph-isomorphism-1412.12612017-02-23 https://scifaro.com/en/abs/deterministic-fully-dynamic-data-structures-for-vertex-cover-and-matching-1412.13182014-12-04 https://scifaro.com/en/abs/searching-and-indexing-genomic-databases-via-kernelization-1412.15912014-12-05 https://scifaro.com/en/abs/on-testing-single-connectedness-in-directed-graphs-and-some-related-problems-1412.16392015-03-03 https://scifaro.com/en/abs/tracking-the-frequency-moments-at-all-times-1412.17632014-12-05 https://scifaro.com/en/abs/ergms-are-hard-1412.17872014-12-05 https://scifaro.com/en/abs/beyond-the-euler-characteristic-approximating-the-genus-of-general-graphs-1412.17922014-12-05 https://scifaro.com/en/abs/a-new-single-source-shortest-path-algorithm-for-nonnegative-weight-graph-1412.18702015-10-16 https://scifaro.com/en/abs/ell-p-testing-and-learning-of-discrete-distributions-1412.23142015-03-24 https://scifaro.com/en/abs/generalized-cofactors-and-decomposition-of-boolean-satisfiability-problems-1412.23412014-12-09 https://scifaro.com/en/abs/an-algorithm-for-l-infty-approximation-by-step-functions-1412.23792015-05-05 https://scifaro.com/en/abs/a-new-exact-algorithm-for-traveling-salesman-problem-with-time-complexity-interval-o-n-4-o-n-3-2-n-1412.24372015-10-16 https://scifaro.com/en/abs/a-robust-and-scalable-algorithm-for-the-steiner-problem-in-graphs-1412.27872014-12-11 https://scifaro.com/en/abs/max-vs-min-tensor-decomposition-and-ica-with-nearly-linear-sample-complexity-1412.29542015-06-22 https://scifaro.com/en/abs/computing-covers-using-prefix-tables-1412.30162015-03-02 https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-the-load-coloring-problem-1412.30232014-12-19 https://scifaro.com/en/abs/empirical-algorithmics-draw-your-own-conclusions-1412.33332014-12-11 https://scifaro.com/en/abs/online-covering-with-convex-objectives-and-applications-1412.35072014-12-12 https://scifaro.com/en/abs/covering-problems-for-partial-words-and-for-indeterminate-strings-1412.36962014-12-12 https://scifaro.com/en/abs/approximation-algorithms-for-budget-constrained-network-upgradeable-problems-1412.37212014-12-12 https://scifaro.com/en/abs/fully-dynamic-all-pairs-all-shortest-paths-1412.38522022-04-21 https://scifaro.com/en/abs/reconfiguration-of-cliques-in-a-graph-1412.39762014-12-15 https://scifaro.com/en/abs/complexity-issues-in-some-clustering-problems-in-combinatorial-circuits-1412.40512017-01-20 https://scifaro.com/en/abs/permutation-reconstruction-from-minmax-betweenness-constraints-1412.40622014-12-15 https://scifaro.com/en/abs/complexity-of-interval-minmax-regret-scheduling-on-parallel-identical-machines-with-total-completion-time-criterion-1412.42732016-03-25 https://scifaro.com/en/abs/online-detection-of-repetitions-with-backtracking-1412.44712015-05-04 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-circle-and-other-packing-problems-1412.47092014-12-16 https://scifaro.com/en/abs/the-rectilinear-steiner-tree-problem-with-given-topology-and-length-restrictions-1412.50102015-08-19 https://scifaro.com/en/abs/k-best-enumeration-1412.50752014-12-17 https://scifaro.com/en/abs/polynomial-time-method-of-determining-subset-sum-solutions-1412.51492017-05-16 https://scifaro.com/en/abs/the-switch-markov-chain-for-sampling-irregular-graphs-1412.52492014-12-18 https://scifaro.com/en/abs/optimal-depth-sorting-networks-1412.53022016-11-30 https://scifaro.com/en/abs/solving-totally-unimodular-lps-with-the-shadow-vertex-algorithm-1412.53812014-12-18 https://scifaro.com/en/abs/an-algorithm-for-online-k-means-clustering-1412.57212015-02-24 https://scifaro.com/en/abs/compression-of-high-throughput-sequencing-data-with-probabilistic-de-bruijn-graph-1412.59322014-12-19 https://scifaro.com/en/abs/short-paths-on-the-voronoi-graph-and-the-closest-vector-problem-with-preprocessing-1412.61682014-12-22 https://scifaro.com/en/abs/finding-2-edge-and-2-vertex-strongly-connected-components-in-quadratic-time-1412.64662018-03-02 https://scifaro.com/en/abs/on-the-shadow-simplex-method-for-curved-polyhedra-1412.67052014-12-23 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-traveling-salesman-problem-with-relaxed-triangle-inequality-1412.67552014-12-23 https://scifaro.com/en/abs/time-bounds-for-streaming-problems-1412.69352014-12-23 https://scifaro.com/en/abs/a-polynomial-kernel-for-trivially-perfect-editing-1412.75582014-12-25 https://scifaro.com/en/abs/greedy-algorithms-for-steiner-forest-1412.76932014-12-25 https://scifaro.com/en/abs/pattern-backtracking-algorithm-for-the-workflow-satisfiability-problem-1412.78342015-04-01 https://scifaro.com/en/abs/a-self-organizing-geometric-algorithm-for-autonomous-data-partitioning-1412.78602014-12-30 https://scifaro.com/en/abs/solving-the-shortest-vector-problem-in-2-n-time-via-discrete-gaussian-sampling-1412.79942019-01-28 https://scifaro.com/en/abs/dynamic-algorithms-for-interval-scheduling-on-a-single-machine-1412.80052014-12-30 https://scifaro.com/en/abs/the-adversarial-noise-threshold-for-distributed-protocols-1412.80972015-04-30 https://scifaro.com/en/abs/how-to-select-the-largest-k-elements-from-evolving-data-1412.81642014-12-30 https://scifaro.com/en/abs/a-sketching-algorithm-for-spectral-graph-sparsification-1412.82252014-12-30 https://scifaro.com/en/abs/pattern-matching-and-local-alignment-for-rna-structures-1412.82462015-01-05 https://scifaro.com/en/abs/a-2k-vertex-kernel-for-maximum-internal-spanning-tree-1412.82962014-12-30 https://scifaro.com/en/abs/maximum-cardinality-neighbourly-sets-in-quadrilateral-free-graphs-1412.83382017-02-03 https://scifaro.com/en/abs/online-packing-and-covering-framework-with-convex-objectives-1412.83472014-12-30 https://scifaro.com/en/abs/on-randomized-algorithms-for-matching-in-the-online-preemptive-model-1412.86152015-07-03 https://scifaro.com/en/abs/optimal-rounding-under-integer-constraints-1501.000142015-01-05 https://scifaro.com/en/abs/expected-number-of-uniformly-distributed-balls-in-a-most-loaded-bin-using-placement-with-simple-linear-functions-1501.001622015-01-05 https://scifaro.com/en/abs/set-merging-for-the-matching-algorithm-of-micali-and-vazirani-1501.002122015-01-05 https://scifaro.com/en/abs/fast-generation-of-random-spanning-trees-and-the-effective-resistance-metric-1501.002672017-03-16 https://scifaro.com/en/abs/spotting-trees-with-few-leaves-1501.005632015-02-24 https://scifaro.com/en/abs/a-review-on-the-tree-edit-distance-problem-and-related-path-decomposition-algorithms-1501.006112015-02-10 https://scifaro.com/en/abs/maximal-noise-in-interactive-communication-over-erasure-channels-and-channels-with-feedback-1501.006242015-01-06 https://scifaro.com/en/abs/a-new-algorithm-for-multiplying-two-dirac-numbers-1501.008282015-01-06 https://scifaro.com/en/abs/optimal-data-dependent-hashing-for-approximate-near-neighbors-1501.010622015-07-17 https://scifaro.com/en/abs/sparse-solutions-to-nonnegative-linear-systems-and-applications-1501.016892015-01-09 https://scifaro.com/en/abs/frequent-directions-simple-and-deterministic-matrix-sketching-1501.017112015-04-22 https://scifaro.com/en/abs/online-algorithms-modeled-after-mousehunt-1501.017202015-01-09 https://scifaro.com/en/abs/new-hashing-algorithm-for-use-in-tcp-reassembly-module-of-ips-1501.020622015-01-12 https://scifaro.com/en/abs/interval-selection-in-the-streaming-model-1501.022852015-02-05 https://scifaro.com/en/abs/computational-performance-evaluation-of-two-integer-linear-programming-models-for-the-minimum-common-string-partition-problem-1501.023882017-02-02 https://scifaro.com/en/abs/a-unified-analysis-approach-for-lms-based-variable-step-size-algorithms-1501.024872017-03-22 https://scifaro.com/en/abs/on-the-complexity-of-hub-labeling-1501.024922015-01-13 https://scifaro.com/en/abs/sorting-and-selection-with-imprecise-comparisons-1501.029112015-01-14 https://scifaro.com/en/abs/fast-generation-of-complex-networks-with-underlying-hyperbolic-geometry-1501.035452015-04-24 https://scifaro.com/en/abs/efficient-algorithms-for-the-order-preserving-pattern-matching-problem-1501.040012015-01-19 https://scifaro.com/en/abs/lower-bounds-in-the-preprocessing-and-query-phases-of-routing-algorithms-1501.042622015-09-08 https://scifaro.com/en/abs/a-practical-index-for-approximate-dictionary-matching-with-few-mismatches-1501.049482016-02-15 https://scifaro.com/en/abs/evacuating-robots-from-a-disk-using-face-to-face-communication-1501.049852023-06-22 https://scifaro.com/en/abs/stochastic-block-model-and-community-detection-in-the-sparse-graphs-a-spectral-algorithm-with-optimal-rate-of-recovery-1501.050212015-06-25 https://scifaro.com/en/abs/the-weighted-2-metric-dimension-of-trees-in-the-non-landmarks-model-1501.051972015-01-22 https://scifaro.com/en/abs/plug-and-play-dual-tree-algorithm-runtime-analysis-1501.052222015-01-22 https://scifaro.com/en/abs/a-speed-and-departure-time-optimization-algorithm-for-the-pollution-routing-problem-1501.053542018-04-03 https://scifaro.com/en/abs/smoothed-analysis-of-the-successive-shortest-path-algorithm-1501.054932015-09-16 https://scifaro.com/en/abs/mespotine-rle-basic-v0-9-an-overhead-reduced-and-improved-run-length-encoding-method-1501.055422015-01-23 https://scifaro.com/en/abs/stable-matchings-of-teachers-to-schools-1501.055472015-01-26 https://scifaro.com/en/abs/online-submodular-maximization-with-preemption-1501.058012015-01-26 https://scifaro.com/en/abs/an-o-n-epsilon-space-and-polynomial-time-algorithm-for-reachability-in-directed-layered-planar-graphs-1501.058282015-01-26 https://scifaro.com/en/abs/cooperative-greedy-pursuit-strategies-for-sparse-signal-representation-by-partitioning-1501.059712015-12-15 https://scifaro.com/en/abs/between-pure-and-approximate-differential-privacy-1501.060952015-01-27 https://scifaro.com/en/abs/better-online-deterministic-packet-routing-on-grids-1501.061402015-01-27 https://scifaro.com/en/abs/a-tie-break-model-for-graph-search-1501.061482015-01-27 https://scifaro.com/en/abs/tsp-with-time-windows-and-service-time-1501.061582015-01-27 https://scifaro.com/en/abs/on-longest-repeat-queries-1501.062592015-01-27 https://scifaro.com/en/abs/d-iteration-diffusion-approach-for-solving-pagerank-1501.063502015-05-07 https://scifaro.com/en/abs/on-the-average-case-complexity-of-shellsort-1501.064612019-08-29 https://scifaro.com/en/abs/approximation-algorithms-for-p2p-orienteering-and-stochastic-vehicle-routing-problem-1501.065152015-01-27 https://scifaro.com/en/abs/improved-practical-matrix-sketching-with-guarantees-1501.065612015-01-27 https://scifaro.com/en/abs/constructing-lz78-tries-and-position-heaps-in-linear-time-for-large-alphabets-1501.066192015-02-02 https://scifaro.com/en/abs/big-data-on-the-rise-testing-monotonicity-of-distributions-1501.067832015-04-27 https://scifaro.com/en/abs/planarity-of-streamed-graphs-1501.071062015-01-29 https://scifaro.com/en/abs/on-the-switch-markov-chain-for-perfect-matchings-1501.077252017-01-27 https://scifaro.com/en/abs/valued-workflow-satisfiability-problem-1501.078142015-02-02 https://scifaro.com/en/abs/efficiently-testing-t-interval-connectivity-in-dynamic-graphs-1502.000892017-03-20 https://scifaro.com/en/abs/obtaining-quality-proved-near-optimal-results-for-traveling-salesman-problem-1502.004472016-12-13 https://scifaro.com/en/abs/optimal-dynamic-program-for-r-domination-problems-over-tree-decompositions-1502.007162015-02-04 https://scifaro.com/en/abs/an-on-line-competitive-algorithm-for-coloring-bipartite-graphs-without-long-induced-paths-1502.008592015-02-04 https://scifaro.com/en/abs/multicuts-in-planar-and-bounded-genus-graphs-with-bounded-number-of-terminals-1502.009112016-11-24 https://scifaro.com/en/abs/computing-maximal-cliques-in-link-streams-1502.009932016-07-05 https://scifaro.com/en/abs/unveiling-the-tree-a-convex-framework-for-sparse-problems-1502.012202015-09-16 https://scifaro.com/en/abs/distributed-estimation-of-generalized-matrix-rank-efficient-algorithms-and-lower-bounds-1502.014032015-02-09 https://scifaro.com/en/abs/optimal-component-labeling-algorithms-for-mesh-connected-computers-and-vlsi-1502.014352015-02-06 https://scifaro.com/en/abs/parameterized-complexity-of-superstring-problems-1502.014612015-02-06 https://scifaro.com/en/abs/a-matrix-laurent-series-based-fast-fourier-transform-for-blocklengths-n-4-mod-8-1502.015662018-02-12 https://scifaro.com/en/abs/graph-partitioning-for-independent-sets-1502.016872015-02-06 https://scifaro.com/en/abs/online-convex-covering-and-packing-problems-1502.018022015-04-15 https://scifaro.com/en/abs/bipartite-synthesis-method-applied-to-the-subset-sum-problem-demonstrates-capability-as-decision-and-optimization-tool-1502.018372015-02-09 https://scifaro.com/en/abs/indexing-arbitrary-length-k-mers-in-sequencing-reads-1502.018612017-03-03 https://scifaro.com/en/abs/tree-search-and-quantum-computation-1502.019512015-02-09 https://scifaro.com/en/abs/can-quantum-entanglement-detection-schemes-improve-search-1502.019592015-02-09 https://scifaro.com/en/abs/approximating-atsp-by-relaxing-connectivity-1502.020512015-08-14 https://scifaro.com/en/abs/secretary-problems-with-non-uniform-arrival-order-1502.021552015-02-10 https://scifaro.com/en/abs/multilayer-hadamard-decomposition-of-discrete-hartley-transforms-1502.021682015-08-27 https://scifaro.com/en/abs/an-improved-lower-bound-for-one-dimensional-online-unit-clustering-1502.024222015-02-10 https://scifaro.com/en/abs/simple-distributed-delta-1-coloring-in-the-sinr-model-1502.024262015-02-10 https://scifaro.com/en/abs/a-distributed-message-optimal-assignment-on-rings-1502.024272015-09-10 https://scifaro.com/en/abs/dynamic-dfs-tree-in-undirected-graphs-breaking-the-o-m-barrier-1502.024812018-02-08 https://scifaro.com/en/abs/list-colouring-big-graphs-on-line-1502.025572015-02-10 https://scifaro.com/en/abs/a-compressed-gap-data-aware-measure-1502.032882015-05-15 https://scifaro.com/en/abs/locating-a-tree-in-a-phylogenetic-network-in-quadratic-time-1502.033792022-08-29 https://scifaro.com/en/abs/spectral-sparsification-of-random-walk-matrix-polynomials-1502.034962015-02-13 https://scifaro.com/en/abs/adaptive-search-over-sorted-sets-1502.038452015-02-16 https://scifaro.com/en/abs/communication-efficient-algorithms-for-top-k-selection-problems-1502.039422015-10-20 https://scifaro.com/en/abs/primal-dual-and-dual-fitting-analysis-of-online-scheduling-algorithms-for-generalized-flow-time-problems-1502.039462021-01-08 https://scifaro.com/en/abs/uniform-kernelization-complexity-of-hitting-forbidden-minors-1502.039652015-02-16 https://scifaro.com/en/abs/a-local-strategy-for-cleaning-expanding-cellular-domains-by-simple-robots-1502.039852015-02-16 https://scifaro.com/en/abs/parameterized-complexity-of-secluded-connectivity-problems-1502.039892015-04-22 https://scifaro.com/en/abs/local-computation-algorithms-for-graphs-of-non-constant-degrees-1502.040222015-02-16 https://scifaro.com/en/abs/efficient-algorithms-for-envy-free-stick-division-with-fewest-cuts-1502.040482017-11-06 https://scifaro.com/en/abs/solving-k-means-on-high-dimensional-big-data-1502.042652015-06-01 https://scifaro.com/en/abs/sample-complexity-for-winner-prediction-in-elections-1502.043542016-04-21 https://scifaro.com/en/abs/maximal-independent-sets-in-generalised-caterpillar-graphs-1502.045142017-02-01 https://scifaro.com/en/abs/smaller-selection-networks-for-cardinality-constraints-encoding-1502.045512015-02-17 https://scifaro.com/en/abs/a-1-varepsilon-embedding-of-low-highway-dimension-graphs-into-bounded-treewidth-graphs-1502.045882019-06-20 https://scifaro.com/en/abs/compressed-tree-canonization-1502.046252015-02-17 https://scifaro.com/en/abs/the-takeoff-towards-optimal-sorting-networks-1502.047482015-03-13 https://scifaro.com/en/abs/clustered-integer-3sum-via-additive-combinatorics-1502.052042015-02-19 https://scifaro.com/en/abs/hierarchical-time-dependent-oracles-1502.052222016-07-04 https://scifaro.com/en/abs/dynamic-subtrees-queries-revisited-the-depth-first-tour-tree-1502.052922015-09-23 https://scifaro.com/en/abs/simple-recognition-of-halin-graphs-and-their-generalizations-1502.053342016-06-28 https://scifaro.com/en/abs/on-learning-k-parities-with-and-without-noise-1502.053752015-02-19 https://scifaro.com/en/abs/lower-bounds-for-the-graph-homomorphism-problem-1502.054472015-02-20 https://scifaro.com/en/abs/prioritized-metric-structures-and-embedding-1502.055432015-04-08 https://scifaro.com/en/abs/time-and-space-optimality-of-rotor-router-graph-exploration-1502.055452015-12-01 https://scifaro.com/en/abs/quicksort-largest-bucket-and-min-wise-hashing-with-limited-independence-1502.057292015-02-23 https://scifaro.com/en/abs/binary-embedding-fundamental-limits-and-fast-algorithm-1502.057462019-01-24 https://scifaro.com/en/abs/time-approximation-trade-offs-for-inapproximable-problems-1502.058282015-02-23 https://scifaro.com/en/abs/fixed-parameter-tractable-distances-to-sparse-graph-classes-1502.059102015-02-23 https://scifaro.com/en/abs/composite-repetition-aware-data-structures-1502.059372015-02-24 https://scifaro.com/en/abs/multi-level-loop-less-algorithm-for-multi-set-permutations-1502.060622015-02-24 https://scifaro.com/en/abs/finding-pairwise-intersections-inside-a-query-range-1502.060792015-02-24 https://scifaro.com/en/abs/derivation-of-a-low-multiplicative-complexity-algorithm-for-multiplying-hyperbolic-octonions-1502.062502015-02-24 https://scifaro.com/en/abs/a-framework-for-space-efficient-string-kernels-1502.063702015-02-24 https://scifaro.com/en/abs/greedy-minimization-of-weakly-supermodular-set-functions-1502.065282015-02-24 https://scifaro.com/en/abs/a-deterministic-sublinear-time-nonadaptive-algorithm-for-metric-1-median-selection-1502.067642015-02-25 https://scifaro.com/en/abs/optimization-problems-in-correlated-networks-1502.068202016-02-02 https://scifaro.com/en/abs/variability-in-data-streams-1502.070272015-02-26 https://scifaro.com/en/abs/an-approximation-algorithm-for-the-longest-cycle-problem-in-solid-grid-graphs-1502.070852015-02-26 https://scifaro.com/en/abs/linear-complexity-simrank-computation-based-on-the-iterative-diagonal-estimation-1502.071672015-02-26 https://scifaro.com/en/abs/incremental-dfs-trees-on-arbitrary-directed-graphs-1502.072062022-02-24 https://scifaro.com/en/abs/improved-approximation-algorithms-for-k-submodular-function-maximization-1502.074062015-02-27 https://scifaro.com/en/abs/comparison-issues-in-large-graphs-state-of-the-art-and-future-directions-1502.075762015-02-27 https://scifaro.com/en/abs/on-the-complexity-of-computing-the-k-restricted-edge-connectivity-of-a-graph-1502.076592016-09-20 https://scifaro.com/en/abs/submatrix-maximum-queries-in-monge-matrices-are-equivalent-to-predecessor-search-1502.076632017-12-27 https://scifaro.com/en/abs/the-k-leaf-spanning-tree-problem-admits-a-klam-value-of-39-1502.077252015-05-12 https://scifaro.com/en/abs/inferring-an-indeterminate-string-from-a-prefix-graph-1502.078702015-03-02 https://scifaro.com/en/abs/is-nearly-linear-the-same-in-theory-and-practice-a-case-study-with-a-combinatorial-laplacian-solver-1502.078882015-03-02 https://scifaro.com/en/abs/combinatorial-approximation-of-maximum-k-vertex-cover-in-bipartite-graphs-within-ratio-0-7-1502.079302015-03-11 https://scifaro.com/en/abs/algorithms-for-longest-common-abelian-factors-1503.000492015-03-03 https://scifaro.com/en/abs/o-1-time-generation-of-adjacent-multiset-combinations-1503.000672015-03-03 https://scifaro.com/en/abs/phylogenetic-incongruence-through-the-lens-of-monadic-second-order-logic-1503.003682015-03-03 https://scifaro.com/en/abs/a-randomized-algorithm-for-approximating-the-log-determinant-of-a-symmetric-positive-definite-matrix-1503.003742016-09-01 https://scifaro.com/en/abs/a-simple-spectral-algorithm-for-recovering-planted-partitions-1503.004232017-08-28 https://scifaro.com/en/abs/efficient-computation-of-the-characteristic-polynomial-of-a-threshold-graph-1503.006172015-03-03 https://scifaro.com/en/abs/more-analysis-of-double-hashing-for-balanced-allocations-1503.006582015-03-03 https://scifaro.com/en/abs/polynomial-kernelization-for-removing-induced-claws-and-diamonds-1503.007042015-03-03 https://scifaro.com/en/abs/deterministic-and-probabilistic-binary-search-in-graphs-1503.008052017-08-01 https://scifaro.com/en/abs/how-to-round-subspaces-a-new-spectral-clustering-algorithm-1503.008272015-10-20 https://scifaro.com/en/abs/an-algorithm-for-multiplication-of-split-octonions-1503.010582015-03-04 https://scifaro.com/en/abs/a-note-on-the-longest-common-abelian-factor-problem-1503.010932015-03-12 https://scifaro.com/en/abs/recognizing-k-equistable-graphs-in-fpt-time-1503.010982015-03-04 https://scifaro.com/en/abs/a-randomized-online-quantile-summary-in-o-frac-1-varepsilon-log-frac-1-varepsilon-words-1503.011562015-03-05 https://scifaro.com/en/abs/counting-inversions-adaptively-1503.011922015-03-05 https://scifaro.com/en/abs/on-the-number-of-minimal-separators-in-graphs-1503.012032015-04-03 https://scifaro.com/en/abs/maximizing-monotone-submodular-functions-over-the-integer-lattice-1503.012182016-05-11 https://scifaro.com/en/abs/tolerant-testers-of-image-properties-1503.013632016-08-16 https://scifaro.com/en/abs/managing-relocation-and-delay-in-container-terminals-with-flexible-service-policies-1503.015352015-03-06 https://scifaro.com/en/abs/scalable-iterative-algorithm-for-robust-subspace-clustering-1503.015782015-06-09 https://scifaro.com/en/abs/gdc-2-compression-of-large-collections-of-genomes-1503.016242017-03-03 https://scifaro.com/en/abs/dimensionality-reduction-of-massive-sparse-datasets-using-coresets-1503.016632015-03-06 https://scifaro.com/en/abs/efficient-farthest-point-queries-in-two-terminal-series-parallel-networks-1503.017062015-07-30 https://scifaro.com/en/abs/how-friends-and-non-determinism-affect-opinion-dynamics-1503.017202015-03-06 https://scifaro.com/en/abs/efficient-inverse-maintenance-and-faster-algorithms-for-linear-programming-1503.017522015-10-15 https://scifaro.com/en/abs/stochastic-service-placement-1503.024132015-03-10 https://scifaro.com/en/abs/approximating-lz77-in-small-space-1503.024162015-03-10 https://scifaro.com/en/abs/the-quicksort-algorithm-and-related-topics-1503.025042015-10-05 https://scifaro.com/en/abs/modified-dijkstra-algorithm-with-invention-hierarchies-applied-to-a-conic-graph-1503.025172015-03-20 https://scifaro.com/en/abs/two-compact-incremental-prime-sieves-1503.025922019-02-20 https://scifaro.com/en/abs/algorithms-for-replica-placement-in-high-availability-storage-1503.026542017-01-09 https://scifaro.com/en/abs/simpler-linear-time-transitive-orientation-via-lexicographic-breadth-first-search-1503.027732015-03-11 https://scifaro.com/en/abs/polynomial-time-approximability-of-the-k-sink-location-problem-1503.028352015-03-11 https://scifaro.com/en/abs/on-the-approximability-of-independent-set-problem-on-power-law-graphs-1503.028802015-03-11 https://scifaro.com/en/abs/dealing-with-4-variables-by-resolution-an-improved-maxsat-algorithm-1503.029202015-03-11 https://scifaro.com/en/abs/self-adjusting-binary-search-trees-what-makes-them-tick-1503.031052015-08-20 https://scifaro.com/en/abs/computing-heat-kernel-pagerank-and-a-local-clustering-algorithm-1503.031552016-12-16 https://scifaro.com/en/abs/solving-local-linear-systems-with-boundary-conditions-using-heat-kernel-pagerank-1503.031572015-08-03 https://scifaro.com/en/abs/iterative-merging-algorithm-for-cooperative-data-exchange-1503.031652015-06-01 https://scifaro.com/en/abs/sampling-colorings-almost-uniformly-in-sparse-random-graphs-1503.033512015-07-29 https://scifaro.com/en/abs/faster-64-bit-universal-hashing-using-carry-less-multiplications-1503.034652016-12-20 https://scifaro.com/en/abs/satisfiability-of-ordering-csps-above-average-1503.038512015-11-03 https://scifaro.com/en/abs/constructing-and-employing-tree-alignment-graphs-for-phylogenetic-synthesis-1503.038772015-03-16 https://scifaro.com/en/abs/local-distribution-and-the-symmetry-gap-approximability-of-multiway-partitioning-problems-1503.039052015-03-16 https://scifaro.com/en/abs/hyper-temporal-networks-1503.039742017-03-23 https://scifaro.com/en/abs/some-comments-on-the-stochastic-eulerian-tour-problem-1503.041772015-03-16 https://scifaro.com/en/abs/an-improved-pseudo-polynomial-upper-bound-for-the-value-problem-and-optimal-strategy-synthesis-in-mean-payoff-games-1503.044262016-04-26 https://scifaro.com/en/abs/minimum-equivalent-precedence-relation-systems-1503.047532015-03-17 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-solving-clique-problems-1503.047942015-03-17 https://scifaro.com/en/abs/perfect-consistent-hashing-1503.049882015-03-19 https://scifaro.com/en/abs/the-book-thickness-of-1-planar-graphs-is-constant-1503.049902015-03-31 https://scifaro.com/en/abs/a-linear-time-algorithm-for-finding-all-double-vertex-dominators-of-a-given-vertex-1503.049942015-03-18 https://scifaro.com/en/abs/the-graph-motif-problem-parameterized-by-the-structure-of-the-input-graph-1503.051102017-01-13 https://scifaro.com/en/abs/sketching-embedding-and-dimensionality-reduction-for-information-spaces-1503.052252015-03-19 https://scifaro.com/en/abs/entropy-scaling-search-of-massive-biological-data-1503.056382015-09-22 https://scifaro.com/en/abs/time-and-space-efficient-algorithms-for-rna-folding-with-the-four-russians-technique-1503.056702015-03-23 https://scifaro.com/en/abs/the-lock-free-k-lsm-relaxed-priority-queue-1503.056982015-03-20 https://scifaro.com/en/abs/counting-hypergraph-matchings-up-to-uniqueness-threshold-1503.058122017-01-09 https://scifaro.com/en/abs/constant-complexity-stochastic-simulation-algorithm-with-optimal-binning-1503.058322015-09-02 https://scifaro.com/en/abs/hub-location-under-uncertainty-a-minimax-regret-model-for-the-capacitated-problem-with-multiple-allocations-1503.059602017-09-19 https://scifaro.com/en/abs/dynamic-data-structures-for-document-collections-and-graphs-1503.059772015-03-23 https://scifaro.com/en/abs/binary-coding-in-stream-1503.062712015-03-24 https://scifaro.com/en/abs/parameterized-complexity-of-critical-node-cuts-1503.063212015-06-30 https://scifaro.com/en/abs/balancing-communication-for-multi-party-interactive-coding-1503.063812015-03-24 https://scifaro.com/en/abs/large-scale-log-determinant-computation-through-stochastic-chebyshev-expansions-1503.063942015-03-24 https://scifaro.com/en/abs/maximization-problems-parameterized-using-their-minimization-versions-the-case-of-vertex-cover-1503.064382015-03-24 https://scifaro.com/en/abs/efficient-generation-of-stable-planar-cages-for-chemistry-1503.066102015-03-24 https://scifaro.com/en/abs/a-fast-heuristic-algorithm-for-redundancy-removal-1503.066322015-03-24 https://scifaro.com/en/abs/on-the-complexity-of-nondeterministically-testable-hypergraph-parameters-1503.070932015-03-25 https://scifaro.com/en/abs/shortest-path-queries-in-planar-graphs-on-gpu-accelerated-architectures-1503.071922015-03-26 https://scifaro.com/en/abs/computing-the-partition-function-of-a-polynomial-on-the-boolean-cube-1503.074632016-11-30 https://scifaro.com/en/abs/mind-the-gap-1503.075632015-07-13 https://scifaro.com/en/abs/analyzing-adaptive-cache-replacement-strategies-1503.076242017-04-25 https://scifaro.com/en/abs/d3-tree-a-dynamic-distributed-deterministic-load-balancer-for-decentralized-tree-structures-1503.079052015-03-30 https://scifaro.com/en/abs/optimality-of-fast-matching-algorithms-for-random-networks-with-applications-to-structural-controllability-1503.080192016-03-25 https://scifaro.com/en/abs/parameterized-complexity-of-asynchronous-border-minimization-1503.080782015-03-30 https://scifaro.com/en/abs/dual-pivot-quicksort-1503.084982015-03-31 https://scifaro.com/en/abs/a-logarithmic-additive-integrality-gap-for-bin-packing-1503.087962015-03-31 https://scifaro.com/en/abs/on-convergence-and-threshold-properties-of-discrete-lotka-volterra-population-protocols-1503.091682015-04-01 https://scifaro.com/en/abs/a-linear-time-algorithm-to-compute-the-impact-of-all-the-articulation-points-1504.003412015-05-12 https://scifaro.com/en/abs/a-bulk-parallel-priority-queue-in-external-memory-with-stxxl-1504.005452015-04-03 https://scifaro.com/en/abs/a-survey-on-methods-and-systems-for-graph-compression-1504.006162015-04-03 https://scifaro.com/en/abs/the-inapproximability-of-maximum-single-sink-unsplittable-priority-and-confluent-flow-problems-1504.006272015-05-18 https://scifaro.com/en/abs/approximation-of-non-boolean-2csp-1504.006812015-04-07 https://scifaro.com/en/abs/improved-cheeger-s-inequality-and-analysis-of-local-graph-partitioning-using-vertex-expansion-and-expansion-profile-1504.006862015-04-06 https://scifaro.com/en/abs/every-property-is-testable-on-a-natural-class-of-scale-free-multigraphs-1504.007662015-07-24 https://scifaro.com/en/abs/how-to-solve-the-cake-cutting-problem-in-sublinear-time-1504.007742015-07-24 https://scifaro.com/en/abs/enhanced-red-black-tree-data-structure-for-facilitating-the-scheduling-of-reservations-1504.007852015-04-06 https://scifaro.com/en/abs/approximately-counting-triangles-in-sublinear-time-1504.009542016-11-17 https://scifaro.com/en/abs/watch-and-learn-optimizing-from-revealed-preferences-feedback-1504.010332015-11-19 https://scifaro.com/en/abs/nearly-optimal-bounds-for-sparse-recovery-in-generic-norms-with-applications-to-k-median-sketching-1504.010762015-04-07 https://scifaro.com/en/abs/learning-how-to-rank-from-heavily-perturbed-statistics-digraph-clustering-approach-1504.011182015-04-07 https://scifaro.com/en/abs/proving-the-herman-protocol-conjecture-1504.011302017-10-12 https://scifaro.com/en/abs/multi-broadcasting-under-the-sinr-model-1504.013522015-04-08 https://scifaro.com/en/abs/a-complete-worst-case-analysis-of-heapsort-with-experimental-verification-of-its-results-a-manuscript-ms-1504.014592017-03-07 https://scifaro.com/en/abs/rehub-extending-hub-labels-for-reverse-k-nearest-neighbor-queries-on-large-scale-networks-1504.014972015-07-13 https://scifaro.com/en/abs/random-projections-for-k-means-maintaining-coresets-beyond-merge-reduce-1504.015842020-02-19 https://scifaro.com/en/abs/the-list-decoding-size-of-fourier-sparse-boolean-functions-1504.016492015-04-08 https://scifaro.com/en/abs/new-unconditional-hardness-results-for-dynamic-and-online-problems-1504.018362015-04-09 https://scifaro.com/en/abs/solving-the-closest-vector-problem-in-2-n-time-the-discrete-gaussian-strikes-again-1504.019952019-01-28 https://scifaro.com/en/abs/set-membership-with-a-few-bit-probes-1504.020352015-04-09 https://scifaro.com/en/abs/an-algorithmic-proof-of-the-lovasz-local-lemma-via-resampling-oracles-1504.020442015-11-19 https://scifaro.com/en/abs/discrete-stochastic-submodular-maximization-adaptive-vs-non-adaptive-vs-offline-1504.021462015-04-28 https://scifaro.com/en/abs/space-and-time-efficient-algorithm-for-maintaining-dense-subgraphs-on-one-pass-dynamic-streams-1504.022682015-09-23 https://scifaro.com/en/abs/optimal-induced-universal-graphs-and-adjacency-labeling-for-trees-1504.023062016-02-17 https://scifaro.com/en/abs/algorithms-for-the-workflow-satisfiability-problem-engineered-for-counting-constraints-1504.024202015-05-18 https://scifaro.com/en/abs/faster-algorithms-for-the-constrained-k-means-problem-1504.025642015-04-13 https://scifaro.com/en/abs/lempel-ziv-computation-in-small-space-lz-ciss-1504.026052015-04-13 https://scifaro.com/en/abs/longest-common-extensions-in-sublinear-space-1504.026712015-04-13 https://scifaro.com/en/abs/the-hardness-of-subgraph-isomorphism-1504.028762015-04-14 https://scifaro.com/en/abs/analysis-of-a-classical-matrix-preconditioning-algorithm-1504.030262015-06-16 https://scifaro.com/en/abs/search-algorithms-for-efficient-logistics-chains-1504.031702016-03-09 https://scifaro.com/en/abs/a-variable-fixing-heuristic-with-local-branching-for-the-fixed-charge-uncapacitated-network-design-problem-with-user-optimal-flow-1504.032172020-06-22 https://scifaro.com/en/abs/testing-cluster-structure-of-graphs-1504.032942015-04-14 https://scifaro.com/en/abs/tight-bounds-on-low-degree-spectral-concentration-of-submodular-and-xos-functions-1504.033912015-08-04 https://scifaro.com/en/abs/the-maximum-cut-problem-in-co-bipartite-chain-graphs-1504.036662015-04-15 https://scifaro.com/en/abs/coloring-graphs-having-few-colorings-over-path-decompositions-1504.036702015-07-10 https://scifaro.com/en/abs/graph-bisection-with-pareto-optimization-1504.038122017-11-23 https://scifaro.com/en/abs/obdds-and-almost-k-wise-independent-random-variables-1504.038422015-04-16 https://scifaro.com/en/abs/optimization-results-for-a-generalized-coupon-collector-problem-1504.038782015-04-16 https://scifaro.com/en/abs/the-parametric-closure-problem-1504.040732018-01-18 https://scifaro.com/en/abs/faster-algorithms-for-testing-under-conditional-sampling-1504.041032015-04-17 https://scifaro.com/en/abs/fault-tolerant-bfs-structures-a-reinforcement-backup-tradeoff-1504.041692015-04-17 https://scifaro.com/en/abs/unit-interval-editing-is-fixed-parameter-tractable-1504.044702017-01-03 https://scifaro.com/en/abs/simpler-faster-and-shorter-labels-for-distances-in-graphs-1504.044982015-04-20 https://scifaro.com/en/abs/a-faster-fptas-for-the-unbounded-knapsack-problem-1504.046502015-11-10 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-multi-antennae-largest-weight-data-retrieval-1504.046792017-06-07 https://scifaro.com/en/abs/efficient-vertex-label-distance-oracles-for-planar-graphs-1504.046902017-12-19 https://scifaro.com/en/abs/tree-buffers-1504.047572015-05-15 https://scifaro.com/en/abs/on-the-lov-asz-theta-function-for-independent-sets-in-sparse-graphs-1504.047672015-04-24 https://scifaro.com/en/abs/rooted-cycle-bases-1504.049312015-04-21 https://scifaro.com/en/abs/tabulation-of-noncrossing-acyclic-digraphs-1504.049932015-04-21 https://scifaro.com/en/abs/route-planning-in-transportation-networks-1504.051402015-04-21 https://scifaro.com/en/abs/decomposing-overcomplete-3rd-order-tensors-using-sum-of-squares-algorithms-1504.052872015-04-23 https://scifaro.com/en/abs/graphlet-based-lazy-associative-graph-classification-1504.054572015-05-15 https://scifaro.com/en/abs/optimal-parameterized-algorithms-for-planar-facility-location-problems-using-voronoi-diagrams-1504.054762015-04-22 https://scifaro.com/en/abs/randomized-block-krylov-methods-for-stronger-and-faster-approximate-singular-value-decomposition-1504.054772015-11-02 https://scifaro.com/en/abs/parameterized-complexity-dichotomy-for-r-ell-vertex-deletion-1504.055152016-10-12 https://scifaro.com/en/abs/a-unified-approach-for-clustering-problems-on-sliding-windows-1504.055532015-04-22 https://scifaro.com/en/abs/deleting-edges-to-restrict-the-size-of-an-epidemic-1504.057732017-04-20 https://scifaro.com/en/abs/on-the-approximation-performance-of-degree-heuristics-for-matching-1504.058302016-12-21 https://scifaro.com/en/abs/an-fpt-algorithm-and-a-polynomial-kernel-for-linear-rankwidth-1-vertex-deletion-1504.059052016-01-13 https://scifaro.com/en/abs/dictionary-matching-in-a-stream-1504.062422015-04-24 https://scifaro.com/en/abs/interactive-communication-with-unknown-noise-rate-1504.063162015-08-17 https://scifaro.com/en/abs/on-the-runtime-of-randomized-local-search-and-simple-evolutionary-algorithms-for-dynamic-makespan-scheduling-1504.063632015-04-27 https://scifaro.com/en/abs/a-practical-and-worst-case-efficient-algorithm-for-divisor-methods-of-apportionment-1504.064752017-12-06 https://scifaro.com/en/abs/run-generation-revisited-what-goes-up-may-or-may-not-come-down-1504.065012015-04-27 https://scifaro.com/en/abs/sampling-correctors-1504.065442018-04-03 https://scifaro.com/en/abs/approximation-algorithms-for-inventory-problems-with-submodular-or-routing-costs-1504.065602015-04-27 https://scifaro.com/en/abs/approximating-lz77-via-small-space-multiple-pattern-matching-1504.066472015-09-11 https://scifaro.com/en/abs/faster-lightweight-lempel-ziv-parsing-1504.067122015-06-09 https://scifaro.com/en/abs/optimal-principal-component-analysis-in-distributed-and-streaming-models-1504.067292016-07-13 https://scifaro.com/en/abs/high-speed-hashing-for-integers-and-strings-1504.068042020-05-12 https://scifaro.com/en/abs/dynamic-index-lz-factorization-and-lce-queries-in-compressed-space-1504.069542016-04-07 https://scifaro.com/en/abs/generalized-solution-for-the-herman-protocol-conjecture-1504.069632022-12-01 https://scifaro.com/en/abs/metric-decompositions-of-path-separable-graphs-1504.070192016-09-29 https://scifaro.com/en/abs/non-preemptive-scheduling-on-machines-with-setup-times-1504.070662015-04-28 https://scifaro.com/en/abs/optimal-shuffle-code-with-permutation-instructions-1504.070732015-05-19 https://scifaro.com/en/abs/fully-dynamic-approximation-of-betweenness-centrality-1504.070912015-07-06 https://scifaro.com/en/abs/scheduling-bidirectional-traffic-on-a-path-1504.071292015-04-28 https://scifaro.com/en/abs/trip-based-public-transit-routing-1504.071492016-07-06 https://scifaro.com/en/abs/adaptive-computation-of-the-swap-insert-correction-distance-1504.072982015-06-30 https://scifaro.com/en/abs/fast-quasi-threshold-editing-1504.073792020-04-28 https://scifaro.com/en/abs/faster-algorithms-for-quantitative-verification-in-constant-treewidth-graphs-1504.073842015-04-29 https://scifaro.com/en/abs/on-maximal-unbordered-factors-1504.074062015-04-29 https://scifaro.com/en/abs/nck-sequences-and-their-difference-sequences-1504.075952015-04-29 https://scifaro.com/en/abs/split-by-edges-trees-1504.076262015-05-14 https://scifaro.com/en/abs/weighted-graph-algorithms-with-python-1504.078282016-01-11 https://scifaro.com/en/abs/a-solution-merging-heuristic-for-the-steiner-problem-in-graphs-using-tree-decompositions-1504.078342016-10-05 https://scifaro.com/en/abs/dynamic-relative-compression-dynamic-partial-sums-and-substring-concatenation-1504.078512016-09-19 https://scifaro.com/en/abs/using-the-wowa-operator-in-robust-discrete-optimization-problems-1504.078632015-10-09 https://scifaro.com/en/abs/algorithms-for-non-linear-and-stochastic-resource-constrained-shortest-paths-1504.078802017-02-16 https://scifaro.com/en/abs/sublinear-time-decremental-algorithms-for-single-source-reachability-and-shortest-paths-on-directed-graphs-1504.079592018-03-02 https://scifaro.com/en/abs/on-temporal-graph-exploration-1504.079762021-03-17 https://scifaro.com/en/abs/a-polynomial-time-bicriteria-approximation-scheme-for-planar-bisection-1504.080082015-05-01 https://scifaro.com/en/abs/a-comparison-of-approaches-for-solving-hard-graph-theoretic-problems-1504.080112015-12-18 https://scifaro.com/en/abs/streaming-algorithms-for-submodular-function-maximization-1504.080242015-05-01 https://scifaro.com/en/abs/a-shortcut-to-sun-flowers-kernels-in-logarithmic-space-or-linear-time-1504.082352015-05-01 https://scifaro.com/en/abs/smoothed-analysis-of-the-minimum-mean-cycle-canceling-algorithm-and-the-network-simplex-algorithm-1504.082512015-05-01 https://scifaro.com/en/abs/optimal-competitiveness-for-the-rectilinear-steiner-arborescence-problem-1504.082652015-05-01 https://scifaro.com/en/abs/simple-and-faster-algorithm-for-reachability-in-a-decremental-directed-graph-1504.083602015-05-19 https://scifaro.com/en/abs/on-the-structure-covering-and-learning-of-poisson-multinomial-distributions-1504.083632015-11-24 https://scifaro.com/en/abs/rule-based-lexicographical-permutation-sequences-1505.000012015-05-04 https://scifaro.com/en/abs/multi-probe-consistent-hashing-1505.000622015-05-04 https://scifaro.com/en/abs/approximation-algorithms-for-the-connected-sensor-cover-problem-1505.000812020-01-23 https://scifaro.com/en/abs/strictly-implicit-priority-queues-on-the-number-of-moves-and-worst-case-time-1505.001472015-05-04 https://scifaro.com/en/abs/an-improved-private-mechanism-for-small-databases-1505.002442015-05-04 https://scifaro.com/en/abs/optimal-search-trees-with-2-way-comparisons-1505.003572021-03-10 https://scifaro.com/en/abs/triple-state-quicksort-a-replacement-for-the-c-c-library-qsort-1505.005582015-05-12 https://scifaro.com/en/abs/anonymous-graph-exploration-with-binoculars-1505.005992015-05-05 https://scifaro.com/en/abs/on-the-threshold-of-intractability-1505.006122015-05-05 https://scifaro.com/en/abs/using-higher-order-fourier-analysis-over-general-fields-1505.006192015-05-05 https://scifaro.com/en/abs/optimal-learning-via-the-fourier-transform-for-sums-of-independent-integer-random-variables-1505.006622015-11-24 https://scifaro.com/en/abs/dual-failure-resilient-bfs-structure-1505.006922015-05-05 https://scifaro.com/en/abs/n-level-hypergraph-partitioning-1505.006932015-05-05 https://scifaro.com/en/abs/parameterized-approximation-algorithms-for-packing-problems-1505.007092015-05-05 https://scifaro.com/en/abs/a-family-of-greedy-algorithms-for-finding-maximum-independent-sets-1505.007522015-05-05 https://scifaro.com/en/abs/dynamic-consistency-of-conditional-simple-temporal-networks-via-mean-payoff-games-a-singly-exponential-time-dc-checking-1505.008282015-07-20 https://scifaro.com/en/abs/evaluating-the-potential-of-a-dual-randomized-kaczmarz-solver-for-laplacian-linear-systems-1505.008752015-10-07 https://scifaro.com/en/abs/approximation-ratio-of-ld-algorithm-for-multi-processor-scheduling-and-the-coffman-sethi-conjecture-1505.010052015-05-08 https://scifaro.com/en/abs/depth-first-search-in-split-by-edges-trees-1505.011402015-05-06 https://scifaro.com/en/abs/implementation-of-bt-trees-1505.012102015-05-07 https://scifaro.com/en/abs/improved-approximation-algorithms-for-stochastic-matching-1505.014392015-05-07 https://scifaro.com/en/abs/public-transit-labeling-1505.014462015-05-07 https://scifaro.com/en/abs/maximum-matching-in-turnstile-streams-1505.014602015-05-07 https://scifaro.com/en/abs/tight-bounds-for-linear-sketches-of-approximate-matchings-1505.014672015-05-07 https://scifaro.com/en/abs/fast-and-powerful-hashing-using-tabulation-1505.015232017-01-04 https://scifaro.com/en/abs/kernelization-via-sampling-with-applications-to-dynamic-graph-streams-1505.017312015-05-08 https://scifaro.com/en/abs/on-the-minimum-labelling-spanning-bi-connected-subgraph-problem-1505.017422015-05-08 https://scifaro.com/en/abs/a-simpler-sublinear-algorithm-for-approximating-the-triangle-count-1505.019272015-05-11 https://scifaro.com/en/abs/applying-sorting-networks-to-synthesize-optimized-sorting-libraries-1505.019622017-08-09 https://scifaro.com/en/abs/sublinear-estimation-of-weighted-matchings-in-dynamic-data-streams-1505.020192015-07-10 https://scifaro.com/en/abs/evaluate-and-compare-two-utilization-based-schedulability-test-frameworks-for-real-time-systems-1505.021552016-09-26 https://scifaro.com/en/abs/network-filtering-for-big-data-triangulated-maximally-filtered-graph-1505.024452015-08-26 https://scifaro.com/en/abs/socio-spatial-group-queries-for-impromptu-activity-planning-1505.026812024-03-01 https://scifaro.com/en/abs/refining-the-analysis-of-divide-and-conquer-how-and-when-1505.028202015-09-28 https://scifaro.com/en/abs/polynomial-enumeration-of-chordless-cycles-on-cyclically-orientable-graphs-1505.028292015-05-13 https://scifaro.com/en/abs/adaptive-computation-of-the-klee-s-measure-in-high-dimensions-1505.028552015-10-05 https://scifaro.com/en/abs/efficient-data-hashing-with-structured-binary-embeddings-1505.031902015-05-14 https://scifaro.com/en/abs/streaming-property-testing-of-visibly-pushdown-languages-1505.033342015-11-04 https://scifaro.com/en/abs/k2q-a-quadratic-form-response-time-and-schedulability-analysis-framework-for-utilization-based-analysis-1505.038832016-09-26 https://scifaro.com/en/abs/k-center-clustering-under-perturbation-resilience-1505.039242019-01-01 https://scifaro.com/en/abs/linear-time-superbubble-identification-algorithm-for-genome-assembly-1505.040192015-09-18 https://scifaro.com/en/abs/greedy-matching-guarantees-and-limitations-1505.041982015-05-19 https://scifaro.com/en/abs/container-relocation-problem-approximation-asymptotic-and-incomplete-information-1505.042292015-10-08 https://scifaro.com/en/abs/partitioned-multiprocessor-fixed-priority-scheduling-of-sporadic-real-time-tasks-1505.046932016-06-23 https://scifaro.com/en/abs/read-mapping-on-de-bruijn-graph-1505.049112018-02-14 https://scifaro.com/en/abs/better-distance-preservers-and-additive-spanners-1505.055992021-08-17 https://scifaro.com/en/abs/extended-fast-search-clustering-algorithm-widely-density-clusters-no-density-peaks-1505.056102015-05-22 https://scifaro.com/en/abs/very-sparse-additive-spanners-and-emulators-1505.056302021-06-08 https://scifaro.com/en/abs/graph-edit-distance-a-new-binary-linear-programming-formulation-1505.057402015-05-22 https://scifaro.com/en/abs/graph-colouring-algorithms-1505.058252015-05-22 https://scifaro.com/en/abs/nearest-neighbor-based-clustering-algorithm-for-large-data-sets-1505.059622015-05-25 https://scifaro.com/en/abs/variable-neighborhood-search-for-solving-bandwidth-coloring-problem-1505.060322019-02-20 https://scifaro.com/en/abs/diffusion-methods-for-classification-with-pairwise-relationships-1505.060722019-05-16 https://scifaro.com/en/abs/local-ranking-problem-on-the-browsegraph-1505.063862015-05-26 https://scifaro.com/en/abs/an-algorithm-for-multipication-of-kaluza-numbers-1505.064252015-05-26 https://scifaro.com/en/abs/an-efficient-dynamic-programming-algorithm-for-the-generalized-lcs-problem-with-multiple-substring-inclusive-constraints-1505.065292015-05-26 https://scifaro.com/en/abs/an-improved-combinatorial-algorithm-for-boolean-matrix-multiplication-1505.068112015-05-27 https://scifaro.com/en/abs/robust-recoverable-and-two-stage-selection-problems-1505.068932017-08-15 https://scifaro.com/en/abs/research-on-solution-space-of-bipartite-graph-vertex-cover-by-maximum-matchings-1505.069552015-12-09 https://scifaro.com/en/abs/new-geometric-algorithms-for-fully-connected-staged-self-assembly-1505.078622017-01-03 https://scifaro.com/en/abs/a-large-neighbourhood-based-heuristic-for-two-echelon-routing-problems-1505.080032016-10-05 https://scifaro.com/en/abs/a-quasi-random-approach-to-matrix-spectral-analysis-1505.081262017-04-07 https://scifaro.com/en/abs/an-efficient-dynamic-programming-algorithm-for-str-ic-seq-ec-lcs-problem-1506.000632015-06-02 https://scifaro.com/en/abs/team-performance-with-test-scores-1506.001472018-03-28 https://scifaro.com/en/abs/privacy-for-the-protected-only-1506.002422015-06-02 https://scifaro.com/en/abs/sample-optimal-density-estimation-in-nearly-linear-time-1506.006712015-06-03 https://scifaro.com/en/abs/characterisation-of-strongly-stable-matchings-1506.006772015-06-03 https://scifaro.com/en/abs/sensor-placement-by-maximal-projection-on-minimum-eigenspace-for-linear-inverse-problems-1506.007472016-11-08 https://scifaro.com/en/abs/parameterized-mixed-cluster-editing-via-modular-decomposition-1506.009442015-06-03 https://scifaro.com/en/abs/an-improved-upper-bound-on-maximal-clique-listing-via-rectangular-fast-matrix-multiplication-1506.010822015-08-25 https://scifaro.com/en/abs/a-nearly-optimal-and-agnostic-algorithm-for-properly-learning-a-mixture-of-k-gaussians-for-any-constant-k-1506.013672015-06-04 https://scifaro.com/en/abs/taylor-polynomial-estimator-for-estimating-frequency-moments-1506.014422015-06-05 https://scifaro.com/en/abs/weighted-sampling-without-replacement-from-data-streams-1506.017472015-06-08 https://scifaro.com/en/abs/metric-dimension-parameterized-by-max-leaf-number-1506.017492015-06-11 https://scifaro.com/en/abs/approximation-and-fixed-parameter-subquadratic-algorithms-for-radius-and-diameter-1506.017992015-06-08 https://scifaro.com/en/abs/learning-from-rational-behavior-predicting-solutions-to-unknown-linear-programs-1506.021622016-10-27 https://scifaro.com/en/abs/catching-the-head-tail-and-everything-in-between-a-streaming-algorithm-for-the-degree-distribution-1506.025742015-11-30 https://scifaro.com/en/abs/fast-and-simple-connectivity-in-graph-timelines-1506.029732015-06-10 https://scifaro.com/en/abs/symmetric-tensor-completion-from-multilinear-entries-and-learning-product-mixtures-over-the-hypercube-1506.031372015-11-25 https://scifaro.com/en/abs/relative-select-1506.032622015-06-11 https://scifaro.com/en/abs/multidimensional-binary-vector-assignment-problem-standard-structural-and-above-guarantee-parameterizations-1506.032822023-06-22 https://scifaro.com/en/abs/a-non-oblivious-reduction-of-counting-ones-to-multiplication-1506.034732015-06-12 https://scifaro.com/en/abs/amortized-rotation-cost-in-avl-trees-1506.035282015-06-12 https://scifaro.com/en/abs/from-independence-to-expansion-and-back-again-1506.036762015-06-12 https://scifaro.com/en/abs/a-tight-algorithm-for-strongly-connected-steiner-subgraph-on-two-terminals-with-demands-1506.037602016-04-07 https://scifaro.com/en/abs/improved-greedy-algorithm-for-set-covering-problem-1506.042202015-06-16 https://scifaro.com/en/abs/drawing-large-graphs-by-multilevel-maxent-stress-optimization-1506.043832015-08-11 https://scifaro.com/en/abs/densest-subgraph-in-dynamic-graph-streams-1506.044172015-06-16 https://scifaro.com/en/abs/optimal-online-algorithms-for-the-multi-objective-time-series-search-problem-1506.044742016-05-02 https://scifaro.com/en/abs/error-tree-a-tree-structure-for-hamming-edit-distances-wildcards-matching-1506.044862020-08-25 https://scifaro.com/en/abs/tree-compression-with-top-trees-revisited-1506.044992015-06-16 https://scifaro.com/en/abs/applications-of-uniform-sampling-densest-subgraph-and-beyond-1506.045052015-07-30 https://scifaro.com/en/abs/linear-algorithm-for-conservative-degenerate-pattern-matching-1506.045592015-06-16 https://scifaro.com/en/abs/eertree-an-efficient-data-structure-for-processing-palindromes-in-strings-1506.048622015-08-18 https://scifaro.com/en/abs/efficient-reverse-k-nearest-neighbor-evaluation-for-hierarchical-index-1506.048672015-06-17 https://scifaro.com/en/abs/fm-index-for-dummies-1506.048962015-10-27 https://scifaro.com/en/abs/linear-time-sequence-comparison-using-minimal-absent-words-applications-1506.049172015-12-23 https://scifaro.com/en/abs/an-improved-distributed-algorithm-for-maximal-independent-set-1506.050932015-07-14 https://scifaro.com/en/abs/fast-multiple-order-preserving-matching-algorithms-1506.052032015-06-18 https://scifaro.com/en/abs/mrf-zoom-a-fast-dictionary-searching-algorithm-for-magnetic-resonance-fingerprinting-1506.053932017-10-31 https://scifaro.com/en/abs/a-parameterized-approximation-algorithm-for-the-mixed-and-windy-capacitated-arc-routing-problem-theory-and-experiments-1506.056202019-11-14 https://scifaro.com/en/abs/a-new-perspective-on-clustered-planarity-as-a-combinatorial-embedding-problem-1506.056732015-06-19 https://scifaro.com/en/abs/simultaneous-embedding-edge-orderings-relative-positions-cutvertices-1506.057152015-06-19 https://scifaro.com/en/abs/an-o-m-2-log-m-competitive-algorithm-for-online-machine-minimization-1506.057212015-06-19 https://scifaro.com/en/abs/a-faster-algorithm-for-fully-dynamic-betweenness-centrality-1506.057832022-04-21 https://scifaro.com/en/abs/enumerating-cyclic-orientations-of-a-graph-1506.059772015-06-22 https://scifaro.com/en/abs/on-euclid-s-algorithm-and-elementary-number-theory-1506.059812023-08-21 https://scifaro.com/en/abs/complexity-of-a-disjoint-matching-problem-on-bipartite-graphs-1506.061572015-06-23 https://scifaro.com/en/abs/big-step-greedy-algorithm-for-maximum-coverage-problem-1506.061632015-09-25 https://scifaro.com/en/abs/upper-bound-on-the-number-of-steps-for-solving-the-subset-sum-problem-by-the-branch-and-bound-method-1506.062842015-06-23 https://scifaro.com/en/abs/approximate-hypergraph-coloring-under-low-discrepancy-and-related-promises-1506.064442015-06-23 https://scifaro.com/en/abs/filling-the-complexity-gaps-for-colouring-planar-and-bounded-degree-graphs-1506.065642019-02-08 https://scifaro.com/en/abs/randomized-composable-core-sets-for-distributed-submodular-maximization-1506.067152015-06-23 https://scifaro.com/en/abs/enhanced-covers-of-regular-indeterminate-strings-using-prefix-tables-1506.067932015-06-24 https://scifaro.com/en/abs/linear-algorithms-for-computing-the-lyndon-border-array-and-the-lyndon-suffix-array-1506.069832015-06-24 https://scifaro.com/en/abs/fully-dynamic-matching-in-bipartite-graphs-1506.070762015-08-18 https://scifaro.com/en/abs/chaining-fragments-in-sequences-to-sweep-or-not-1506.074582015-06-25 https://scifaro.com/en/abs/towards-resistance-sparsifiers-1506.075682015-06-26 https://scifaro.com/en/abs/an-experimental-evaluation-of-the-best-of-many-christofides-algorithm-for-the-traveling-salesman-problem-1506.077762015-06-26 https://scifaro.com/en/abs/efficient-computation-of-middle-levels-gray-codes-1506.078982017-06-21 https://scifaro.com/en/abs/correlation-clustering-and-biclustering-with-locally-bounded-errors-1506.081892016-05-25 https://scifaro.com/en/abs/sparsified-cholesky-solvers-for-sdd-linear-systems-1506.082042015-08-14 https://scifaro.com/en/abs/greedy-is-an-almost-optimal-deque-1506.083192015-08-20 https://scifaro.com/en/abs/a-linear-size-logarithmic-stretch-path-reporting-distance-oracle-for-general-graphs-1506.083922015-06-30 https://scifaro.com/en/abs/a-polynomial-kernel-for-block-graph-deletion-1506.084772016-01-18 https://scifaro.com/en/abs/fast-computation-of-abelian-runs-1506.085182017-01-02 https://scifaro.com/en/abs/commutativity-in-the-algorithmic-lovasz-local-lemma-1506.085472018-09-05 https://scifaro.com/en/abs/fast-and-vectorizable-alternative-to-binary-search-in-o-1-applicable-to-a-wide-domain-of-sorted-arrays-of-floating-point-numbers-1506.086202017-12-01 https://scifaro.com/en/abs/a-comparative-study-of-divisive-hierarchical-clustering-algorithms-1506.089772018-09-07 https://scifaro.com/en/abs/polynomial-time-construction-of-optimal-tree-structured-communication-data-layout-descriptions-1506.091002015-07-01 https://scifaro.com/en/abs/on-fair-size-based-scheduling-1506.091582015-07-01 https://scifaro.com/en/abs/improved-competitive-analysis-of-online-scheduling-deadline-sensitive-jobs-1506.092082015-09-14 https://scifaro.com/en/abs/private-approximations-of-the-2nd-moment-matrix-using-existing-techniques-in-linear-regression-1507.000562015-11-26 https://scifaro.com/en/abs/improved-purely-additive-fault-tolerant-spanners-1507.005052015-07-03 https://scifaro.com/en/abs/i-o-efficient-similarity-join-1507.005522017-03-29 https://scifaro.com/en/abs/approximation-algorithms-for-connected-maximum-cut-and-related-problems-1507.006482015-07-03 https://scifaro.com/en/abs/on-the-approximability-of-digraph-ordering-1507.006622015-07-03 https://scifaro.com/en/abs/approximate-deadline-scheduling-with-precedence-constraints-1507.007482015-07-06 https://scifaro.com/en/abs/truthful-online-scheduling-with-commitments-1507.007732015-07-06 https://scifaro.com/en/abs/online-self-indexed-grammar-compression-1507.008052015-07-07 https://scifaro.com/en/abs/explicit-expanding-expanders-1507.011962015-07-07 https://scifaro.com/en/abs/computing-runs-on-a-general-alphabet-1507.012312015-11-24 https://scifaro.com/en/abs/approximating-unweighted-tree-augmentation-via-lift-and-project-part-ii-1507.013092015-09-01 https://scifaro.com/en/abs/diffnodesets-an-efficient-structure-for-fast-mining-frequent-itemsets-1507.013452018-01-12 https://scifaro.com/en/abs/sorting-and-permuting-without-bank-conflicts-on-gpus-1507.013912015-07-07 https://scifaro.com/en/abs/sorting-networks-to-the-end-and-back-again-1507.014282017-08-09 https://scifaro.com/en/abs/fast-and-simple-computation-of-top-k-closeness-centralities-1507.014902015-07-07 https://scifaro.com/en/abs/log-lists-and-their-applications-to-sorting-by-transpositions-reversals-and-block-interchanges-1507.015122015-10-29 https://scifaro.com/en/abs/a-fixed-parameter-tractable-approximation-scheme-for-the-optimal-cut-graph-of-a-surface-1507.016882015-07-08 https://scifaro.com/en/abs/path-fault-tolerant-approximate-shortest-path-trees-1507.016952015-07-08 https://scifaro.com/en/abs/the-temp-secretary-problem-1507.017322015-07-09 https://scifaro.com/en/abs/space-efficient-plane-sweep-algorithms-1507.017672016-04-25 https://scifaro.com/en/abs/the-restricted-isometry-property-of-subsampled-fourier-matrices-1507.017682015-10-14 https://scifaro.com/en/abs/polynomial-time-isomorphism-test-of-groups-that-are-tame-extensions-1507.019172015-07-10 https://scifaro.com/en/abs/efficient-implementation-of-a-synchronous-parallel-push-relabel-algorithm-1507.019262015-07-27 https://scifaro.com/en/abs/on-the-pathwidth-of-almost-semicomplete-digraphs-1507.019342015-07-08 https://scifaro.com/en/abs/dynamic-reallocation-problems-in-scheduling-1507.019812016-02-16 https://scifaro.com/en/abs/random-walks-and-evolving-sets-faster-convergences-and-limitations-1507.020692015-07-09 https://scifaro.com/en/abs/independence-and-efficient-domination-on-p-6-free-graphs-1507.021632015-09-02 https://scifaro.com/en/abs/edge-bipartization-faster-than-2-k-1507.021682017-03-29 https://scifaro.com/en/abs/directed-multicut-is-w-1-hard-even-for-four-terminal-pairs-1507.021782018-02-13 https://scifaro.com/en/abs/the-art-of-trellis-decoding-is-fixed-parameter-tractable-1507.021842018-05-16 https://scifaro.com/en/abs/l-infinity-isotonic-regression-for-linear-multidimensional-and-tree-orders-1507.022262017-06-26 https://scifaro.com/en/abs/using-optimization-to-obtain-a-width-independent-parallel-simpler-and-faster-positive-sdp-solver-1507.022592016-01-12 https://scifaro.com/en/abs/optimal-approximate-matrix-product-in-terms-of-stable-rank-1507.022682016-03-03 https://scifaro.com/en/abs/distinguishing-hidden-markov-chains-1507.023142016-05-10 https://scifaro.com/en/abs/a-faster-pseudopolynomial-time-algorithm-for-subset-sum-1507.023182016-12-13 https://scifaro.com/en/abs/multisection-in-the-stochastic-block-model-using-semidefinite-programming-1507.023232015-07-10 https://scifaro.com/en/abs/online-algorithms-for-multi-level-aggregation-1507.023782016-12-30 https://scifaro.com/en/abs/maximum-matching-width-new-characterizations-and-a-fast-algorithm-for-dominating-set-1507.023842015-07-10 https://scifaro.com/en/abs/planar-ultrametric-rounding-for-image-segmentation-1507.024072015-09-11 https://scifaro.com/en/abs/algorithmic-complexity-of-power-law-networks-1507.024262015-07-10 https://scifaro.com/en/abs/discovering-archipelagos-of-tractability-for-constraint-satisfaction-and-counting-1507.024792015-07-21 https://scifaro.com/en/abs/differentially-private-ordinary-least-squares-1507.024822017-08-23 https://scifaro.com/en/abs/an-algorithm-for-fast-computation-of-the-multiresolution-discrete-fourier-transform-1507.025252015-07-10 https://scifaro.com/en/abs/sublinear-distance-labeling-1507.026182016-09-09 https://scifaro.com/en/abs/a-simplified-1-5-approximation-algorithm-for-augmenting-edge-connectivity-of-a-graph-from-1-to-2-1507.027992015-07-13 https://scifaro.com/en/abs/calibrations-scheduling-problem-with-arbitrary-lengths-and-activation-length-1507.028082020-02-05 https://scifaro.com/en/abs/finger-search-in-grammar-compressed-strings-1507.028532016-11-17 https://scifaro.com/en/abs/a-bloom-filter-based-semi-index-on-q-grams-1507.029892022-07-26 https://scifaro.com/en/abs/a-1-75-lp-approximation-for-the-tree-augmentation-problem-1507.030092015-07-19 https://scifaro.com/en/abs/micro-clustering-finding-small-clusters-in-large-diversity-1507.030672016-06-07 https://scifaro.com/en/abs/coveringlsh-locality-sensitive-hashing-without-false-negatives-1507.032252016-01-08 https://scifaro.com/en/abs/deciding-circular-arc-graph-isomorphism-in-parameterized-logspace-1507.033482018-02-02 https://scifaro.com/en/abs/testing-shape-restrictions-of-discrete-distributions-1507.035582016-01-22 https://scifaro.com/en/abs/deadline-aware-power-management-in-data-centers-1507.036482015-07-19 https://scifaro.com/en/abs/a-new-framework-for-distributed-submodular-maximization-1507.037192016-08-15 https://scifaro.com/en/abs/tight-bounds-for-subgraph-isomorphism-and-graph-homomorphism-1507.037382015-07-15 https://scifaro.com/en/abs/a-lower-bound-on-supporting-predecessor-search-in-k-sorted-arrays-1507.038232015-07-15 https://scifaro.com/en/abs/distance-labeling-schemes-for-trees-1507.040462015-07-16 https://scifaro.com/en/abs/stream-verification-1507.041882015-07-16 https://scifaro.com/en/abs/a-numerical-analysis-of-quicksort-how-many-cases-are-bad-cases-1507.042202015-07-16 https://scifaro.com/en/abs/a-bi-criteria-approximation-algorithm-for-k-means-1507.042272015-08-04 https://scifaro.com/en/abs/tight-lower-bounds-for-data-dependent-locality-sensitive-hashing-1507.042992015-07-16 https://scifaro.com/en/abs/the-bernstein-mechanism-function-release-under-differential-privacy-1507.044992016-12-12 https://scifaro.com/en/abs/the-complexity-of-all-switches-strategy-improvement-1507.045002023-06-22 https://scifaro.com/en/abs/simple-and-fast-rounding-algorithms-for-directed-and-node-weighted-multiway-cut-1507.046742015-07-17 https://scifaro.com/en/abs/extension-complexity-mso-logic-and-treewidth-1507.049072023-06-22 https://scifaro.com/en/abs/probabilistic-polynomials-and-hamming-nearest-neighbors-1507.051062016-11-18 https://scifaro.com/en/abs/tight-lower-bounds-for-planted-clique-in-the-degree-4-sos-program-1507.051362016-03-15 https://scifaro.com/en/abs/an-algorithm-for-discrete-fractional-hadamard-transform-1507.053872015-07-21 https://scifaro.com/en/abs/solving-problems-on-graphs-of-high-rank-width-1507.054632015-07-21 https://scifaro.com/en/abs/meta-kernelization-using-well-structured-modulators-1507.055442015-07-21 https://scifaro.com/en/abs/a-semidefinite-program-for-unbalanced-multisection-in-the-stochastic-block-model-1507.056052016-12-05 https://scifaro.com/en/abs/on-structural-parameterizations-of-hitting-set-hitting-paths-in-graphs-using-2-sat-1507.058902015-07-27 https://scifaro.com/en/abs/faster-worst-case-deterministic-dynamic-connectivity-1507.059442015-11-05 https://scifaro.com/en/abs/optimal-testing-for-properties-of-distributions-1507.059522015-12-09 https://scifaro.com/en/abs/towards-single-face-shortest-vertex-disjoint-paths-in-undirected-planar-graphs-1507.059802015-07-23 https://scifaro.com/en/abs/fast-bidirectional-probability-estimation-in-markov-models-1507.059982015-11-05 https://scifaro.com/en/abs/personalized-pagerank-estimation-and-search-a-bidirectional-approach-1507.059992015-12-16 https://scifaro.com/en/abs/building-a-good-team-secretary-problems-and-the-supermodular-degree-1507.061992015-07-23 https://scifaro.com/en/abs/sublinear-space-distance-labeling-using-hubs-1507.062402016-07-21 https://scifaro.com/en/abs/parameterized-lower-bound-and-np-completeness-of-some-h-free-edge-deletion-problems-1507.063412015-09-15 https://scifaro.com/en/abs/robust-monotone-submodular-function-maximization-1507.066162018-10-31 https://scifaro.com/en/abs/connectivity-algorithm-1507.066772015-07-27 https://scifaro.com/en/abs/compressed-data-structures-for-dynamic-sequences-1507.068662015-07-27 https://scifaro.com/en/abs/pattern-avoiding-access-in-binary-search-trees-1507.069532015-08-20 https://scifaro.com/en/abs/string-comparison-in-v-order-new-lexicographic-properties-on-line-applications-1507.070382015-07-28 https://scifaro.com/en/abs/range-predecessor-and-lempel-ziv-parsing-1507.070802015-07-28 https://scifaro.com/en/abs/improved-approximations-for-cubic-and-cubic-bipartite-tsp-1507.071212016-06-27 https://scifaro.com/en/abs/spatial-mixing-and-approximate-counting-for-potts-model-on-graphs-with-bounded-average-degree-1507.072252015-07-28 https://scifaro.com/en/abs/a-deterministic-algorithm-for-maximizing-submodular-functions-1507.072372015-07-28 https://scifaro.com/en/abs/spectral-structure-of-singular-spectrum-decomposition-for-time-series-1507.073302015-07-28 https://scifaro.com/en/abs/a-combinatorial-approximation-algorithm-for-graph-balancing-with-light-hyper-edges-1507.073962015-10-05 https://scifaro.com/en/abs/partial-resampling-to-approximate-covering-integer-programs-1507.074022023-10-13 https://scifaro.com/en/abs/fully-online-suffix-tree-and-directed-acyclic-word-graph-construction-for-multiple-texts-1507.076222018-07-13 https://scifaro.com/en/abs/prime-factorization-of-the-kirchhoff-polynomial-compact-enumeration-of-arborescences-1507.077272024-08-06 https://scifaro.com/en/abs/duality-and-nonlinear-graph-laplacians-1507.077892015-07-29 https://scifaro.com/en/abs/flow-rounding-1507.081392015-07-30 https://scifaro.com/en/abs/fast-biclustering-by-dual-parameterization-1507.081582015-07-30 https://scifaro.com/en/abs/approximating-dense-max-2-csps-1507.083482015-07-31 https://scifaro.com/en/abs/the-submodular-secretary-problem-goes-linear-1507.083842015-07-31 https://scifaro.com/en/abs/randomised-rounding-with-applications-1507.085012015-07-31 https://scifaro.com/en/abs/bidirectional-pagerank-estimation-from-average-case-to-worst-case-1507.087052015-12-16 https://scifaro.com/en/abs/a-cubic-vertex-kernel-for-diamond-free-edge-deletion-and-more-1507.087922016-01-01 https://scifaro.com/en/abs/on-the-displacement-for-covering-a-unit-interval-with-randomly-placed-sensors-1507.089232016-06-23 https://scifaro.com/en/abs/on-non-canonical-solving-the-satisfiability-problem-1508.001232016-03-03 https://scifaro.com/en/abs/online-contention-resolution-schemes-1508.001422015-10-15 https://scifaro.com/en/abs/a-provably-linear-time-in-place-and-stable-merge-algorithm-via-the-perfect-shuffle-1508.002922015-08-04 https://scifaro.com/en/abs/coding-for-interactive-communication-correcting-insertions-and-deletions-1508.005142016-05-25 https://scifaro.com/en/abs/non-commutative-edmonds-problem-and-matrix-semi-invariants-1508.006902016-06-20 https://scifaro.com/en/abs/the-k-mismatch-problem-revisited-1508.007312015-08-28 https://scifaro.com/en/abs/offline-and-online-models-of-budget-allocation-for-maximizing-influence-spread-1508.010592018-03-13 https://scifaro.com/en/abs/bin-packing-problem-two-approximation-algorithms-1508.013762015-08-07 https://scifaro.com/en/abs/an-o-1-approximation-for-minimum-spanning-tree-interdiction-1508.014482015-08-07 https://scifaro.com/en/abs/resource-oblivious-sorting-on-multicores-1508.015042017-11-03 https://scifaro.com/en/abs/a-parameterized-complexity-view-on-non-preemptively-scheduling-interval-constrained-jobs-few-machines-small-looseness-and-small-slack-1508.016572017-05-25 https://scifaro.com/en/abs/practical-algorithms-for-finding-extremal-sets-1508.017532015-08-10 https://scifaro.com/en/abs/generalized-multiple-depot-traveling-salesmen-problem-polyhedral-study-and-exact-algorithm-1508.018132015-08-11 https://scifaro.com/en/abs/the-mixing-time-of-the-dikin-walk-in-a-polytope-a-simple-proof-1508.019772016-08-10 https://scifaro.com/en/abs/deterministic-algorithms-for-submodular-maximization-problems-1508.021572015-08-11 https://scifaro.com/en/abs/two-particle-in-grid-realisations-on-spacetrees-1508.024352016-01-11 https://scifaro.com/en/abs/unified-acceleration-method-for-packing-and-covering-problems-via-diameter-reduction-1508.024392015-10-07 https://scifaro.com/en/abs/relative-suffix-trees-1508.025502017-12-18 https://scifaro.com/en/abs/technical-note-split-algorithm-in-o-n-for-the-capacitated-vehicle-routing-problem-1508.027592018-05-08 https://scifaro.com/en/abs/editing-to-a-planar-graph-of-given-degrees-1508.027732015-08-13 https://scifaro.com/en/abs/space-efficient-detection-of-unusual-words-1508.029682015-08-13 https://scifaro.com/en/abs/multiple-path-selection-for-new-highway-alignments-using-discrete-algorithms-1508.030642015-08-14 https://scifaro.com/en/abs/mergeshuffle-a-very-fast-parallel-random-permutation-algorithm-1508.031672015-08-14 https://scifaro.com/en/abs/constructing-linear-sized-spectral-sparsification-in-almost-linear-time-1508.032612015-08-14 https://scifaro.com/en/abs/a-randomized-rounding-algorithm-for-sparse-pca-1508.033372016-11-24 https://scifaro.com/en/abs/codon-context-optimization-in-synthetic-gene-design-1508.034282015-08-17 https://scifaro.com/en/abs/analyzing-the-performance-of-lock-free-data-structures-a-conflict-based-model-1508.035662015-08-17 https://scifaro.com/en/abs/fast-witness-extraction-using-a-decision-oracle-1508.035722015-08-17 https://scifaro.com/en/abs/online-assignment-of-heterogeneous-tasks-in-crowdsourcing-markets-1508.035932015-08-17 https://scifaro.com/en/abs/metric-embedding-with-outliers-1508.036002015-08-17 https://scifaro.com/en/abs/the-complexity-of-cyber-attacks-in-a-new-layered-security-model-and-the-maximum-weight-rooted-subtree-problem-1508.036572015-08-18 https://scifaro.com/en/abs/sorting-under-1-infty-cost-model-1508.036982015-11-12 https://scifaro.com/en/abs/coordination-complexity-small-information-coordinating-large-populations-1508.037352016-01-06 https://scifaro.com/en/abs/a-tale-of-two-metrics-simultaneous-bounds-on-competitiveness-and-regret-1508.037692015-08-18 https://scifaro.com/en/abs/locality-preserving-allocations-problems-and-coloured-bin-packing-1508.039922015-08-18 https://scifaro.com/en/abs/near-optimal-distributed-maximum-flow-1508.047472015-08-20 https://scifaro.com/en/abs/alignment-of-protein-coding-sequences-with-frameshift-extension-penalties-1508.047832015-08-21 https://scifaro.com/en/abs/a-faster-cutting-plane-method-and-its-implications-for-combinatorial-and-convex-optimization-1508.048742015-11-06 https://scifaro.com/en/abs/a-discrete-and-bounded-envy-free-cake-cutting-protocol-for-four-agents-1508.051432016-04-07 https://scifaro.com/en/abs/optimal-algorithms-and-lower-bounds-for-testing-closeness-of-structured-distributions-1508.055382015-08-25 https://scifaro.com/en/abs/a-practical-o-r-log-log-n-n-time-algorithm-for-computing-the-longest-common-subsequence-1508.055532015-08-25 https://scifaro.com/en/abs/dual-based-approximation-algorithms-for-cut-based-network-connectivity-problems-1508.055672017-07-24 https://scifaro.com/en/abs/on-the-displacement-for-covering-a-d-dimensional-cube-with-randomly-placed-sensors-1508.057862015-08-25 https://scifaro.com/en/abs/formulations-and-algorithms-for-the-multiple-depot-fuel-constrained-multiple-vehicle-routing-problem-1508.059682015-08-26 https://scifaro.com/en/abs/dense-subset-sum-may-be-the-hardest-1508.060192015-08-26 https://scifaro.com/en/abs/cardinality-estimation-meets-good-turing-1508.062162015-08-26 https://scifaro.com/en/abs/full-text-and-keyword-indexes-for-string-searching-1508.066102015-08-27 https://scifaro.com/en/abs/tight-lower-bounds-for-the-workflow-satisfiability-problem-based-on-the-strong-exponential-time-hypothesis-1508.068292015-08-28 https://scifaro.com/en/abs/a-dual-descent-algorithm-for-node-capacitated-multiflow-problems-and-its-applications-1508.070652018-10-30 https://scifaro.com/en/abs/graphulo-linear-algebra-graph-kernels-for-nosql-databases-1508.073722016-11-11 https://scifaro.com/en/abs/colored-bin-packing-1508.073802015-09-01 https://scifaro.com/en/abs/approximating-unweighted-tree-augmentation-via-lift-and-project-part-i-stemless-tap-1508.075042015-09-01 https://scifaro.com/en/abs/intersection-link-representations-of-graphs-1508.075572015-09-01 https://scifaro.com/en/abs/non-negative-submodular-stochastic-probing-via-stochastic-contention-resolution-schemes-1508.077712015-09-04 https://scifaro.com/en/abs/interval-scheduling-maximizing-minimum-coverage-1508.078202015-11-02 https://scifaro.com/en/abs/towards-tight-bounds-for-the-streaming-set-cover-problem-1509.001182016-05-03 https://scifaro.com/en/abs/on-minimizing-crossings-in-storyline-visualizations-1509.004422016-08-03 https://scifaro.com/en/abs/l-drawings-of-directed-graphs-1509.006842015-09-03 https://scifaro.com/en/abs/variants-of-plane-diameter-completion-1509.007572015-09-03 https://scifaro.com/en/abs/finding-near-optimal-independent-sets-at-scale-1509.007642015-09-03 https://scifaro.com/en/abs/testing-properties-of-functions-on-finite-groups-1509.009302015-09-04 https://scifaro.com/en/abs/on-the-equivalence-among-problems-of-bounded-width-1509.010142015-09-04 https://scifaro.com/en/abs/finding-the-leftmost-critical-factorization-on-unordered-alphabet-1509.010182016-04-12 https://scifaro.com/en/abs/advanced-multilevel-node-separator-algorithms-1509.011902015-09-04 https://scifaro.com/en/abs/optimization-and-reoptimization-in-scheduling-problems-1509.016302015-09-08 https://scifaro.com/en/abs/linear-kernels-for-outbranching-problems-in-sparse-digraphs-1509.016752015-09-08 https://scifaro.com/en/abs/sparsification-of-two-variable-valued-csps-1509.018442015-09-08 https://scifaro.com/en/abs/approximation-of-the-quadratic-knapsack-problem-1509.018662016-05-24 https://scifaro.com/en/abs/a-macro-placer-algorithm-for-chip-design-1509.018672015-09-08 https://scifaro.com/en/abs/querying-probabilistic-neighborhoods-in-spatial-data-sets-efficiently-1509.019902016-08-17 https://scifaro.com/en/abs/per-bucket-concurrent-rehashing-algorithms-1509.022352015-09-09 https://scifaro.com/en/abs/optimizing-static-and-adaptive-probing-schedules-for-rapid-event-detection-1509.024872015-09-11 https://scifaro.com/en/abs/approximating-the-smallest-spanning-subgraph-for-2-edge-connectivity-in-directed-graphs-1509.028412015-09-10 https://scifaro.com/en/abs/practical-and-optimal-lsh-for-angular-distance-1509.028972015-09-10 https://scifaro.com/en/abs/explicit-bounds-for-nondeterministically-testable-hypergraph-parameters-1509.030462015-09-11 https://scifaro.com/en/abs/fast-exact-shortest-path-and-distance-queries-on-road-networks-with-parametrized-costs-1509.031652015-09-11 https://scifaro.com/en/abs/online-buy-at-bulk-network-design-1509.032122015-09-11 https://scifaro.com/en/abs/output-polynomial-enumeration-on-graphs-of-bounded-local-linear-mim-width-1509.037532015-09-16 https://scifaro.com/en/abs/approximability-of-tsp-on-power-law-graphs-1509.039762015-09-15 https://scifaro.com/en/abs/fast-greedy-approaches-for-compressive-sensing-of-large-scale-signals-1509.039792016-03-18 https://scifaro.com/en/abs/raising-the-bar-for-vertex-cover-fixed-parameter-tractability-above-a-higher-guarantee-1509.039902015-09-15 https://scifaro.com/en/abs/stable-nash-equilibria-in-the-gale-shapley-matching-game-1509.043442015-09-16 https://scifaro.com/en/abs/linear-probing-with-5-independent-hashing-1509.045492017-05-12 https://scifaro.com/en/abs/fast-template-matching-by-subsampled-circulant-matrix-1509.048632015-09-17 https://scifaro.com/en/abs/an-fpt-2-approximation-for-tree-cut-decomposition-1509.048802018-05-16 https://scifaro.com/en/abs/maximum-matching-in-general-graphs-without-explicit-consideration-of-blossoms-revisited-1509.049272015-09-17 https://scifaro.com/en/abs/array-layouts-for-comparison-based-searching-1509.050532017-03-16 https://scifaro.com/en/abs/boosting-bayesian-parameter-inference-of-nonlinear-stochastic-differential-equation-models-by-hamiltonian-scale-separation-1509.053052016-04-20 https://scifaro.com/en/abs/searching-for-a-superlinear-lower-bounds-for-the-maximum-consecutive-subsums-problem-and-the-min-convolution-1509.054452015-09-21 https://scifaro.com/en/abs/fptas-for-hardcore-and-ising-models-on-hypergraphs-1509.054942015-09-21 https://scifaro.com/en/abs/streaming-verification-in-data-analysis-1509.055142015-09-21 https://scifaro.com/en/abs/finding-two-edge-disjoint-paths-with-length-constraints-1509.055592015-09-21 https://scifaro.com/en/abs/randomised-enumeration-of-small-witnesses-using-a-decision-oracle-1509.055722018-01-08 https://scifaro.com/en/abs/a-parameterized-algorithm-for-mixed-cut-1509.056122015-09-21 https://scifaro.com/en/abs/lower-bounds-for-approximation-schemes-for-closest-string-1509.058092015-09-22 https://scifaro.com/en/abs/a-certifying-and-dynamic-algorithm-for-the-recognition-of-proper-circular-arc-graphs-1509.058282015-09-22 https://scifaro.com/en/abs/exploiting-reduction-rules-and-data-structures-local-search-for-minimum-vertex-cover-in-massive-graphs-1509.058702015-09-22 https://scifaro.com/en/abs/a-linear-approximation-algorithm-for-the-bpp-with-the-best-possible-absolute-approximation-ratio-1509.060482015-09-22 https://scifaro.com/en/abs/parallel-query-in-the-suffix-tree-1509.061672015-09-30 https://scifaro.com/en/abs/a-note-on-linear-fractional-set-packing-problem-1509.063322015-09-25 https://scifaro.com/en/abs/using-contracted-solution-graphs-for-solving-reconfiguration-problems-1509.063572018-07-13 https://scifaro.com/en/abs/dynamic-graph-connectivity-with-improved-worst-case-update-time-and-sublinear-space-1509.064642015-09-23 https://scifaro.com/en/abs/bin-packing-with-linear-usage-costs-1509.067122015-09-23 https://scifaro.com/en/abs/minimum-weight-perfect-matching-via-blossom-belief-propagation-1509.068492015-09-24 https://scifaro.com/en/abs/dynamic-concurrent-van-emde-boas-array-1509.069482015-09-24 https://scifaro.com/en/abs/finding-perfect-matchings-in-bipartite-hypergraphs-1509.070072016-12-06 https://scifaro.com/en/abs/practical-concurrent-priority-queues-1509.070532015-09-24 https://scifaro.com/en/abs/integer-programming-models-and-parameterized-algorithms-for-controlling-palletizers-1509.072782016-08-02 https://scifaro.com/en/abs/parameterized-algorithms-for-min-max-multiway-cut-and-list-digraph-homomorphism-1509.074042015-09-25 https://scifaro.com/en/abs/deterministic-sparse-suffix-sorting-in-the-restore-model-1509.074172018-03-26 https://scifaro.com/en/abs/minimax-regret-1-median-problem-in-dynamic-path-networks-1509.076002015-09-28 https://scifaro.com/en/abs/connectivity-preserving-iterative-compaction-and-finding-2-disjoint-rooted-paths-in-linear-time-1509.076802015-09-28 https://scifaro.com/en/abs/a-1-epsilon-approximation-for-makespan-scheduling-with-precedence-constraints-using-lp-hierarchies-1509.078082018-02-19 https://scifaro.com/en/abs/inserting-multiple-edges-into-a-planar-graph-1509.079522015-09-29 https://scifaro.com/en/abs/amplification-and-derandomization-without-slowdown-1509.081232015-09-29 https://scifaro.com/en/abs/tight-lower-and-upper-bounds-for-the-complexity-of-canonical-colour-refinement-1509.082512015-09-29 https://scifaro.com/en/abs/parameterized-lower-bounds-and-dichotomy-results-for-the-np-completeness-of-h-free-edge-modification-problems-1509.088072015-09-30 https://scifaro.com/en/abs/fast-algorithms-for-exact-string-matching-1509.092282015-10-01 https://scifaro.com/en/abs/efficiently-finding-all-maximal-alpha-gapped-repeats-1509.092372015-10-01 https://scifaro.com/en/abs/fpt-approximation-schemes-for-maximizing-submodular-functions-1510.002152021-04-21 https://scifaro.com/en/abs/implementing-efficient-all-solutions-sat-solvers-1510.005232016-11-10 https://scifaro.com/en/abs/on-independent-set-on-b1-epg-graphs-1510.005982015-10-05 https://scifaro.com/en/abs/a-note-on-easy-and-efficient-computation-of-full-abelian-periods-of-a-word-1510.006342017-01-02 https://scifaro.com/en/abs/a-note-on-finding-dual-feedback-vertex-set-1510.007732015-10-06 https://scifaro.com/en/abs/existence-of-k-ary-trees-subtree-sizes-heights-and-depths-1510.009582016-07-19 https://scifaro.com/en/abs/design-and-management-of-vehicle-sharing-systems-a-survey-of-algorithmic-approaches-1510.011582015-10-06 https://scifaro.com/en/abs/a-framework-for-estimating-stream-expression-cardinalities-1510.014552016-02-25 https://scifaro.com/en/abs/simultaneous-feedback-vertex-set-a-parameterized-perspective-1510.015572015-10-07 https://scifaro.com/en/abs/logarithmic-regret-bounds-for-bandits-with-knapsacks-1510.018002017-04-12 https://scifaro.com/en/abs/efficient-ranking-of-lyndon-words-and-decoding-lexicographically-minimal-de-bruijn-sequence-1510.026372023-12-13 https://scifaro.com/en/abs/an-improved-combinatorial-polynomial-algorithm-for-the-linear-arrow-debreu-market-1510.026942015-10-19 https://scifaro.com/en/abs/on-the-complexity-of-inner-product-similarity-join-1510.028242016-04-08 https://scifaro.com/en/abs/lempel-ziv-computation-in-compressed-space-lz-cics-1510.028822016-05-31 https://scifaro.com/en/abs/a-shifting-bloom-filter-framework-for-set-queries-1510.030192016-03-23 https://scifaro.com/en/abs/dynamic-sketching-for-graph-optimization-problems-with-applications-to-cut-preserving-sketches-1510.032522015-10-13 https://scifaro.com/en/abs/a-still-simpler-way-of-introducing-the-interior-point-method-for-linear-programming-1510.033392016-12-07 https://scifaro.com/en/abs/on-the-smoothness-of-paging-algorithms-1510.033622015-10-13 https://scifaro.com/en/abs/layered-heaps-beating-standard-and-fibonacci-heaps-in-practice-1510.033672015-10-13 https://scifaro.com/en/abs/linear-vertex-kernel-for-the-problem-of-packing-r-stars-into-a-graph-without-long-induced-paths-1510.035642015-10-14 https://scifaro.com/en/abs/a-faster-subquadratic-algorithm-for-finding-outlier-correlations-1510.038952018-01-08 https://scifaro.com/en/abs/an-o-log-opt-approximation-for-covering-and-packing-minor-models-of-theta-r-1510.039452017-01-23 https://scifaro.com/en/abs/canonical-paths-for-mcmc-from-art-to-science-1510.040992015-10-15 https://scifaro.com/en/abs/column-selection-via-adaptive-sampling-1510.041492015-10-15 https://scifaro.com/en/abs/random-irregular-block-hierarchical-networks-algorithms-for-computation-of-main-properties-1510.042492018-05-04 https://scifaro.com/en/abs/an-improved-randomized-data-structure-for-dynamic-graph-connectivity-1510.045902015-10-16 https://scifaro.com/en/abs/predictive-partitioning-for-efficient-bfs-traversal-in-social-networks-1510.045972015-11-30 https://scifaro.com/en/abs/how-good-is-multi-pivot-quicksort-1510.046762016-06-01 https://scifaro.com/en/abs/improved-solution-to-the-non-domination-level-update-problem-1510.047962015-10-19 https://scifaro.com/en/abs/a-cost-function-for-similarity-based-hierarchical-clustering-1510.050432015-10-20 https://scifaro.com/en/abs/faster-algorithms-to-enumerate-hypergraph-transversals-1510.050932015-10-20 https://scifaro.com/en/abs/fast-parallel-operations-on-search-trees-1510.054332016-05-12 https://scifaro.com/en/abs/preprocessing-under-uncertainty-1510.055032015-10-20 https://scifaro.com/en/abs/input-sparsity-and-hardness-for-robust-subspace-approximation-1510.060732015-10-22 https://scifaro.com/en/abs/computing-lz77-in-run-compressed-space-1510.062572015-10-22 https://scifaro.com/en/abs/subquadratic-algorithms-for-succinct-stable-matching-1510.064522016-12-21 https://scifaro.com/en/abs/generalized-shortest-path-kernel-on-graphs-1510.064922015-11-20 https://scifaro.com/en/abs/hollow-heaps-1510.065352015-10-23 https://scifaro.com/en/abs/memory-adjustable-navigation-piles-with-applications-to-sorting-and-convex-hulls-1510.071852015-10-27 https://scifaro.com/en/abs/on-the-dominating-set-problem-in-random-graphs-1510.071882015-10-27 https://scifaro.com/en/abs/federated-scheduling-admits-no-constant-speedup-factors-for-constrained-deadline-dag-task-systems-1510.072542016-06-23 https://scifaro.com/en/abs/faster-exact-and-parameterized-algorithm-for-feedback-vertex-set-in-tournaments-1510.076762015-10-28 https://scifaro.com/en/abs/fast-compatibility-testing-for-rooted-phylogenetic-trees-1510.077582015-10-28 https://scifaro.com/en/abs/expanders-via-local-edge-flips-1510.077682015-10-28 https://scifaro.com/en/abs/an-o-log-k-log-2-n-competitive-randomized-algorithm-for-the-k-sever-problem-1510.077732015-10-28 https://scifaro.com/en/abs/approximating-betweenness-centrality-in-fully-dynamic-networks-1510.079712015-10-28 https://scifaro.com/en/abs/a-faster-fpt-algorithm-and-a-smaller-kernel-for-block-graph-vertex-deletion-1510.081542015-10-29 https://scifaro.com/en/abs/beyond-level-planarity-1510.082742016-08-30 https://scifaro.com/en/abs/approximate-association-via-dissociation-1510.082762015-10-29 https://scifaro.com/en/abs/scheduling-under-linear-constraints-1510.085512015-10-30 https://scifaro.com/en/abs/mixed-robust-average-submodular-partitioning-fast-algorithms-guarantees-and-applications-to-parallel-machine-learning-and-multi-label-image-segmentation-1510.088652016-08-17 https://scifaro.com/en/abs/a-randomized-algorithm-for-long-directed-cycle-1510.088922015-11-02 https://scifaro.com/en/abs/robust-shift-and-invert-preconditioning-faster-and-more-sample-efficient-algorithms-for-eigenvector-computation-1510.088962016-05-31 https://scifaro.com/en/abs/narrow-gauge-and-analytical-branching-strategies-for-mixed-integer-programming-1511.000212016-01-08 https://scifaro.com/en/abs/shortest-reconfiguration-of-sliding-tokens-on-a-caterpillar-1511.002432015-11-03 https://scifaro.com/en/abs/parameterized-integer-quadratic-programming-variables-and-coefficients-1511.003102017-04-11 https://scifaro.com/en/abs/uniqueness-spatial-mixing-and-approximation-for-ferromagnetic-2-spin-systems-1511.004932018-07-06 https://scifaro.com/en/abs/parameterized-algorithms-for-constraint-satisfaction-problems-above-average-with-global-cardinality-constraints-1511.006482016-10-21 https://scifaro.com/en/abs/beating-countsketch-for-heavy-hitters-in-insertion-streams-1511.006612015-11-03 https://scifaro.com/en/abs/the-4-3-additive-spanner-exponent-is-tight-1511.007002020-05-12 https://scifaro.com/en/abs/distributed-selection-in-o-log-n-time-with-o-n-log-log-n-messages-1511.007152017-12-13 https://scifaro.com/en/abs/approximating-subadditive-hadamard-functions-on-implicit-matrices-1511.008382015-11-04 https://scifaro.com/en/abs/beating-the-harmonic-lower-bound-for-online-bin-packing-1511.008762018-06-29 https://scifaro.com/en/abs/burrows-wheeler-transform-for-terabases-1511.008982016-01-15 https://scifaro.com/en/abs/efficient-algorithms-with-asymmetric-read-and-write-costs-1511.010382016-08-30 https://scifaro.com/en/abs/a-correction-on-shiloach-s-algorithm-for-minimum-linear-arrangement-of-trees-1511.010612020-09-24 https://scifaro.com/en/abs/streaming-symmetric-norms-via-measure-concentration-1511.011112017-06-27 https://scifaro.com/en/abs/a-7-3-approximation-for-feedback-vertex-sets-in-tournaments-1511.011372015-11-05 https://scifaro.com/en/abs/why-is-dual-pivot-quicksort-fast-1511.011382016-09-29 https://scifaro.com/en/abs/local-conflict-coloring-1511.012872017-02-03 https://scifaro.com/en/abs/fully-polynomial-time-parameterized-computations-for-graphs-and-matrices-of-low-treewidth-1511.013792015-11-05 https://scifaro.com/en/abs/how-robust-are-reconstruction-thresholds-for-community-detection-1511.014732016-03-23 https://scifaro.com/en/abs/pattern-matching-in-213-231-avoiding-permutations-1511.017702015-11-06 https://scifaro.com/en/abs/dynamic-balanced-graph-partitioning-1511.020742020-05-15 https://scifaro.com/en/abs/traversing-grammar-compressed-trees-with-constant-delay-1511.021412015-11-11 https://scifaro.com/en/abs/submodular-hamming-metrics-1511.021632015-11-09 https://scifaro.com/en/abs/on-stabbing-queries-for-generalized-longest-repeat-1511.023932015-11-10 https://scifaro.com/en/abs/graph-isomorphism-for-bounded-genus-graphs-in-linear-time-1511.024602015-11-10 https://scifaro.com/en/abs/hardness-and-approximation-for-network-flow-interdiction-1511.024862015-11-10 https://scifaro.com/en/abs/improved-approximation-algorithms-for-relay-placement-1511.025252015-11-10 https://scifaro.com/en/abs/faster-randomized-branching-algorithms-for-r-sat-1511.025912016-03-08 https://scifaro.com/en/abs/waste-makes-haste-bounded-time-protocols-for-envy-free-cake-cutting-with-free-disposal-1511.025992018-05-15 https://scifaro.com/en/abs/optimal-dynamic-strings-1511.026122016-04-11 https://scifaro.com/en/abs/two-flow-based-approaches-for-the-static-relocation-problem-in-carsharing-systems-1511.026502015-11-10 https://scifaro.com/en/abs/reopt-an-algorithm-with-a-quality-guaranty-for-solving-the-static-relocation-problem-1511.027512015-11-10 https://scifaro.com/en/abs/approximation-algorithms-for-finding-maximum-induced-expanders-1511.027862015-11-10 https://scifaro.com/en/abs/parameterized-complexity-of-length-bounded-cuts-and-multi-cuts-1511.028012016-10-25 https://scifaro.com/en/abs/strong-connectivity-in-directed-graphs-under-failures-with-application-1511.029132019-05-08 https://scifaro.com/en/abs/k-way-hypergraph-partitioning-via-n-level-recursive-bisection-1511.031372015-11-11 https://scifaro.com/en/abs/a-study-on-splay-trees-1511.031482020-04-08 https://scifaro.com/en/abs/accelerated-newton-iteration-roots-of-black-box-polynomials-and-matrix-eigenvalues-1511.031862016-01-05 https://scifaro.com/en/abs/learning-communities-in-the-presence-of-errors-1511.032292016-06-27 https://scifaro.com/en/abs/reorganizing-topologies-of-steiner-trees-to-accelerate-their-elimination-1511.034072018-03-13 https://scifaro.com/en/abs/the-fourier-transform-of-poisson-multinomial-distributions-and-its-algorithmic-applications-1511.035922016-06-23 https://scifaro.com/en/abs/a-size-free-clt-for-poisson-multinomials-and-its-applications-1511.036412016-06-17 https://scifaro.com/en/abs/properly-learning-poisson-binomial-distributions-in-almost-polynomial-time-1511.040662015-11-13 https://scifaro.com/en/abs/experimental-evaluation-of-distributed-node-coloring-algorithms-for-wireless-networks-1511.043032015-11-16 https://scifaro.com/en/abs/combining-monte-carlo-and-hyper-heuristic-methods-for-the-multi-mode-resource-constrained-multi-project-scheduling-problem-1511.043872016-09-09 https://scifaro.com/en/abs/an-efficient-assignment-of-drainage-direction-over-flat-surfaces-in-raster-digital-elevation-models-1511.044332015-11-16 https://scifaro.com/en/abs/priority-flood-an-optimal-depression-filling-and-watershed-labeling-algorithm-for-digital-elevation-models-1511.044632015-11-17 https://scifaro.com/en/abs/optimizing-star-convex-functions-1511.044662016-05-13 https://scifaro.com/en/abs/a-backward-forward-recovery-approach-for-the-preconditioned-conjugate-gradient-method-1511.044782015-11-17 https://scifaro.com/en/abs/bin-packing-with-multiple-colors-1511.047622015-11-17 https://scifaro.com/en/abs/planar-disjoint-paths-completion-1511.049522015-11-18 https://scifaro.com/en/abs/tight-running-time-lower-bounds-for-vertex-deletion-problems-1511.054492016-05-18 https://scifaro.com/en/abs/fast-computation-on-semirings-isomorphic-to-times-max-on-mathbb-r-1511.056902016-06-20 https://scifaro.com/en/abs/randomization-can-be-as-helpful-as-a-glimpse-of-the-future-in-online-computation-1511.058862016-08-22 https://scifaro.com/en/abs/algorithms-for-communication-problems-for-mobile-agents-exchanging-energy-1511.059872015-11-20 https://scifaro.com/en/abs/a-duality-based-2-approximation-algorithm-for-maximum-agreement-forest-1511.060002016-04-29 https://scifaro.com/en/abs/on-sketching-quadratic-forms-1511.060992026-02-23 https://scifaro.com/en/abs/diffusing-private-data-over-networks-1511.062532015-11-20 https://scifaro.com/en/abs/faster-parallel-solver-for-positive-linear-programs-via-dynamically-bucketed-selective-coordinate-descent-1511.064682015-11-23 https://scifaro.com/en/abs/on-binary-embedding-using-circulant-matrices-1511.064802015-12-08 https://scifaro.com/en/abs/approximating-directed-steiner-problems-via-tree-embedding-1511.065592016-03-01 https://scifaro.com/en/abs/unifying-and-strengthening-hardness-for-dynamic-problems-via-the-online-matrix-vector-multiplication-conjecture-1511.067732015-11-24 https://scifaro.com/en/abs/a-simple-algorithm-for-replacement-paths-problem-1511.069052015-11-24 https://scifaro.com/en/abs/on-a-natural-dynamics-for-linear-programming-1511.070202015-11-24 https://scifaro.com/en/abs/constant-factor-approximation-for-atsp-with-two-edge-weights-1511.070382017-09-05 https://scifaro.com/en/abs/max-sum-diversity-via-convex-programming-1511.070772015-11-24 https://scifaro.com/en/abs/longest-gapped-repeats-and-palindromes-1511.071802023-06-22 https://scifaro.com/en/abs/input-sparsity-time-low-rank-approximation-via-ridge-leverage-score-sampling-1511.072632016-10-10 https://scifaro.com/en/abs/approximation-algorithms-for-route-planning-with-nonlinear-objectives-1511.074122015-11-24 https://scifaro.com/en/abs/an-approximation-algorithm-for-uniform-capacitated-k-median-problem-with-1-epsilon-capacity-violation-1511.074942015-11-25 https://scifaro.com/en/abs/tradeoffs-for-nearest-neighbors-on-the-sphere-1511.075272016-09-13 https://scifaro.com/en/abs/calculating-the-unrooted-subtree-prune-and-regraft-distance-1511.075292017-11-07 https://scifaro.com/en/abs/cost-minimizing-online-algorithms-for-energy-storage-management-with-worst-case-guarantee-1511.075592017-09-25 https://scifaro.com/en/abs/multivariate-complexity-analysis-of-geometric-sc-red-blue-set-cover-1511.076422015-11-26 https://scifaro.com/en/abs/a-note-on-fault-tolerant-reachability-for-directed-graphs-1511.077412015-11-25 https://scifaro.com/en/abs/lift-and-round-to-improve-weighted-completion-time-on-unrelated-machines-1511.078262015-12-02 https://scifaro.com/en/abs/max-cut-under-graph-constraints-1511.081522018-10-18 https://scifaro.com/en/abs/a-tight-lower-bound-for-vertex-planarization-on-graphs-of-bounded-treewidth-1511.082832015-11-30 https://scifaro.com/en/abs/engineering-oracles-for-time-dependent-road-networks-1511.083032015-11-30 https://scifaro.com/en/abs/on-the-greedy-algorithm-for-the-shortest-common-superstring-problem-with-reversals-1511.084312015-12-08 https://scifaro.com/en/abs/simultaneous-private-learning-of-multiple-concepts-1511.085522015-11-30 https://scifaro.com/en/abs/predecessor-problem-on-smooth-distributions-1511.085982017-01-27 https://scifaro.com/en/abs/a-lasserre-lower-bound-for-the-min-sum-single-machine-scheduling-problem-1511.086442015-11-30 https://scifaro.com/en/abs/tight-bounds-for-gomory-hu-like-cut-counting-1511.086472017-12-06 https://scifaro.com/en/abs/k-means-for-streaming-and-distributed-big-sparse-data-1511.089902016-02-09 https://scifaro.com/en/abs/a-short-survey-on-data-clustering-algorithms-1511.091232015-12-01 https://scifaro.com/en/abs/constant-approximation-algorithms-for-highly-connected-multi-dominating-sets-in-unit-disk-graphs-1511.091562018-08-08 https://scifaro.com/en/abs/non-adaptive-group-testing-on-graphs-1511.091962023-06-22 https://scifaro.com/en/abs/efficient-deterministic-single-round-document-exchange-for-edit-distance-1511.092292015-12-04 https://scifaro.com/en/abs/the-alternating-stock-size-problem-and-the-gasoline-puzzle-1511.092592018-04-10 https://scifaro.com/en/abs/an-improved-approximation-guarantee-for-the-maximum-budgeted-allocation-problem-1511.092932015-12-01 https://scifaro.com/en/abs/on-the-complexity-of-multi-parameterized-cluster-editing-1511.093602015-12-01 https://scifaro.com/en/abs/dynamic-parallel-and-distributed-graph-cuts-1512.001012016-11-03 https://scifaro.com/en/abs/online-budgeted-repeated-matching-1512.001532015-12-02 https://scifaro.com/en/abs/an-in-place-framework-for-exact-and-approximate-shortest-unique-substring-queries-1512.003782015-12-02 https://scifaro.com/en/abs/fast-k-nearest-neighbour-search-via-dynamic-continuous-indexing-1512.004422017-04-07 https://scifaro.com/en/abs/hitting-set-for-hypergraphs-of-low-vc-dimension-1512.004812016-06-22 https://scifaro.com/en/abs/cachediff-fast-random-sampling-1512.005012015-12-03 https://scifaro.com/en/abs/proposed-approximate-dynamic-programming-for-pathfinding-under-visible-uncertainty-1512.005192015-12-03 https://scifaro.com/en/abs/fast-average-case-pattern-matching-on-weighted-sequences-1512.010852015-12-09 https://scifaro.com/en/abs/reconstruction-of-depth-3-top-fan-in-two-circuits-over-characteristic-zero-fields-1512.012562018-02-28 https://scifaro.com/en/abs/cell-probe-lower-bounds-for-dynamic-problems-via-a-new-communication-model-1512.012932015-12-07 https://scifaro.com/en/abs/exact-algorithms-via-monotone-local-search-1512.016212015-12-08 https://scifaro.com/en/abs/solving-the-subset-sum-problem-with-heap-ordered-subset-trees-1512.017272016-05-09 https://scifaro.com/en/abs/k-trails-recognition-complexity-and-approximations-1512.017812015-12-08 https://scifaro.com/en/abs/on-routing-disjoint-paths-in-bounded-treewidth-graphs-1512.018292015-12-08 https://scifaro.com/en/abs/sparsified-cholesky-and-multigrid-solvers-for-connection-laplacians-1512.018922015-12-08 https://scifaro.com/en/abs/a-bloated-fm-index-reducing-the-number-of-cache-misses-during-the-search-1512.019962015-12-08 https://scifaro.com/en/abs/minimum-cut-of-directed-planar-graphs-in-o-nloglogn-time-1512.020682016-11-15 https://scifaro.com/en/abs/finding-k-simple-shortest-paths-and-cycles-1512.021572016-02-24 https://scifaro.com/en/abs/faster-information-gathering-in-ad-hoc-radio-tree-networks-1512.021792015-12-08 https://scifaro.com/en/abs/approximation-friendly-discrepancy-rounding-1512.022542016-12-05 https://scifaro.com/en/abs/fast-spectral-algorithms-from-sum-of-squares-proofs-tensor-decomposition-and-planted-sparse-vectors-1512.023372016-02-04 https://scifaro.com/en/abs/vertex-coloring-with-star-defects-1512.025052016-03-24 https://scifaro.com/en/abs/a-randomized-polynomial-kernel-for-subset-feedback-vertex-set-1512.025102015-12-09 https://scifaro.com/en/abs/maximum-scatter-tsp-in-doubling-metrics-1512.029632016-06-29 https://scifaro.com/en/abs/breaking-the-log-n-barrier-on-rumor-spreading-1512.030222015-12-10 https://scifaro.com/en/abs/parameterized-tractability-of-the-maximum-duo-preservation-string-mapping-problem-1512.032202015-12-11 https://scifaro.com/en/abs/a-fast-heuristic-for-exact-string-matching-1512.035122015-12-14 https://scifaro.com/en/abs/fast-generation-of-spatially-embedded-random-networks-1512.035322015-12-14 https://scifaro.com/en/abs/graph-isomorphism-in-quasipolynomial-time-1512.035472016-01-20 https://scifaro.com/en/abs/computing-affine-combinations-distances-and-correlations-for-recursive-partition-functions-1512.036972016-03-18 https://scifaro.com/en/abs/finding-heavypaths-in-weighted-graphs-and-a-case-study-on-community-detection-1512.040102015-12-15 https://scifaro.com/en/abs/embedding-approximately-low-dimensional-ell-2-2-metrics-into-ell-1-1512.041702015-12-15 https://scifaro.com/en/abs/hypergraph-two-coloring-in-the-streaming-model-1512.041882018-05-15 https://scifaro.com/en/abs/parameterized-algorithms-on-perfect-graphs-for-deletion-to-r-ell-graphs-1512.042002015-12-15 https://scifaro.com/en/abs/breaking-the-variance-approximating-the-hamming-distance-in-tilde-o-1-epsilon-time-per-alignment-1512.045152015-12-15 https://scifaro.com/en/abs/efficient-algorithms-for-personalized-pagerank-1512.046332015-12-16 https://scifaro.com/en/abs/probabilistic-analysis-of-the-dual-next-fit-algorithm-for-bin-covering-1512.047192015-12-16 https://scifaro.com/en/abs/optimal-las-vegas-reduction-from-one-way-set-reconciliation-to-error-correction-1512.050282015-12-17 https://scifaro.com/en/abs/streaming-kernel-principal-component-analysis-1512.050592015-12-17 https://scifaro.com/en/abs/computing-the-complete-pareto-front-1512.052072015-12-17 https://scifaro.com/en/abs/improved-kernels-for-signed-max-cut-parameterized-above-lower-bound-on-r-l-graphs-1512.052232023-06-22 https://scifaro.com/en/abs/improved-bounds-for-3sum-k-sum-and-linear-degeneracy-1512.052792017-03-07 https://scifaro.com/en/abs/non-local-probes-do-not-help-with-graph-problems-1512.054112015-12-18 https://scifaro.com/en/abs/a-faster-fixed-parameter-algorithm-for-two-layer-crossing-minimization-1512.058762015-12-21 https://scifaro.com/en/abs/improved-balanced-flow-computation-using-parametric-flow-1512.059742016-05-16 https://scifaro.com/en/abs/the-limitations-of-optimization-from-samples-1512.062382016-11-17 https://scifaro.com/en/abs/online-matroid-intersection-beating-half-for-random-arrival-1512.062712018-02-20 https://scifaro.com/en/abs/chinese-postman-problem-on-edge-colored-multigraphs-1512.062832016-09-13 https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-the-airplane-refueling-problem-1512.063532015-12-22 https://scifaro.com/en/abs/optimizing-spread-of-influence-in-weighted-social-networks-via-partial-incentives-1512.063722015-12-22 https://scifaro.com/en/abs/building-a-balanced-k-d-tree-with-mapreduce-1512.063892020-11-03 https://scifaro.com/en/abs/from-discrepancy-to-majority-1512.064882018-03-01 https://scifaro.com/en/abs/path-computation-in-multi-layer-multi-domain-networks-a-language-theoretic-approach-1512.065322015-12-22 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-rectilinear-steiner-tree-and-rectilinear-traveling-salesman-problem-in-the-plane-1512.066492019-07-24 https://scifaro.com/en/abs/solving-k-sum-using-few-linear-queries-1512.066782016-02-19 https://scifaro.com/en/abs/on-lagrangian-relaxation-and-reoptimization-problems-1512.067362015-12-22 https://scifaro.com/en/abs/general-graph-identification-by-hashing-1512.072632015-12-24 https://scifaro.com/en/abs/the-lateral-transhipment-problem-with-a-priori-routes-and-a-lot-sizing-application-1512.074492015-12-24 https://scifaro.com/en/abs/a-quadratic-assignment-formulation-of-the-graph-edit-distance-1512.074942015-12-24 https://scifaro.com/en/abs/sublinear-time-maintenance-of-breadth-first-spanning-trees-in-partially-dynamic-networks-1512.081472018-03-02 https://scifaro.com/en/abs/decremental-single-source-shortest-paths-on-undirected-graphs-in-near-linear-total-update-time-1512.081482018-08-20 https://scifaro.com/en/abs/maximium-priority-matchings-1512.085552015-12-31 https://scifaro.com/en/abs/tight-bounds-for-approximate-carath-eodory-and-beyond-1512.086022015-12-31 https://scifaro.com/en/abs/the-packing-while-traveling-problem-1512.088312017-03-22 https://scifaro.com/en/abs/the-edge-group-coloring-problem-with-applications-to-multicast-switching-1512.089952015-12-31 https://scifaro.com/en/abs/the-bounded-edge-coloring-problem-and-offline-crossbar-scheduling-1512.090022015-12-31 https://scifaro.com/en/abs/fast-computation-of-isochrones-in-road-networks-1512.090902015-12-31 https://scifaro.com/en/abs/dynamic-time-dependent-route-planning-in-road-networks-with-user-preferences-1512.091322015-12-31 https://scifaro.com/en/abs/a-4-5-approximation-algorithm-for-the-maximum-traveling-salesman-problem-1512.092362016-03-22 https://scifaro.com/en/abs/faster-maximium-priority-matchings-in-bipartite-graphs-1512.093492016-01-01 https://scifaro.com/en/abs/geometric-memory-management-1512.093582016-02-18 https://scifaro.com/en/abs/a-parameterized-algorithm-for-bounded-degree-vertex-deletion-1601.001632016-08-23 https://scifaro.com/en/abs/on-a-generalization-of-nemhauser-and-trotter-s-local-optimization-theorem-1601.001642020-07-23 https://scifaro.com/en/abs/firefighting-on-trees-beyond-integrality-gaps-1601.002712016-03-15 https://scifaro.com/en/abs/approximate-distance-oracles-for-planar-graphs-with-improved-query-time-space-tradeoff-1601.008392016-01-06 https://scifaro.com/en/abs/define-an-optimisation-based-method-for-robust-disentangling-of-filamentous-networks-1601.008472017-06-01 https://scifaro.com/en/abs/a-serial-multilevel-hypergraph-partitioning-algorithm-1601.013362016-01-08 https://scifaro.com/en/abs/constant-factor-approximations-for-asymmetric-tsp-on-nearly-embeddable-graphs-1601.013722016-01-08 https://scifaro.com/en/abs/on-the-computation-of-the-optimal-connecting-points-in-road-networks-1601.013962016-05-09 https://scifaro.com/en/abs/maximum-leaf-spanning-trees-of-growing-sierpinski-networks-models-1601.014652016-01-08 https://scifaro.com/en/abs/k-nearest-neighbors-on-road-networks-a-journey-in-experimentation-and-in-memory-implementation-1601.015492016-08-11 https://scifaro.com/en/abs/grafalgo-a-library-of-graph-algorithms-and-supporting-data-structures-revised-1601.015972016-01-08 https://scifaro.com/en/abs/a-prefixed-itemset-based-improvement-for-apriori-algorithm-1601.017462016-01-11 https://scifaro.com/en/abs/optimal-power-flow-with-inelastic-demands-for-demand-response-in-radial-distribution-networks-1601.023232018-03-22 https://scifaro.com/en/abs/subexponential-time-algorithms-for-finding-small-tree-and-path-decompositions-1601.024152016-05-05 https://scifaro.com/en/abs/approximation-algorithms-for-node-weighted-prize-collecting-steiner-tree-problems-on-planar-graphs-1601.024812016-01-12 https://scifaro.com/en/abs/stationary-signal-processing-on-graphs-1601.025222017-05-24 https://scifaro.com/en/abs/irls-and-slime-mold-equivalence-and-convergence-1601.027122016-01-13 https://scifaro.com/en/abs/a-sidetrack-based-algorithm-for-finding-the-k-shortest-simple-paths-in-a-directed-graph-1601.028672016-01-13 https://scifaro.com/en/abs/the-minimal-hitting-set-generation-problem-algorithms-and-computation-1601.029392016-01-13 https://scifaro.com/en/abs/submodular-optimization-under-noise-1601.030952016-11-08 https://scifaro.com/en/abs/graph-editing-to-a-given-degree-sequence-1601.031742016-01-14 https://scifaro.com/en/abs/improved-algorithmic-bounds-for-discrepancy-of-sparse-set-systems-1601.033112016-02-03 https://scifaro.com/en/abs/the-complexity-of-bit-retrieval-1601.034282016-01-15 https://scifaro.com/en/abs/characterizing-a-set-of-popular-matchings-defined-by-preference-lists-with-ties-1601.034582025-03-07 https://scifaro.com/en/abs/stable-marriage-problem-with-ties-and-incomplete-bounded-length-preference-list-under-social-stability-1601.035232016-07-25 https://scifaro.com/en/abs/arbitrary-overlap-constraints-in-graph-packing-problems-1601.036762016-01-15 https://scifaro.com/en/abs/dual-tree-k-means-with-bounded-iteration-runtime-1601.037542016-01-18 https://scifaro.com/en/abs/mining-frequent-items-in-the-time-fading-model-1601.038922016-08-08 https://scifaro.com/en/abs/on-an-application-of-multidimensional-arrays-1601.039282016-01-18 https://scifaro.com/en/abs/concurrent-hash-tables-fast-and-general-1601.040172016-09-07 https://scifaro.com/en/abs/multiple-edge-fault-tolerant-approximate-shortest-path-trees-1601.041692016-01-22 https://scifaro.com/en/abs/determining-tournament-payout-structures-for-daily-fantasy-sports-1601.042032016-11-07 https://scifaro.com/en/abs/partial-match-queries-with-random-wildcards-in-tries-and-distributed-hash-tables-1601.042132016-01-27 https://scifaro.com/en/abs/sublinear-time-algorithms-for-counting-star-subgraphs-with-applications-to-join-selectivity-estimation-1601.042332016-01-19 https://scifaro.com/en/abs/word-existence-algorithm-1601.042482016-01-19 https://scifaro.com/en/abs/on-competitive-algorithms-for-approximations-of-top-k-position-monitoring-of-distributed-streams-1601.044482016-10-28 https://scifaro.com/en/abs/parameterized-and-approximation-complexity-of-the-detection-pair-problem-in-graphs-1601.050032018-01-31 https://scifaro.com/en/abs/low-space-external-memory-construction-of-the-succinct-permuted-longest-common-prefix-array-1601.050202016-03-09 https://scifaro.com/en/abs/optimal-composition-ordering-problems-for-piecewise-linear-functions-1601.054802016-01-22 https://scifaro.com/en/abs/a-new-approach-for-testing-properties-of-discrete-distributions-1601.055572016-05-10 https://scifaro.com/en/abs/unshuffling-permutations-1601.059622016-03-04 https://scifaro.com/en/abs/a-characterization-for-the-existence-of-connected-f-factors-of-textit-large-minimum-degree-1601.062912016-01-26 https://scifaro.com/en/abs/incremental-maintenance-of-maximal-cliques-in-a-dynamic-graph-1601.063112018-03-20 https://scifaro.com/en/abs/a-novel-graph-based-approach-for-determining-molecular-similarity-1601.066932016-01-26 https://scifaro.com/en/abs/combinatorial-algorithm-for-counting-small-induced-graphs-and-orbits-1601.068342017-04-12 https://scifaro.com/en/abs/simple-and-efficient-fully-functional-succinct-trees-1601.069392016-03-24 https://scifaro.com/en/abs/streaming-space-complexity-of-nearly-all-functions-of-one-variable-on-frequency-vectors-1601.074732016-01-28 https://scifaro.com/en/abs/deterministic-sub-linear-space-lce-data-structures-with-efficient-construction-1601.076702016-02-01 https://scifaro.com/en/abs/minimal-suffix-and-rotation-of-a-substring-in-optimal-time-1601.080512016-02-01 https://scifaro.com/en/abs/a-two-phase-algorithm-for-bin-stretching-with-stretching-factor-1-5-1601.081112016-08-23 https://scifaro.com/en/abs/optimal-prefix-free-codes-with-partial-sorting-1602.000232016-02-02 https://scifaro.com/en/abs/on-the-factor-revealing-lp-approach-for-facility-location-with-penalties-1602.001922016-09-29 https://scifaro.com/en/abs/lempel-ziv-decoding-in-external-memory-1602.003292020-12-11 https://scifaro.com/en/abs/efficient-frequent-directions-algorithm-for-sparse-matrices-1602.004122016-02-18 https://scifaro.com/en/abs/packed-compact-tries-a-fast-and-efficient-data-structure-for-online-string-processing-1602.004222017-10-11 https://scifaro.com/en/abs/efficiently-correcting-matrix-products-1602.004352016-08-19 https://scifaro.com/en/abs/faster-longest-common-extension-queries-in-strings-over-general-alphabets-1602.004472016-04-08 https://scifaro.com/en/abs/on-pattern-matching-with-k-mismatches-and-few-don-t-cares-1602.006212016-10-31 https://scifaro.com/en/abs/efficient-index-for-weighted-sequences-1602.011162016-02-04 https://scifaro.com/en/abs/how-proofs-are-prepared-at-camelot-1602.012952016-02-04 https://scifaro.com/en/abs/plurality-consensus-via-shuffling-lessons-learned-from-load-balancing-1602.013422016-02-04 https://scifaro.com/en/abs/accelerating-local-search-for-the-maximum-independent-set-problem-1602.016592016-02-05 https://scifaro.com/en/abs/a-double-oracle-approach-for-minmax-regret-optimization-problems-with-interval-data-1602.017642017-07-12 https://scifaro.com/en/abs/scalable-isocontour-visualization-in-road-networks-via-minimum-link-paths-1602.017772016-02-05 https://scifaro.com/en/abs/scheduling-of-unit-length-jobs-with-bipartite-incompatibility-graphs-on-four-uniform-machines-1602.018672016-02-08 https://scifaro.com/en/abs/almost-stable-matchings-in-the-hospitals-residents-problem-with-couples-1602.019562016-06-21 https://scifaro.com/en/abs/compressive-spectral-clustering-1602.020182016-05-24 https://scifaro.com/en/abs/parallel-ordered-sets-using-join-1602.021202016-11-15 https://scifaro.com/en/abs/on-the-circuit-complexity-of-the-standard-and-the-karatsuba-methods-of-multiplying-integers-1602.023622016-02-09 https://scifaro.com/en/abs/find-an-optimal-path-in-static-system-and-dynamical-system-within-polynomial-runtime-1602.023772016-02-09 https://scifaro.com/en/abs/metric-dimension-of-bounded-tree-length-graphs-1602.026102016-02-09 https://scifaro.com/en/abs/model-and-objective-separation-with-conditional-lower-bounds-disjunction-is-harder-than-conjunction-1602.026702016-02-09 https://scifaro.com/en/abs/graphical-model-sketch-1602.031052016-07-19 https://scifaro.com/en/abs/graph-wavelets-via-sparse-cuts-extended-version-1602.033202016-06-14 https://scifaro.com/en/abs/a-representation-of-a-compressed-de-bruijn-graph-for-pan-genome-analysis-that-enables-search-1602.033332016-02-11 https://scifaro.com/en/abs/parallel-shortest-paths-using-radius-stepping-1602.038812016-03-15 https://scifaro.com/en/abs/efficient-call-path-detection-for-android-os-size-of-huge-source-code-1602.039422016-02-15 https://scifaro.com/en/abs/spectral-alignment-of-graphs-1602.041812017-09-06 https://scifaro.com/en/abs/haplotype-inference-for-pedigrees-with-few-recombinations-1602.042702016-02-16 https://scifaro.com/en/abs/the-triangle-scheduling-problem-1602.043652016-05-03 https://scifaro.com/en/abs/fast-computation-of-the-kinship-coefficients-1602.043682016-02-20 https://scifaro.com/en/abs/linear-separability-in-spatial-databases-1602.043992016-02-16 https://scifaro.com/en/abs/randomized-approximate-nearest-neighbor-search-with-limited-adaptivity-1602.044212016-02-16 https://scifaro.com/en/abs/on-the-insertion-time-of-random-walk-cuckoo-hashing-1602.046522017-01-10 https://scifaro.com/en/abs/reduced-complexity-multi-scale-path-planning-on-probabilistic-maps-1602.048002016-02-16 https://scifaro.com/en/abs/tight-lower-bounds-on-graph-embedding-problems-1602.050162016-02-17 https://scifaro.com/en/abs/exploration-of-faulty-hamiltonian-graphs-1602.051362016-10-04 https://scifaro.com/en/abs/work-efficient-parallel-and-incremental-graph-connectivity-1602.052322016-02-18 https://scifaro.com/en/abs/scheduling-mapreduce-jobs-under-multi-round-precedences-1602.052632016-02-18 https://scifaro.com/en/abs/simple-average-case-lower-bounds-for-approximate-near-neighbor-from-isoperimetric-inequalities-1602.053912017-01-09 https://scifaro.com/en/abs/distributed-strong-diameter-network-decomposition-1602.054372016-02-18 https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-rainbow-coloring-1602.056082016-02-19 https://scifaro.com/en/abs/compact-flow-diagrams-for-state-sequences-1602.056222018-05-08 https://scifaro.com/en/abs/tight-hardness-results-for-maximum-weight-rectangles-1602.058372016-03-04 https://scifaro.com/en/abs/twopaco-an-efficient-algorithm-to-build-the-compacted-de-bruijn-graph-from-many-complete-genomes-1602.058562016-02-19 https://scifaro.com/en/abs/abra-approximating-betweenness-centrality-in-static-and-dynamic-graphs-with-rademacher-averages-1602.058662016-02-19 https://scifaro.com/en/abs/distortion-resistant-hashing-for-rapid-search-of-similar-dna-subsequence-1602.058892016-02-19 https://scifaro.com/en/abs/an-algorithm-for-the-weighted-metric-dimension-of-two-dimensional-grids-1602.058992016-02-19 https://scifaro.com/en/abs/binarization-trees-and-random-number-generation-1602.060582018-05-15 https://scifaro.com/en/abs/sublinear-random-access-generators-for-preferential-attachment-graphs-1602.061592025-09-03 https://scifaro.com/en/abs/competitive-path-computation-and-function-placement-in-sdns-1602.061692016-02-22 https://scifaro.com/en/abs/a-constant-approximation-algorithm-for-scheduling-packets-on-line-networks-1602.061742020-09-30 https://scifaro.com/en/abs/sorting-with-forbidden-intermediates-1602.062832017-03-27 https://scifaro.com/en/abs/on-the-size-and-the-approximability-of-minimum-temporally-connected-subgraphs-1602.064112016-02-23 https://scifaro.com/en/abs/a-loopless-and-branchless-o-1-algorithm-to-generate-the-next-dyck-word-1602.064262018-03-21 https://scifaro.com/en/abs/non-preemptive-scheduling-in-a-smart-grid-model-and-its-implications-on-machine-minimization-1602.066592017-08-07 https://scifaro.com/en/abs/siedm-an-efficient-string-index-and-search-algorithm-for-edit-distance-with-moves-1602.066882016-04-11 https://scifaro.com/en/abs/on-the-hardness-of-partially-dynamic-graph-problems-and-connections-to-diameter-1602.067052016-05-04 https://scifaro.com/en/abs/online-bounded-analysis-1602.067082017-06-14 https://scifaro.com/en/abs/fast-online-k-nn-graph-building-1602.068192016-02-23 https://scifaro.com/en/abs/principal-component-projection-without-principal-component-analysis-1602.068722019-11-27 https://scifaro.com/en/abs/fast-cross-polytope-locality-sensitive-hashing-1602.069222016-09-22 https://scifaro.com/en/abs/synthesis-of-fast-multiplication-algorithms-for-arbitrary-tensors-1602.070082016-02-24 https://scifaro.com/en/abs/improved-bounds-for-shortest-paths-in-dense-distance-graphs-1602.070132016-07-18 https://scifaro.com/en/abs/scalable-generation-of-scale-free-graphs-1602.071062016-02-24 https://scifaro.com/en/abs/on-the-power-of-advice-and-randomization-for-online-bipartite-matching-1602.071542016-06-22 https://scifaro.com/en/abs/paging-with-multiple-caches-1602.071952016-02-24 https://scifaro.com/en/abs/faster-algorithms-for-the-maximum-common-subtree-isomorphism-problem-1602.072102016-08-23 https://scifaro.com/en/abs/approximate-hamming-distance-in-a-stream-1602.072412016-02-24 https://scifaro.com/en/abs/computing-approximate-psd-factorizations-1602.073512016-02-25 https://scifaro.com/en/abs/the-robust-recoverable-spanning-tree-problem-with-interval-costs-is-polynomially-solvable-1602.074222016-03-08 https://scifaro.com/en/abs/tri-est-counting-local-and-global-triangles-in-fully-dynamic-streams-with-fixed-memory-size-1602.074242016-06-29 https://scifaro.com/en/abs/enumeration-and-maximum-number-of-minimal-connected-vertex-covers-in-graphs-1602.075042016-02-25 https://scifaro.com/en/abs/adaptive-learning-with-robust-generalization-guarantees-1602.077262016-06-03 https://scifaro.com/en/abs/a-note-on-modeling-self-suspending-time-as-blocking-time-in-real-time-systems-1602.077502016-02-26 https://scifaro.com/en/abs/on-satisfiability-problems-with-a-linear-structure-1602.078762016-02-26 https://scifaro.com/en/abs/streaming-verification-of-graph-properties-1602.081622016-10-05 https://scifaro.com/en/abs/stable-marriage-with-covering-constraints-a-complete-computational-trichotomy-1602.082302019-10-08 https://scifaro.com/en/abs/theoretical-analysis-of-the-k-means-algorithm-a-survey-1602.082542016-02-29 https://scifaro.com/en/abs/balanced-allocation-patience-is-not-a-virtue-1602.082982018-01-24 https://scifaro.com/en/abs/approximation-complexity-of-max-cut-on-power-law-graphs-1602.083692016-02-29 https://scifaro.com/en/abs/graph-isomorphism-for-unit-square-graphs-1602.083712016-06-23 https://scifaro.com/en/abs/exact-weighted-minwise-hashing-in-constant-time-1602.083932016-02-29 https://scifaro.com/en/abs/on-the-computational-complexity-of-minimum-concave-cost-flow-in-a-two-dimensional-grid-1602.085152016-03-01 https://scifaro.com/en/abs/analysing-survey-propagation-guided-decimation-on-random-formulas-1602.085192016-03-01 https://scifaro.com/en/abs/online-tree-caching-1602.085632017-05-16 https://scifaro.com/en/abs/improved-bounds-and-algorithms-for-graph-cuts-and-network-reliability-1602.087302023-10-13 https://scifaro.com/en/abs/compressing-graphs-and-indexes-with-recursive-graph-bisection-1602.088202017-09-04 https://scifaro.com/en/abs/algorithms-on-ideal-over-complex-multiplication-order-1602.090372016-03-01 https://scifaro.com/en/abs/promethee-is-not-quadratic-an-o-qn-log-n-algorithm-1603.000912016-03-02 https://scifaro.com/en/abs/an-optimal-algorithm-for-l1-heavy-hitters-in-insertion-streams-and-related-problems-1603.002132016-03-02 https://scifaro.com/en/abs/bptree-an-ell-2-heavy-hitters-algorithm-using-constant-memory-1603.007592017-11-10 https://scifaro.com/en/abs/vertex-cover-structural-parameterization-revisited-1603.007702016-03-03 https://scifaro.com/en/abs/pareto-optimal-matchings-of-students-to-courses-in-the-presence-of-prerequisites-1603.008582017-07-11 https://scifaro.com/en/abs/using-quadrilaterals-to-compute-the-shortest-path-1603.009632016-03-04 https://scifaro.com/en/abs/tight-analysis-of-a-multiple-swap-heuristic-for-budgeted-red-blue-median-1603.009732016-03-04 https://scifaro.com/en/abs/yes-no-bloom-filter-a-way-of-representing-sets-with-fewer-false-positives-1603.010602016-03-04 https://scifaro.com/en/abs/the-domination-game-proving-the-3-5-conjecture-on-isolate-free-forests-1603.011812016-03-04 https://scifaro.com/en/abs/sequential-ranking-under-random-semi-bandit-feedback-1603.014502016-05-27 https://scifaro.com/en/abs/distributed-delta-1-coloring-in-sublogarithmic-rounds-1603.014862023-10-13 https://scifaro.com/en/abs/inferential-privacy-guarantees-for-differentially-private-mechanisms-1603.015082017-05-25 https://scifaro.com/en/abs/rapidly-mixing-markov-chains-a-comparison-of-techniques-a-survey-1603.015122016-03-07 https://scifaro.com/en/abs/randomized-algorithms-for-finding-a-majority-element-1603.015832016-05-02 https://scifaro.com/en/abs/computing-shortest-paths-using-a-landmarks-and-polygon-inequalities-abstract-1603.016072016-03-07 https://scifaro.com/en/abs/new-algorithms-for-heavy-hitters-in-data-streams-1603.017332016-03-08 https://scifaro.com/en/abs/new-algorithms-for-maximum-disjoint-paths-based-on-tree-likeness-1603.017402016-05-23 https://scifaro.com/en/abs/complex-demand-scheduling-problem-with-application-in-smart-grid-1603.017862019-03-06 https://scifaro.com/en/abs/concentrated-differential-privacy-1603.018872016-03-17 https://scifaro.com/en/abs/aggregated-2d-range-queries-on-clustered-points-1603.020632016-04-01 https://scifaro.com/en/abs/terminal-embeddings-1603.023212016-03-09 https://scifaro.com/en/abs/constant-approximation-for-capacitated-k-median-with-1-epsilon-capacity-violation-1603.023242016-05-12 https://scifaro.com/en/abs/on-self-reducibility-and-reoptimization-of-closest-substring-problem-1603.024572016-03-09 https://scifaro.com/en/abs/scheduling-meets-n-fold-integer-programming-1603.026112018-01-09 https://scifaro.com/en/abs/bipartite-correlation-clustering-maximizing-agreements-1603.027822016-03-10 https://scifaro.com/en/abs/reducing-the-generalised-sudoku-problem-to-the-hamiltonian-cycle-problem-1603.030192016-03-10 https://scifaro.com/en/abs/online-matching-haste-makes-waste-1603.030242016-03-10 https://scifaro.com/en/abs/scenario-submodular-cover-1603.031582016-03-11 https://scifaro.com/en/abs/near-optimal-sample-complexity-bounds-for-circulant-binary-embedding-1603.031782016-03-15 https://scifaro.com/en/abs/a-novel-algorithm-for-string-matching-with-mismatches-1603.032032016-03-11 https://scifaro.com/en/abs/most-compact-parsimonious-trees-1603.033152016-11-01 https://scifaro.com/en/abs/a-unifying-formalism-for-shortest-path-problems-with-expensive-edge-evaluations-via-lazy-best-first-search-over-paths-with-edge-selectors-1603.034902016-06-15 https://scifaro.com/en/abs/sorting-with-asymmetric-read-and-write-costs-1603.035052016-03-15 https://scifaro.com/en/abs/near-isometric-binary-hashing-for-large-scale-datasets-1603.038362016-03-15 https://scifaro.com/en/abs/fast-scalable-construction-of-minimal-perfect-hash-functions-1603.043302016-03-24 https://scifaro.com/en/abs/a-fast-parameterized-algorithm-for-co-path-set-1603.043762016-07-29 https://scifaro.com/en/abs/linear-sum-assignment-with-edition-1603.043802016-03-24 https://scifaro.com/en/abs/the-quadratic-minimum-spanning-tree-problem-and-its-variations-1603.044512016-03-16 https://scifaro.com/en/abs/a-branch-and-bound-algorithm-for-a-fractional-0-1-programming-problem-1603.045972016-03-16 https://scifaro.com/en/abs/nd-tree-based-update-a-fast-algorithm-for-the-dynamic-non-dominance-problem-1603.047982017-11-08 https://scifaro.com/en/abs/the-landscape-of-bounds-for-binary-search-trees-1603.048922016-03-17 https://scifaro.com/en/abs/parallel-algorithms-for-select-and-partition-with-noisy-comparisons-1603.049412016-03-17 https://scifaro.com/en/abs/benchmarking-concurrent-priority-queues-performance-of-k-lsm-and-related-data-structures-1603.050472016-03-17 https://scifaro.com/en/abs/optimal-quantile-approximation-in-streams-1603.053462016-04-07 https://scifaro.com/en/abs/improved-approximation-for-node-disjoint-paths-in-planar-graphs-1603.055202016-03-18 https://scifaro.com/en/abs/tight-bounds-for-single-pass-streaming-complexity-of-the-set-cover-problem-1603.057152016-03-21 https://scifaro.com/en/abs/parameterized-vertex-deletion-problems-for-hereditary-graph-classes-with-a-block-property-1603.059452016-03-21 https://scifaro.com/en/abs/a-message-passing-algorithm-for-the-problem-of-path-packing-in-graphs-1603.060022016-03-22 https://scifaro.com/en/abs/better-bounds-for-coalescing-branching-random-walks-1603.061092016-03-22 https://scifaro.com/en/abs/robust-principal-graphs-for-data-approximation-1603.068282019-09-25 https://scifaro.com/en/abs/efficient-enumeration-of-unidirectional-cuts-for-technology-mapping-of-boolean-networks-1603.073712016-03-25 https://scifaro.com/en/abs/an-effective-time-aware-map-matching-process-for-low-sampling-gps-data-1603.073762016-03-25 https://scifaro.com/en/abs/parameterized-pattern-matching-succinctly-1603.074572016-04-07 https://scifaro.com/en/abs/online-budgeted-allocation-with-general-budgets-1603.077682016-03-28 https://scifaro.com/en/abs/approximate-personalized-pagerank-on-dynamic-graphs-1603.077962017-12-27 https://scifaro.com/en/abs/an-empirical-study-of-online-packet-scheduling-algorithms-1603.079472025-11-21 https://scifaro.com/en/abs/binary-search-trees-and-rectangulations-1603.081512016-03-29 https://scifaro.com/en/abs/on-the-shoshan-zwick-algorithm-for-the-all-pairs-shortest-path-problem-1603.086272016-03-30 https://scifaro.com/en/abs/the-scj-small-parsimony-problem-for-weighted-gene-adjacencies-extended-version-1603.088192016-09-27 https://scifaro.com/en/abs/local-search-yields-a-ptas-for-k-means-in-doubling-metrics-1603.089762017-01-11 https://scifaro.com/en/abs/routing-under-balance-1603.090092016-03-31 https://scifaro.com/en/abs/efficient-and-robust-approximate-nearest-neighbor-search-using-hierarchical-navigable-small-world-graphs-1603.093202018-08-16 https://scifaro.com/en/abs/local-search-yields-approximation-schemes-for-k-means-and-k-median-in-euclidean-and-minor-free-metrics-1603.095352016-04-08 https://scifaro.com/en/abs/detecting-one-variable-patterns-1604.000542017-07-19 https://scifaro.com/en/abs/iterative-packing-for-demand-and-hypergraph-matching-1604.003102016-04-04 https://scifaro.com/en/abs/generalized-hypergraph-matching-via-iterated-packing-and-local-ratio-1604.003222016-04-04 https://scifaro.com/en/abs/beyond-matroids-secretary-problem-and-prophet-inequality-with-general-constraints-1604.003572024-09-05 https://scifaro.com/en/abs/throughput-optimal-multi-hop-broadcast-algorithms-1604.004462016-04-05 https://scifaro.com/en/abs/approximating-unweighted-tree-augmentation-via-lift-and-project-part-0-1-8-epsilon-approximation-for-unweighted-tap-1604.007082016-04-05 https://scifaro.com/en/abs/sparse-fourier-transform-in-any-constant-dimension-with-nearly-optimal-sample-complexity-in-sublinear-time-1604.008452016-04-05 https://scifaro.com/en/abs/mixing-time-for-some-adjacent-transposition-markov-chains-1604.008702018-01-12 https://scifaro.com/en/abs/recognition-of-unipolar-and-generalised-split-graphs-1604.009222016-04-05 https://scifaro.com/en/abs/maximizing-the-weighted-number-of-spanning-trees-near-t-optimal-graphs-1604.011162016-04-13 https://scifaro.com/en/abs/on-the-complexity-of-computing-prime-tables-on-a-turing-machine-1604.011542016-04-06 https://scifaro.com/en/abs/a-fast-incremental-bsp-tree-archive-for-non-dominated-points-1604.011692016-09-13 https://scifaro.com/en/abs/heavy-hitters-via-cluster-preserving-clustering-1604.013572016-04-06 https://scifaro.com/en/abs/partial-sublinear-time-approximation-and-inapproximation-for-maximum-coverage-1604.014212016-07-21 https://scifaro.com/en/abs/the-price-of-differential-privacy-for-low-rank-factorization-1604.014292018-04-19 https://scifaro.com/en/abs/a-multivariate-approach-for-checking-resiliency-in-access-control-1604.015502016-04-26 https://scifaro.com/en/abs/online-lower-bounds-via-duality-1604.016972016-04-07 https://scifaro.com/en/abs/clustering-via-crowdsourcing-1604.018392016-04-08 https://scifaro.com/en/abs/on-fully-dynamic-graph-sparsifiers-1604.020942018-03-02 https://scifaro.com/en/abs/simultaneous-nearest-neighbor-search-1604.021882016-04-11 https://scifaro.com/en/abs/efficient-summing-over-sliding-windows-1604.024502016-04-12 https://scifaro.com/en/abs/computing-longest-increasing-subsequence-over-sequential-data-streams-1604.025522016-10-12 https://scifaro.com/en/abs/multi-state-perfect-phylogeny-mixture-deconvolution-and-applications-to-cancer-sequencing-1604.026052016-04-12 https://scifaro.com/en/abs/on-an-algorithm-for-receiving-sudoku-matrices-1604.026912022-12-13 https://scifaro.com/en/abs/an-experimental-study-of-dynamic-dominators-1604.027112016-04-12 https://scifaro.com/en/abs/efficiently-enumerating-minimal-triangulations-1604.028332023-07-28 https://scifaro.com/en/abs/efficient-fpt-algorithms-for-strict-compatibility-of-unrooted-phylogenetic-trees-1604.030082016-04-12 https://scifaro.com/en/abs/know-when-to-persist-deriving-value-from-a-stream-buffer-1604.030092016-04-12 https://scifaro.com/en/abs/amortized-dynamic-cell-probe-lower-bounds-from-four-party-communication-1604.030302016-04-12 https://scifaro.com/en/abs/fast-computation-of-isomorphisms-between-finite-fields-using-elliptic-curves-1604.030722018-08-15 https://scifaro.com/en/abs/an-algorithm-for-3-sat-problems-1604.034622017-08-01 https://scifaro.com/en/abs/joint-alignment-of-multiple-protein-protein-interaction-networks-via-convex-optimization-1604.034822016-04-13 https://scifaro.com/en/abs/ramanujan-graphs-in-polynomial-time-1604.035442016-04-13 https://scifaro.com/en/abs/fsg-fast-string-graph-construction-for-de-novo-assembly-of-reads-data-1604.035872017-05-30 https://scifaro.com/en/abs/a-discrete-and-bounded-envy-free-cake-cutting-protocol-for-any-number-of-agents-1604.036552017-08-29 https://scifaro.com/en/abs/sublinear-time-estimation-of-degree-distribution-moments-the-degeneracy-connection-1604.036612017-02-17 https://scifaro.com/en/abs/optimal-monotone-drawings-of-trees-1604.039212016-04-14 https://scifaro.com/en/abs/lossy-kernelization-1604.041112016-11-07 https://scifaro.com/en/abs/on-dynamic-job-ordering-and-slot-configurations-for-minimizing-the-makespan-of-multiple-mapreduce-jobs-1604.044712016-04-18 https://scifaro.com/en/abs/capacitated-dominating-set-on-planar-graphs-1604.046642016-04-19 https://scifaro.com/en/abs/impact-of-knowledge-on-election-time-in-anonymous-networks-1604.050232016-04-19 https://scifaro.com/en/abs/on-directed-steiner-trees-with-multiple-roots-1604.051032016-04-19 https://scifaro.com/en/abs/online-dominating-set-1604.051722018-09-14 https://scifaro.com/en/abs/design-of-dynamic-algorithms-via-primal-dual-method-1604.053372016-04-20 https://scifaro.com/en/abs/online-row-sampling-1604.054482016-04-20 https://scifaro.com/en/abs/locating-a-small-cluster-privately-1604.055902017-03-14 https://scifaro.com/en/abs/online-ad-assignment-with-an-ad-exchange-1604.056032016-04-20 https://scifaro.com/en/abs/new-deterministic-approximation-algorithms-for-fully-dynamic-matching-1604.057652016-04-21 https://scifaro.com/en/abs/almost-all-even-yao-yao-graphs-are-spanners-1604.058142016-06-23 https://scifaro.com/en/abs/subexponential-parameterized-algorithms-for-planar-and-apex-minor-free-graphs-via-low-treewidth-pattern-covering-1604.059992016-04-21 https://scifaro.com/en/abs/practical-combinations-of-repetition-aware-data-structures-1604.060022016-04-22 https://scifaro.com/en/abs/a-single-exponential-fixed-parameter-algorithm-for-distance-hereditary-vertex-deletion-1604.060562017-08-07 https://scifaro.com/en/abs/succinct-choice-dictionaries-1604.060582017-03-17 https://scifaro.com/en/abs/cuckoo-filter-simplification-and-analysis-1604.060672016-04-21 https://scifaro.com/en/abs/data-structure-lower-bounds-for-document-indexing-problems-1604.062642016-04-22 https://scifaro.com/en/abs/robust-estimators-in-high-dimensions-without-the-computational-intractability-1604.064432019-03-18 https://scifaro.com/en/abs/weighted-domination-number-of-cactus-graphs-1604.064522016-04-25 https://scifaro.com/en/abs/indexing-variation-graphs-1604.066052017-01-13 https://scifaro.com/en/abs/a-sparse-multidimensional-fft-for-real-positive-vectors-1604.066822016-12-08 https://scifaro.com/en/abs/faster-average-case-low-memory-semi-external-construction-of-the-burrows-wheeler-transform-1604.066872016-04-25 https://scifaro.com/en/abs/blockquicksort-how-branch-mispredictions-don-t-affect-quicksort-1604.066972016-06-27 https://scifaro.com/en/abs/graph-balancing-with-two-edge-types-1604.069182016-09-13 https://scifaro.com/en/abs/agnostic-estimation-of-mean-and-covariance-1604.069682016-08-16 https://scifaro.com/en/abs/better-analysis-of-greedy-binary-search-tree-on-decomposable-sequences-1604.069972016-04-26 https://scifaro.com/en/abs/a-local-algorithm-for-constructing-spanners-in-minor-free-graphs-1604.070382021-04-28 https://scifaro.com/en/abs/closing-the-gap-for-makespan-scheduling-via-sparsification-techniques-1604.071532016-04-26 https://scifaro.com/en/abs/about-the-structure-of-the-integer-cone-and-its-application-to-bin-packing-1604.072862016-12-09 https://scifaro.com/en/abs/fast-approximation-algorithms-for-p-centres-in-large-delta-hyperbolic-graphs-1604.073592016-05-03 https://scifaro.com/en/abs/estimating-weighted-matchings-in-o-n-space-1604.074672016-09-06 https://scifaro.com/en/abs/the-p-center-problem-in-tree-networks-revisited-1604.075352016-04-27 https://scifaro.com/en/abs/pattern-matching-and-consensus-problems-on-weighted-sequences-and-profiles-1604.075812016-07-12 https://scifaro.com/en/abs/hiring-secretaries-over-time-the-benefit-of-concurrent-employment-1604.081252017-05-31 https://scifaro.com/en/abs/a-logarithmic-integrality-gap-bound-for-directed-steiner-tree-in-quasi-bipartite-graphs-1604.081322016-04-28 https://scifaro.com/en/abs/tree-deletion-pruning-in-label-correcting-algorithms-for-the-multiobjective-shortest-path-problem-1604.081472016-04-28 https://scifaro.com/en/abs/polynomial-time-algorithms-for-energy-games-with-special-weight-structures-1604.082342018-03-02 https://scifaro.com/en/abs/graph-minors-for-preserving-terminal-distances-approximately-lower-and-upper-bounds-1604.083422016-12-30 https://scifaro.com/en/abs/exploiting-variable-associations-to-configure-efficient-local-search-algorithms-in-large-scale-binary-integer-programs-1604.084482017-05-15 https://scifaro.com/en/abs/fully-dynamic-maximal-matching-in-constant-update-time-1604.084912016-04-29 https://scifaro.com/en/abs/kadabra-is-an-adaptive-algorithm-for-betweenness-via-random-approximation-1604.085532016-08-15 https://scifaro.com/en/abs/decomposing-cubic-graphs-into-connected-subgraphs-of-size-three-1604.086032022-08-29 https://scifaro.com/en/abs/on-approximating-functions-of-the-singular-values-in-a-stream-1604.086792017-03-21 https://scifaro.com/en/abs/i-o-efficient-generation-of-massive-graphs-following-the-lfr-benchmark-1604.087382017-06-15 https://scifaro.com/en/abs/optimal-computation-of-avoided-words-1604.087602016-05-02 https://scifaro.com/en/abs/a-linear-time-parameterized-algorithm-for-node-unique-label-cover-1604.087642016-05-02 https://scifaro.com/en/abs/designing-optimal-and-fast-on-average-pattern-matching-algorithms-1604.088602016-11-29 https://scifaro.com/en/abs/strongly-refuting-random-csps-below-the-spectral-threshold-1605.000582016-11-07 https://scifaro.com/en/abs/improved-algorithms-for-the-evacuation-route-planning-problem-1605.000652016-05-05 https://scifaro.com/en/abs/dynamic-graph-stream-algorithms-in-o-n-space-1605.000892016-05-03 https://scifaro.com/en/abs/automatic-parameter-derivations-in-k2u-framework-1605.001192016-05-03 https://scifaro.com/en/abs/a-note-on-the-exact-schedulability-analysis-for-segmented-self-suspending-systems-1605.001242016-06-07 https://scifaro.com/en/abs/on-leader-green-election-1605.001372016-05-12 https://scifaro.com/en/abs/random-cluster-dynamics-for-the-ising-model-is-rapidly-mixing-1605.001392016-05-03 https://scifaro.com/en/abs/a-linear-time-algorithm-for-the-weighted-paired-domination-problem-on-block-graphs-1605.003722016-05-03 https://scifaro.com/en/abs/parameterized-complexity-of-the-mincca-problem-on-graphs-of-bounded-decomposability-1605.005322016-05-03 https://scifaro.com/en/abs/algorithms-for-the-pagination-problem-a-bin-packing-with-overlapping-items-1605.005582017-09-06 https://scifaro.com/en/abs/capacity-planning-for-cluster-tools-in-the-semiconductor-industry-1605.009142016-05-04 https://scifaro.com/en/abs/newer-method-of-string-comparison-the-modified-moving-contracting-window-pattern-algorithm-1605.010792016-05-05 https://scifaro.com/en/abs/new-results-on-linear-size-distance-preservers-1605.011062021-01-01 https://scifaro.com/en/abs/fully-dynamic-data-structure-for-lce-queries-in-compressed-space-1605.014882016-06-28 https://scifaro.com/en/abs/rank-and-select-another-lesson-learned-1605.015392016-05-13 https://scifaro.com/en/abs/faster-online-matrix-vector-multiplication-1605.016952016-05-09 https://scifaro.com/en/abs/negative-weight-shortest-paths-and-unit-capacity-minimum-cost-flow-in-tilde-o-m-10-7-log-w-time-1605.017172016-07-15 https://scifaro.com/en/abs/minimum-power-range-assignment-for-symmetric-connectivity-in-sensor-networks-with-two-power-levels-1605.017522016-05-09 https://scifaro.com/en/abs/routing-with-congestion-in-acyclic-digraphs-1605.018662016-05-09 https://scifaro.com/en/abs/markov-chain-methods-for-the-bipartite-boolean-quadratic-programming-problem-1605.020382016-10-25 https://scifaro.com/en/abs/fast-compatibility-testing-for-phylogenies-with-nested-taxa-1605.020452016-05-09 https://scifaro.com/en/abs/average-size-of-a-suffix-tree-for-markov-sources-1605.021232016-05-10 https://scifaro.com/en/abs/solving-generalized-maximum-weight-connected-subgraph-problem-for-network-enrichment-analysis-1605.021682016-05-10 https://scifaro.com/en/abs/the-i-o-complexity-of-strassen-s-matrix-multiplication-with-recomputation-1605.022242016-05-10 https://scifaro.com/en/abs/a-novel-framework-for-online-amnesic-trajectory-compression-in-resource-constrained-environments-1605.023372016-05-10 https://scifaro.com/en/abs/approximate-gaussian-elimination-for-laplacians-fast-sparse-and-simple-1605.023532016-05-10 https://scifaro.com/en/abs/fixed-parameter-approximations-for-k-center-problems-in-low-highway-dimension-graphs-1605.025302019-04-29 https://scifaro.com/en/abs/characterization-and-inference-of-graph-diffusion-processes-from-observations-of-stationary-signals-1605.025692017-06-07 https://scifaro.com/en/abs/parameter-free-locality-sensitive-hashing-for-spherical-range-reporting-1605.026732017-04-11 https://scifaro.com/en/abs/a-framework-for-similarity-search-with-space-time-tradeoffs-using-locality-sensitive-filtering-1605.026872016-11-23 https://scifaro.com/en/abs/lower-bounds-on-time-space-trade-offs-for-approximate-near-neighbors-1605.027012016-08-22 https://scifaro.com/en/abs/querying-temporal-drifts-at-multiple-granularities-technical-report-1605.027722016-05-16 https://scifaro.com/en/abs/an-algorithm-for-koml-os-conjecture-matching-banaszczyk-s-bound-1605.028822016-09-13 https://scifaro.com/en/abs/approximation-and-kernelization-for-chordal-vertex-deletion-1605.030012016-05-11 https://scifaro.com/en/abs/core-congestion-is-inherent-in-hyperbolic-networks-1605.030592016-07-14 https://scifaro.com/en/abs/parameterized-complexity-and-approximation-issues-for-the-colorful-components-problems-1605.030712018-06-20 https://scifaro.com/en/abs/multiobjective-optimization-in-a-quantum-adiabatic-computer-1605.031522020-03-25 https://scifaro.com/en/abs/approximating-min-cost-chain-constrained-spanning-trees-a-reduction-from-weighted-to-unweighted-problems-1605.032032016-05-12 https://scifaro.com/en/abs/variance-of-the-internal-profile-in-suffix-trees-1605.033902016-05-16 https://scifaro.com/en/abs/on-the-lattice-distortion-problem-1605.036132016-11-01 https://scifaro.com/en/abs/parallel-equivalence-class-sorting-algorithms-lower-bounds-and-distribution-based-analysis-1605.036432016-05-13 https://scifaro.com/en/abs/the-non-uniform-k-center-problem-1605.036922016-05-16 https://scifaro.com/en/abs/popular-conjectures-as-a-barrier-for-dynamic-planar-graph-algorithms-1605.037972016-05-13 https://scifaro.com/en/abs/adapting-the-bron-kerbosch-algorithm-for-enumerating-maximal-cliques-in-temporal-graphs-1605.038712017-05-03 https://scifaro.com/en/abs/competitive-analysis-of-the-top-k-ranking-problem-1605.039332016-05-13 https://scifaro.com/en/abs/efficient-similarity-search-in-dynamic-data-streams-1605.039492021-03-09 https://scifaro.com/en/abs/robin-hood-hashing-really-has-constant-average-search-cost-and-variance-in-full-tables-1605.040312016-05-16 https://scifaro.com/en/abs/lightweight-lcp-construction-for-very-large-collections-of-strings-1605.040982016-05-16 https://scifaro.com/en/abs/searching-lattice-data-structures-of-varying-degrees-of-sortedness-1605.041602016-05-16 https://scifaro.com/en/abs/the-densest-k-subhypergraph-problem-1605.042842016-05-16 https://scifaro.com/en/abs/rlzap-relative-lempel-ziv-with-adaptive-pointers-1605.044212016-05-17 https://scifaro.com/en/abs/improved-distance-sensitivity-oracles-via-tree-partitioning-1605.044912016-05-17 https://scifaro.com/en/abs/hopsets-with-constant-hopbound-and-applications-to-approximate-shortest-paths-1605.045382016-05-17 https://scifaro.com/en/abs/efficient-construction-of-probabilistic-tree-embeddings-1605.046512017-05-29 https://scifaro.com/en/abs/flexible-resource-allocation-for-clouds-and-all-optical-networks-1605.049822016-05-18 https://scifaro.com/en/abs/exact-online-string-matching-bibliography-1605.050672016-05-18 https://scifaro.com/en/abs/enumeration-of-enumeration-algorithms-1605.051022016-05-26 https://scifaro.com/en/abs/the-non-uniform-fast-fourier-transform-in-computed-tomography-1605.052312016-05-18 https://scifaro.com/en/abs/fast-concurrent-cuckoo-kick-out-eviction-schemes-for-high-density-tables-1605.052362016-05-18 https://scifaro.com/en/abs/csa-fast-pattern-search-for-large-alphabets-1605.054042016-05-19 https://scifaro.com/en/abs/parallel-algorithms-for-summing-floating-point-numbers-1605.054362016-05-19 https://scifaro.com/en/abs/geometric-near-neighbor-access-tree-gnat-revisited-1605.059442016-05-23 https://scifaro.com/en/abs/online-purchasing-under-uncertainty-1605.060722017-01-11 https://scifaro.com/en/abs/on-polynomial-time-approximation-bounded-solution-for-tsp-and-np-complete-problems-1605.061832016-12-20 https://scifaro.com/en/abs/games-from-basic-data-structures-1605.063272016-05-23 https://scifaro.com/en/abs/efficient-and-compact-representations-of-some-non-canonical-prefix-free-codes-1605.066152021-04-02 https://scifaro.com/en/abs/the-greedy-spanner-is-existentially-optimal-1605.068522020-01-22 https://scifaro.com/en/abs/sonik-efficient-in-situ-all-item-rank-generation-using-bit-operations-1605.069922016-06-24 https://scifaro.com/en/abs/isotropic-dynamic-hierarchical-clustering-1605.070302016-07-19 https://scifaro.com/en/abs/submodular-maximization-using-test-scores-1605.071722019-05-10 https://scifaro.com/en/abs/canonical-number-and-nutcracker-heuristic-algorithms-for-the-graph-isomorphism-problem-using-free-energy-1605.072202016-09-15 https://scifaro.com/en/abs/deterministic-time-space-tradeoffs-for-k-sum-1605.072852016-05-25 https://scifaro.com/en/abs/a-novel-algorithm-for-solving-the-decision-boolean-satisfiability-problem-without-algebra-1605.075032018-04-17 https://scifaro.com/en/abs/parameterized-complexity-of-fair-deletion-problems-1605.079592022-03-17 https://scifaro.com/en/abs/dominance-product-and-high-dimensional-closest-pair-under-l-infty-1605.081072017-06-27 https://scifaro.com/en/abs/analysis-of-resparsification-1605.081942016-05-27 https://scifaro.com/en/abs/a-resource-frugal-probabilistic-dictionary-and-applications-in-meta-genomics-1605.083192016-05-27 https://scifaro.com/en/abs/energy-efficient-algorithms-1605.084482016-05-30 https://scifaro.com/en/abs/maximum-expectation-matching-under-recourse-1605.086162016-05-30 https://scifaro.com/en/abs/parameterized-resiliency-problems-via-integer-linear-programming-1605.087382018-05-04 https://scifaro.com/en/abs/faster-eigenvector-computation-via-shift-and-invert-preconditioning-1605.087542016-05-30 https://scifaro.com/en/abs/greedy-column-subset-selection-new-bounds-and-distributed-algorithms-1605.087952021-11-16 https://scifaro.com/en/abs/algorithms-to-compute-the-lyndon-array-1605.089352016-05-31 https://scifaro.com/en/abs/a-polynomial-time-graph-isomorphism-algorithm-for-graphs-that-are-not-locally-triangle-free-1605.091902016-06-02 https://scifaro.com/en/abs/a-simpler-self-reduction-algorithm-for-matroid-path-width-1605.095202018-04-20 https://scifaro.com/en/abs/dynamic-index-and-lz-factorization-in-compressed-space-1605.095582016-07-20 https://scifaro.com/en/abs/fast-approximate-furthest-neighbors-with-data-dependent-hashing-1605.097842016-06-01 https://scifaro.com/en/abs/graph-isomorphism-testing-boosted-by-path-coloring-1606.000012016-06-02 https://scifaro.com/en/abs/hardness-of-the-pricing-problem-for-chains-in-barter-exchanges-1606.001172016-06-02 https://scifaro.com/en/abs/fast-deterministic-selection-1606.004842016-08-05 https://scifaro.com/en/abs/online-budgeted-truthful-matching-1606.005812016-06-03 https://scifaro.com/en/abs/on-solving-floating-point-sssp-using-an-integer-priority-queue-1606.007262016-06-03 https://scifaro.com/en/abs/approximating-the-spectral-sums-of-large-scale-matrices-using-chebyshev-approximations-1606.009422017-03-10 https://scifaro.com/en/abs/a-minimal-variance-estimator-for-the-cardinality-of-big-data-set-intersection-1606.009962016-06-06 https://scifaro.com/en/abs/temporal-flows-in-temporal-networks-1606.010912017-01-23 https://scifaro.com/en/abs/predicting-with-distributions-1606.012752017-06-12 https://scifaro.com/en/abs/recoverable-robust-spanning-tree-problem-under-interval-uncertainty-representations-1606.013422016-08-30 https://scifaro.com/en/abs/assortment-optimisation-under-a-general-discrete-choice-model-a-tight-analysis-of-revenue-ordered-assortments-1606.013712019-02-22 https://scifaro.com/en/abs/adaptive-submodular-ranking-and-routing-1606.015302019-02-06 https://scifaro.com/en/abs/position-indexed-formulations-for-kidney-exchange-1606.016232016-06-14 https://scifaro.com/en/abs/a-graph-partitioning-algorithm-for-leak-detection-in-water-distribution-networks-1606.017542016-06-07 https://scifaro.com/en/abs/further-kernelization-of-proper-interval-vertex-deletion-new-observations-and-refined-analysis-1606.019252016-11-28 https://scifaro.com/en/abs/re-enabling-high-speed-caching-for-lsm-trees-1606.020152016-06-08 https://scifaro.com/en/abs/a-distributed-force-directed-algorithm-on-giraph-design-and-experiments-1606.021622016-06-08 https://scifaro.com/en/abs/on-the-benefit-of-merging-suffix-array-intervals-for-parallel-pattern-matching-1606.024652016-06-09 https://scifaro.com/en/abs/hardness-of-approximation-for-h-free-edge-modification-problems-1606.026882018-05-15 https://scifaro.com/en/abs/maximum-selection-and-sorting-with-adversarial-comparators-and-an-application-to-density-estimation-1606.027862016-06-10 https://scifaro.com/en/abs/approximation-algorithm-for-n-distance-minimal-vertex-cover-problem-1606.028892016-06-10 https://scifaro.com/en/abs/efficient-robust-proper-learning-of-log-concave-distributions-1606.030772016-06-10 https://scifaro.com/en/abs/approximation-algorithms-for-the-vertex-happiness-1606.031852017-01-12 https://scifaro.com/en/abs/conflict-resolution-in-multiple-access-channels-supporting-simultaneous-successful-transmissions-1606.031982016-06-13 https://scifaro.com/en/abs/constraining-the-number-of-positive-responses-in-adaptive-non-adaptive-and-two-stage-group-testing-1606.032002016-06-13 https://scifaro.com/en/abs/parameterized-algorithmics-for-graph-modification-problems-on-interactions-with-heuristics-1606.032682016-06-13 https://scifaro.com/en/abs/better-partitions-of-protein-graphs-for-subsystem-quantum-chemistry-1606.034272016-06-13 https://scifaro.com/en/abs/on-matching-and-thickness-in-heterogeneous-dynamic-markets-1606.036262017-11-09 https://scifaro.com/en/abs/variable-neighborhood-search-based-algorithm-for-university-course-timetabling-problem-1606.036802016-06-14 https://scifaro.com/en/abs/computing-the-optimal-longest-queue-length-in-torus-networks-1606.038002021-09-03 https://scifaro.com/en/abs/fm-index-of-alignment-with-gaps-1606.038972016-06-14 https://scifaro.com/en/abs/randomized-ternary-search-tries-1606.040422017-01-10 https://scifaro.com/en/abs/single-machine-scheduling-with-job-dependent-machine-deterioration-1606.041572017-02-23 https://scifaro.com/en/abs/context-trees-augmenting-geospatial-trajectories-with-context-1606.042692016-10-12 https://scifaro.com/en/abs/range-majorities-and-minorities-in-arrays-1606.044952016-06-15 https://scifaro.com/en/abs/string-inference-from-the-lcp-array-1606.045732017-02-27 https://scifaro.com/en/abs/space-efficient-biconnected-components-and-recognition-of-outerplanar-graphs-1606.046792016-12-09 https://scifaro.com/en/abs/geodesic-walks-in-polytopes-1606.046962017-06-02 https://scifaro.com/en/abs/improved-space-efficient-linear-time-algorithms-for-bfs-dfs-and-applications-1606.047182017-07-28 https://scifaro.com/en/abs/efficient-data-streaming-multiway-aggregation-through-concurrent-algorithmic-designs-and-new-abstract-data-types-1606.047462016-06-16 https://scifaro.com/en/abs/a-simple-streaming-bit-parallel-algorithm-for-swap-pattern-matching-1606.047632018-09-26 https://scifaro.com/en/abs/distance-geometry-approach-for-special-graph-coloring-problems-1606.049782016-06-17 https://scifaro.com/en/abs/scalable-partial-least-squares-regression-on-grammar-compressed-data-matrices-1606.050312016-06-17 https://scifaro.com/en/abs/revisiting-the-majority-problem-average-case-analysis-with-arbitrarily-many-colours-1606.051232018-01-08 https://scifaro.com/en/abs/reconstructing-a-bounded-degree-directed-tree-using-path-queries-1606.051832017-11-20 https://scifaro.com/en/abs/lp-based-robust-algorithms-for-noisy-minor-free-and-bounded-treewidth-graphs-1606.051982017-02-03 https://scifaro.com/en/abs/weighted-online-problems-with-advice-1606.052102017-08-15 https://scifaro.com/en/abs/geometric-median-in-nearly-linear-time-1606.052252016-06-17 https://scifaro.com/en/abs/a-linear-time-algorithm-for-a-variant-of-the-max-cut-problem-in-series-parallel-graphs-1606.052402017-03-21 https://scifaro.com/en/abs/tssort-probabilistic-noise-resistant-sorting-1606.052892016-06-17 https://scifaro.com/en/abs/on-computing-the-total-displacement-number-via-weighted-motzkin-paths-1606.055382020-08-27 https://scifaro.com/en/abs/explicit-correlation-amplifiers-for-finding-outlier-correlations-in-deterministic-subquadratic-time-1606.056082016-11-09 https://scifaro.com/en/abs/bidimensionality-and-kernels-1606.056892020-09-02 https://scifaro.com/en/abs/a-compact-index-for-order-preserving-pattern-matching-1606.057242018-12-11 https://scifaro.com/en/abs/how-to-fake-multiply-by-a-gaussian-matrix-1606.057322020-12-10 https://scifaro.com/en/abs/the-gene-family-free-median-of-three-1606.059102016-06-21 https://scifaro.com/en/abs/a-new-parallel-algorithm-for-two-pass-connected-component-labeling-1606.059732016-06-21 https://scifaro.com/en/abs/cutwidth-obstructions-and-algorithmic-aspects-1606.059752017-02-16 https://scifaro.com/en/abs/scalable-motif-aware-graph-clustering-1606.062352017-02-07 https://scifaro.com/en/abs/a-linear-potential-function-for-pairing-heaps-1606.063892016-06-28 https://scifaro.com/en/abs/online-stochastic-matching-new-algorithms-and-bounds-1606.063952019-07-24 https://scifaro.com/en/abs/faster-computation-of-path-width-1606.065662016-06-22 https://scifaro.com/en/abs/a-self-index-on-block-trees-1606.066172017-10-11 https://scifaro.com/en/abs/intriguingly-simple-and-efficient-time-dependent-routing-in-road-networks-1606.066362017-07-03 https://scifaro.com/en/abs/two-stage-algorithms-for-covering-array-construction-1606.067302016-06-23 https://scifaro.com/en/abs/think-eternally-improved-algorithms-for-the-temp-secretary-problem-and-extensions-1606.069262016-06-23 https://scifaro.com/en/abs/optimal-evacuation-flows-on-dynamic-paths-with-general-edge-capacities-1606.072082016-06-24 https://scifaro.com/en/abs/robust-learning-of-fixed-structure-bayesian-networks-1606.073842018-10-30 https://scifaro.com/en/abs/generalized-preconditioning-and-network-flow-problems-1606.074252016-06-28 https://scifaro.com/en/abs/on-the-importance-of-graph-search-algorithms-for-drgep-based-mechanism-reduction-methods-1606.078022016-06-28 https://scifaro.com/en/abs/tight-algorithms-for-vertex-cover-with-hard-capacities-on-multigraphs-and-hypergraphs-1606.078612017-01-24 https://scifaro.com/en/abs/matroid-online-bipartite-matching-and-vertex-cover-1606.078632016-06-28 https://scifaro.com/en/abs/fully-dynamic-spanners-with-worst-case-update-time-1606.078642018-03-02 https://scifaro.com/en/abs/constant-factor-approximation-algorithms-for-uniform-hard-capacitated-facility-location-problems-natural-lp-is-not-too-bad-1606.080222022-03-24 https://scifaro.com/en/abs/matrix-balancing-in-lp-norms-a-new-analysis-of-osborne-s-iteration-1606.080832016-06-28 https://scifaro.com/en/abs/a-width-parameter-useful-for-chordal-and-co-comparability-graphs-1606.080872017-03-08 https://scifaro.com/en/abs/near-optimal-computation-of-runs-over-general-alphabet-via-non-crossing-lce-queries-1606.082752016-06-28 https://scifaro.com/en/abs/a-reduction-for-optimizing-lattice-submodular-functions-with-diminishing-returns-1606.083622018-05-29 https://scifaro.com/en/abs/biconnectivity-st-numbering-and-other-applications-of-dfs-using-o-n-bits-1606.086452017-07-28 https://scifaro.com/en/abs/iterative-partial-rounding-for-vertex-cover-with-hard-capacities-1606.086672016-10-17 https://scifaro.com/en/abs/using-sequence-ensembles-for-seeding-alignments-of-minion-sequencing-data-1606.087192016-06-29 https://scifaro.com/en/abs/better-unrelated-machine-scheduling-for-weighted-completion-time-via-random-offsets-from-non-uniform-distributions-1606.088172016-06-29 https://scifaro.com/en/abs/efficiently-inferring-pairwise-subtree-prune-and-regraft-adjacencies-between-phylogenetic-trees-1606.088932017-04-28 https://scifaro.com/en/abs/the-matching-relaxation-for-a-class-of-generalized-set-partitioning-problems-1606.092792022-08-30 https://scifaro.com/en/abs/online-packet-scheduling-with-bounded-delay-and-lookahead-1606.093952016-07-01 https://scifaro.com/en/abs/generating-massive-complex-networks-with-hyperbolic-geometry-faster-in-practice-1606.094812016-07-01 https://scifaro.com/en/abs/representing-pattern-matching-algorithms-by-polynomial-size-automata-1607.001382016-07-04 https://scifaro.com/en/abs/lecture-notes-on-the-arv-algorithm-for-sparsest-cut-1607.008542016-07-05 https://scifaro.com/en/abs/unit-interval-vertex-deletion-fewer-vertices-are-relevant-1607.011622016-07-06 https://scifaro.com/en/abs/improved-lower-bounds-for-online-hypercube-and-rectangle-packing-1607.012292017-11-07 https://scifaro.com/en/abs/trip-based-public-transit-routing-using-condensed-search-trees-1607.012992016-09-16 https://scifaro.com/en/abs/on-sampling-and-greedy-map-inference-of-constrained-determinantal-point-processes-1607.015512016-07-07 https://scifaro.com/en/abs/deterministic-graph-exploration-with-advice-1607.016572016-11-17 https://scifaro.com/en/abs/on-the-complexity-and-approximability-of-budget-constrained-minimum-cost-flows-1607.022822016-07-11 https://scifaro.com/en/abs/a-network-simplex-method-for-the-budget-constrained-minimum-cost-flow-problem-1607.022842017-11-16 https://scifaro.com/en/abs/robust-assignments-via-ear-decompositions-and-randomized-rounding-1607.024372016-07-11 https://scifaro.com/en/abs/fine-grained-complexity-analysis-of-two-classic-tsp-variants-1607.027252016-07-12 https://scifaro.com/en/abs/computing-the-atom-graph-of-a-graph-and-the-union-join-graph-of-a-hypergraph-1607.029112016-07-12 https://scifaro.com/en/abs/estimating-current-flow-closeness-centrality-with-a-multigrid-laplacian-solver-1607.029552020-11-09 https://scifaro.com/en/abs/quadboost-a-scalable-concurrent-quadtree-1607.032922016-07-13 https://scifaro.com/en/abs/tight-lower-bounds-for-the-complexity-of-multicoloring-1607.034322017-02-20 https://scifaro.com/en/abs/pseudo-centroid-clustering-1607.034672016-11-04 https://scifaro.com/en/abs/streaming-algorithms-for-computing-edit-distance-without-exploiting-suffix-trees-1607.037182016-07-14 https://scifaro.com/en/abs/improved-approximation-for-weighted-tree-augmentation-with-bounded-costs-1607.037912016-09-16 https://scifaro.com/en/abs/practical-optimization-of-steiner-trees-via-the-cavity-method-1607.038662016-08-03 https://scifaro.com/en/abs/tolerant-junta-testing-and-the-connection-to-submodular-optimization-and-function-isomorphism-1607.039382016-11-04 https://scifaro.com/en/abs/deleting-and-testing-forbidden-patterns-in-multi-dimensional-arrays-1607.039612017-03-28 https://scifaro.com/en/abs/directed-hamiltonicity-and-out-branchings-via-generalized-laplacians-1607.040022017-04-26 https://scifaro.com/en/abs/edit-distance-sketching-streaming-and-document-exchange-1607.042002016-07-15 https://scifaro.com/en/abs/space-efficient-construction-of-compressed-indexes-in-deterministic-linear-time-1607.043462016-11-15 https://scifaro.com/en/abs/heuristics-for-packing-semifluids-1607.044032016-07-18 https://scifaro.com/en/abs/online-grammar-compression-for-frequent-pattern-discovery-1607.044462016-09-01 https://scifaro.com/en/abs/maximizing-a-monotone-submodular-function-with-a-bounded-curvature-under-a-knapsack-constraint-1607.045272016-07-18 https://scifaro.com/en/abs/on-distance-d-independent-set-and-other-problems-in-graphs-with-few-minimal-separators-1607.045452016-07-18 https://scifaro.com/en/abs/local-search-for-max-sum-diversification-1607.045572016-07-18 https://scifaro.com/en/abs/the-complexity-of-tropical-graph-homomorphisms-1607.047772018-01-31 https://scifaro.com/en/abs/robust-algorithms-with-polynomial-loss-for-near-unanimity-csps-1607.047872018-12-06 https://scifaro.com/en/abs/logic-programming-with-graph-automorphism-integrating-naut-with-prolog-tool-description-1607.048292016-08-02 https://scifaro.com/en/abs/fully-dynamic-de-bruijn-graphs-1607.049092016-07-21 https://scifaro.com/en/abs/near-optimal-induced-universal-graphs-for-bounded-degree-graphs-1607.049112016-07-25 https://scifaro.com/en/abs/an-improved-algorithm-for-incremental-dfs-tree-in-undirected-graphs-1607.049132018-02-21 https://scifaro.com/en/abs/distributed-graph-clustering-by-load-balancing-1607.049842019-04-12 https://scifaro.com/en/abs/minimum-cycle-and-homology-bases-of-surface-embedded-graphs-1607.051122016-07-19 https://scifaro.com/en/abs/partitioning-a-graph-into-small-pieces-with-applications-to-path-transversal-1607.051222016-07-19 https://scifaro.com/en/abs/near-optimal-approximate-shortest-paths-and-transshipment-in-distributed-and-streaming-models-1607.051272021-02-04 https://scifaro.com/en/abs/fully-dynamic-all-pairs-shortest-paths-with-worst-case-update-time-revisited-1607.051322018-03-02 https://scifaro.com/en/abs/multi-view-pattern-matching-1607.051572016-07-19 https://scifaro.com/en/abs/on-the-optimality-of-pseudo-polynomial-algorithms-for-integer-programming-1607.053422018-07-18 https://scifaro.com/en/abs/multidimensional-dynamic-pricing-for-welfare-maximization-1607.053972017-06-13 https://scifaro.com/en/abs/distance-sensitive-bloom-filters-without-false-negatives-1607.054512016-11-03 https://scifaro.com/en/abs/spanning-circuits-in-regular-matroids-1607.055162016-07-20 https://scifaro.com/en/abs/distributed-construction-of-purely-additive-spanners-1607.055972016-07-20 https://scifaro.com/en/abs/streaming-k-mismatch-with-error-correcting-and-applications-1607.056262019-04-24 https://scifaro.com/en/abs/how-to-discreetly-spread-a-rumor-in-a-crowd-1607.056972016-07-20 https://scifaro.com/en/abs/erasure-resilient-property-testing-1607.057862016-07-21 https://scifaro.com/en/abs/conditionally-optimal-algorithms-for-generalized-b-uchi-games-1607.058502016-11-17 https://scifaro.com/en/abs/dynamic-time-warping-and-geometric-edit-distance-breaking-the-quadratic-barrier-1607.059942020-01-29 https://scifaro.com/en/abs/approximating-spanners-and-directed-steiner-forest-upper-and-lower-bounds-1607.060682016-07-21 https://scifaro.com/en/abs/stochastic-dominance-and-the-bijective-ratio-of-online-algorithms-1607.061322016-07-22 https://scifaro.com/en/abs/faster-graph-coloring-in-polynomial-space-1607.062012016-10-14 https://scifaro.com/en/abs/greedy-bi-criteria-approximations-for-k-medians-and-k-means-1607.062032016-07-22 https://scifaro.com/en/abs/metric-perturbation-resilience-1607.064422016-07-22 https://scifaro.com/en/abs/hyperloglog-hyper-extended-sketches-for-concave-sublinear-frequency-statistics-1607.065172017-02-27 https://scifaro.com/en/abs/gerbil-a-fast-and-memory-efficient-k-mer-counter-with-gpu-support-1607.066182016-07-25 https://scifaro.com/en/abs/fast-longest-common-extensions-in-small-space-1607.066602016-07-25 https://scifaro.com/en/abs/edge-coloring-with-minimum-reload-changeover-costs-1607.067512016-07-25 https://scifaro.com/en/abs/hereditary-graph-classes-when-the-complexities-of-colouring-and-clique-cover-coincide-1607.067572017-06-08 https://scifaro.com/en/abs/connectivity-oracles-for-graphs-subject-to-vertex-failures-1607.068652017-09-08 https://scifaro.com/en/abs/incremental-2-edge-connectivity-in-directed-graphs-1607.070732016-07-26 https://scifaro.com/en/abs/polynomial-time-algorithm-for-2-stable-clustering-instances-1607.074312017-02-14 https://scifaro.com/en/abs/a-hierarchy-of-lower-bounds-for-sublinear-additive-spanners-1607.074972017-01-11 https://scifaro.com/en/abs/low-congestion-shortcuts-without-embedding-1607.075532020-08-25 https://scifaro.com/en/abs/unrelated-machine-scheduling-of-jobs-with-uniform-smith-ratios-1607.076312017-03-16 https://scifaro.com/en/abs/a-scalable-algorithm-for-tracking-an-unknown-number-of-targets-using-multiple-sensors-1607.076472017-05-24 https://scifaro.com/en/abs/a-selectable-sloppy-heap-1607.076732017-08-11 https://scifaro.com/en/abs/finding-detours-is-fixed-parameter-tractable-1607.077372018-04-24 https://scifaro.com/en/abs/computing-the-k-nearest-neighbors-for-all-vertices-via-dijkstra-1607.078182016-07-27 https://scifaro.com/en/abs/approximation-and-parameterized-complexity-of-minimax-approval-voting-1607.079062016-07-28 https://scifaro.com/en/abs/on-maximizing-a-monotone-k-submodular-function-subject-to-a-matroid-constraint-1607.079572016-08-23 https://scifaro.com/en/abs/minmax-tree-facility-location-and-sink-evacuation-with-dynamic-confluent-flows-1607.080412016-07-28 https://scifaro.com/en/abs/suffix-arrays-with-a-twist-1607.081762016-07-28 https://scifaro.com/en/abs/efficient-algorithms-for-constructing-very-sparse-spanners-and-emulators-1607.083372017-02-07 https://scifaro.com/en/abs/a-new-lightweight-algorithm-to-compute-the-bwt-and-the-lcp-array-of-a-set-of-strings-1607.083422016-07-29 https://scifaro.com/en/abs/computing-minimum-cuts-in-hypergraphs-1607.086822017-05-16 https://scifaro.com/en/abs/submodular-secretary-problems-cardinality-matching-and-linear-constraints-1607.088052016-08-01 https://scifaro.com/en/abs/local-testing-for-membership-in-lattices-1608.001802016-08-02 https://scifaro.com/en/abs/an-approximation-algorithm-for-maximum-internal-spanning-tree-1608.001962016-08-02 https://scifaro.com/en/abs/optimal-distance-labeling-schemes-for-trees-1608.002122017-05-16 https://scifaro.com/en/abs/on-approximating-maximum-independent-set-of-rectangles-1608.002712016-08-02 https://scifaro.com/en/abs/on-the-complexity-of-constrained-determinantal-point-processes-1608.005542017-04-25 https://scifaro.com/en/abs/adaptivity-gaps-for-stochastic-probing-submodular-and-xos-functions-1608.006732016-08-03 https://scifaro.com/en/abs/on-the-power-of-simple-reductions-for-the-maximum-independent-set-problem-1608.007242016-08-03 https://scifaro.com/en/abs/sparse-suffix-tree-construction-in-optimal-time-and-space-1608.008652016-08-03 https://scifaro.com/en/abs/meraculous2-fast-accurate-short-read-assembly-of-large-polymorphic-genomes-1608.010312017-11-09 https://scifaro.com/en/abs/fast-and-lean-immutable-multi-maps-on-the-jvm-based-on-heterogeneous-hash-array-mapped-tries-1608.010362016-08-04 https://scifaro.com/en/abs/testing-sparsity-over-known-and-unknown-bases-1608.012752017-09-14 https://scifaro.com/en/abs/consistent-hashing-with-bounded-loads-1608.013502017-07-28 https://scifaro.com/en/abs/quasimetric-embeddings-and-their-applications-1608.013962016-08-05 https://scifaro.com/en/abs/linear-time-kernelization-for-feedback-vertex-set-1608.014632017-02-20 https://scifaro.com/en/abs/streaming-weighted-matchings-optimal-meets-greedy-1608.014872018-05-01 https://scifaro.com/en/abs/robust-shortest-path-planning-and-semicontractive-dynamic-programming-1608.016702016-08-08 https://scifaro.com/en/abs/approximation-algorithms-for-clustering-problems-with-lower-bounds-and-outliers-1608.017002016-11-04 https://scifaro.com/en/abs/a-polynomial-time-deterministic-approach-to-the-traveling-salesperson-problem-1608.017162018-11-19 https://scifaro.com/en/abs/improved-approximation-algorithms-for-capacitated-fault-tolerant-k-center-1608.017212016-08-08 https://scifaro.com/en/abs/computing-the-independence-polynomial-from-the-tree-threshold-down-to-the-roots-1608.022822017-11-15 https://scifaro.com/en/abs/epr-dictionaries-a-practical-and-fast-data-structure-for-constant-time-searches-in-unidirectional-and-bidirectional-fm-indices-1608.024132016-11-18 https://scifaro.com/en/abs/an-widetilde-o-n-queries-adaptive-tester-for-unateness-1608.024512016-08-09 https://scifaro.com/en/abs/a-note-on-the-survivable-network-design-problem-1608.025152016-08-09 https://scifaro.com/en/abs/bidirectional-conditional-insertion-sort-algorithm-an-efficient-progress-on-the-classical-insertion-sort-1608.026152017-08-08 https://scifaro.com/en/abs/parameterized-algorithms-for-the-maximum-agreement-forest-problem-on-multiple-rooted-multifurcating-trees-1608.027092016-09-06 https://scifaro.com/en/abs/testing-assignments-to-constraint-satisfaction-problems-1608.030172016-08-11 https://scifaro.com/en/abs/the-sparse-awakens-streaming-algorithms-for-matching-size-estimation-in-sparse-graphs-1608.031182016-11-15 https://scifaro.com/en/abs/on-the-limitations-of-deterministic-de-randomizations-for-online-bipartite-matching-and-max-sat-1608.031822016-08-11 https://scifaro.com/en/abs/distributed-degree-splitting-edge-coloring-and-orientations-1608.032202016-08-11 https://scifaro.com/en/abs/faster-algorithms-for-computing-the-stationary-distribution-simulating-random-walks-and-more-1608.032702016-11-03 https://scifaro.com/en/abs/approximation-algorithms-for-the-maximum-weight-internal-spanning-tree-problem-1608.032992017-05-30 https://scifaro.com/en/abs/bi-arc-digraphs-and-conservative-polymorphisms-1608.033682020-03-03 https://scifaro.com/en/abs/finding-large-set-covers-faster-via-the-representation-method-1608.034392016-08-12 https://scifaro.com/en/abs/optimal-hashing-based-time-space-trade-offs-for-approximate-near-neighbors-1608.035802019-10-04 https://scifaro.com/en/abs/constrained-submodular-maximization-beyond-1-e-1608.036112016-08-15 https://scifaro.com/en/abs/greedy-maximization-framework-for-graph-based-influence-functions-1608.040362016-09-09 https://scifaro.com/en/abs/instantaneous-reaction-time-in-dynamic-consistency-checking-of-conditional-simple-temporal-networks-extended-version-with-an-improved-upper-bound-1608.041322018-12-11 https://scifaro.com/en/abs/a-faster-approximation-algorithm-for-the-gibbs-partition-function-1608.042232017-12-29 https://scifaro.com/en/abs/polynomial-representations-of-threshold-functions-and-algorithmic-applications-1608.043552016-08-16 https://scifaro.com/en/abs/an-improved-algorithm-for-diameter-optimally-augmenting-paths-in-a-metric-space-1608.044562016-08-17 https://scifaro.com/en/abs/lecture-notes-on-randomized-linear-algebra-1608.044812016-08-17 https://scifaro.com/en/abs/optimization-of-bootstrapping-in-circuits-1608.045352016-08-17 https://scifaro.com/en/abs/faster-sublinear-algorithms-using-conditional-sampling-1608.047592016-08-18 https://scifaro.com/en/abs/compact-and-fast-sensitivity-oracles-for-single-source-distances-1608.047692016-08-18 https://scifaro.com/en/abs/lecture-notes-on-spectral-graph-methods-1608.048452016-08-18 https://scifaro.com/en/abs/quicksort-with-median-of-medians-is-considered-practical-1608.048522016-08-18 https://scifaro.com/en/abs/quicksort-is-optimal-for-many-equal-keys-1608.049062019-05-07 https://scifaro.com/en/abs/in-place-sparse-suffix-sorting-1608.051002017-11-02 https://scifaro.com/en/abs/shortest-unique-palindromic-substring-queries-in-optimal-time-1608.055502017-07-05 https://scifaro.com/en/abs/linear-kernels-for-separating-a-graph-into-components-of-bounded-size-1608.058162017-08-08 https://scifaro.com/en/abs/the-random-access-zipper-simple-purely-functional-sequences-1608.060092016-08-23 https://scifaro.com/en/abs/computing-maximum-flow-with-augmenting-electrical-flows-1608.060162016-08-23 https://scifaro.com/en/abs/a-linear-kernel-for-finding-square-roots-of-almost-planar-graphs-1608.061362016-08-23 https://scifaro.com/en/abs/squares-of-low-maximum-degree-1608.061422016-08-30 https://scifaro.com/en/abs/a-ptas-for-the-steiner-forest-problem-in-doubling-metrics-1608.063252016-08-24 https://scifaro.com/en/abs/online-bin-packing-with-cardinality-constraints-resolved-1608.064152016-08-24 https://scifaro.com/en/abs/on-low-high-orders-of-directed-graphs-incremental-algorithms-and-applications-1608.064622016-08-24 https://scifaro.com/en/abs/synergistic-sorting-multiselection-and-deferred-data-structures-on-multisets-1608.066662016-10-03 https://scifaro.com/en/abs/a-widetilde-o-n-non-adaptive-tester-for-unateness-1608.069802016-09-06 https://scifaro.com/en/abs/a-simple-linear-space-algorithm-for-computing-a-longest-common-increasing-subsequence-1608.070022016-08-26 https://scifaro.com/en/abs/kernelization-and-parameterized-algorithms-for-3-path-vertex-cover-1608.070222017-08-08 https://scifaro.com/en/abs/a-note-on-the-practicality-of-maximal-planar-subgraph-algorithms-1608.075052016-08-29 https://scifaro.com/en/abs/an-algorithm-for-dividing-two-complex-numbers-1608.075962016-08-31 https://scifaro.com/en/abs/testing-unateness-of-real-valued-functions-1608.076522016-08-30 https://scifaro.com/en/abs/indexing-and-querying-color-sets-of-images-1608.078472016-08-30 https://scifaro.com/en/abs/crossing-minimization-in-storyline-visualization-1608.080272016-08-30 https://scifaro.com/en/abs/a-family-of-fast-exact-pattern-matching-algorithms-1608.083462016-08-31 https://scifaro.com/en/abs/collaborative-delivery-with-energy-constrained-mobile-robots-1608.085002020-08-27 https://scifaro.com/en/abs/placing-arrows-in-directed-graph-drawings-1608.085052016-08-31 https://scifaro.com/en/abs/the-h-k-server-problem-on-bounded-depth-trees-1608.085272017-04-12 https://scifaro.com/en/abs/low-ply-drawings-of-trees-1608.085382016-09-05 https://scifaro.com/en/abs/dynamic-controllability-of-conditional-simple-temporal-networks-is-pspace-complete-1608.085452016-08-31 https://scifaro.com/en/abs/bitonic-st-orderings-for-upward-planar-graphs-1608.085782016-08-31 https://scifaro.com/en/abs/using-parallelism-techniques-to-improve-sequential-and-multi-core-sorting-performance-1608.086482016-09-01 https://scifaro.com/en/abs/one-minute-derivation-of-the-conjugate-gradient-algorithm-1608.086912016-09-01 https://scifaro.com/en/abs/j-viz-sibling-first-recursive-graph-drawing-for-visualizing-java-bytecode-1608.089702016-09-01 https://scifaro.com/en/abs/parallel-clustering-of-graphs-for-anonymization-and-recommender-systems-1609.001612016-09-05 https://scifaro.com/en/abs/testing-k-monotonicity-1609.002652016-09-15 https://scifaro.com/en/abs/beyond-highway-dimension-small-distance-labels-using-tree-skeletons-1609.005122016-12-13 https://scifaro.com/en/abs/on-unrooted-and-root-uncertain-variants-of-several-well-known-phylogenetic-network-problems-1609.005442016-09-05 https://scifaro.com/en/abs/predicting-signed-edges-with-o-n-1-o-1-log-n-queries-1609.007502016-10-05 https://scifaro.com/en/abs/algorithms-for-visualizing-phylogenetic-networks-1609.007552016-09-06 https://scifaro.com/en/abs/greedy-maxcut-algorithms-and-their-information-content-1609.008102016-09-06 https://scifaro.com/en/abs/dynamic-beats-fixed-on-phase-based-algorithms-for-file-migration-1609.008312019-06-24 https://scifaro.com/en/abs/a-robust-sparse-fourier-transform-in-the-continuous-setting-1609.008962016-09-06 https://scifaro.com/en/abs/cost-efficient-scheduling-on-machines-from-the-cloud-1609.011842016-12-22 https://scifaro.com/en/abs/fourier-sparse-interpolation-without-a-frequency-gap-1609.013612016-09-07 https://scifaro.com/en/abs/improved-algorithms-for-computing-k-sink-on-dynamic-path-networks-1609.013732016-09-07 https://scifaro.com/en/abs/succinct-data-structure-for-nearest-colored-node-in-a-tree-1609.014002017-02-21 https://scifaro.com/en/abs/faster-o-v-2-e-w-time-energy-algorithms-for-optimal-strategy-synthesis-in-mean-payoff-games-1609.015172016-09-07 https://scifaro.com/en/abs/fleet-management-for-autonomous-vehicles-1609.016342016-09-07 https://scifaro.com/en/abs/compact-layered-drawings-of-general-directed-graphs-1609.017552016-09-08 https://scifaro.com/en/abs/revisiting-calculation-of-moments-of-number-of-comparisons-used-by-the-randomized-quick-sort-algorithm-1609.018702017-04-13 https://scifaro.com/en/abs/mixed-integer-programming-for-cycle-detection-in-non-reversible-markov-processes-1609.020632016-09-12 https://scifaro.com/en/abs/optimal-speed-scaling-with-a-solar-cell-1609.026682016-09-12 https://scifaro.com/en/abs/an-empirical-study-of-cycle-toggling-based-laplacian-solvers-1609.029572016-09-13 https://scifaro.com/en/abs/efficient-computation-of-longest-single-arm-gapped-palindromes-in-a-string-1609.030002019-11-01 https://scifaro.com/en/abs/a-heuristic-method-of-generating-diameter-3-graphs-for-order-degree-problem-1609.031362016-10-10 https://scifaro.com/en/abs/postprocessing-for-iterative-differentially-private-algorithms-1609.032512016-09-13 https://scifaro.com/en/abs/dilemma-first-search-for-effortless-optimization-of-np-hard-problems-1609.035452016-09-13 https://scifaro.com/en/abs/efficient-completion-of-weighted-automata-1609.036452016-09-14 https://scifaro.com/en/abs/longest-common-subsequence-in-at-least-k-length-order-isomorphic-substrings-1609.036682017-02-07 https://scifaro.com/en/abs/a-cubic-time-2-approximation-algorithm-for-rspr-distance-1609.040292017-07-28 https://scifaro.com/en/abs/opting-into-optimal-matchings-1609.040512016-09-15 https://scifaro.com/en/abs/a-linear-time-parameterized-algorithm-for-directed-feedback-vertex-set-1609.043472016-09-15 https://scifaro.com/en/abs/time-variant-graph-classification-1609.043502017-06-14 https://scifaro.com/en/abs/sort-race-1609.044712016-09-16 https://scifaro.com/en/abs/scheduling-autonomous-vehicle-platoons-through-an-unregulated-intersection-1609.045122016-09-16 https://scifaro.com/en/abs/from-h-m-to-gap-for-lightweight-bwt-merging-1609.046182016-09-16 https://scifaro.com/en/abs/compressive-computed-tomography-reconstruction-through-denoising-approximate-message-passing-1609.046612020-11-04 https://scifaro.com/en/abs/k-medoids-for-k-means-seeding-1609.047232017-11-07 https://scifaro.com/en/abs/finding-disjoint-paths-on-edge-colored-graphs-more-tractability-results-1609.049512017-11-30 https://scifaro.com/en/abs/parameterized-and-approximation-complexity-of-partial-vc-dimension-1609.051102019-05-29 https://scifaro.com/en/abs/kmerlight-fast-and-accurate-k-mer-abundance-estimation-1609.056262016-09-20 https://scifaro.com/en/abs/spectrometer-amortized-sublinear-spectral-approximation-of-distance-on-graphs-1609.057152016-09-20 https://scifaro.com/en/abs/fully-dynamic-connectivity-in-o-log-n-log-log-n-2-amortized-expected-time-1609.058672024-02-14 https://scifaro.com/en/abs/matrix-norms-in-data-streams-faster-multi-pass-and-row-order-1609.058852018-10-25 https://scifaro.com/en/abs/derandomized-concentration-bounds-for-polynomials-and-hypergraph-maximal-independent-set-1609.061562023-10-13 https://scifaro.com/en/abs/linear-time-string-indexing-and-analysis-in-small-space-1609.063782016-09-22 https://scifaro.com/en/abs/exact-rule-based-stochastic-simulations-for-systems-with-unlimited-number-of-molecular-species-1609.064032016-10-05 https://scifaro.com/en/abs/the-cascading-haar-wavelet-algorithm-for-computing-the-walsh-hadamard-transform-1609.066412017-06-28 https://scifaro.com/en/abs/psvr-self-stabilizing-publish-subscribe-communication-for-ad-hoc-networks-1609.068412016-09-23 https://scifaro.com/en/abs/nash-social-welfare-matrix-permanent-and-stable-polynomials-1609.070562016-09-26 https://scifaro.com/en/abs/clifford-algebras-meet-tree-decompositions-1609.071342018-08-13 https://scifaro.com/en/abs/a-topological-algorithm-for-determining-how-road-networks-evolve-over-time-1609.072392016-09-26 https://scifaro.com/en/abs/scheduling-under-power-and-energy-constraints-1609.073542019-02-08 https://scifaro.com/en/abs/popularity-in-the-generalized-hospital-residents-setting-1609.076502016-12-20 https://scifaro.com/en/abs/a-practical-algorithm-for-packing-tubes-and-boxes-1609.076762016-09-27 https://scifaro.com/en/abs/linear-kernels-for-edge-deletion-problems-to-immersion-closed-graph-classes-1609.077802016-09-27 https://scifaro.com/en/abs/fractality-of-massive-graphs-scalable-analysis-with-sketch-based-box-covering-algorithm-1609.079942016-09-27 https://scifaro.com/en/abs/how-much-does-a-treedepth-modulator-help-to-obtain-polynomial-kernels-beyond-sparse-graphs-1609.080952018-06-07 https://scifaro.com/en/abs/tight-hardness-results-for-distance-and-centrality-problems-in-constant-degree-graphs-1609.084032017-04-21 https://scifaro.com/en/abs/scenic-routes-now-efficiently-solving-the-time-dependent-arc-orienteering-problem-1609.084842016-09-28 https://scifaro.com/en/abs/median-of-k-jumplists-and-dangling-min-bsts-1609.085132019-05-07 https://scifaro.com/en/abs/efficient-algorithms-for-scheduling-moldable-tasks-1609.085882023-03-30 https://scifaro.com/en/abs/cut-tree-construction-from-massive-graphs-1609.087232016-09-29 https://scifaro.com/en/abs/the-subset-assignment-problem-for-data-placement-in-caches-1609.087672016-10-04 https://scifaro.com/en/abs/on-notions-of-distortion-and-an-almost-minimum-spanning-tree-with-constant-average-distortion-1609.088012018-11-14 https://scifaro.com/en/abs/anytime-discovery-of-a-diverse-set-of-patterns-with-monte-carlo-tree-search-1609.088272017-12-07 https://scifaro.com/en/abs/the-power-of-data-reduction-for-matching-1609.088792020-07-24 https://scifaro.com/en/abs/a-tight-analysis-of-kierstead-trotter-algorithm-for-online-unit-interval-coloring-1609.090312016-11-03 https://scifaro.com/en/abs/graph-partitioning-and-a-componentwise-pagerank-algorithm-1609.090682016-09-30 https://scifaro.com/en/abs/a-linear-programming-based-heuristic-framework-for-min-max-regret-combinatorial-optimization-problems-with-interval-costs-1609.091792016-12-21 https://scifaro.com/en/abs/lower-bounds-for-protrusion-replacement-by-counting-equivalence-classes-1609.093042016-09-30 https://scifaro.com/en/abs/maximizing-the-strong-triadic-closure-in-split-graphs-and-proper-interval-graphs-1609.094332016-10-10 https://scifaro.com/en/abs/multi-dimensional-signal-approximation-with-sparse-structured-priors-using-split-bregman-iterations-1609.095252016-10-03 https://scifaro.com/en/abs/approximate-hierarchical-clustering-via-sparsest-cut-and-spreading-metrics-1609.095482016-10-03 https://scifaro.com/en/abs/clustered-planarity-with-pipes-1609.096792016-10-03 https://scifaro.com/en/abs/regular-and-almost-universal-hashing-an-efficient-implementation-1609.098402018-10-16 https://scifaro.com/en/abs/ptas-for-ordered-instances-of-resource-allocation-problems-with-restrictions-on-inclusions-1610.000822016-10-12 https://scifaro.com/en/abs/fast-and-compact-planar-embeddings-1610.001302018-02-20 https://scifaro.com/en/abs/real-stability-testing-1610.002092016-10-04 https://scifaro.com/en/abs/a-theta-m-9-ternary-minimum-cost-network-flow-lp-model-of-the-assignment-problem-polytope-with-applications-to-hard-combinatorial-optimization-problems-1610.003532026-04-13 https://scifaro.com/en/abs/on-the-weighted-quartet-consensus-problem-1610.005052017-05-12 https://scifaro.com/en/abs/facility-leasing-with-penalties-1610.005752016-10-04 https://scifaro.com/en/abs/approximation-algorithms-for-stochastic-k-tsp-1610.010582016-10-05 https://scifaro.com/en/abs/a-recursive-algorithm-for-a-pipeline-maintenance-scheduling-problem-1610.011502016-10-06 https://scifaro.com/en/abs/on-the-algorithmic-significance-and-analysis-of-the-method-of-dayan-deriving-one-1610.011752017-09-04 https://scifaro.com/en/abs/on-equivalent-color-transform-and-four-coloring-theorem-1610.018652016-10-07 https://scifaro.com/en/abs/a-framework-for-small-but-rich-vehicle-routing-problems-1610.018762016-10-07 https://scifaro.com/en/abs/efficient-l1-norm-principal-component-analysis-via-bit-flipping-1610.019592017-08-02 https://scifaro.com/en/abs/polynomial-time-tensor-decompositions-with-sum-of-squares-1610.019802016-10-07 https://scifaro.com/en/abs/constant-approximation-algorithm-for-non-uniform-capacitated-multi-item-lot-sizing-via-strong-covering-inequalities-1610.020562016-10-10 https://scifaro.com/en/abs/a-hybrid-sampling-scheme-for-triangle-counting-1610.020662019-04-18 https://scifaro.com/en/abs/an-efficient-high-probability-algorithm-for-linear-bandits-1610.020722016-10-14 https://scifaro.com/en/abs/approximation-algorithms-for-multi-multiway-cut-and-multicut-problems-on-directed-graphs-1610.023362020-11-06 https://scifaro.com/en/abs/energy-efficient-delivery-by-heterogeneous-mobile-agents-1610.023612020-08-27 https://scifaro.com/en/abs/lopsidependency-in-the-moser-tardos-framework-beyond-the-lopsided-lovasz-local-lemma-1610.024202023-10-13 https://scifaro.com/en/abs/redundancies-in-linear-systems-with-two-variables-per-inequality-1610.028202016-10-11 https://scifaro.com/en/abs/an-encoding-for-order-preserving-matching-1610.028652017-02-21 https://scifaro.com/en/abs/comments-on-dumitrescu-s-a-selectable-sloppy-heap-1610.029532016-10-11 https://scifaro.com/en/abs/batch-coloring-of-graphs-1610.029972016-10-11 https://scifaro.com/en/abs/scalable-construction-of-text-indexes-1610.030072016-10-11 https://scifaro.com/en/abs/tight-tradeoffs-for-real-time-approximation-of-longest-palindromes-in-streams-1610.031252016-10-12 https://scifaro.com/en/abs/combining-treewidth-and-backdoors-for-csp-1610.032982016-10-12 https://scifaro.com/en/abs/a-greedy-approach-for-budgeted-maximum-inner-product-search-1610.033172016-10-12 https://scifaro.com/en/abs/engineering-a-distributed-full-text-index-1610.033322016-12-07 https://scifaro.com/en/abs/string-cadences-1610.033372016-10-12 https://scifaro.com/en/abs/deterministic-parallel-algorithms-for-fooling-polylogarithmic-juntas-and-the-lovasz-local-lemma-1610.033832023-10-13 https://scifaro.com/en/abs/finding-euler-tours-in-the-strsort-model-1610.034122016-10-12 https://scifaro.com/en/abs/computing-all-distinct-squares-in-linear-time-for-integer-alphabets-1610.034212017-02-21 https://scifaro.com/en/abs/complexity-and-stop-conditions-for-np-as-general-assignment-problems-the-travel-salesman-problem-in-mathbb-r-2-knight-tour-problem-and-boolean-satisfiability-problem-1610.034772016-10-12 https://scifaro.com/en/abs/discovering-small-target-sets-in-social-networks-a-fast-and-effective-algorithm-1610.037212016-10-13 https://scifaro.com/en/abs/computing-the-expected-value-and-variance-of-geometric-measures-1610.037882016-10-13 https://scifaro.com/en/abs/an-efficient-strongly-connected-components-algorithm-in-the-fault-tolerant-model-1610.040102017-04-25 https://scifaro.com/en/abs/min-cost-flow-on-unit-capacity-networks-and-convex-cost-k-flow-are-as-easy-as-the-assignment-problem-with-all-min-cuts-algorithm-1610.040122025-07-30 https://scifaro.com/en/abs/approximating-partition-functions-of-bounded-degree-boolean-counting-constraint-satisfaction-problems-1610.040552020-08-21 https://scifaro.com/en/abs/approximate-counting-the-lovasz-local-lemma-and-inference-in-graphical-models-1610.043172017-03-17 https://scifaro.com/en/abs/improved-approximation-for-two-dimensional-strip-packing-with-polynomial-bounded-width-1610.044302017-12-14 https://scifaro.com/en/abs/application-of-global-route-planning-algorithms-with-geodesy-1610.045972016-10-17 https://scifaro.com/en/abs/a-2-ell-k-kernel-for-ell-component-order-connectivity-1610.047112025-02-24 https://scifaro.com/en/abs/a-near-linear-pseudopolynomial-time-algorithm-for-subset-sum-1610.047122017-01-10 https://scifaro.com/en/abs/tight-approximation-bounds-for-the-seminar-assignment-problem-1610.047852016-10-18 https://scifaro.com/en/abs/local-max-cut-in-smoothed-polynomial-time-1610.048072017-04-12 https://scifaro.com/en/abs/on-finding-small-sets-that-influence-large-networks-1610.048382016-10-18 https://scifaro.com/en/abs/logarithmic-price-of-buffer-downscaling-on-line-metrics-1610.049152017-07-25 https://scifaro.com/en/abs/approximations-of-the-densest-k-subhypergraph-and-set-union-knapsack-problems-1610.049352016-10-18 https://scifaro.com/en/abs/gene-tree-construction-and-correction-using-supertree-and-reconciliation-1610.050682016-10-25 https://scifaro.com/en/abs/tropical-vertex-disjoint-cycles-of-a-vertex-colored-digraph-barter-exchange-with-multiple-items-per-agent-1610.051152023-06-22 https://scifaro.com/en/abs/lazifying-conditional-gradient-algorithms-1610.051202018-09-06 https://scifaro.com/en/abs/efficient-random-sampling-parallel-vectorized-cache-efficient-and-online-1610.051412019-11-18 https://scifaro.com/en/abs/polylogarithmic-bounds-on-the-competitiveness-of-min-cost-bipartite-perfect-matching-with-delays-1610.051552016-10-18 https://scifaro.com/en/abs/asymptotic-expansions-for-moments-of-number-of-comparisons-used-by-the-randomized-quick-sort-algorithm-1610.056562017-03-21 https://scifaro.com/en/abs/feasibility-based-large-margin-nearest-neighbor-metric-learning-1610.057102018-05-03 https://scifaro.com/en/abs/polynomial-time-algorithm-for-determining-the-graph-isomorphism-v-2-1610.057252018-02-13 https://scifaro.com/en/abs/fully-dynamic-algorithm-for-top-k-densest-subgraphs-1610.058972017-08-30 https://scifaro.com/en/abs/proximity-aware-balanced-allocations-in-cache-networks-1610.059612016-10-25 https://scifaro.com/en/abs/parallel-construction-of-wavelet-trees-on-multicore-architectures-1610.059942016-10-20 https://scifaro.com/en/abs/k-clique-graphs-for-dense-subgraph-discovery-1610.060082018-07-10 https://scifaro.com/en/abs/practical-estimation-of-rotation-distance-and-induced-partial-order-for-binary-trees-1610.060232016-10-20 https://scifaro.com/en/abs/lp-branching-algorithms-based-on-biased-graphs-1610.060602020-02-21 https://scifaro.com/en/abs/explicit-linear-kernels-for-packing-problems-1610.061312016-10-20 https://scifaro.com/en/abs/better-streaming-algorithms-for-the-maximum-coverage-problem-1610.061992018-05-11 https://scifaro.com/en/abs/on-the-price-of-stability-of-undirected-multicast-games-1610.065152016-10-21 https://scifaro.com/en/abs/the-broadcaster-repacking-problem-1610.066722016-10-24 https://scifaro.com/en/abs/a-convex-programming-based-algorithm-for-mean-payoff-stochastic-games-with-perfect-information-1610.066812016-10-24 https://scifaro.com/en/abs/two-stage-optimization-with-recourse-and-revocation-1610.067012016-10-24 https://scifaro.com/en/abs/the-k-shortest-paths-problem-with-application-to-routing-1610.069342017-11-08 https://scifaro.com/en/abs/p-3-games-on-chordal-bipartite-graphs-1610.070182016-10-25 https://scifaro.com/en/abs/local-maxima-and-improved-exact-algorithm-for-max-2-sat-1610.071002016-11-01 https://scifaro.com/en/abs/a-polynomial-kernel-for-distance-hereditary-vertex-deletion-1610.072292017-02-22 https://scifaro.com/en/abs/molecular-solutions-for-the-maximum-k-colourable-sub-graph-problem-in-adleman-lipton-model-1610.072942016-11-10 https://scifaro.com/en/abs/an-attempt-to-design-a-better-algorithm-for-the-uncapacitated-facility-location-problem-1610.074342016-10-25 https://scifaro.com/en/abs/target-set-selection-in-dense-graph-classes-1610.075302020-08-17 https://scifaro.com/en/abs/online-and-random-order-load-balancing-simultaneously-1610.076392016-10-31 https://scifaro.com/en/abs/bias-aware-sketches-1610.077182017-03-28 https://scifaro.com/en/abs/derandomization-for-k-submodular-maximization-1610.077292017-02-16 https://scifaro.com/en/abs/hardness-of-approximation-for-strip-packing-1610.077662016-10-26 https://scifaro.com/en/abs/subexponential-parameterized-algorithms-for-graphs-of-polynomial-growth-1610.077782016-10-26 https://scifaro.com/en/abs/almost-optimal-streaming-algorithms-for-coverage-problems-1610.080962017-03-13 https://scifaro.com/en/abs/efficient-pattern-matching-in-elastic-degenerate-strings-1610.081112016-10-27 https://scifaro.com/en/abs/lp-rounding-and-combinatorial-algorithms-for-minimizing-active-and-busy-time-1610.081542016-10-27 https://scifaro.com/en/abs/optimal-in-place-suffix-sorting-1610.083052018-11-12 https://scifaro.com/en/abs/on-line-algorithms-for-multiplication-and-division-in-real-and-complex-numeration-systems-1610.083092023-06-22 https://scifaro.com/en/abs/finding-largest-common-substructures-of-molecules-in-quadratic-time-1610.087392016-10-28 https://scifaro.com/en/abs/aligning-coding-sequences-with-frameshift-extension-penalties-1610.088092017-04-14 https://scifaro.com/en/abs/scheduling-distributed-clusters-of-parallel-machines-primal-dual-and-lp-based-approximation-algorithms-full-version-1610.090582016-10-31 https://scifaro.com/en/abs/performance-evaluation-of-explicit-finite-difference-algorithms-with-varying-amounts-of-computational-and-memory-intensity-1610.091462016-10-31 https://scifaro.com/en/abs/sort-well-with-energy-constrained-comparisons-1610.092232018-05-16 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-detecting-the-possibility-of-braess-paradox-in-directed-graphs-1610.093202024-05-24 https://scifaro.com/en/abs/evangelism-in-social-networks-algorithms-and-complexity-1610.094862016-11-01 https://scifaro.com/en/abs/computing-a-clique-tree-with-algorithm-mls-maximal-label-search-1610.096232016-11-01 https://scifaro.com/en/abs/linear-time-safe-alternating-dfs-and-sccs-1610.096792025-08-14 https://scifaro.com/en/abs/reconstructing-protein-and-gene-phylogenies-by-extending-the-framework-of-reconciliation-1610.097322017-07-05 https://scifaro.com/en/abs/subquadratic-submodular-function-minimization-1610.098002016-11-01 https://scifaro.com/en/abs/submodular-optimization-over-sliding-windows-1610.099842016-11-01 https://scifaro.com/en/abs/a-simple-hash-class-with-strong-randomness-properties-in-graphs-and-hypergraphs-1611.000292016-11-02 https://scifaro.com/en/abs/last-but-not-least-online-spanners-for-buy-at-bulk-1611.000522016-11-02 https://scifaro.com/en/abs/submodular-maximization-over-sliding-windows-1611.001292016-11-02 https://scifaro.com/en/abs/deterministic-fully-dynamic-approximate-vertex-cover-and-fractional-matching-in-o-1-amortized-update-time-1611.001982016-11-21 https://scifaro.com/en/abs/worst-case-competitive-analysis-of-online-algorithms-for-conic-optimization-1611.005072016-11-03 https://scifaro.com/en/abs/an-asymptotically-optimal-online-algorithm-for-weighted-random-sampling-with-replacement-1611.005322016-11-03 https://scifaro.com/en/abs/online-algorithm-for-demand-response-with-inelastic-demands-and-apparent-power-constraint-1611.005592021-10-26 https://scifaro.com/en/abs/combinatorial-prophet-inequalities-1611.006652016-11-03 https://scifaro.com/en/abs/approximating-cycles-in-directed-graphs-fast-algorithms-for-girth-and-roundtrip-spanners-1611.007212018-08-14 https://scifaro.com/en/abs/almost-linear-time-algorithms-for-markov-chains-and-new-spectral-primitives-for-directed-graphs-1611.007552016-11-03 https://scifaro.com/en/abs/multidimensional-binary-search-for-contextual-decision-making-1611.008292017-04-27 https://scifaro.com/en/abs/below-all-subsets-for-minimal-connected-dominating-set-1611.008402016-11-04 https://scifaro.com/en/abs/low-rank-approximation-with-entrywise-ell-1-norm-error-1611.008982020-04-17 https://scifaro.com/en/abs/decreasekeys-are-expensive-for-external-memory-priority-queues-1611.009112016-11-04 https://scifaro.com/en/abs/a-dichotomy-for-regular-expression-membership-testing-1611.009182016-11-08 https://scifaro.com/en/abs/fast-eigenspace-approximation-using-random-signals-1611.009382016-11-07 https://scifaro.com/en/abs/fully-polynomial-time-approximation-schemes-fptas-for-some-counting-problems-1611.009922016-11-04 https://scifaro.com/en/abs/on-computing-the-dollo-1-phylogeny-in-polynomial-time-1611.010172025-06-17 https://scifaro.com/en/abs/drive-mode-optimization-and-path-planning-for-plug-in-hybrid-electric-vehicles-1611.010322017-12-12 https://scifaro.com/en/abs/near-optimal-disjoint-path-facility-location-through-set-cover-by-pairs-1611.012102016-11-07 https://scifaro.com/en/abs/searching-trees-with-permanently-noisy-advice-walking-and-query-algorithms-1611.014032020-01-17 https://scifaro.com/en/abs/space-efficient-re-pair-compression-1611.014792016-11-07 https://scifaro.com/en/abs/a-two-pronged-progress-in-structured-dense-matrix-multiplication-1611.015692017-11-21 https://scifaro.com/en/abs/surviving-in-directed-graphs-a-polylogarithmic-approximation-for-two-connected-directed-steiner-tree-1611.016442016-11-08 https://scifaro.com/en/abs/uniform-sampling-through-the-lov-asz-local-lemma-1611.016472019-01-16 https://scifaro.com/en/abs/deciding-graph-non-hamiltonicity-via-a-closure-algorithm-1611.017102016-11-09 https://scifaro.com/en/abs/lz-end-parsing-in-compressed-space-1611.017692020-12-15 https://scifaro.com/en/abs/a-simpler-and-faster-strongly-polynomial-algorithm-for-generalized-flow-maximization-1611.017782020-02-14 https://scifaro.com/en/abs/algorithmic-discrepancy-beyond-partial-coloring-1611.018052017-07-13 https://scifaro.com/en/abs/compressed-dynamic-range-majority-and-minority-data-structures-1611.018352018-05-24 https://scifaro.com/en/abs/linear-sketching-over-mathbb-f-2-1611.018792016-11-14 https://scifaro.com/en/abs/on-the-configuration-lp-of-the-restricted-assignment-problem-1611.019342017-01-16 https://scifaro.com/en/abs/nested-algorithms-for-optimal-reservoir-operation-and-their-embedding-in-a-decision-support-platform-1611.023082016-11-09 https://scifaro.com/en/abs/a-greedy-approach-to-answer-reachability-queries-on-dags-1611.025062016-11-09 https://scifaro.com/en/abs/an-optimal-ancestry-labeling-scheme-with-applications-to-xml-trees-and-universal-posets-1611.025892016-11-23 https://scifaro.com/en/abs/on-the-complexity-of-local-distributed-graph-problems-1611.026632017-10-31 https://scifaro.com/en/abs/fully-dynamic-minimum-spanning-forest-with-improved-worst-case-update-time-1611.028642016-11-29 https://scifaro.com/en/abs/tight-lower-bounds-for-the-longest-common-extension-problem-1611.028912017-05-12 https://scifaro.com/en/abs/a-near-linear-approximation-scheme-for-multicuts-of-embedded-graphs-with-a-fixed-number-of-terminals-1611.029662020-10-06 https://scifaro.com/en/abs/scalable-compression-of-a-weighted-graph-1611.031592016-11-11 https://scifaro.com/en/abs/sharper-bounds-for-regularized-data-fitting-1611.032252017-06-27 https://scifaro.com/en/abs/constrained-submodular-maximization-via-a-non-symmetric-technique-1611.032532016-11-11 https://scifaro.com/en/abs/approximately-sampling-elements-with-fixed-rank-in-graded-posets-1611.033852023-04-11 https://scifaro.com/en/abs/collision-based-testers-are-optimal-for-uniformity-and-closeness-1611.035792016-11-14 https://scifaro.com/en/abs/dynamic-spanning-forest-with-worst-case-update-time-adaptive-las-vegas-and-o-n-1-2-epsilon-time-1611.037452017-04-19 https://scifaro.com/en/abs/improved-distance-queries-and-cycle-counting-by-frobenius-normal-form-1611.037892023-03-14 https://scifaro.com/en/abs/a-ptas-for-three-edge-connectivity-in-planar-graphs-1611.038892016-11-15 https://scifaro.com/en/abs/an-fptas-for-counting-proper-four-colorings-on-cubic-graphs-1611.041002016-11-16 https://scifaro.com/en/abs/planning-system-for-deliveries-in-medell-in-1611.041562016-11-15 https://scifaro.com/en/abs/uncertain-graph-sparsification-1611.043082017-05-25 https://scifaro.com/en/abs/learning-theoretic-foundations-of-algorithm-configuration-for-combinatorial-partitioning-problems-1611.045352018-10-17 https://scifaro.com/en/abs/real-stable-polynomials-and-matroids-optimization-and-counting-1611.045482016-11-15 https://scifaro.com/en/abs/rate-of-convergence-of-major-cost-incurred-in-the-in-situ-permutation-algorithm-1611.047842016-11-16 https://scifaro.com/en/abs/fast-and-accurate-mining-of-correlated-heavy-hitters-1611.049422017-04-07 https://scifaro.com/en/abs/continuity-assumptions-in-cake-cutting-1611.049882016-11-16 https://scifaro.com/en/abs/massively-parallel-similarity-join-edge-isoperimetry-and-distance-correlations-on-the-hypercube-1611.049992016-11-16 https://scifaro.com/en/abs/a-new-method-to-index-and-store-spatio-temporal-data-1611.052472016-11-18 https://scifaro.com/en/abs/incremental-and-fully-dynamic-subgraph-connectivity-for-emergency-planning-1611.052482016-11-17 https://scifaro.com/en/abs/longest-common-extensions-with-recompression-1611.053592016-11-22 https://scifaro.com/en/abs/new-hardness-results-for-routing-on-disjoint-paths-1611.054292016-11-17 https://scifaro.com/en/abs/an-improved-integrality-gap-for-the-calinescu-karloff-rabani-relaxation-for-multiway-cut-1611.055302016-11-18 https://scifaro.com/en/abs/online-and-dynamic-algorithms-for-set-cover-1611.056462016-11-18 https://scifaro.com/en/abs/the-matrix-chain-algorithm-to-compile-linear-algebra-expressions-1611.056602016-11-18 https://scifaro.com/en/abs/maximizing-a-submodular-function-with-viability-constraints-1611.057532016-11-18 https://scifaro.com/en/abs/on-the-query-complexity-of-black-peg-ab-mastermind-1611.059072016-11-21 https://scifaro.com/en/abs/computing-absolutely-normal-numbers-in-nearly-linear-time-1611.059112020-07-17 https://scifaro.com/en/abs/parallelepipeds-obtaining-hbl-lower-bounds-1611.059442016-11-21 https://scifaro.com/en/abs/weak-decoupling-polynomial-folds-and-approximate-optimization-over-the-sphere-1611.059982017-04-25 https://scifaro.com/en/abs/query-complexity-of-tournament-solutions-1611.061892024-01-30 https://scifaro.com/en/abs/approximate-near-neighbors-for-general-symmetric-norms-1611.062222017-07-25 https://scifaro.com/en/abs/on-the-energy-efficient-displacement-of-random-sensors-for-interference-and-connectivity-1611.063292019-05-07 https://scifaro.com/en/abs/incremental-exact-min-cut-in-poly-logarithmic-amortized-update-time-1611.065002016-11-22 https://scifaro.com/en/abs/approximation-and-parameterized-algorithms-for-geometric-independent-set-with-shrinking-1611.065012016-11-22 https://scifaro.com/en/abs/a-note-on-distance-labeling-in-planar-graphs-1611.065292016-11-22 https://scifaro.com/en/abs/fair-division-via-social-comparison-1611.065892018-02-27 https://scifaro.com/en/abs/algorithmic-and-hardness-results-for-the-hub-labeling-problem-1611.066052016-11-22 https://scifaro.com/en/abs/furl-fixed-memory-and-uncertainty-reducing-local-triangle-counting-for-graph-streams-1611.066152016-11-29 https://scifaro.com/en/abs/a-randomized-polynomial-kernelization-for-vertex-cover-with-a-smaller-parameter-1611.067952016-11-22 https://scifaro.com/en/abs/a-framework-for-analyzing-resparsification-algorithms-1611.069402016-11-22 https://scifaro.com/en/abs/fine-grained-complexity-and-conditional-hardness-for-sparse-graphs-1611.070082017-10-20 https://scifaro.com/en/abs/a-data-structure-for-nearest-common-ancestors-with-linking-1611.070552016-11-23 https://scifaro.com/en/abs/distributable-consistent-multi-object-matching-1611.071912018-04-12 https://scifaro.com/en/abs/approximate-furthest-neighbor-with-application-to-annulus-query-1611.073032016-11-23 https://scifaro.com/en/abs/asymptotic-expansions-for-factorial-moments-of-some-distributions-in-the-analysis-of-algorithms-1611.073362016-11-23 https://scifaro.com/en/abs/lazy-local-search-meets-machine-scheduling-1611.073712016-12-14 https://scifaro.com/en/abs/the-heterogeneous-capacitated-k-center-problem-1611.074142016-11-23 https://scifaro.com/en/abs/sampling-random-spanning-trees-faster-than-matrix-multiplication-1611.074512017-06-22 https://scifaro.com/en/abs/approximating-k-forest-with-resource-augmentation-a-primal-dual-approach-1611.074892016-11-23 https://scifaro.com/en/abs/purchasing-a-c-4-online-1611.075032016-11-23 https://scifaro.com/en/abs/data-structures-for-weighted-matching-and-extensions-to-b-matching-and-f-factors-1611.075412016-11-24 https://scifaro.com/en/abs/efficient-delivery-policy-to-minimize-user-traffic-consumption-in-guaranteed-advertising-1611.075992016-11-24 https://scifaro.com/en/abs/faster-population-counts-using-avx2-instructions-1611.076122018-09-07 https://scifaro.com/en/abs/simultaneous-feedback-edge-set-a-parameterized-perspective-1611.077012016-11-24 https://scifaro.com/en/abs/timing-matters-online-dynamics-in-broadcast-games-1611.077452016-11-24 https://scifaro.com/en/abs/a-faster-algorithm-for-cuckoo-insertion-and-bipartite-matching-in-large-graphs-1611.077862019-07-17 https://scifaro.com/en/abs/minimizing-the-union-tight-approximations-for-small-set-bipartite-vertex-expansion-1611.078662016-11-24 https://scifaro.com/en/abs/testing-submodularity-and-other-properties-of-valuation-functions-1611.078792016-11-24 https://scifaro.com/en/abs/burrows-wheeler-transform-and-lcp-array-construction-in-constant-space-1611.081982018-06-08 https://scifaro.com/en/abs/search-on-a-line-by-byzantine-robots-1611.082092016-11-28 https://scifaro.com/en/abs/an-efficient-streaming-algorithm-for-the-submodular-cover-problem-1611.085742016-11-28 https://scifaro.com/en/abs/whom-to-befriend-to-influence-people-1611.086872016-11-30 https://scifaro.com/en/abs/a-linear-time-algorithm-for-integral-multiterminal-flows-in-trees-1611.088032016-11-29 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-dag-partitioning-1611.088092017-02-02 https://scifaro.com/en/abs/on-the-size-of-lempel-ziv-and-lyndon-factorizations-1611.088982020-12-08 https://scifaro.com/en/abs/on-low-space-differentially-private-low-rank-factorization-in-the-spectral-norm-1611.089542016-11-29 https://scifaro.com/en/abs/online-knapsack-problem-and-budgeted-truthful-bipartite-matching-1611.090122016-11-29 https://scifaro.com/en/abs/faster-randomized-worst-case-update-time-for-dynamic-subgraph-connectivity-1611.090722017-03-01 https://scifaro.com/en/abs/hierarchical-hyperlink-prediction-for-the-www-1611.090842016-11-29 https://scifaro.com/en/abs/development-of-a-data-model-to-facilitate-rapid-watershed-delineation-1611.091312016-11-29 https://scifaro.com/en/abs/congestion-free-rerouting-of-flows-on-dags-1611.092962017-07-31 https://scifaro.com/en/abs/locality-sensitive-hashing-without-false-negatives-for-l-p-1611.093172016-11-29 https://scifaro.com/en/abs/maximizing-non-monotone-dr-submodular-functions-with-cardinality-constraints-1611.094742017-09-05 https://scifaro.com/en/abs/implicant-based-parallel-all-solution-solver-for-boolean-satisfiability-1611.095902017-02-07 https://scifaro.com/en/abs/optimizing-run-length-algorithm-using-octonary-repetition-tree-1611.096642016-11-30 https://scifaro.com/en/abs/on-scenario-aggregation-to-approximate-robust-optimization-problems-1611.097542016-11-30 https://scifaro.com/en/abs/scalable-similarity-search-for-molecular-descriptors-1611.100452017-08-11 https://scifaro.com/en/abs/search-and-fetch-with-2-robots-on-a-disk-wireless-and-face-to-face-communication-models-1611.102082023-06-22 https://scifaro.com/en/abs/global-and-fixed-terminal-cuts-in-digraphs-1612.001562017-07-07 https://scifaro.com/en/abs/new-frameworks-for-offline-and-streaming-coreset-constructions-1612.008892022-09-20 https://scifaro.com/en/abs/reconfiguring-ordered-bases-of-a-matroid-1612.009582016-12-06 https://scifaro.com/en/abs/non-monotone-dr-submodular-function-maximization-1612.009602016-12-06 https://scifaro.com/en/abs/online-page-migration-on-ring-networks-in-uniform-model-1612.009892016-12-06 https://scifaro.com/en/abs/approximation-algorithms-for-the-maximum-profit-pick-up-problem-with-time-windows-and-capacity-constraint-1612.010382016-12-06 https://scifaro.com/en/abs/proceedings-second-graphs-as-models-workshop-1612.010532016-12-06 https://scifaro.com/en/abs/the-limited-blessing-of-low-dimensionality-when-1-1-d-is-the-best-possible-exponent-for-d-dimensional-geometric-problems-1612.011712016-12-06 https://scifaro.com/en/abs/plane-gossip-approximating-rumor-spread-in-planar-graphs-1612.014922017-07-18 https://scifaro.com/en/abs/technology-beats-algorithms-in-exact-string-matching-1612.015062016-12-06 https://scifaro.com/en/abs/tighter-inapproximability-for-set-cover-1612.016102017-02-17 https://scifaro.com/en/abs/design-and-evaluation-of-alternate-enumeration-techniques-for-subset-sum-problem-1612.016932016-12-13 https://scifaro.com/en/abs/deterministic-indexing-for-packed-strings-1612.017482016-12-07 https://scifaro.com/en/abs/symmetry-exploitation-for-online-machine-covering-with-bounded-migration-1612.018292018-08-29 https://scifaro.com/en/abs/on-the-minimum-chordal-completion-polytope-1612.019662016-12-07 https://scifaro.com/en/abs/approximate-modularity-revisited-1612.020342018-04-02 https://scifaro.com/en/abs/asynchronous-approach-in-the-plane-a-deterministic-polynomial-algorithm-1612.021682018-07-10 https://scifaro.com/en/abs/loglog-beta-and-more-a-new-algorithm-for-cardinality-estimation-based-on-loglog-counting-1612.022842020-12-22 https://scifaro.com/en/abs/distributed-coverage-maximization-via-sketching-1612.023272017-03-13 https://scifaro.com/en/abs/subquadratic-algorithms-for-algebraic-generalizations-of-3sum-1612.023842016-12-08 https://scifaro.com/en/abs/a-note-on-logarithmic-space-stream-algorithms-for-matchings-in-low-arboricity-graphs-1612.025312017-08-15 https://scifaro.com/en/abs/sorting-data-on-ultra-large-scale-with-raduls-new-incarnation-of-radix-sort-1612.025572016-12-09 https://scifaro.com/en/abs/a-constructive-algorithm-for-the-lll-on-permutations-1612.026632023-10-13 https://scifaro.com/en/abs/faster-space-efficient-algorithms-for-subset-sum-k-sum-and-related-problems-1612.027882017-06-27 https://scifaro.com/en/abs/lower-bounds-for-differential-privacy-from-gaussian-width-1612.029142016-12-12 https://scifaro.com/en/abs/randomized-admission-policy-for-efficient-top-k-and-frequency-estimation-1612.029622016-12-12 https://scifaro.com/en/abs/approximation-algorithm-for-cycle-star-hub-network-design-problems-and-cycle-metric-labeling-problems-1612.029902021-06-03 https://scifaro.com/en/abs/vertex-sparsification-in-trees-1612.030172016-12-12 https://scifaro.com/en/abs/hard-capacitated-set-cover-and-uncapacitated-geometric-set-cover-1612.030972016-12-12 https://scifaro.com/en/abs/testing-ising-models-1612.031472019-07-12 https://scifaro.com/en/abs/testing-bayesian-networks-1612.031562020-01-28 https://scifaro.com/en/abs/gract-a-grammar-based-compressed-representation-of-trajectories-1612.033082016-12-13 https://scifaro.com/en/abs/a-primal-dual-approximation-algorithm-for-min-sum-single-machine-scheduling-problems-1612.033392016-12-13 https://scifaro.com/en/abs/oblivious-sorting-and-queues-1612.033432016-12-13 https://scifaro.com/en/abs/k-distinct-in-and-out-branchings-in-digraphs-1612.036072018-01-16 https://scifaro.com/en/abs/a-note-on-testing-intersection-of-convex-sets-in-sublinear-time-1612.037352016-12-13 https://scifaro.com/en/abs/improved-algorithms-for-decremental-single-source-reachability-on-directed-graphs-1612.038562016-12-13 https://scifaro.com/en/abs/efficient-representation-of-multidimensional-data-over-hierarchical-domains-1612.040942016-12-14 https://scifaro.com/en/abs/an-o-n-2-log-4-n-log-log-n-time-matrix-multiplication-algorithm-1612.042082023-07-11 https://scifaro.com/en/abs/compact-trip-representation-over-networks-1612.042092016-12-14 https://scifaro.com/en/abs/towards-a-constructive-version-of-banaszczyk-s-vector-balancing-theorem-1612.043042016-12-14 https://scifaro.com/en/abs/flsss-a-novel-algorithmic-framework-for-combinatorial-optimization-problems-in-the-subset-sum-family-1612.044842018-11-27 https://scifaro.com/en/abs/a-refined-analysis-of-lsh-for-well-dispersed-data-points-1612.045712016-12-15 https://scifaro.com/en/abs/efficient-sampling-for-better-osn-data-provisioning-1612.046662016-12-15 https://scifaro.com/en/abs/an-integer-interior-point-method-for-min-cost-flow-using-arc-contractions-and-deletions-1612.046892016-12-15 https://scifaro.com/en/abs/a-17-12-approximation-algorithm-for-2-vertex-connected-spanning-subgraphs-on-graphs-with-minimum-degree-at-least-3-1612.047902017-01-18 https://scifaro.com/en/abs/algorithms-for-automatic-ranking-of-participants-and-tasks-in-an-anonymized-contest-1612.047942016-12-21 https://scifaro.com/en/abs/anti-path-cover-on-sparse-graph-classes-1612.049852016-12-16 https://scifaro.com/en/abs/multivariate-submodular-optimization-1612.052222019-08-23 https://scifaro.com/en/abs/maximum-matching-on-trees-in-the-online-preemptive-and-the-incremental-dynamic-graph-models-1612.054192018-01-23 https://scifaro.com/en/abs/a-message-passing-algorithm-for-the-minimum-cost-multicut-problem-1612.054412017-01-13 https://scifaro.com/en/abs/a-dual-ascent-framework-for-lagrangean-decomposition-of-combinatorial-problems-1612.054602017-01-13 https://scifaro.com/en/abs/a-generalized-approximation-framework-for-fractional-network-flow-and-packing-problems-1612.054742016-12-19 https://scifaro.com/en/abs/a-general-purpose-algorithm-for-counting-simple-cycles-and-simple-paths-of-any-length-1612.055312019-09-12 https://scifaro.com/en/abs/approximating-approximate-distance-oracles-1612.056232016-12-19 https://scifaro.com/en/abs/pam-parallel-augmented-maps-1612.056652018-03-28 https://scifaro.com/en/abs/backdoors-to-tractable-valued-csp-1612.057332016-12-20 https://scifaro.com/en/abs/a-characterization-of-constant-sample-testable-properties-1612.060162016-12-20 https://scifaro.com/en/abs/similarity-preserving-compressions-of-high-dimensional-sparse-data-1612.060572016-12-20 https://scifaro.com/en/abs/sorting-networks-on-restricted-topologies-1612.064732022-03-22 https://scifaro.com/en/abs/clustering-uncertain-graphs-1612.066752017-10-17 https://scifaro.com/en/abs/stochastic-runtime-analysis-of-a-cross-entropy-algorithm-for-traveling-salesman-problems-1612.069622017-12-21 https://scifaro.com/en/abs/a-hardness-result-and-new-algorithm-for-the-longest-common-palindromic-subsequence-problem-1612.074752016-12-23 https://scifaro.com/en/abs/simultaneous-encodings-for-range-and-next-previous-larger-smaller-value-queries-1612.074932016-12-23 https://scifaro.com/en/abs/set-similarity-search-beyond-minhash-1612.077102017-04-19 https://scifaro.com/en/abs/spectral-algorithms-for-tensor-completion-1612.078662016-12-26 https://scifaro.com/en/abs/better-guarantees-for-k-means-and-euclidean-k-median-by-primal-dual-algorithms-1612.079252017-04-11 https://scifaro.com/en/abs/all-pairs-2-reachability-in-mathcal-o-n-omega-log-n-time-1612.080752017-07-27 https://scifaro.com/en/abs/new-results-for-adaptive-and-approximate-counting-of-inversions-1612.080972016-12-28 https://scifaro.com/en/abs/metric-1-median-selection-with-fewer-queries-1612.086542018-07-31 https://scifaro.com/en/abs/a-constant-optimization-of-the-binary-indexed-tree-query-operation-1612.090832016-12-30 https://scifaro.com/en/abs/ergodic-effects-in-token-circulation-1612.091452017-11-07 https://scifaro.com/en/abs/a-new-algorithm-to-compare-the-magnitude-of-two-rns-numbers-1612.091682017-09-19 https://scifaro.com/en/abs/advice-complexity-of-the-online-search-problem-1612.092992017-01-10 https://scifaro.com/en/abs/parallel-algorithms-for-core-maintenance-in-dynamic-graphs-1612.093682017-01-02 https://scifaro.com/en/abs/set-membership-with-non-adaptive-bit-probes-1612.093882017-01-02 https://scifaro.com/en/abs/quasi-linear-time-algorithm-to-compute-lexdfs-lexup-and-lexdown-orderings-1701.003052017-01-05 https://scifaro.com/en/abs/a-generalized-power-iteration-method-for-solving-quadratic-problem-on-the-stiefel-manifold-1701.003812017-05-15 https://scifaro.com/en/abs/an-agglomeration-law-for-sorting-networks-and-its-application-in-functional-programming-1701.006352017-01-04 https://scifaro.com/en/abs/partially-recursive-acceptance-rejection-1701.008212017-01-05 https://scifaro.com/en/abs/a-comparison-of-algorithms-for-intrusion-detection-on-batch-and-data-stream-environments-1701.008932017-01-05 https://scifaro.com/en/abs/private-incremental-regression-1701.010932017-01-05 https://scifaro.com/en/abs/new-abilities-and-limitations-of-spectral-graph-bisection-1701.013372017-05-01 https://scifaro.com/en/abs/on-spectral-partitioning-of-signed-graphs-1701.013942018-04-02 https://scifaro.com/en/abs/on-convex-programming-relaxations-for-the-permanent-1701.014192017-01-06 https://scifaro.com/en/abs/algorithms-for-optimal-replica-placement-under-correlated-failure-in-hierarchical-failure-domains-1701.015392017-04-21 https://scifaro.com/en/abs/exact-computation-of-influence-spread-by-binary-decision-diagrams-1701.015402017-01-09 https://scifaro.com/en/abs/o-mbox-depth-competitive-algorithm-for-online-multi-level-aggregation-1701.019362017-01-10 https://scifaro.com/en/abs/an-efficient-exact-model-for-the-cell-formation-problem-with-a-variable-number-of-production-cells-1701.024722017-08-29 https://scifaro.com/en/abs/computing-abelian-regularities-on-rle-strings-1701.028362018-01-29 https://scifaro.com/en/abs/on-finding-highly-connected-spanning-subgraphs-1701.028532017-01-12 https://scifaro.com/en/abs/parallel-mining-of-time-faded-heavy-hitters-1701.030042017-01-12 https://scifaro.com/en/abs/linear-search-with-terrain-dependent-speeds-1701.030472017-01-12 https://scifaro.com/en/abs/a-practical-efficient-and-effective-method-for-the-hamiltonian-cycle-problem-that-runs-on-a-standard-computer-1701.031362017-01-24 https://scifaro.com/en/abs/an-eptas-for-scheduling-on-unrelated-machines-of-few-different-types-1701.032632017-12-07 https://scifaro.com/en/abs/sampling-and-reconstruction-using-bloom-filters-1701.033082019-05-15 https://scifaro.com/en/abs/simplified-and-space-optimal-semi-streaming-for-2-epsilon-approximate-matching-1701.037302019-01-01 https://scifaro.com/en/abs/streaming-k-means-clustering-with-fast-queries-1701.038262018-12-10 https://scifaro.com/en/abs/optimal-elephant-flow-detection-1701.040212017-01-17 https://scifaro.com/en/abs/sf-sketch-a-two-stage-sketch-for-data-streams-1701.041482017-02-08 https://scifaro.com/en/abs/on-estimating-maximum-matching-size-in-graph-streams-1701.043642017-01-17 https://scifaro.com/en/abs/on-double-resolution-imaging-and-discrete-tomography-1701.043992018-11-08 https://scifaro.com/en/abs/polynomial-time-algorithms-for-the-subset-feedback-vertex-set-problem-on-interval-graphs-and-permutation-graphs-1701.046342017-02-02 https://scifaro.com/en/abs/the-fast-parallel-algorithm-for-cnf-sat-without-algebra-1701.047772018-04-17 https://scifaro.com/en/abs/randomized-bicriteria-approximation-algorithm-for-minimum-submodular-cost-partial-multi-cover-problem-1701.053392017-02-02 https://scifaro.com/en/abs/efficient-implementation-of-newton-raphson-methods-for-sequential-data-prediction-1701.053782017-01-20 https://scifaro.com/en/abs/efficient-information-flow-maximization-in-probabilistic-graphs-1701.053952018-05-08 https://scifaro.com/en/abs/reliable-virtual-machine-placement-and-routing-in-clouds-1701.060052017-05-01 https://scifaro.com/en/abs/on-practical-accuracy-of-edit-distance-approximation-algorithms-1701.061342017-01-24 https://scifaro.com/en/abs/algorithm-for-an-arbitrary-order-cumulant-tensor-calculation-in-a-sliding-window-of-data-streams-1701.064462022-10-06 https://scifaro.com/en/abs/fine-grained-parameterized-complexity-analysis-of-graph-coloring-problems-1701.069852017-01-25 https://scifaro.com/en/abs/fast-exact-k-means-k-medians-and-bregman-divergence-clustering-in-1d-1701.072042018-04-26 https://scifaro.com/en/abs/a-quasi-polynomial-approximation-for-the-restricted-assignment-problem-1701.072082019-08-21 https://scifaro.com/en/abs/a-framework-of-dynamic-data-structures-for-string-processing-1701.072382017-01-26 https://scifaro.com/en/abs/structural-parameters-for-scheduling-with-assignment-restrictions-1701.072422017-01-26 https://scifaro.com/en/abs/a-ptas-for-the-time-invariant-incremental-knapsack-problem-1701.072992018-01-31 https://scifaro.com/en/abs/implementation-of-tetris-as-a-model-counter-1701.074732017-01-27 https://scifaro.com/en/abs/on-rescheduling-due-to-machine-disruption-while-to-minimize-the-total-weighted-completion-time-1701.074982017-01-27 https://scifaro.com/en/abs/fast-and-accurate-time-series-classification-with-weasel-1701.076812017-12-19 https://scifaro.com/en/abs/an-fptas-for-the-parametric-knapsack-problem-1701.078222017-01-30 https://scifaro.com/en/abs/evaluating-a-sublinear-time-algorithm-for-the-minimum-spanning-tree-weight-problem-1701.081282017-01-30 https://scifaro.com/en/abs/linear-time-approximation-schemes-for-planar-minimum-three-edge-connected-and-three-vertex-connected-spanning-subgraphs-1701.083152017-01-31 https://scifaro.com/en/abs/on-the-local-structure-of-stable-clustering-instances-1701.084232017-08-11 https://scifaro.com/en/abs/the-intermittent-traveling-salesman-problem-with-different-temperature-profiles-greedy-or-not-1701.085172017-01-31 https://scifaro.com/en/abs/approximate-string-matching-theory-and-applications-la-recherche-approch-ee-de-motifs-th-eorie-et-applications-1701.086882017-01-31 https://scifaro.com/en/abs/scheduling-maintenance-jobs-in-networks-1701.088092017-02-01 https://scifaro.com/en/abs/computing-a-tree-having-a-small-vertex-cover-1701.088972018-08-08 https://scifaro.com/en/abs/what-can-be-sampled-locally-1702.001422022-09-09 https://scifaro.com/en/abs/communication-optimal-distributed-clustering-1702.001962017-02-02 https://scifaro.com/en/abs/convergence-results-for-neural-networks-via-electrodynamics-1702.004582018-12-06 https://scifaro.com/en/abs/distributed-approximation-algorithms-for-the-multiple-knapsack-problem-1702.007872017-02-06 https://scifaro.com/en/abs/ranking-vertices-for-active-module-recovery-problem-1702.009482017-02-06 https://scifaro.com/en/abs/an-o-n-2-algorithm-for-many-to-many-matching-of-points-with-demands-in-one-dimension-1702.010832018-03-29 https://scifaro.com/en/abs/improved-guarantees-for-vertex-sparsification-in-planar-graphs-1702.011362017-12-29 https://scifaro.com/en/abs/fast-and-simple-jumbled-indexing-for-binary-rle-strings-1702.012802017-02-15 https://scifaro.com/en/abs/new-cardinality-estimation-algorithms-for-hyperloglog-sketches-1702.012842017-02-27 https://scifaro.com/en/abs/an-adaptive-sublinear-time-block-sparse-fourier-transform-1702.012862017-04-12 https://scifaro.com/en/abs/combinatorial-secretary-problems-with-ordinal-information-1702.012902017-08-28 https://scifaro.com/en/abs/from-lz77-to-the-run-length-encoded-burrows-wheeler-transform-and-back-1702.013402017-02-07 https://scifaro.com/en/abs/efficient-algorithms-for-k-regret-minimizing-sets-1702.014462017-02-10 https://scifaro.com/en/abs/on-the-value-of-penalties-in-time-inconsistent-planning-1702.016772017-02-07 https://scifaro.com/en/abs/a-2-approximation-for-the-height-of-maximal-outerplanar-graph-drawings-1702.017192017-02-07 https://scifaro.com/en/abs/a-local-search-2-917-approximation-algorithm-for-duo-preservation-string-mapping-1702.018772017-02-08 https://scifaro.com/en/abs/a-new-graph-parameter-to-measure-linearity-1702.021332022-10-19 https://scifaro.com/en/abs/position-heaps-for-parameterized-strings-1702.023212017-04-19 https://scifaro.com/en/abs/a-family-of-approximation-algorithms-for-the-maximum-duo-preservation-string-mapping-problem-1702.024052017-05-31 https://scifaro.com/en/abs/oblivious-resampling-oracles-and-parallel-algorithms-for-the-lopsided-lovasz-local-lemma-1702.025472023-10-13 https://scifaro.com/en/abs/maximum-matching-in-two-three-and-a-few-more-passes-over-graph-streams-1702.025592017-04-24 https://scifaro.com/en/abs/a-generalization-of-permanent-inequalities-and-applications-in-counting-and-optimization-1702.029372017-02-10 https://scifaro.com/en/abs/the-price-of-selection-in-differential-privacy-1702.029702017-02-13 https://scifaro.com/en/abs/a-las-vegas-approximation-algorithm-for-metric-1-median-selection-1702.031062017-02-28 https://scifaro.com/en/abs/fast-and-scalable-minimal-perfect-hashing-for-massive-key-sets-1702.031542018-11-06 https://scifaro.com/en/abs/fast-and-compact-exact-distance-oracle-for-planar-graphs-1702.032592017-05-03 https://scifaro.com/en/abs/derandomized-balanced-allocation-1702.033752018-11-14 https://scifaro.com/en/abs/trie-compression-for-gpu-accelerated-multi-pattern-matching-1702.036572017-02-20 https://scifaro.com/en/abs/how-large-is-your-graph-1702.039592017-02-15 https://scifaro.com/en/abs/selecting-with-history-1702.039892018-09-27 https://scifaro.com/en/abs/optimal-longest-paths-by-dynamic-programming-1702.041702017-02-15 https://scifaro.com/en/abs/dynamic-programming-algorithms-efficient-solution-of-the-lp-relaxation-and-approximation-schemes-for-the-penalized-knapsack-problem-1702.042112017-02-15 https://scifaro.com/en/abs/solving-orienteering-with-category-constraints-using-prioritized-search-1702.043042017-02-15 https://scifaro.com/en/abs/approximating-the-held-karp-bound-for-metric-tsp-in-nearly-linear-time-1702.043072017-10-16 https://scifaro.com/en/abs/a-2-epsilon-approximation-for-maximum-weight-matching-in-the-semi-streaming-model-1702.045362018-11-07 https://scifaro.com/en/abs/a-parallel-implementation-of-the-synchronised-louvain-method-1702.046452017-02-16 https://scifaro.com/en/abs/finding-all-useless-arcs-in-directed-planar-graphs-1702.047862018-05-09 https://scifaro.com/en/abs/online-constrained-forest-and-prize-collecting-network-design-1702.048712017-02-17 https://scifaro.com/en/abs/succinct-progress-measures-for-solving-parity-games-1702.050512020-01-15 https://scifaro.com/en/abs/a-fully-polynomial-time-approximation-scheme-for-packing-while-traveling-1702.052172017-02-20 https://scifaro.com/en/abs/improving-the-betweenness-centrality-of-a-node-by-adding-links-1702.052842018-08-02 https://scifaro.com/en/abs/exact-clustering-in-linear-time-1702.054252017-02-28 https://scifaro.com/en/abs/multi-way-sparsest-cut-problem-on-trees-with-a-control-on-the-number-of-parts-and-outliers-1702.055702017-02-21 https://scifaro.com/en/abs/a-circuit-based-approach-to-efficient-enumeration-1702.055892019-08-28 https://scifaro.com/en/abs/embeddings-of-schatten-norms-with-applications-to-data-streams-1702.056262017-02-21 https://scifaro.com/en/abs/an-adaptivity-hierarchy-theorem-for-property-testing-1702.056782017-02-21 https://scifaro.com/en/abs/polynomial-time-efficient-construction-heuristics-for-vertex-separation-minimization-problem-1702.057102017-02-21 https://scifaro.com/en/abs/hypercube-lsh-for-approximate-near-neighbors-1702.057602017-12-08 https://scifaro.com/en/abs/canonical-representations-for-circular-arc-graphs-using-flip-sets-1702.057632018-02-02 https://scifaro.com/en/abs/conditional-lower-bounds-for-all-pairs-max-flow-1702.058052022-11-22 https://scifaro.com/en/abs/memory-efficient-max-flow-for-multi-label-submodular-mrfs-1702.058882017-02-21 https://scifaro.com/en/abs/robust-and-adaptive-search-1702.059322017-02-21 https://scifaro.com/en/abs/refined-vertex-sparsifiers-of-planar-graphs-1702.059512019-10-08 https://scifaro.com/en/abs/identifying-high-betweenness-centrality-nodes-in-large-social-networks-1702.060872017-02-23 https://scifaro.com/en/abs/an-optimal-xp-algorithm-for-hamiltonian-cycle-on-graphs-of-bounded-clique-width-1702.060952019-06-11 https://scifaro.com/en/abs/preemptive-online-partitioning-of-sequences-1702.060992017-02-21 https://scifaro.com/en/abs/density-independent-algorithms-for-sparsifying-k-step-random-walks-1702.061102017-02-21 https://scifaro.com/en/abs/reconstructing-binary-matrices-under-window-constraints-from-their-row-and-column-sums-1702.061212017-02-22 https://scifaro.com/en/abs/a-1-4-epsilon-approximation-algorithm-for-the-2-max-duo-problem-1702.062562017-09-07 https://scifaro.com/en/abs/parameterized-aspects-of-triangle-enumeration-1702.065482018-12-24 https://scifaro.com/en/abs/double-threshold-digraphs-1702.066142018-06-27 https://scifaro.com/en/abs/approximating-unique-games-using-low-diameter-graph-decomposition-1702.069692017-12-01 https://scifaro.com/en/abs/deterministic-adaptive-non-submodular-maximization-via-the-primal-curvature-1702.070022018-01-16 https://scifaro.com/en/abs/diverse-weighted-bipartite-b-matching-1702.071342017-08-17 https://scifaro.com/en/abs/tight-bounds-for-online-coloring-of-basic-graph-classes-1702.071722017-07-04 https://scifaro.com/en/abs/network-construction-with-ordered-constraints-1702.072922017-02-24 https://scifaro.com/en/abs/making-asynchronous-distributed-computations-robust-to-noise-1702.074032017-02-27 https://scifaro.com/en/abs/capacitated-center-problems-with-two-sided-bounds-and-outliers-1702.074352017-02-27 https://scifaro.com/en/abs/small-space-encoding-lce-data-structure-with-constant-time-queries-1702.074582017-02-27 https://scifaro.com/en/abs/compression-with-the-tudocomp-framework-1702.075772021-04-23 https://scifaro.com/en/abs/simple-fast-and-lightweight-parallel-wavelet-tree-construction-1702.075782017-11-13 https://scifaro.com/en/abs/on-problems-equivalent-to-min-convolution-1702.076692019-05-07 https://scifaro.com/en/abs/an-efficient-data-structure-for-dynamic-two-dimensional-reconfiguration-1702.076962017-02-27 https://scifaro.com/en/abs/subquadratic-algorithms-for-the-diameter-and-the-sum-of-pairwise-distances-in-planar-graphs-1702.078152018-05-14 https://scifaro.com/en/abs/constructing-adjacency-arrays-from-incidence-arrays-1702.078322017-09-19 https://scifaro.com/en/abs/an-efficient-multiway-mergesort-for-gpu-architectures-1702.079612017-03-31 https://scifaro.com/en/abs/approximation-strategies-for-generalized-binary-search-in-weighted-trees-1702.082072017-02-28 https://scifaro.com/en/abs/on-the-expected-value-of-the-determinant-of-random-sum-of-rank-one-matrices-1702.082472020-03-24 https://scifaro.com/en/abs/independent-set-size-approximation-in-graph-streams-1702.082992017-02-28 https://scifaro.com/en/abs/an-sdp-based-algorithm-for-linear-sized-spectral-sparsification-1702.084152017-02-28 https://scifaro.com/en/abs/elementary-yet-precise-worst-case-analysis-of-mergesort-a-short-version-sv-1702.084432017-03-01 https://scifaro.com/en/abs/the-infinite-server-problem-1702.084742017-03-01 https://scifaro.com/en/abs/synergistic-computation-of-planar-maxima-and-convex-hull-1702.085452017-03-01 https://scifaro.com/en/abs/binary-search-in-graphs-revisited-1702.088992018-08-20 https://scifaro.com/en/abs/defective-coloring-on-classes-of-perfect-graphs-1702.089032023-06-22 https://scifaro.com/en/abs/algorithms-and-bounds-for-very-strong-rainbow-coloring-1703.002362018-01-17 https://scifaro.com/en/abs/on-the-np-hardness-of-scheduling-with-time-restrictions-1703.005752017-03-03 https://scifaro.com/en/abs/a-resource-frugal-probabilistic-dictionary-and-applications-in-bioinformatics-1703.006672017-03-27 https://scifaro.com/en/abs/even-faster-sorting-of-not-only-integers-1703.006872017-03-03 https://scifaro.com/en/abs/exact-algorithms-for-the-order-picking-problem-1703.006992018-06-05 https://scifaro.com/en/abs/robust-communication-optimal-distributed-clustering-algorithms-1703.008302019-03-08 https://scifaro.com/en/abs/improved-deterministic-distributed-matching-via-rounding-1703.009002017-08-08 https://scifaro.com/en/abs/optimal-time-and-space-construction-of-suffix-arrays-and-lcp-arrays-for-integer-alphabets-1703.010092019-07-16 https://scifaro.com/en/abs/give-me-some-slack-efficient-network-measurements-1703.011662018-04-25 https://scifaro.com/en/abs/sharp-bounds-for-population-recovery-1703.014742017-03-07 https://scifaro.com/en/abs/4-3-rectangle-tiling-lower-bound-1703.014752017-03-07 https://scifaro.com/en/abs/machine-learning-friendly-set-version-of-johnson-lindenstrauss-lemma-1703.015072017-11-10 https://scifaro.com/en/abs/using-matching-to-detect-infeasibility-of-some-integer-programs-1703.015322017-03-07 https://scifaro.com/en/abs/distributed-partial-clustering-1703.015392017-06-06 https://scifaro.com/en/abs/greed-works-online-algorithms-for-unrelated-machine-stochastic-scheduling-1703.016342020-05-14 https://scifaro.com/en/abs/conditional-hardness-for-sensitivity-problems-1703.016382017-03-07 https://scifaro.com/en/abs/parameterized-complexity-of-finding-a-spanning-tree-with-minimum-reload-cost-diameter-1703.016862017-04-25 https://scifaro.com/en/abs/tight-space-approximation-tradeoff-for-the-multi-pass-streaming-set-cover-problem-1703.018472017-03-07 https://scifaro.com/en/abs/a-randomized-efficient-algorithm-for-3sat-1703.019052018-01-03 https://scifaro.com/en/abs/near-optimal-closeness-testing-of-discrete-histogram-distributions-1703.019132017-03-07 https://scifaro.com/en/abs/distributed-exact-shortest-paths-in-sublinear-time-1703.019392017-05-02 https://scifaro.com/en/abs/space-efficient-k-mer-algorithm-for-generalized-suffix-tree-1703.022242017-03-08 https://scifaro.com/en/abs/a-simple-deterministic-distributed-mst-algorithm-with-near-optimal-time-and-message-complexities-1703.024112017-03-08 https://scifaro.com/en/abs/stream-aggregation-through-order-sampling-1703.026932017-11-02 https://scifaro.com/en/abs/k-best-solutions-of-mso-problems-on-tree-decomposable-graphs-1703.027842017-03-09 https://scifaro.com/en/abs/constrained-clustering-via-diagrams-a-unified-theory-and-its-applications-to-electoral-district-design-1703.028672017-04-10 https://scifaro.com/en/abs/on-low-rank-width-colorings-1703.033042019-07-29 https://scifaro.com/en/abs/crossing-the-logarithmic-barrier-for-dynamic-boolean-data-structure-lower-bounds-1703.035752017-03-13 https://scifaro.com/en/abs/the-densest-subgraph-problem-with-a-convex-concave-size-function-1703.036032021-10-27 https://scifaro.com/en/abs/a-note-on-approximate-strengths-of-edges-in-a-hypergraph-1703.038492017-03-14 https://scifaro.com/en/abs/core-maintenance-in-dynamic-graphs-a-parallel-approach-based-on-matching-1703.039002017-03-14 https://scifaro.com/en/abs/on-solving-travelling-salesman-problem-with-vertex-requisitions-1703.039632017-03-14 https://scifaro.com/en/abs/the-weighted-matching-approach-to-maximum-cardinality-matching-1703.039982017-03-14 https://scifaro.com/en/abs/improved-approximation-algorithms-for-k-connected-m-dominating-set-problems-1703.042302017-03-14 https://scifaro.com/en/abs/on-the-transformation-capability-of-feasible-mechanisms-for-programmable-matter-1703.043812017-03-14 https://scifaro.com/en/abs/optimal-densification-for-fast-and-accurate-minwise-hashing-1703.046642017-03-16 https://scifaro.com/en/abs/the-stochastic-container-relocation-problem-1703.047692017-10-13 https://scifaro.com/en/abs/near-optimal-compression-for-the-planar-graph-metric-1703.048142017-03-16 https://scifaro.com/en/abs/faster-str-ic-lcs-computation-via-rle-1703.049542017-03-16 https://scifaro.com/en/abs/algorithms-for-outerplanar-graph-roots-and-graph-roots-of-pathwidth-at-most-2-1703.051022018-10-09 https://scifaro.com/en/abs/complexity-dichotomies-for-the-minimum-f-overlay-problem-1703.051562017-03-16 https://scifaro.com/en/abs/optimal-unateness-testers-for-real-valued-functions-adaptivity-helps-1703.051992017-03-16 https://scifaro.com/en/abs/a-local-algorithm-for-the-sparse-spanning-graph-problem-1703.054182017-07-20 https://scifaro.com/en/abs/data-delivery-by-mobile-agents-with-energy-constraints-over-a-fixed-path-1703.054962017-03-17 https://scifaro.com/en/abs/improving-tsp-tours-using-dynamic-programming-over-tree-decomposition-1703.055592017-08-02 https://scifaro.com/en/abs/a-linear-time-algorithm-for-maximum-cardinality-matching-on-cocomparability-graphs-1703.055982018-10-23 https://scifaro.com/en/abs/connection-scan-algorithm-1703.059972017-03-20 https://scifaro.com/en/abs/an-fptas-for-the-knapsack-problem-with-parametric-weights-1703.060482017-03-20 https://scifaro.com/en/abs/fast-non-monotone-submodular-maximisation-subject-to-a-matroid-constraint-1703.060532017-03-22 https://scifaro.com/en/abs/approximation-ratio-of-repair-1703.060612017-03-20 https://scifaro.com/en/abs/robust-assignments-with-vulnerable-nodes-1703.060742017-03-20 https://scifaro.com/en/abs/toward-an-enumeration-of-unlabeled-trees-1703.061132017-03-20 https://scifaro.com/en/abs/discriminative-distance-based-network-indices-with-application-to-link-prediction-1703.062272018-04-03 https://scifaro.com/en/abs/hardware-efficient-schemes-of-quaternion-multiplying-units-for-2d-discrete-quaternion-fourier-transform-processors-1703.063202017-03-21 https://scifaro.com/en/abs/reoptimization-of-the-closest-substring-problem-under-pattern-length-modification-1703.066442017-03-21 https://scifaro.com/en/abs/discovering-relaxed-sound-workflow-nets-using-integer-linear-programming-1703.067332017-11-09 https://scifaro.com/en/abs/on-the-interplay-between-strong-regularity-and-graph-densification-1703.071072017-03-22 https://scifaro.com/en/abs/a-hybrid-feasibility-constraints-guided-search-to-the-two-dimensional-bin-packing-problem-with-due-dates-1703.072442017-11-09 https://scifaro.com/en/abs/on-the-tree-augmentation-problem-1703.072472018-12-27 https://scifaro.com/en/abs/just-in-time-batch-scheduling-problem-with-two-dimensional-bin-packing-constraints-1703.072902017-07-28 https://scifaro.com/en/abs/distributed-distance-bounded-network-design-through-distributed-convex-programming-1703.074172017-09-12 https://scifaro.com/en/abs/on-the-probe-complexity-of-local-computation-algorithms-1703.077342017-03-23 https://scifaro.com/en/abs/distance-sensitive-hashing-1703.078672018-04-18 https://scifaro.com/en/abs/minimum-cuts-and-shortest-cycles-in-directed-planar-graphs-via-noncrossing-shortest-paths-1703.079642017-03-24 https://scifaro.com/en/abs/resolving-the-complexity-of-some-fundamental-problems-in-computational-social-choice-1703.080412017-03-24 https://scifaro.com/en/abs/an-asymptotically-tighter-bound-on-sampling-for-frequent-itemsets-mining-1703.082732017-03-27 https://scifaro.com/en/abs/metric-random-matchings-with-applications-1703.084332017-03-27 https://scifaro.com/en/abs/compression-with-wildcards-all-k-models-of-a-binary-decision-diagram-1703.085112023-12-19 https://scifaro.com/en/abs/maximizing-the-area-of-intersection-of-rectangles-1703.086582017-03-28 https://scifaro.com/en/abs/steiner-point-removal-distant-terminals-don-t-really-bother-1703.087902017-03-28 https://scifaro.com/en/abs/palindromic-decompositions-with-gaps-and-errors-1703.089312017-03-28 https://scifaro.com/en/abs/tree-edit-distance-cannot-be-computed-in-strongly-subcubic-time-unless-apsp-can-1703.089402017-03-28 https://scifaro.com/en/abs/new-algorithms-for-the-minimum-coloring-cut-problem-1703.092582017-04-10 https://scifaro.com/en/abs/fluid-communities-a-competitive-scalable-and-diverse-community-detection-algorithm-1703.093072017-10-10 https://scifaro.com/en/abs/algorithmic-interpretations-of-fractal-dimension-1703.093242017-03-29 https://scifaro.com/en/abs/edge-matching-problems-with-rotations-1703.094212017-03-29 https://scifaro.com/en/abs/ruling-out-fpt-algorithms-for-weighted-coloring-on-forests-1703.097262017-03-30 https://scifaro.com/en/abs/engineering-dfs-based-graph-algorithms-1703.100232017-03-30 https://scifaro.com/en/abs/priv-it-private-and-sample-efficient-identity-testing-1703.101272017-06-08 https://scifaro.com/en/abs/recursive-method-for-the-solution-of-systems-of-linear-equations-1703.102322017-03-31 https://scifaro.com/en/abs/preserving-distances-in-very-faulty-graphs-1703.102932017-03-31 https://scifaro.com/en/abs/finding-even-cycles-faster-via-capped-k-walks-1703.103802017-03-31 https://scifaro.com/en/abs/the-dynamics-of-rank-maximal-and-popular-matchings-1703.105942020-09-24 https://scifaro.com/en/abs/light-spanners-for-bounded-treewidth-graphs-imply-light-spanners-for-h-minor-free-graphs-1703.106332017-04-03 https://scifaro.com/en/abs/an-analysis-of-budgeted-parallel-search-on-conditional-galton-watson-trees-1703.107312019-09-06 https://scifaro.com/en/abs/local-guarantees-in-graph-cuts-and-clustering-1704.003552017-04-04 https://scifaro.com/en/abs/a-message-passing-algorithm-for-graph-isomorphism-1704.003952017-04-04 https://scifaro.com/en/abs/dynamic-planar-embeddings-of-dynamic-graphs-1704.005652017-04-04 https://scifaro.com/en/abs/graph-partitioning-with-acyclicity-constraints-1704.007052017-04-04 https://scifaro.com/en/abs/on-the-combinatorial-power-of-the-weisfeiler-lehman-algorithm-1704.010232017-04-05 https://scifaro.com/en/abs/computing-top-k-closeness-centrality-faster-in-unweighted-graphs-1704.010772017-04-28 https://scifaro.com/en/abs/the-integrality-gap-of-the-goemans-linial-sdp-relaxation-for-sparsest-cut-is-at-least-a-constant-multiple-of-sqrt-log-n-1704.012002017-04-06 https://scifaro.com/en/abs/storing-complex-data-sharing-policies-with-the-min-mask-sketch-1704.012182017-04-06 https://scifaro.com/en/abs/local-flow-partitioning-for-faster-edge-connectivity-1704.012542019-11-11 https://scifaro.com/en/abs/optimal-trade-offs-for-pattern-matching-with-k-mismatches-1704.013112017-04-06 https://scifaro.com/en/abs/a-new-algorithm-for-solving-3-cnf-sat-problem-1704.013962017-04-07 https://scifaro.com/en/abs/streaming-pattern-matching-with-d-wildcards-1704.016462020-01-01 https://scifaro.com/en/abs/approximate-clustering-with-same-cluster-queries-1704.018622017-10-05 https://scifaro.com/en/abs/optimal-las-vegas-locality-sensitive-data-structures-1704.020542018-06-28 https://scifaro.com/en/abs/probabilistic-recurrence-relations-for-work-and-span-of-parallel-algorithms-1704.020612017-04-10 https://scifaro.com/en/abs/hierarchical-clustering-objective-functions-and-algorithms-1704.021472017-04-10 https://scifaro.com/en/abs/new-subquadratic-approximation-algorithms-for-the-girth-1704.021782017-04-10 https://scifaro.com/en/abs/proportional-approval-voting-harmonic-k-median-and-negative-association-1704.021832018-03-13 https://scifaro.com/en/abs/echantillonnage-de-signaux-sur-graphes-via-des-processus-d-eterminantaux-1704.022392017-07-06 https://scifaro.com/en/abs/algorithms-for-stable-matching-and-clustering-in-a-grid-1704.023032017-04-10 https://scifaro.com/en/abs/matrix-scaling-and-balancing-via-box-constrained-newton-s-method-and-interior-point-methods-1704.023102017-08-22 https://scifaro.com/en/abs/much-faster-algorithms-for-matrix-scaling-1704.023152017-04-10 https://scifaro.com/en/abs/testing-hereditary-properties-of-ordered-graphs-and-matrices-1704.023672017-04-11 https://scifaro.com/en/abs/a-framework-for-the-secretary-problem-on-the-intersection-of-matroids-1704.026082017-04-11 https://scifaro.com/en/abs/0-1-all-csps-half-integral-a-path-packing-and-linear-time-fpt-algorithms-1704.027002017-11-08 https://scifaro.com/en/abs/deterministic-distributed-edge-coloring-via-hypergraph-maximal-matching-1704.027672017-04-11 https://scifaro.com/en/abs/voronoi-diagrams-on-planar-graphs-and-computing-the-diameter-in-deterministic-tilde-o-n-5-3-time-1704.027932020-06-26 https://scifaro.com/en/abs/fully-dynamic-approximate-maximum-matching-and-minimum-vertex-cover-in-o-log-3-n-worst-case-update-time-1704.028442017-04-11 https://scifaro.com/en/abs/minor-matching-hypertree-width-1704.029392017-07-05 https://scifaro.com/en/abs/tight-lower-bounds-for-differentially-private-selection-1704.030242017-04-12 https://scifaro.com/en/abs/weighted-k-server-bounds-via-combinatorial-dichotomies-1704.033182017-09-08 https://scifaro.com/en/abs/sublinear-time-low-rank-approximation-of-positive-semidefinite-matrices-1704.033712019-01-04 https://scifaro.com/en/abs/approximating-optimization-problems-using-eas-on-scale-free-networks-1704.036642018-11-27 https://scifaro.com/en/abs/optimal-strategies-for-weighted-ray-search-1704.037772021-05-05 https://scifaro.com/en/abs/robustly-learning-a-gaussian-getting-optimal-error-efficiently-1704.038662017-11-07 https://scifaro.com/en/abs/approximating-the-largest-root-and-applications-to-interlacing-families-1704.038922017-04-14 https://scifaro.com/en/abs/spectrum-approximation-beyond-fast-matrix-multiplication-algorithms-and-hardness-1704.041632019-01-04 https://scifaro.com/en/abs/hybridizing-non-dominated-sorting-algorithms-divide-and-conquer-meets-best-order-sort-1704.042052017-04-14 https://scifaro.com/en/abs/parameterized-complexity-and-approximability-of-directed-odd-cycle-transversal-1704.042492017-04-17 https://scifaro.com/en/abs/point-sweep-coverage-on-path-1704.043322017-06-28 https://scifaro.com/en/abs/fast-randomized-algorithms-for-t-product-based-tensor-operations-and-decompositions-with-applications-to-imaging-data-1704.043622018-09-05 https://scifaro.com/en/abs/fast-similarity-sketching-1704.043702024-05-07 https://scifaro.com/en/abs/encoding-cardinality-constraints-using-generalized-selection-networks-1704.043892017-04-17 https://scifaro.com/en/abs/maximal-unbordered-factors-of-random-strings-1704.044722018-12-18 https://scifaro.com/en/abs/additive-spanners-and-distance-oracles-in-quadratic-time-1704.044732017-04-17 https://scifaro.com/en/abs/the-entropy-of-backwards-analysis-1704.045092017-04-18 https://scifaro.com/en/abs/a-simple-randomized-algorithm-to-compute-harmonic-numbers-and-logarithms-1704.045382017-04-24 https://scifaro.com/en/abs/seth-based-lower-bounds-for-subset-sum-and-bicriteria-path-1704.045462021-02-22 https://scifaro.com/en/abs/pseudo-separation-for-assessment-of-structural-vulnerability-of-a-network-1704.045552017-04-18 https://scifaro.com/en/abs/fmtree-a-fast-locating-algorithm-of-fm-indexes-for-genomic-data-1704.046152017-04-19 https://scifaro.com/en/abs/generic-lsh-families-for-the-angular-distance-based-on-johnson-lindenstrauss-projections-and-feature-hashing-lsh-1704.046842017-05-03 https://scifaro.com/en/abs/outward-influence-and-cascade-size-estimation-in-billion-scale-networks-1704.047942017-04-18 https://scifaro.com/en/abs/nearly-tight-bounds-for-sandpile-transience-on-the-grid-1704.048302023-04-11 https://scifaro.com/en/abs/on-the-k-means-median-cost-function-1704.052322021-09-10 https://scifaro.com/en/abs/a-faster-implementation-of-online-run-length-burrows-wheeler-transform-1704.052332017-10-17 https://scifaro.com/en/abs/grammar-based-graph-compression-1704.052542017-04-19 https://scifaro.com/en/abs/positive-instance-driven-dynamic-programming-for-treewidth-1704.052862018-01-15 https://scifaro.com/en/abs/online-weighted-matching-breaking-the-frac-1-2-barrier-1704.053842019-11-22 https://scifaro.com/en/abs/online-degree-bounded-steiner-network-design-1704.054302017-04-19 https://scifaro.com/en/abs/1d-modeling-of-sensor-selection-problem-for-weak-barrier-coverage-and-gap-mending-in-wireless-sensor-networks-1704.055762017-04-20 https://scifaro.com/en/abs/alphabet-dependent-parallel-algorithm-for-suffix-tree-construction-for-pattern-searching-1704.056602017-04-20 https://scifaro.com/en/abs/m-bonsai-a-practical-compact-dynamic-trie-1704.056822017-04-20 https://scifaro.com/en/abs/sorting-sums-of-binary-decision-summands-1704.057952017-04-20 https://scifaro.com/en/abs/online-weighted-degree-bounded-steiner-networks-via-novel-online-mixed-packing-covering-1704.058112017-04-20 https://scifaro.com/en/abs/beating-1-1-e-for-ordered-prophets-1704.058362017-06-01 https://scifaro.com/en/abs/on-fast-bounded-locality-sensitive-hashing-1704.059022017-04-21 https://scifaro.com/en/abs/temporal-clustering-1704.059642017-10-17 https://scifaro.com/en/abs/optimal-query-time-for-encoding-range-majority-1704.061492017-04-21 https://scifaro.com/en/abs/cell-probe-lower-bounds-from-online-communication-complexity-1704.061852017-11-16 https://scifaro.com/en/abs/the-ising-partition-function-zeros-and-deterministic-approximation-1704.064932018-12-26 https://scifaro.com/en/abs/fairness-in-resource-allocation-and-slowed-down-dependent-rounding-1704.065282017-09-26 https://scifaro.com/en/abs/path-contractions-edge-deletions-and-connectivity-preservation-1704.066222017-04-24 https://scifaro.com/en/abs/select-and-permute-an-improved-online-framework-for-scheduling-to-minimize-weighted-completion-time-1704.066772017-04-25 https://scifaro.com/en/abs/continuous-monitoring-of-ell-p-norms-in-data-streams-1704.067102017-11-10 https://scifaro.com/en/abs/complexity-analysis-of-the-parallel-guided-ejection-search-for-the-pickup-and-delivery-problem-with-time-windows-1704.067242017-04-25 https://scifaro.com/en/abs/generalized-feedback-vertex-set-problems-on-bounded-treewidth-graphs-chordality-is-the-key-to-single-exponential-parameterized-algorithms-1704.067572021-08-27 https://scifaro.com/en/abs/adaptive-cuckoo-filters-1704.068182017-10-12 https://scifaro.com/en/abs/a-decomposition-algorithm-to-solve-the-multi-hop-peer-to-peer-ride-matching-problem-1704.068382017-04-25 https://scifaro.com/en/abs/ranking-with-fairness-constraints-1704.068402018-07-31 https://scifaro.com/en/abs/multiple-source-dual-fault-tolerant-bfs-trees-1704.069072017-04-25 https://scifaro.com/en/abs/a-new-fully-polynomial-time-approximation-scheme-for-the-interval-subset-sum-problem-1704.069282017-04-25 https://scifaro.com/en/abs/a-match-in-time-saves-nine-deterministic-online-matching-with-delays-1704.069802017-04-25 https://scifaro.com/en/abs/recognizing-union-find-trees-built-up-using-union-by-rank-strategy-is-np-complete-1704.072542017-04-25 https://scifaro.com/en/abs/finding-hitting-and-packing-cycles-in-subexponential-time-on-unit-disk-graphs-1704.072792017-04-25 https://scifaro.com/en/abs/hitting-minors-on-bounded-treewidth-graphs-i-general-upper-bounds-1704.072842021-03-12 https://scifaro.com/en/abs/minimal-controllability-of-conjunctive-boolean-networks-is-np-complete-1704.072912020-06-09 https://scifaro.com/en/abs/elite-bases-regression-a-real-time-algorithm-for-symbolic-regression-1704.073132017-05-16 https://scifaro.com/en/abs/sampling-biased-monotonic-surfaces-using-exponential-metrics-1704.073222020-09-16 https://scifaro.com/en/abs/metropolis-hastings-algorithms-for-estimating-betweenness-centrality-in-large-networks-1704.073512017-05-05 https://scifaro.com/en/abs/strictly-balancing-matrices-in-polynomial-time-using-osborne-s-iteration-1704.074062017-04-26 https://scifaro.com/en/abs/popular-matching-with-lower-quotas-1704.075462017-04-27 https://scifaro.com/en/abs/indexing-weighted-sequences-neat-and-efficient-1704.076252017-08-28 https://scifaro.com/en/abs/single-pass-pca-of-large-high-dimensional-data-1704.076692017-04-26 https://scifaro.com/en/abs/an-efficient-data-structure-for-counting-all-linear-extensions-of-a-poset-calculating-its-jump-number-and-the-likes-1704.077082017-04-26 https://scifaro.com/en/abs/succinct-approximate-rank-queries-1704.077102017-04-26 https://scifaro.com/en/abs/concave-flow-on-small-depth-directed-networks-1704.077912017-04-26 https://scifaro.com/en/abs/exact-algorithms-via-multivariate-subroutines-1704.079822017-04-27 https://scifaro.com/en/abs/a-framework-for-algorithm-stability-1704.080002025-03-10 https://scifaro.com/en/abs/improved-algorithms-for-computing-the-cycle-of-minimum-cost-to-time-ratio-in-directed-graphs-1704.081222018-03-02 https://scifaro.com/en/abs/decremental-data-structures-for-connectivity-and-dominators-in-directed-graphs-1704.082352018-03-02 https://scifaro.com/en/abs/relative-error-tensor-low-rank-approximation-1704.082462018-04-02 https://scifaro.com/en/abs/an-improved-bound-for-minimizing-the-total-weighted-completion-time-of-coflows-in-datacenters-1704.083572017-04-28 https://scifaro.com/en/abs/improved-oracles-for-time-dependent-road-networks-1704.084452017-04-28 https://scifaro.com/en/abs/communication-complexity-of-approximate-maximum-matching-in-the-message-passing-model-1704.084622017-04-28 https://scifaro.com/en/abs/linear-size-hopsets-with-small-hopbound-and-distributed-routing-with-low-memory-1704.084682017-04-28 https://scifaro.com/en/abs/practical-and-effective-re-pair-compression-1704.085582017-04-28 https://scifaro.com/en/abs/faster-betweenness-centrality-updates-in-evolving-networks-1704.085922017-04-28 https://scifaro.com/en/abs/improved-approximation-algorithm-for-the-dense-3-subhypergraph-problem-1704.086202018-01-25 https://scifaro.com/en/abs/an-improved-integrality-gap-for-steiner-tree-1704.086802023-09-12 https://scifaro.com/en/abs/matrix-completion-and-related-problems-via-strong-duality-1704.086832018-04-26 https://scifaro.com/en/abs/relaxing-the-irrevocability-requirement-for-online-graph-algorithms-1704.088352017-05-01 https://scifaro.com/en/abs/substochastic-monte-carlo-algorithms-1704.090142017-05-01 https://scifaro.com/en/abs/stability-and-recovery-for-independence-systems-1705.001272017-07-03 https://scifaro.com/en/abs/replica-placement-on-bounded-treewidth-graphs-1705.001452017-09-12 https://scifaro.com/en/abs/thorup-zwick-emulators-are-universally-optimal-hopsets-1705.003272017-05-02 https://scifaro.com/en/abs/common-greedy-wiring-and-rewiring-heuristics-do-not-guarantee-maximum-assortative-graphs-of-given-degree-1705.003822018-06-05 https://scifaro.com/en/abs/parallel-construction-of-compact-planar-embeddings-1705.004152017-05-02 https://scifaro.com/en/abs/improved-average-complexity-for-comparison-based-sorting-1705.008492017-05-03 https://scifaro.com/en/abs/weighted-network-estimation-by-the-use-of-topological-graph-metrics-1705.008922018-06-21 https://scifaro.com/en/abs/determinant-preserving-sparsification-of-sddm-matrices-with-applications-to-counting-and-sampling-spanning-trees-1705.009852017-05-03 https://scifaro.com/en/abs/dynamic-space-efficient-hashing-1705.009972017-05-03 https://scifaro.com/en/abs/cddt-fast-approximate-2d-ray-casting-for-accelerated-localization-1705.011672018-03-09 https://scifaro.com/en/abs/consistency-of-orthology-and-paralogy-constraints-in-the-presence-of-gene-transfers-1705.012402022-02-16 https://scifaro.com/en/abs/covering-small-independent-sets-and-separators-with-applications-to-parameterized-algorithms-1705.014142017-05-04 https://scifaro.com/en/abs/homomorphisms-are-a-good-basis-for-counting-small-subgraphs-1705.015952017-05-05 https://scifaro.com/en/abs/streaming-for-aibohphobes-longest-palindrome-with-mismatches-1705.018872017-05-05 https://scifaro.com/en/abs/a-survey-of-shortest-path-algorithms-1705.020442017-05-08 https://scifaro.com/en/abs/a-note-on-hardness-of-diameter-approximation-1705.021272018-03-02 https://scifaro.com/en/abs/online-covering-with-sum-of-ell-q-norm-objectives-1705.021942017-05-10 https://scifaro.com/en/abs/the-stochastic-matching-problem-beating-half-with-a-non-adaptive-algorithm-1705.022802017-05-08 https://scifaro.com/en/abs/efficient-parallel-strategy-improvement-for-parity-games-1705.023132017-05-08 https://scifaro.com/en/abs/on-algorithms-for-l-bounded-cut-problem-1705.023902017-09-11 https://scifaro.com/en/abs/incremental-dfs-algorithms-a-theoretical-and-experimental-study-1705.026132017-05-09 https://scifaro.com/en/abs/an-o-n-log-n-time-algorithm-for-the-k-center-problem-in-trees-1705.027522018-03-07 https://scifaro.com/en/abs/rank-vertex-cover-as-a-natural-problem-for-algebraic-compression-1705.028222017-05-11 https://scifaro.com/en/abs/faster-tuple-lattice-sieving-using-spherical-locality-sensitive-filters-1705.028282018-02-26 https://scifaro.com/en/abs/community-detection-in-hypergraphs-spiked-tensor-models-and-sum-of-squares-1705.029732018-07-05 https://scifaro.com/en/abs/optimal-computation-of-overabundant-words-1705.033852017-05-10 https://scifaro.com/en/abs/computation-of-k-core-decomposition-on-giraph-1705.036032017-05-16 https://scifaro.com/en/abs/near-optimal-parallel-algorithms-for-dynamic-dfs-in-undirected-graphs-1705.036372017-05-11 https://scifaro.com/en/abs/benchmark-graphs-for-practical-graph-isomorphism-1705.036862017-05-11 https://scifaro.com/en/abs/autoscaling-bloom-filter-controlling-trade-off-between-true-and-false-positives-1705.039342019-08-13 https://scifaro.com/en/abs/zig-zagging-in-a-triangulation-1705.039502017-05-25 https://scifaro.com/en/abs/faster-algorithms-for-1-mappability-of-a-sequence-1705.040222017-05-12 https://scifaro.com/en/abs/distributed-property-testing-for-subgraph-freeness-revisited-1705.040332017-05-12 https://scifaro.com/en/abs/k-sets-a-linear-time-clustering-algorithm-for-data-points-with-a-sparse-similarity-measure-1705.042492017-05-12 https://scifaro.com/en/abs/distance-preserving-graph-contractions-1705.045442019-02-14 https://scifaro.com/en/abs/how-to-answer-a-small-batch-of-rmqs-or-lca-queries-in-practice-1705.045892017-05-15 https://scifaro.com/en/abs/sublogarithmic-distributed-algorithms-for-lov-asz-local-lemma-and-the-complexity-hierarchy-1705.048402017-05-17 https://scifaro.com/en/abs/relaxation-heuristics-for-the-set-multicover-problem-with-generalized-upper-bound-constraints-1705.049702018-01-09 https://scifaro.com/en/abs/assembling-sequences-of-dna-using-an-on-line-algorithm-based-on-debruijn-graphs-1705.051052017-05-26 https://scifaro.com/en/abs/constructing-a-consensus-phylogeny-from-a-leaf-removal-distance-1705.052952019-07-10 https://scifaro.com/en/abs/comparison-based-choices-1705.057352017-05-17 https://scifaro.com/en/abs/stochastic-k-server-how-should-uber-work-1705.057552017-06-01 https://scifaro.com/en/abs/estimating-sequence-similarity-from-read-sets-for-clustering-next-generation-sequencing-data-1705.061252017-05-18 https://scifaro.com/en/abs/fast-snapshottable-concurrent-braun-heaps-1705.062712017-05-18 https://scifaro.com/en/abs/constrained-submodular-maximization-via-greedy-local-search-1705.063192018-01-16 https://scifaro.com/en/abs/layered-graphs-a-class-that-admits-polynomial-time-solutions-for-some-hard-problems-1705.064252017-05-26 https://scifaro.com/en/abs/exemplar-or-matching-modeling-dcj-problems-with-unequal-content-genome-data-1705.065592017-05-29 https://scifaro.com/en/abs/algorithms-for-ell-p-low-rank-approximation-1705.067302017-05-19 https://scifaro.com/en/abs/using-a-hamiltonian-cycle-problem-algorithm-to-assist-in-solving-difficult-instances-of-traveling-salesman-problem-1705.068552017-05-22 https://scifaro.com/en/abs/a-high-performance-algorithm-for-identifying-frequent-items-in-data-streams-1705.070012017-05-23 https://scifaro.com/en/abs/on-packet-scheduling-with-adversarial-jamming-and-speedup-1705.070182018-08-07 https://scifaro.com/en/abs/clustering-under-local-stability-bridging-the-gap-between-worst-case-and-beyond-worst-case-analysis-1705.071572018-12-31 https://scifaro.com/en/abs/privmin-differentially-private-minhash-for-jaccard-similarity-computation-1705.072582017-05-23 https://scifaro.com/en/abs/fast-and-simple-algorithms-for-computing-both-lcs-k-and-lcs-k-1705.072792018-05-25 https://scifaro.com/en/abs/dynamic-analysis-of-the-arrow-distributed-directory-protocol-in-general-networks-1705.073272017-05-23 https://scifaro.com/en/abs/parameterized-complexity-of-the-list-coloring-reconfiguration-problem-with-graph-parameters-1705.075512017-05-23 https://scifaro.com/en/abs/improved-method-for-finding-optimal-formulae-for-bilinear-maps-in-a-finite-field-1705.077282018-12-10 https://scifaro.com/en/abs/taming-near-repeat-calculation-for-crime-analysis-via-cohesive-subgraph-computing-1705.077462020-03-27 https://scifaro.com/en/abs/computing-the-bwt-and-lcp-array-of-a-set-of-strings-in-external-memory-1705.077562020-12-07 https://scifaro.com/en/abs/randomized-composable-coresets-for-matching-and-vertex-cover-1705.082422017-05-24 https://scifaro.com/en/abs/optimization-in-large-graphs-toward-a-better-future-1705.082772017-05-24 https://scifaro.com/en/abs/algorithms-and-hardness-results-for-happy-coloring-problems-1705.082822017-05-24 https://scifaro.com/en/abs/efficient-coalgebraic-partition-refinement-1705.083622026-01-21 https://scifaro.com/en/abs/on-the-multiparty-communication-complexity-of-testing-triangle-freeness-1705.084382017-05-24 https://scifaro.com/en/abs/a-study-on-exponential-size-neighborhoods-for-the-bin-packing-problem-with-conflicts-1705.084952017-05-25 https://scifaro.com/en/abs/representing-the-suffix-tree-with-the-cdawg-1705.086402017-05-25 https://scifaro.com/en/abs/combinatorial-n-fold-integer-programming-and-applications-1705.086572017-11-10 https://scifaro.com/en/abs/using-minimum-path-cover-to-boost-dynamic-programming-on-dags-co-linear-chaining-extended-1705.087542018-01-30 https://scifaro.com/en/abs/linearizable-iterators-for-concurrent-sets-1705.088852018-03-02 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-recognizing-well-covered-r-l-graphs-1705.091772018-06-07 https://scifaro.com/en/abs/overcommitment-in-cloud-services-bin-packing-with-chance-constraints-1705.093352017-05-29 https://scifaro.com/en/abs/duel-and-sweep-algorithm-for-order-preserving-pattern-matching-1705.094382017-05-29 https://scifaro.com/en/abs/new-variants-of-pattern-matching-with-constants-and-variables-1705.095042017-05-29 https://scifaro.com/en/abs/on-two-lz78-style-grammars-compression-bounds-and-compressed-space-computation-1705.095382017-07-26 https://scifaro.com/en/abs/gossip-in-a-smartphone-peer-to-peer-network-1705.096092017-05-29 https://scifaro.com/en/abs/near-linear-time-approximation-algorithms-for-optimal-transport-via-sinkhorn-iteration-1705.096342018-02-08 https://scifaro.com/en/abs/multiresolution-priority-queues-1705.096422017-08-11 https://scifaro.com/en/abs/a-greedy-approximation-algorithm-for-the-minimum-2-2-connected-dominating-set-problem-1705.096432017-05-29 https://scifaro.com/en/abs/linear-size-cdawg-new-repetition-aware-indexing-and-grammar-compression-1705.097792017-07-28 https://scifaro.com/en/abs/universal-protocols-for-information-dissemination-using-emergent-signals-1705.097982017-11-30 https://scifaro.com/en/abs/deterministic-partially-dynamic-single-source-shortest-paths-in-weighted-graphs-1705.100972017-05-30 https://scifaro.com/en/abs/a-scalable-solution-to-the-nearest-neighbor-search-problem-through-local-search-methods-on-neighbor-graphs-1705.103512021-06-30 https://scifaro.com/en/abs/optimal-time-text-indexing-in-bwt-runs-bounded-space-1705.103822017-07-13 https://scifaro.com/en/abs/tiny-groups-tackle-byzantine-adversaries-1705.103872018-01-10 https://scifaro.com/en/abs/further-approximations-for-demand-matching-matroid-constraints-and-minor-closed-graphs-1705.103962017-05-31 https://scifaro.com/en/abs/gaussian-variant-of-freivalds-algorithm-for-efficient-and-reliable-matrix-product-verification-1705.104492017-05-31 https://scifaro.com/en/abs/a-faster-construction-of-greedy-consensus-trees-1705.105482017-07-05 https://scifaro.com/en/abs/the-logarithmic-funnel-heap-an-efficient-priority-queue-for-extremely-large-sets-1705.106482023-12-07 https://scifaro.com/en/abs/faster-algorithms-for-computing-maximal-2-connected-subgraphs-in-sparse-directed-graphs-1705.107092017-05-31 https://scifaro.com/en/abs/fast-regression-with-an-ell-infty-guarantee-1705.107232017-05-31 https://scifaro.com/en/abs/saving-critical-nodes-with-firefighters-is-fpt-1705.109232017-06-01 https://scifaro.com/en/abs/succinct-partial-sums-and-fenwick-trees-1705.109872017-06-01 https://scifaro.com/en/abs/decremental-single-source-reachability-in-planar-digraphs-1705.111632017-06-01 https://scifaro.com/en/abs/improved-algorithms-for-mst-and-metric-tsp-interdiction-1706.000342017-06-02 https://scifaro.com/en/abs/order-preserving-pattern-matching-on-trees-and-dags-1706.001482017-07-26 https://scifaro.com/en/abs/exploring-the-complexity-of-layout-parameters-in-tournaments-and-semi-complete-digraphs-1706.006172017-06-05 https://scifaro.com/en/abs/inferring-protein-protein-interaction-and-protein-dna-interaction-directions-based-on-cause-effect-pairs-in-undirected-and-mixed-networks-1706.009112017-06-06 https://scifaro.com/en/abs/a-fast-x86-implementation-of-select-1706.009902017-06-06 https://scifaro.com/en/abs/improved-consistent-weighted-sampling-revisited-1706.011722017-06-06 https://scifaro.com/en/abs/the-classical-complexity-of-boson-sampling-1706.012602017-10-19 https://scifaro.com/en/abs/balanced-facilities-on-random-graphs-1706.013472017-06-06 https://scifaro.com/en/abs/time-dependent-shortest-paths-in-bounded-treewidth-graphs-1706.015082017-06-07 https://scifaro.com/en/abs/approximation-algorithms-for-minimizing-maximum-sensor-movement-for-line-barrier-coverage-in-the-plane-1706.016232017-06-07 https://scifaro.com/en/abs/approximation-algorithms-for-the-open-shop-problem-with-delivery-times-1706.020192017-06-08 https://scifaro.com/en/abs/isomorphic-coupled-task-scheduling-problem-with-compatibility-constraints-on-a-single-processor-1706.022022017-06-08 https://scifaro.com/en/abs/linear-hashing-is-awesome-1706.027832017-06-12 https://scifaro.com/en/abs/on-line-assembling-mitochondrial-dna-from-de-novo-transcriptome-1706.028282017-06-12 https://scifaro.com/en/abs/cinct-compression-and-retrieval-for-massive-vehicular-trajectories-via-relative-movement-labeling-1706.028852017-10-02 https://scifaro.com/en/abs/practical-evaluation-of-lempel-ziv-78-and-lempel-ziv-welch-tries-1706.030352017-06-12 https://scifaro.com/en/abs/towards-balanced-clustering-part-1-preliminaries-1706.030652017-06-13 https://scifaro.com/en/abs/constant-query-time-1-epsilon-approximate-distance-oracle-for-planar-graphs-1706.031082017-06-13 https://scifaro.com/en/abs/parameterized-algorithms-for-power-efficiently-connecting-wireless-sensor-networks-theory-and-experiments-1706.031772022-03-23 https://scifaro.com/en/abs/improved-methods-for-computing-distances-between-unordered-trees-using-integer-programming-1706.034732017-06-13 https://scifaro.com/en/abs/monitoring-of-domain-related-problems-in-distributed-data-streams-1706.035682017-06-13 https://scifaro.com/en/abs/streaming-non-monotone-submodular-maximization-personalized-video-summarization-on-the-fly-1706.035832017-12-27 https://scifaro.com/en/abs/designing-deterministic-polynomial-space-algorithms-by-color-coding-multivariate-polynomials-1706.036982017-12-20 https://scifaro.com/en/abs/clustering-high-dimensional-dynamic-data-streams-1706.038872017-06-14 https://scifaro.com/en/abs/deleting-vertices-to-graphs-of-bounded-genus-1706.040652017-06-14 https://scifaro.com/en/abs/distributed-submodular-maximization-with-limited-information-1706.040822017-06-14 https://scifaro.com/en/abs/the-power-of-choice-in-priority-scheduling-1706.041782017-06-14 https://scifaro.com/en/abs/structured-connectivity-augmentation-1706.042552017-06-15 https://scifaro.com/en/abs/recommending-links-through-influence-maximization-1706.043682017-06-15 https://scifaro.com/en/abs/experimental-study-of-compressed-stack-algorithms-in-limited-memory-environments-1706.047082017-06-16 https://scifaro.com/en/abs/efficient-representative-subset-selection-over-sliding-windows-1706.047642018-09-05 https://scifaro.com/en/abs/improved-set-based-symbolic-algorithms-for-parity-games-1706.048892017-06-16 https://scifaro.com/en/abs/the-complexity-of-the-multiple-pattern-matching-problem-for-random-strings-1706.049282017-07-03 https://scifaro.com/en/abs/online-strip-packing-with-polynomial-migration-1706.049392018-02-21 https://scifaro.com/en/abs/optimal-online-two-way-trading-with-bounded-number-of-transactions-1706.053202017-06-19 https://scifaro.com/en/abs/modeling-biological-problems-in-computer-science-a-case-study-in-genome-assembly-1706.054292018-01-04 https://scifaro.com/en/abs/an-improved-kernel-for-the-cycle-contraction-problem-1706.056282017-06-20 https://scifaro.com/en/abs/recognizing-hyperelliptic-graphs-in-polynomial-time-1706.056702019-09-24 https://scifaro.com/en/abs/superminhash-a-new-minwise-hashing-algorithm-for-jaccard-similarity-estimation-1706.056982017-06-20 https://scifaro.com/en/abs/fourier-based-testing-for-families-of-distributions-1706.057382017-08-09 https://scifaro.com/en/abs/approximate-generalized-matching-f-factors-and-f-edge-covers-1706.057612020-05-11 https://scifaro.com/en/abs/how-hard-is-it-to-find-honest-witnesses-1706.058152017-06-20 https://scifaro.com/en/abs/capacity-releasing-diffusion-for-speed-and-locality-1706.058262018-06-12 https://scifaro.com/en/abs/conditional-lower-bounds-for-space-time-tradeoffs-1706.058472017-07-26 https://scifaro.com/en/abs/an-exponential-lower-bound-for-cut-sparsifiers-in-planar-graphs-1706.060862018-01-03 https://scifaro.com/en/abs/selecting-nodes-and-buying-links-to-maximize-the-information-diffusion-in-a-network-1706.064662017-06-21 https://scifaro.com/en/abs/orthogonal-compaction-using-additional-bends-1706.065142017-06-21 https://scifaro.com/en/abs/bb-graph-a-subgraph-isomorphism-algorithm-for-efficiently-querying-big-graph-databases-1706.066542018-08-21 https://scifaro.com/en/abs/computing-maximum-cliques-in-b-2-epg-graphs-1706.066852017-06-22 https://scifaro.com/en/abs/maxent-stress-optimization-of-3d-biomolecular-models-1706.068052017-06-22 https://scifaro.com/en/abs/approximating-sparsest-cut-in-low-rank-graphs-via-embeddings-from-approximately-low-dimensional-spaces-1706.068062017-06-22 https://scifaro.com/en/abs/faster-batched-range-minimum-queries-1706.069402017-07-12 https://scifaro.com/en/abs/new-cardinality-estimation-methods-for-hyperloglog-sketches-1706.072902017-06-23 https://scifaro.com/en/abs/efficient-convex-optimization-with-membership-oracles-1706.073572017-06-23 https://scifaro.com/en/abs/optimal-general-matchings-1706.074182021-05-07 https://scifaro.com/en/abs/parameterized-approximation-algorithms-for-some-location-problems-in-graphs-1706.074752017-06-26 https://scifaro.com/en/abs/a-2-epsilon-approximation-for-precedence-constrained-single-machine-scheduling-with-release-dates-and-total-weighted-completion-time-objective-1706.076042017-06-26 https://scifaro.com/en/abs/testing-piecewise-functions-1706.076692018-05-22 https://scifaro.com/en/abs/the-optimal-route-and-stops-for-a-group-of-users-in-a-road-network-1706.078292017-06-27 https://scifaro.com/en/abs/a-practical-fpt-algorithm-for-flow-decomposition-and-transcript-assembly-1706.078512017-08-31 https://scifaro.com/en/abs/sparsity-based-stap-design-based-on-alternating-direction-method-with-gain-phase-errors-1706.079752017-06-27 https://scifaro.com/en/abs/minimum-connected-transversals-in-graphs-new-hardness-results-and-tractable-cases-using-the-price-of-connectivity-1706.080502017-09-22 https://scifaro.com/en/abs/steiner-point-removal-with-distortion-o-log-k-1706.081152017-07-28 https://scifaro.com/en/abs/simulation-optimization-a-review-of-algorithms-and-applications-1706.085912017-06-28 https://scifaro.com/en/abs/domain-reduction-techniques-for-global-nlp-and-minlp-optimization-1706.086012017-06-28 https://scifaro.com/en/abs/traversing-a-n-cube-without-balanced-hamiltonian-cycle-to-generate-pseudorandom-numbers-1706.089232017-06-28 https://scifaro.com/en/abs/contraction-and-deletion-blockers-for-perfect-graphs-and-h-free-graphs-1706.090522017-06-29 https://scifaro.com/en/abs/on-the-complexity-of-finding-internally-vertex-disjoint-long-directed-paths-1706.090662017-06-29 https://scifaro.com/en/abs/dispersion-on-trees-1706.091852017-06-29 https://scifaro.com/en/abs/accelerations-for-graph-isomorphism-1706.092302017-06-29 https://scifaro.com/en/abs/lossy-kernels-for-connected-dominating-set-on-sparse-graphs-1706.093392018-02-23 https://scifaro.com/en/abs/new-results-on-routing-via-matchings-on-graphs-1706.093552022-03-22 https://scifaro.com/en/abs/parameterized-algorithms-for-partitioning-graphs-into-highly-connected-clusters-1706.094872017-06-30 https://scifaro.com/en/abs/defining-equitable-geographic-districts-in-road-networks-via-stable-matching-1706.095932017-09-21 https://scifaro.com/en/abs/robust-detection-in-leak-prone-population-protocols-1706.099372019-08-19 https://scifaro.com/en/abs/on-conceptually-simple-algorithms-for-variants-of-online-bipartite-matching-1706.099662017-07-03 https://scifaro.com/en/abs/on-the-solution-of-linear-programming-problems-in-the-age-of-big-data-1706.100302017-11-13 https://scifaro.com/en/abs/compaction-of-church-numerals-for-higher-order-compression-1706.100612017-11-13 https://scifaro.com/en/abs/time-space-trade-offs-for-lempel-ziv-compressed-indexing-1706.100942018-01-10 https://scifaro.com/en/abs/agglomerative-clustering-of-growing-squares-1706.101952018-05-15 https://scifaro.com/en/abs/contracting-a-planar-graph-efficiently-1706.102282017-07-03 https://scifaro.com/en/abs/cache-oblivious-algorithms-for-computing-the-triplet-distance-between-trees-1706.102842019-11-11 https://scifaro.com/en/abs/corpus-compressed-streaming-and-the-spotify-problem-1707.000802017-07-04 https://scifaro.com/en/abs/simultaneous-consecutive-ones-submatrix-and-editing-problems-classical-complexity-fixed-parameter-tractable-results-1707.001062018-11-14 https://scifaro.com/en/abs/a-new-algorithm-for-fast-generalized-dfts-1707.003492018-04-02 https://scifaro.com/en/abs/dynamic-parameterized-problems-and-algorithms-1707.003622017-07-04 https://scifaro.com/en/abs/speeding-up-string-matching-by-weak-factor-recognition-1707.004692017-07-04 https://scifaro.com/en/abs/packing-cycles-faster-than-erd-h-o-s-p-osa-1707.010372017-07-05 https://scifaro.com/en/abs/biased-predecessor-search-1707.011822017-07-06 https://scifaro.com/en/abs/maximum-induced-matching-algorithms-via-vertex-ordering-characterizations-1707.012452017-09-22 https://scifaro.com/en/abs/on-directed-feedback-vertex-set-parameterized-by-treewidth-1707.014702017-09-15 https://scifaro.com/en/abs/single-sink-fractionally-subadditive-network-design-1707.014872017-07-12 https://scifaro.com/en/abs/a-new-and-improved-algorithm-for-online-bin-packing-1707.017282017-07-07 https://scifaro.com/en/abs/fast-compressed-self-indexes-with-deterministic-linear-time-construction-1707.017432017-09-05 https://scifaro.com/en/abs/turing-kernelization-for-finding-long-paths-in-graph-classes-excluding-a-topological-minor-1707.017972017-07-07 https://scifaro.com/en/abs/adaptive-modular-exponentiation-methods-v-s-python-s-power-function-1707.018982017-07-10 https://scifaro.com/en/abs/on-calculation-of-bounds-for-greedy-algorithms-when-applied-to-sensor-selection-problems-1707.018992017-07-10 https://scifaro.com/en/abs/networked-fairness-in-cake-cutting-1707.020332017-07-10 https://scifaro.com/en/abs/a-subexponential-parameterized-algorithm-for-directed-subset-traveling-salesman-problem-on-planar-graphs-1707.021902022-10-03 https://scifaro.com/en/abs/the-stellar-decomposition-a-compact-representation-for-simplicial-complexes-and-beyond-1707.022112021-08-05 https://scifaro.com/en/abs/efficient-dynamic-approximate-distance-oracles-for-vertex-labeled-planar-graphs-1707.024142017-08-29 https://scifaro.com/en/abs/dynamic-clustering-to-minimize-the-sum-of-radii-1707.025772017-07-11 https://scifaro.com/en/abs/on-the-min-max-delay-problem-np-completeness-algorithm-and-integrality-gap-1707.026502018-06-27 https://scifaro.com/en/abs/efficient-enumeration-of-induced-matchings-in-a-graph-without-cycles-with-length-four-1707.027402018-09-21 https://scifaro.com/en/abs/a-local-search-algorithm-for-steiner-forest-1707.027532017-07-11 https://scifaro.com/en/abs/subdeterminant-maximization-via-nonconvex-relaxations-and-anti-concentration-1707.027572018-07-24 https://scifaro.com/en/abs/a-succinct-data-structure-for-self-indexing-ternary-relations-1707.027592017-07-11 https://scifaro.com/en/abs/compressed-representation-of-dynamic-binary-relations-with-applications-1707.027692017-07-11 https://scifaro.com/en/abs/round-compression-for-parallel-matching-algorithms-1707.034782018-02-02 https://scifaro.com/en/abs/enumerating-vertices-of-0-1-polyhedra-associated-with-0-1-totally-unimodular-matrices-1707.039142017-07-14 https://scifaro.com/en/abs/stochastic-packing-integer-programs-with-few-queries-1707.040202019-03-14 https://scifaro.com/en/abs/triangle-packing-in-sparse-tournaments-approximation-and-kernelization-1707.042202017-07-14 https://scifaro.com/en/abs/approximation-schemes-for-clustering-with-outliers-1707.042952017-07-17 https://scifaro.com/en/abs/topological-sorting-under-regular-constraints-1707.043102019-08-28 https://scifaro.com/en/abs/lempel-ziv-a-one-bit-catastrophe-but-not-a-tragedy-1707.043122017-08-01 https://scifaro.com/en/abs/a-tight-approximation-for-co-flow-scheduling-for-minimizing-total-weighted-completion-time-1707.043312018-12-04 https://scifaro.com/en/abs/satiation-in-fisher-markets-and-approximation-of-nash-social-welfare-1707.044282019-08-01 https://scifaro.com/en/abs/competitive-algorithms-for-generalized-k-server-in-uniform-metrics-1707.045192017-07-18 https://scifaro.com/en/abs/fine-grained-reductions-from-approximate-counting-to-decision-1707.046092020-11-25 https://scifaro.com/en/abs/clustering-algorithms-for-the-centralized-and-local-models-1707.047662017-07-18 https://scifaro.com/en/abs/on-approximating-the-number-of-k-cliques-in-sublinear-time-1707.048582018-03-14 https://scifaro.com/en/abs/testing-bounded-arboricity-1707.048642021-04-28 https://scifaro.com/en/abs/near-optimal-sized-weight-tolerant-subgraph-for-single-source-shortest-path-1707.048672017-07-18 https://scifaro.com/en/abs/coding-sets-with-asymmetric-information-1707.048752018-07-30 https://scifaro.com/en/abs/polylogarithmic-approximation-algorithms-for-weighted-mathcal-f-deletion-problems-1707.049082017-07-18 https://scifaro.com/en/abs/feedback-vertex-set-inspired-kernel-for-chordal-vertex-deletion-1707.049172017-07-18 https://scifaro.com/en/abs/practical-locally-private-heavy-hitters-1707.049822017-07-18 https://scifaro.com/en/abs/fully-polynomial-fpt-algorithms-for-some-classes-of-bounded-clique-width-graphs-1707.050162017-10-19 https://scifaro.com/en/abs/truly-sub-cubic-algorithms-for-language-edit-distance-and-rna-folding-via-fast-bounded-difference-min-plus-product-1707.050952017-07-18 https://scifaro.com/en/abs/purely-combinatorial-algorithms-for-approximate-directed-minimum-degree-spanning-trees-1707.051232019-05-28 https://scifaro.com/en/abs/tight-analysis-of-randomized-greedy-mis-1707.051242019-05-17 https://scifaro.com/en/abs/a-tight-analysis-of-the-parallel-undecided-state-dynamics-with-two-colors-1707.051352018-04-20 https://scifaro.com/en/abs/capacitated-covering-problems-in-geometric-spaces-1707.051702017-12-13 https://scifaro.com/en/abs/computing-the-number-of-induced-copies-of-a-fixed-graph-in-a-bounded-degree-graph-1707.051862017-09-21 https://scifaro.com/en/abs/coloring-down-3-2-approximation-for-special-cases-of-the-weighted-tree-augmentation-problem-1707.052402017-07-18 https://scifaro.com/en/abs/shorter-tours-and-longer-detours-uniform-covers-and-a-bit-beyond-1707.053872019-08-19 https://scifaro.com/en/abs/on-treewidth-and-stable-marriage-1707.054042017-07-19 https://scifaro.com/en/abs/polynomial-time-algorithm-for-maximum-weight-independent-set-on-p-6-free-graphs-1707.054912020-03-24 https://scifaro.com/en/abs/nested-convex-bodies-are-chaseable-1707.055272017-07-19 https://scifaro.com/en/abs/the-compressed-overlap-index-1707.056132017-07-19 https://scifaro.com/en/abs/learning-powers-of-poisson-binomial-distributions-1707.056622017-07-19 https://scifaro.com/en/abs/reconciling-graphs-and-sets-of-sets-1707.058672018-07-26 https://scifaro.com/en/abs/computing-tutte-paths-1707.059942017-07-21 https://scifaro.com/en/abs/better-labeling-schemes-for-nearest-common-ancestors-through-minor-universal-trees-1707.060112017-07-20 https://scifaro.com/en/abs/online-bipartite-matching-with-amortized-o-log-2-n-replacements-1707.060632018-05-07 https://scifaro.com/en/abs/on-finding-maximum-cardinality-subset-of-vectors-with-a-constraint-on-normalized-squared-length-of-vectors-sum-1707.060682017-07-20 https://scifaro.com/en/abs/a-sublinear-tester-for-outerplanarity-and-other-forbidden-minors-with-one-sided-error-1707.061262018-08-09 https://scifaro.com/en/abs/submodular-minimization-under-congruency-constraints-1707.062122018-11-27 https://scifaro.com/en/abs/dynamic-bridge-finding-in-tilde-o-log-2-n-amortized-time-1707.063112018-08-28 https://scifaro.com/en/abs/document-listing-on-repetitive-collections-with-guaranteed-performance-1707.063742018-11-15 https://scifaro.com/en/abs/parameterized-approximation-algorithms-for-bidirected-steiner-network-problems-1707.064992022-04-08 https://scifaro.com/en/abs/the-euler-and-chinese-postman-problems-on-2-arc-colored-digraphs-1707.065032017-07-21 https://scifaro.com/en/abs/improved-bounds-for-testing-dyck-languages-1707.066062017-07-21 https://scifaro.com/en/abs/two-results-on-slime-mold-computations-1707.066312019-07-01 https://scifaro.com/en/abs/social-hash-partitioner-a-scalable-distributed-hypergraph-partitioner-1707.066652017-07-24 https://scifaro.com/en/abs/constant-time-updates-in-hierarchical-heavy-hitters-1707.067782017-07-24 https://scifaro.com/en/abs/improved-kernels-and-algorithms-for-claw-and-diamond-free-edge-deletion-based-on-refined-observations-1707.067792022-01-05 https://scifaro.com/en/abs/the-complexity-landscape-of-fixed-parameter-directed-steiner-network-problems-1707.068082022-11-11 https://scifaro.com/en/abs/hierarchical-partial-planarity-1707.068442017-07-24 https://scifaro.com/en/abs/load-thresholds-for-cuckoo-hashing-with-overlapping-blocks-1707.068552019-12-18 https://scifaro.com/en/abs/fast-nearest-neighbor-preserving-embeddings-1707.068672017-07-24 https://scifaro.com/en/abs/bilinear-assignment-problem-large-neighborhoods-and-experimental-analysis-of-algorithms-1707.070572017-09-12 https://scifaro.com/en/abs/testable-bounded-degree-graph-properties-are-random-order-streamable-1707.073342017-07-25 https://scifaro.com/en/abs/greedy-shortest-common-superstring-approximation-in-compact-space-1707.077272019-12-04 https://scifaro.com/en/abs/many-objective-pareto-local-search-1707.078992017-12-15 https://scifaro.com/en/abs/scheduling-to-minimize-total-weighted-completion-time-via-time-indexed-linear-programming-relaxations-1707.080392017-07-26 https://scifaro.com/en/abs/persistent-cache-oblivious-streaming-indexes-1707.081862017-07-27 https://scifaro.com/en/abs/fast-label-extraction-in-the-cdawg-1707.081972017-09-27 https://scifaro.com/en/abs/the-2d-tree-sliding-window-discrete-fourier-transform-1707.082132019-03-01 https://scifaro.com/en/abs/a-nearly-instance-optimal-algorithm-for-top-k-ranking-under-the-multinomial-logit-model-1707.082382017-08-01 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-k-center-and-bounded-capacity-vehicle-routing-in-graphs-with-bounded-highway-dimension-1707.082702017-11-15 https://scifaro.com/en/abs/a-change-sensitive-algorithm-for-maintaining-maximal-bicliques-in-a-dynamic-bipartite-graph-1707.082722017-07-27 https://scifaro.com/en/abs/practical-adversarial-combinatorial-bandit-algorithm-via-compression-of-decision-sets-1707.083002017-07-27 https://scifaro.com/en/abs/fast-distributed-approximation-for-max-cut-1707.084962017-07-27 https://scifaro.com/en/abs/a-naive-algorithm-for-feedback-vertex-set-1707.086842017-08-02 https://scifaro.com/en/abs/vertex-deletion-problems-on-chordal-graphs-1707.086902017-08-02 https://scifaro.com/en/abs/an-improved-subsumption-testing-algorithm-for-the-optimal-size-sorting-network-problem-1707.087252017-07-28 https://scifaro.com/en/abs/ramsey-spanning-trees-and-their-applications-1707.087692017-07-28 https://scifaro.com/en/abs/nearest-common-ancestors-universal-trees-and-improved-labeling-schemes-1707.088072017-07-28 https://scifaro.com/en/abs/effective-edge-fault-tolerant-single-source-spanners-via-best-or-good-swap-edges-1707.088612017-07-28 https://scifaro.com/en/abs/independent-feedback-vertex-sets-for-graphs-of-bounded-diameter-1707.093832017-08-01 https://scifaro.com/en/abs/independent-feedback-vertex-set-for-p-5-free-graphs-1707.094022017-08-01 https://scifaro.com/en/abs/balanced-stable-marriage-how-close-is-close-enough-1707.095452017-08-01 https://scifaro.com/en/abs/recognizing-graphs-close-to-bipartite-graphs-with-an-application-to-colouring-reconfiguration-1707.098172017-08-01 https://scifaro.com/en/abs/temporal-hierarchical-clustering-1707.099042017-10-23 https://scifaro.com/en/abs/which-distribution-distances-are-sublinearly-testable-1708.000022017-11-01 https://scifaro.com/en/abs/computing-the-margin-of-victory-in-preferential-parliamentary-elections-1708.001212017-08-02 https://scifaro.com/en/abs/improved-algorithms-for-scheduling-unsplittable-flows-on-paths-1708.001432017-08-02 https://scifaro.com/en/abs/adaptive-hierarchical-clustering-using-ordinal-queries-1708.001492018-04-18 https://scifaro.com/en/abs/exact-approaches-for-the-travelling-thief-problem-1708.003312017-08-02 https://scifaro.com/en/abs/a-watershed-delineation-algorithm-for-2d-flow-direction-grids-1708.003542017-08-02 https://scifaro.com/en/abs/a-note-on-the-size-of-query-trees-1708.005102017-08-03 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-contraction-to-generalization-of-trees-1708.006222017-08-03 https://scifaro.com/en/abs/approximate-solution-of-length-bounded-maximum-multicommodity-flow-with-unit-edge-lengths-1708.007742017-08-03 https://scifaro.com/en/abs/average-case-reconstruction-for-the-deletion-channel-subpolynomially-many-traces-suffice-1708.008542017-08-03 https://scifaro.com/en/abs/efficient-hybrid-search-algorithm-on-ordered-datasets-1708.009642017-08-04 https://scifaro.com/en/abs/improved-deterministic-distributed-construction-of-spanners-1708.010112017-08-15 https://scifaro.com/en/abs/the-gram-schmidt-walk-a-cure-for-the-banaszczyk-blues-1708.010792017-08-04 https://scifaro.com/en/abs/efficient-pattern-matching-in-degenerate-strings-with-the-burrows-wheeler-transform-1708.011302017-08-04 https://scifaro.com/en/abs/l1-norm-principal-component-analysis-of-complex-data-1708.012492018-05-23 https://scifaro.com/en/abs/compact-provably-good-lps-for-orienteering-and-regret-bounded-vehicle-routing-1708.013352017-08-07 https://scifaro.com/en/abs/better-tradeoffs-for-exact-distance-oracles-in-planar-graphs-1708.013862017-08-07 https://scifaro.com/en/abs/localization-of-electrical-flows-1708.016322017-08-08 https://scifaro.com/en/abs/a-simple-ptas-for-the-dual-bin-packing-problem-and-advice-complexity-of-its-online-version-1708.016572017-08-08 https://scifaro.com/en/abs/study-of-sparsity-aware-set-membership-adaptive-algorithms-with-adjustable-penalties-1708.016962017-08-08 https://scifaro.com/en/abs/isolating-a-vertex-via-lattices-polytopes-with-totally-unimodular-faces-1708.022222018-05-08 https://scifaro.com/en/abs/analyzing-boltzmann-samplers-for-bose-einstein-condensates-with-dirichlet-generating-functions-1708.022662023-04-11 https://scifaro.com/en/abs/odd-multiway-cut-in-directed-acyclic-graphs-1708.023232018-04-09 https://scifaro.com/en/abs/distributed-rank-1-dictionary-learning-towards-fast-and-scalable-solutions-for-fmri-big-data-analytics-1708.026382017-08-10 https://scifaro.com/en/abs/randomly-coloring-graphs-of-bounded-treewidth-1708.026772017-08-10 https://scifaro.com/en/abs/optimal-identity-testing-with-high-probability-1708.027282019-01-17 https://scifaro.com/en/abs/fast-algorithm-for-finding-maximum-distance-with-space-subdivision-in-e2-1708.027582017-08-10 https://scifaro.com/en/abs/space-subdivision-to-speed-up-convex-hull-construction-in-e3-1708.027692017-08-10 https://scifaro.com/en/abs/on-maximum-common-subgraph-problems-in-series-parallel-graphs-1708.027722017-08-10 https://scifaro.com/en/abs/simple-analysis-of-sparse-sign-consistent-jl-1708.029662019-10-01 https://scifaro.com/en/abs/distance-preserving-subgraphs-of-interval-graphs-1708.030812018-09-27 https://scifaro.com/en/abs/lower-bounds-for-several-online-variants-of-bin-packing-1708.032282017-08-11 https://scifaro.com/en/abs/robust-scheduling-to-minimize-the-weighted-number-of-late-jobs-with-interval-due-date-uncertainty-1708.032522017-08-11 https://scifaro.com/en/abs/robust-polynomial-regression-up-to-the-information-theoretic-limit-1708.032572017-08-11 https://scifaro.com/en/abs/partial-optimality-of-dual-decomposition-for-map-inference-in-pairwise-mrfs-1708.033142017-08-11 https://scifaro.com/en/abs/algorithms-based-on-algebras-and-their-applications-to-isomorphism-of-polynomials-with-one-secret-group-isomorphism-and-polynomial-identity-testing-1708.034952019-02-08 https://scifaro.com/en/abs/an-ensemble-classification-algorithm-based-on-information-entropy-for-data-streams-1708.034962017-08-14 https://scifaro.com/en/abs/new-tools-and-connections-for-exponential-time-approximation-1708.035152017-08-14 https://scifaro.com/en/abs/optimal-offline-dynamic-2-3-edge-vertex-connectivity-1708.038122019-03-22 https://scifaro.com/en/abs/training-support-vector-machines-using-coresets-1708.038352017-11-13 https://scifaro.com/en/abs/the-parameterized-complexity-of-happy-colorings-1708.038532017-08-15 https://scifaro.com/en/abs/dynamic-minimum-spanning-forest-with-subpolynomial-worst-case-update-time-1708.039622017-08-16 https://scifaro.com/en/abs/metric-embedding-via-shortest-path-decompositions-1708.040732023-01-03 https://scifaro.com/en/abs/a-branch-price-and-remember-algorithm-for-the-u-shaped-assembly-line-balancing-problem-1708.041272017-09-05 https://scifaro.com/en/abs/a-constant-factor-approximation-algorithm-for-the-asymmetric-traveling-salesman-problem-1708.042152020-09-17 https://scifaro.com/en/abs/graphettes-constant-time-determination-of-graphlet-and-orbit-identity-including-possibly-disconnected-graphlets-up-to-size-8-1708.043412017-08-16 https://scifaro.com/en/abs/quasi-ptas-for-scheduling-with-precedences-using-lp-hierarchies-1708.043692017-08-16 https://scifaro.com/en/abs/streaming-periodicity-with-mismatches-1708.043812017-08-16 https://scifaro.com/en/abs/linear-algebraic-analogues-of-the-graph-isomorphism-problem-and-the-erd-h-o-s-r-enyi-model-1708.045012017-10-03 https://scifaro.com/en/abs/polynomial-time-algorithms-for-the-longest-induced-path-and-induced-disjoint-paths-problems-on-graphs-of-bounded-mim-width-1708.045362017-09-29 https://scifaro.com/en/abs/sample-efficient-estimation-and-recovery-in-sparse-fft-via-isolation-on-average-1708.045442017-08-18 https://scifaro.com/en/abs/an-efficient-npn-boolean-matching-algorithm-based-on-structural-signature-and-shannon-expansion-1708.045972017-11-10 https://scifaro.com/en/abs/generalized-uniformity-testing-1708.046962017-08-17 https://scifaro.com/en/abs/polylogarithmic-approximation-for-minimum-planarization-almost-1708.047232017-08-17 https://scifaro.com/en/abs/new-approximations-for-coalitional-manipulation-in-general-scoring-rules-1708.048622017-08-17 https://scifaro.com/en/abs/online-primal-dual-algorithms-with-configuration-linear-programs-1708.049032017-08-17 https://scifaro.com/en/abs/balanced-allocation-through-random-walk-1708.049452017-08-24 https://scifaro.com/en/abs/approximation-schemes-for-minimizing-the-maximum-lateness-on-a-single-machine-with-release-times-under-non-availability-or-deadline-constraints-1708.051022017-08-18 https://scifaro.com/en/abs/finding-subcube-heavy-hitters-in-analytics-data-streams-1708.051592018-02-22 https://scifaro.com/en/abs/the-streaming-k-mismatch-problem-1708.052232018-04-10 https://scifaro.com/en/abs/an-optimal-realization-algorithm-for-bipartite-graphs-with-degrees-in-prescribed-intervals-1708.055202017-08-21 https://scifaro.com/en/abs/online-service-with-delay-1708.056112017-08-21 https://scifaro.com/en/abs/improved-rectangular-matrix-multiplication-using-powers-of-the-coppersmith-winograd-tensor-1708.056222021-10-05 https://scifaro.com/en/abs/an-fpt-algorithm-for-planar-multicuts-with-sources-and-sinks-on-the-outer-face-1708.059032017-09-18 https://scifaro.com/en/abs/kirchhoff-index-as-a-measure-of-edge-centrality-in-weighted-networks-nearly-linear-time-algorithms-1708.059592018-01-16 https://scifaro.com/en/abs/efficient-algorithms-for-scheduling-equal-length-jobs-with-processing-set-restrictions-on-uniform-parallel-batch-machines-1708.060482017-08-22 https://scifaro.com/en/abs/practical-minimum-cut-algorithms-1708.061272019-06-05 https://scifaro.com/en/abs/scalable-kernelization-for-maximum-independent-sets-1708.061512019-09-11 https://scifaro.com/en/abs/simple-and-near-optimal-distributed-coloring-for-sparse-graphs-1708.062752017-08-24 https://scifaro.com/en/abs/recovering-nonuniform-planted-partitions-via-iterated-projection-1708.067832017-08-24 https://scifaro.com/en/abs/back-to-the-future-an-even-more-nearly-optimal-cardinality-estimation-algorithm-1708.068392017-08-24 https://scifaro.com/en/abs/elements-of-nonlinear-analysis-of-information-streams-1708.071112017-08-24 https://scifaro.com/en/abs/exploiting-computation-friendly-graph-compression-methods-1708.072712018-02-20 https://scifaro.com/en/abs/a-fast-approximation-scheme-for-low-dimensional-k-means-1708.073812017-08-30 https://scifaro.com/en/abs/one-way-trail-orientations-1708.073892017-08-25 https://scifaro.com/en/abs/fast-locality-sensitive-hashing-frameworks-for-approximate-near-neighbor-search-1708.075862018-02-19 https://scifaro.com/en/abs/conditional-lower-bound-for-subgraph-isomorphism-with-a-tree-pattern-1708.075912018-04-10 https://scifaro.com/en/abs/efficient-adaptive-implementation-of-the-serial-schedule-generation-scheme-using-preprocessing-and-bloom-filters-1708.077862017-08-28 https://scifaro.com/en/abs/stability-of-the-lanczos-method-for-matrix-function-approximation-1708.077882024-11-19 https://scifaro.com/en/abs/ell-1-regression-using-lewis-weights-preconditioning-and-stochastic-gradient-descent-1708.078212018-06-04 https://scifaro.com/en/abs/algorithms-for-big-data-graphs-and-pagerank-1708.078292017-08-29 https://scifaro.com/en/abs/an-algorithm-of-parking-planning-for-smart-parking-system-1708.079322017-08-29 https://scifaro.com/en/abs/a-model-for-donation-verification-1708.079732017-08-29 https://scifaro.com/en/abs/strassen-s-2x2-matrix-multiplication-algorithm-a-conceptual-perspective-1708.080832019-11-11 https://scifaro.com/en/abs/two-dimensional-indirect-binary-search-for-the-positive-one-in-three-satisfiability-problem-1708.083772017-09-19 https://scifaro.com/en/abs/deterministic-digital-clustering-of-wireless-ad-hoc-networks-1708.086472018-01-15 https://scifaro.com/en/abs/exact-and-approximate-algorithms-for-computing-betweenness-centrality-in-directed-graphs-1708.087392023-06-22 https://scifaro.com/en/abs/aligned-drawings-of-planar-graphs-1708.087782018-10-24 https://scifaro.com/en/abs/cheeger-inequalities-for-submodular-transformations-1708.087812018-10-15 https://scifaro.com/en/abs/online-circle-and-sphere-packing-1708.089062017-08-30 https://scifaro.com/en/abs/an-o-log-log-m-competitive-algorithm-for-online-machine-minimization-1708.090462018-01-31 https://scifaro.com/en/abs/answering-spatial-multiple-set-intersection-queries-using-2-3-cuckoo-hash-filters-1708.090592017-08-31 https://scifaro.com/en/abs/dynamic-graph-coloring-1708.090802018-06-26 https://scifaro.com/en/abs/planar-l-drawings-of-directed-graphs-1708.091072017-09-05 https://scifaro.com/en/abs/on-smooth-orthogonal-and-octilinear-drawings-relations-complexity-and-kandinsky-drawings-1708.091972017-08-31 https://scifaro.com/en/abs/experimental-evaluation-of-book-drawing-algorithms-1708.092212017-08-31 https://scifaro.com/en/abs/on-vertex-and-empty-ply-proximity-drawings-1708.092332017-09-08 https://scifaro.com/en/abs/an-interactive-tool-to-explore-and-improve-the-ply-number-of-drawings-1708.092502017-08-31 https://scifaro.com/en/abs/nodetrix-planarity-testing-with-small-clusters-1708.092812019-04-11 https://scifaro.com/en/abs/approximating-weighted-duo-preservation-in-comparative-genomics-1708.093252017-08-31 https://scifaro.com/en/abs/designing-strassen-s-algorithm-1708.093982017-09-01 https://scifaro.com/en/abs/simple-compact-monotone-tree-drawings-1708.096532025-05-19 https://scifaro.com/en/abs/visualizing-co-phylogenetic-reconciliations-1708.096912017-09-01 https://scifaro.com/en/abs/walking-through-waypoints-1708.098272018-05-01 https://scifaro.com/en/abs/reconstructing-generalized-staircase-polygons-with-uniform-step-length-1708.098422017-09-04 https://scifaro.com/en/abs/a-simple-balanced-search-tree-with-no-balance-criterion-1709.002472019-08-09 https://scifaro.com/en/abs/milp-and-max-clique-based-heuristics-for-the-eternity-ii-puzzle-1709.002522017-10-06 https://scifaro.com/en/abs/space-efficient-classical-and-quantum-algorithms-for-the-shortest-vector-problem-1709.003782018-03-09 https://scifaro.com/en/abs/dynamic-shortest-path-and-transitive-closure-algorithms-a-survey-1709.005532017-10-31 https://scifaro.com/en/abs/optimal-net-load-balancing-in-smart-grids-with-high-pv-penetration-1709.006442018-04-05 https://scifaro.com/en/abs/pairing-heaps-the-forward-variant-1709.011522018-06-22 https://scifaro.com/en/abs/flash-randomized-algorithms-accelerated-over-cpu-gpu-for-ultra-high-dimensional-similarity-search-1709.011902018-07-04 https://scifaro.com/en/abs/just-take-the-average-an-embarrassingly-simple-2-n-time-algorithm-for-svp-and-cvp-1709.015352019-01-28 https://scifaro.com/en/abs/constructing-light-spanners-deterministically-in-near-linear-time-1709.019602022-01-20 https://scifaro.com/en/abs/stabilizing-weighted-graphs-1709.019822017-11-28 https://scifaro.com/en/abs/sharp-bounds-for-generalized-uniformity-testing-1709.020872017-09-08 https://scifaro.com/en/abs/enhancing-kiwi-scalable-concurrent-key-value-map-1709.022252017-10-16 https://scifaro.com/en/abs/a-tight-lower-bound-for-counting-hamiltonian-cycles-via-matrix-rank-1709.023112017-11-22 https://scifaro.com/en/abs/nearest-embedded-and-embedding-self-nested-trees-1709.023342019-08-28 https://scifaro.com/en/abs/rank-select-indices-without-tears-1709.023772017-09-08 https://scifaro.com/en/abs/an-adversarial-model-for-scheduling-with-testing-1709.025922020-05-15 https://scifaro.com/en/abs/obstructions-to-a-small-hyperbolicity-in-helly-graphs-1709.028372019-07-15 https://scifaro.com/en/abs/mixed-integer-programming-with-convex-concave-constraints-fixed-parameter-tractability-and-applications-to-multicovering-and-voting-1709.028502017-11-22 https://scifaro.com/en/abs/a-new-approximation-guarantee-for-monotone-submodular-function-maximization-via-discrete-convexity-1709.029102017-09-12 https://scifaro.com/en/abs/sublinear-time-algorithms-for-compressive-phase-retrieval-1709.029172020-03-03 https://scifaro.com/en/abs/on-low-risk-heavy-hitters-and-sparse-recovery-schemes-1709.029192019-12-10 https://scifaro.com/en/abs/robust-routing-in-interdependent-networks-1709.030332021-11-29 https://scifaro.com/en/abs/multi-level-spherical-locality-sensitive-hashing-for-approximate-near-neighbors-1709.035172017-09-19 https://scifaro.com/en/abs/importance-sketching-of-influence-dynamics-in-billion-scale-networks-1709.035652017-09-13 https://scifaro.com/en/abs/an-efficient-approximation-algorithm-for-the-steiner-tree-problem-1709.038672018-11-02 https://scifaro.com/en/abs/scheduling-two-agents-on-a-single-machine-a-parameterized-analysis-of-np-hard-problems-1709.041612017-09-14 https://scifaro.com/en/abs/on-the-parameterized-tractability-of-the-just-in-time-flow-shop-scheduling-problem-1709.041692017-09-14 https://scifaro.com/en/abs/gene-tree-reconciliation-including-transfers-with-replacement-is-hard-and-fpt-1709.044592019-02-25 https://scifaro.com/en/abs/simple-round-compression-for-parallel-vertex-cover-1709.045992017-09-15 https://scifaro.com/en/abs/emoma-exact-match-in-one-memory-access-1709.047112017-09-15 https://scifaro.com/en/abs/optimal-broadcasting-in-networks-with-faulty-nodes-1709.048852017-09-15 https://scifaro.com/en/abs/technical-report-accelerating-dynamic-graph-analytics-on-gpus-1709.050612018-06-28 https://scifaro.com/en/abs/string-attractors-1709.053142017-09-20 https://scifaro.com/en/abs/differential-privacy-on-finite-computers-1709.053962019-01-18 https://scifaro.com/en/abs/process-oriented-iterative-multiple-alignment-for-medical-process-mining-1709.054402017-09-19 https://scifaro.com/en/abs/lexico-minimum-replica-placement-in-multitrees-1709.057092017-09-19 https://scifaro.com/en/abs/new-algorithms-for-minimizing-the-weighted-number-of-tardy-jobs-on-a-single-machine-1709.057512017-09-19 https://scifaro.com/en/abs/approximations-for-generalized-unsplittable-flow-on-paths-with-application-to-power-systems-optimization-1709.058762022-11-11 https://scifaro.com/en/abs/non-clairvoyant-scheduling-to-minimize-max-flow-time-on-a-machine-with-setup-times-1709.058962017-09-19 https://scifaro.com/en/abs/learning-neural-networks-with-two-nonlinear-layers-in-polynomial-time-1709.060102018-04-24 https://scifaro.com/en/abs/cache-aware-lock-free-concurrent-hash-tries-1709.060562017-09-19 https://scifaro.com/en/abs/crossing-patterns-in-nonplanar-road-networks-1709.061132017-09-20 https://scifaro.com/en/abs/improving-spliced-alignment-for-identification-of-ortholog-groups-and-multiple-cds-alignment-1709.061692017-09-20 https://scifaro.com/en/abs/tilt-assembly-algorithms-for-micro-factories-that-build-objects-with-uniform-external-forces-1709.062992017-09-20 https://scifaro.com/en/abs/dependent-randomized-rounding-for-clustering-and-partition-systems-with-knapsack-constraints-1709.069952024-05-14 https://scifaro.com/en/abs/sorting-with-recurrent-comparison-errors-1709.072492017-09-22 https://scifaro.com/en/abs/a-communication-efficient-distributed-data-structure-for-top-k-and-k-select-queries-1709.072592017-09-22 https://scifaro.com/en/abs/predicting-positive-and-negative-links-with-noisy-queries-theory-practice-1709.073082020-12-08 https://scifaro.com/en/abs/non-depth-first-search-against-independent-distributions-on-an-and-or-tree-1709.073582018-10-19 https://scifaro.com/en/abs/stochastic-input-models-in-online-computing-1709.076012017-09-25 https://scifaro.com/en/abs/planar-graph-perfect-matching-is-in-nc-1709.078222018-04-24 https://scifaro.com/en/abs/nc-algorithms-for-weighted-planar-perfect-matching-and-related-problems-1709.078692018-04-20 https://scifaro.com/en/abs/combinatorial-optimization-of-ac-optimal-power-flow-with-discrete-demands-in-radial-networks-1709.084312020-07-16 https://scifaro.com/en/abs/a-linear-algorithm-for-finding-the-sink-of-unique-sink-orientations-on-grids-1709.084362017-09-26 https://scifaro.com/en/abs/crowdsourced-correlation-clustering-with-relative-distance-comparisons-1709.084592017-09-26 https://scifaro.com/en/abs/a-polynomial-time-approximation-algorithm-for-all-terminal-network-reliability-1709.085612021-06-16 https://scifaro.com/en/abs/evolutionary-acyclic-graph-partitioning-1709.085632017-09-26 https://scifaro.com/en/abs/polysemy-detection-in-distributed-representation-of-word-sense-1709.088582017-09-27 https://scifaro.com/en/abs/in-place-initializable-arrays-1709.089002022-03-31 https://scifaro.com/en/abs/computing-tree-decompositions-with-flowcutter-pace-2017-submission-1709.089492017-09-27 https://scifaro.com/en/abs/fillable-arrays-with-constant-time-operations-and-a-single-bit-of-redundancy-1709.095742017-09-28 https://scifaro.com/en/abs/on-the-tractability-of-optimization-problems-on-h-graphs-1709.097372020-02-24 https://scifaro.com/en/abs/a-nearly-linear-time-algorithm-for-submodular-maximization-with-a-knapsack-constraint-1709.097672018-11-20 https://scifaro.com/en/abs/fully-leafed-induced-subtrees-1709.098082018-07-10 https://scifaro.com/en/abs/active-information-acquisition-for-linear-optimization-1709.100612021-09-07 https://scifaro.com/en/abs/energy-constrained-depth-first-search-1709.101462018-02-20 https://scifaro.com/en/abs/ranked-enumeration-of-minimal-triangulations-1709.102542018-10-09 https://scifaro.com/en/abs/barrier-coverage-with-non-uniform-lengths-to-minimize-aggregate-movements-1709.102852017-10-02 https://scifaro.com/en/abs/fast-computation-of-graph-edit-distance-1709.103052017-10-02 https://scifaro.com/en/abs/non-approximability-and-polylogarithmic-approximations-of-the-single-sink-unsplittable-and-confluent-dynamic-flow-problems-1709.103072017-10-02 https://scifaro.com/en/abs/runtime-distributions-and-criteria-for-restarts-1709.104052019-04-29 https://scifaro.com/en/abs/online-load-balancing-for-related-machines-1709.104552017-10-02 https://scifaro.com/en/abs/on-the-fly-array-initialization-in-less-space-1709.104772017-10-02 https://scifaro.com/en/abs/parameterized-algorithms-for-conflict-free-colorings-of-graphs-1710.002232017-10-03 https://scifaro.com/en/abs/bayesian-estimation-from-few-samples-community-detection-and-related-problems-1710.002642017-10-04 https://scifaro.com/en/abs/a-lottery-model-for-center-type-problems-with-outliers-1710.002872017-10-03 https://scifaro.com/en/abs/orthogonal-vectors-indexing-1710.005862017-10-04 https://scifaro.com/en/abs/parameterized-approximation-schemes-for-steiner-trees-with-small-number-of-steiner-vertices-1710.006682026-02-19 https://scifaro.com/en/abs/exploring-graphs-with-time-constraints-by-unreliable-collections-of-mobile-robots-1710.007752017-10-03 https://scifaro.com/en/abs/finding-the-optimal-nets-for-self-folding-kirigami-1710.008522018-07-10 https://scifaro.com/en/abs/online-and-distributed-robust-regressions-under-adversarial-data-corruption-1710.009042017-10-04 https://scifaro.com/en/abs/ordered-dags-hypercubesort-1710.009442017-10-04 https://scifaro.com/en/abs/optimal-matroid-partitioning-problems-1710.009502017-10-04 https://scifaro.com/en/abs/computing-top-k-closeness-centrality-in-fully-dynamic-graphs-1710.011432017-10-04 https://scifaro.com/en/abs/scaling-up-group-closeness-maximization-1710.011442019-05-16 https://scifaro.com/en/abs/massively-parallel-algorithms-and-hardness-for-single-linkage-clustering-under-ell-p-distances-1710.014312018-03-28 https://scifaro.com/en/abs/an-improved-algorithm-for-computing-all-the-best-swap-edges-of-a-tree-spanner-1710.015162017-10-05 https://scifaro.com/en/abs/celestial-walk-a-terminating-oblivious-walk-for-convex-subdivisions-1710.016202017-10-05 https://scifaro.com/en/abs/dismantling-divsufsort-1710.018962017-10-06 https://scifaro.com/en/abs/efficient-compression-and-indexing-of-trajectories-1710.019522017-10-06 https://scifaro.com/en/abs/max-flow-vitality-in-general-and-st-planar-graphs-1710.019652018-12-21 https://scifaro.com/en/abs/memetic-multilevel-hypergraph-partitioning-1710.019682018-02-06 https://scifaro.com/en/abs/fast-sketch-based-recovery-of-correlation-outliers-1710.019852017-10-06 https://scifaro.com/en/abs/skyline-computation-with-noisy-comparisons-1710.020582020-04-02 https://scifaro.com/en/abs/tiered-sampling-an-efficient-method-for-approximate-counting-sparse-motifs-in-massive-graph-streams-1710.021082017-10-06 https://scifaro.com/en/abs/covering-vectors-by-spaces-regular-matroids-1710.023002017-10-09 https://scifaro.com/en/abs/the-paulsen-problem-continuous-operator-scaling-and-smoothed-analysis-1710.025872017-11-10 https://scifaro.com/en/abs/implicit-decomposition-for-write-efficient-connectivity-algorithms-1710.026372017-10-10 https://scifaro.com/en/abs/fast-flow-volume-estimation-1710.031552017-10-17 https://scifaro.com/en/abs/optimal-vertex-fault-tolerant-spanners-for-fixed-stretch-1710.031642017-10-10 https://scifaro.com/en/abs/balanced-power-diagrams-for-redistricting-1710.033582018-01-09 https://scifaro.com/en/abs/efficient-dynamic-dictionary-matching-with-dawgs-and-ac-automata-1710.033952019-02-22 https://scifaro.com/en/abs/using-modular-decomposition-technique-to-solve-the-maximum-clique-problem-1710.040402017-10-12 https://scifaro.com/en/abs/finding-euler-tours-in-one-pass-in-the-w-streaming-model-with-o-n-log-n-ram-1710.040912017-10-12 https://scifaro.com/en/abs/on-the-power-of-tree-depth-for-fully-polynomial-fpt-algorithms-1710.043762017-10-24 https://scifaro.com/en/abs/structured-robust-submodular-maximization-offline-and-online-algorithms-1710.047402020-10-15 https://scifaro.com/en/abs/the-power-of-sum-of-squares-for-detecting-hidden-structures-1710.050172017-10-31 https://scifaro.com/en/abs/a-general-framework-for-robust-interactive-learning-1710.054222017-10-17 https://scifaro.com/en/abs/balanced-judicious-partition-is-fixed-parameter-tractable-1710.054912017-10-17 https://scifaro.com/en/abs/convergence-rate-of-riemannian-hamiltonian-monte-carlo-and-faster-polytope-volume-computation-1710.062612017-10-18 https://scifaro.com/en/abs/a-generative-model-for-sparse-evolving-digraphs-1710.062982018-07-06 https://scifaro.com/en/abs/understanding-the-correlation-gap-for-matchings-1710.063392017-10-18 https://scifaro.com/en/abs/chain-reduction-for-binary-and-zero-suppressed-decision-diagrams-1710.065002017-10-19 https://scifaro.com/en/abs/discovering-patterns-of-interest-in-ip-traffic-using-cliques-in-bipartite-link-streams-1710.071072017-12-19 https://scifaro.com/en/abs/on-vertex-coloring-without-monochromatic-triangles-1710.071322017-10-20 https://scifaro.com/en/abs/reaching-a-target-in-the-plane-with-no-information-1710.071452017-10-20 https://scifaro.com/en/abs/a-unified-polynomial-time-algorithm-for-feedback-vertex-set-on-graphs-of-bounded-mim-width-1710.071482018-01-12 https://scifaro.com/en/abs/probabilistic-analysis-of-the-dual-pivot-quicksort-count-1710.075052017-10-23 https://scifaro.com/en/abs/a-unified-ptas-for-prize-collecting-tsp-and-steiner-tree-problem-in-doubling-metrics-1710.077742018-06-22 https://scifaro.com/en/abs/twin-sort-technique-1710.079922017-10-24 https://scifaro.com/en/abs/characterizing-and-enumerating-walsh-hadamard-transform-algorithms-1710.080292017-10-30 https://scifaro.com/en/abs/high-quality-shared-memory-graph-partitioning-1710.082312018-10-16 https://scifaro.com/en/abs/communication-efficient-checking-of-big-data-operations-1710.082552018-02-23 https://scifaro.com/en/abs/faster-carry-bit-computation-for-adder-circuits-with-prescribed-arrival-times-1710.082672019-10-28 https://scifaro.com/en/abs/deterministic-rendezvous-at-a-node-of-agents-with-arbitrary-velocities-1710.082912019-08-20 https://scifaro.com/en/abs/hyperminhash-minhash-in-loglog-space-1710.084362019-07-16 https://scifaro.com/en/abs/the-unbounded-integrality-gap-of-a-semidefinite-relaxation-of-the-traveling-salesman-problem-1710.084552017-10-25 https://scifaro.com/en/abs/an-fpt-algorithm-beating-2-approximation-for-k-cut-1710.084882017-10-25 https://scifaro.com/en/abs/on-the-complexity-of-sampling-nodes-uniformly-from-a-graph-1710.088152017-10-25 https://scifaro.com/en/abs/exact-mean-computation-in-dynamic-time-warping-spaces-1710.089372018-06-01 https://scifaro.com/en/abs/counting-and-enumerating-independent-sets-with-applications-to-knapsack-problems-1710.089532017-10-26 https://scifaro.com/en/abs/solving-packing-and-covering-lps-in-tilde-o-frac-1-epsilon-2-distributed-iterations-with-a-single-algorithm-and-simpler-analysis-1710.090022017-10-26 https://scifaro.com/en/abs/distributed-graph-clustering-using-modularity-and-map-equation-1710.096052020-04-28 https://scifaro.com/en/abs/edge-based-wedge-sampling-to-estimate-triangle-counts-in-very-large-graphs-1710.099612017-10-30 https://scifaro.com/en/abs/variance-reduced-value-iteration-and-faster-algorithms-for-solving-markov-decision-processes-1710.099882020-12-24 https://scifaro.com/en/abs/a-note-on-faithful-coupling-of-markov-chains-1710.100262017-10-30 https://scifaro.com/en/abs/external-memory-pipelining-made-easy-with-tpie-1710.100912017-10-30 https://scifaro.com/en/abs/lyndon-array-construction-during-burrows-wheeler-inversion-1710.101052019-03-12 https://scifaro.com/en/abs/almost-optimal-stochastic-weighted-matching-with-few-queries-1710.105922018-05-24 https://scifaro.com/en/abs/improved-bounds-for-testing-forbidden-order-patterns-1710.106602017-10-31 https://scifaro.com/en/abs/an-algorithmic-approach-to-handle-circular-trading-in-commercial-taxing-system-1710.108362017-11-07 https://scifaro.com/en/abs/an-fptas-of-minimizing-total-weighted-completion-time-on-single-machine-with-position-constraint-1710.109042017-10-31 https://scifaro.com/en/abs/at-the-roots-of-dictionary-compression-string-attractors-1710.109642020-12-17 https://scifaro.com/en/abs/finding-connected-secluded-subgraphs-1710.109792017-10-31 https://scifaro.com/en/abs/prophet-secretary-for-combinatorial-auctions-and-matroids-1710.112132018-03-20 https://scifaro.com/en/abs/reachability-preservers-new-extremal-bounds-and-approximation-algorithms-1710.112502023-11-23 https://scifaro.com/en/abs/approximation-algorithms-for-ell-0-low-rank-approximation-1710.112532018-10-02 https://scifaro.com/en/abs/the-exact-solution-to-rank-1-l1-norm-tucker2-decomposition-1710.113062018-04-04 https://scifaro.com/en/abs/improved-bounds-for-online-dominating-sets-of-trees-1710.114142017-11-01 https://scifaro.com/en/abs/manipulation-strategies-for-the-rank-maximal-matching-problem-1710.114622018-08-30 https://scifaro.com/en/abs/designing-rna-secondary-structures-is-hard-1710.115132018-03-28 https://scifaro.com/en/abs/on-learning-mixtures-of-well-separated-gaussians-1710.115922017-11-01 https://scifaro.com/en/abs/replace-or-retrieve-keywords-in-documents-at-scale-1711.000462017-11-10 https://scifaro.com/en/abs/approximating-the-2-machine-flow-shop-problem-with-exact-delays-taking-two-values-1711.000812022-03-22 https://scifaro.com/en/abs/scheduling-monotone-moldable-jobs-in-linear-time-1711.001032018-01-09 https://scifaro.com/en/abs/fast-dynamic-arrays-1711.002752017-11-02 https://scifaro.com/en/abs/improved-approximation-schemes-for-the-restricted-shortest-path-problem-1711.002842019-11-05 https://scifaro.com/en/abs/the-price-of-information-in-combinatorial-optimization-1711.004052017-11-02 https://scifaro.com/en/abs/efficient-widetilde-o-n-epsilon-spectral-sketches-for-the-laplacian-and-its-pseudoinverse-1711.005712018-01-09 https://scifaro.com/en/abs/optimal-parametric-search-for-path-and-tree-partitioning-1711.005992017-11-03 https://scifaro.com/en/abs/an-optimal-choice-dictionary-1711.008082017-11-03 https://scifaro.com/en/abs/minor-free-graphs-have-light-spanners-1711.008212017-11-03 https://scifaro.com/en/abs/the-complexity-of-finding-small-separators-in-temporal-graphs-1711.009632018-07-26 https://scifaro.com/en/abs/k-server-via-multiscale-entropic-regularization-1711.010852017-11-06 https://scifaro.com/en/abs/the-bane-of-low-dimensionality-clustering-1711.011712017-11-06 https://scifaro.com/en/abs/a-tight-approximation-for-fully-dynamic-bin-packing-without-bundling-1711.012312018-05-25 https://scifaro.com/en/abs/distributed-graph-clustering-and-sparsification-1711.012622017-11-06 https://scifaro.com/en/abs/constant-approximation-for-k-median-and-k-means-with-outliers-via-iterative-rounding-1711.013232018-04-09 https://scifaro.com/en/abs/two-error-bounds-of-imperfect-binary-search-1711.013342017-11-07 https://scifaro.com/en/abs/on-constant-multi-commodity-flow-cut-gaps-for-directed-minor-free-graphs-1711.013702017-11-07 https://scifaro.com/en/abs/practical-data-dependent-metric-compression-with-provable-guarantees-1711.015202017-11-07 https://scifaro.com/en/abs/is-input-sparsity-time-possible-for-kernel-low-rank-approximation-1711.015962017-11-07 https://scifaro.com/en/abs/bloom-filters-adaptivity-and-the-dictionary-problem-1711.016162018-08-28 https://scifaro.com/en/abs/fooling-views-a-new-lower-bound-technique-for-distributed-computations-under-congestion-1711.016232017-12-14 https://scifaro.com/en/abs/routing-symmetric-demands-in-directed-minor-free-graphs-with-constant-congestion-1711.016922017-11-07 https://scifaro.com/en/abs/nearly-work-efficient-parallel-algorithm-for-digraph-reachability-1711.017002017-11-07 https://scifaro.com/en/abs/fusible-hsts-and-the-randomized-k-server-conjecture-1711.017892021-07-30 https://scifaro.com/en/abs/prophet-secretary-surpassing-the-1-1-e-barrier-1711.018342017-11-07 https://scifaro.com/en/abs/lisco-a-continuous-approach-in-lidar-point-cloud-clustering-1711.018532017-11-07 https://scifaro.com/en/abs/constant-factor-approximation-for-ordered-k-median-1711.019722018-03-01 https://scifaro.com/en/abs/almost-polynomial-hardness-of-node-disjoint-paths-in-grids-1711.019802017-11-07 https://scifaro.com/en/abs/integer-programming-in-parameterized-complexity-three-miniatures-1711.020322018-10-26 https://scifaro.com/en/abs/optimum-search-schemes-for-approximate-string-matching-using-bidirectional-fm-index-1711.020352018-03-06 https://scifaro.com/en/abs/maximum-entropy-distributions-bit-complexity-and-stability-1711.020362019-06-04 https://scifaro.com/en/abs/on-structural-parameterizations-of-the-edge-disjoint-paths-problem-1711.020762017-11-07 https://scifaro.com/en/abs/fully-dynamic-bin-packing-with-limited-repacking-1711.020782018-05-18 https://scifaro.com/en/abs/small-resolution-proofs-for-qbf-using-dependency-treewidth-1711.021202017-11-08 https://scifaro.com/en/abs/on-derandomizing-local-distributed-algorithms-1711.021942019-09-19 https://scifaro.com/en/abs/streaming-robust-submodular-maximization-a-partitioned-thresholding-approach-1711.025982017-11-27 https://scifaro.com/en/abs/convex-optimization-with-unbounded-nonconvex-oracles-using-simulated-annealing-1711.026212018-06-19 https://scifaro.com/en/abs/algorithms-to-approximate-column-sparse-packing-problems-1711.027242019-08-07 https://scifaro.com/en/abs/a-compressed-dynamic-self-index-for-highly-repetitive-text-collections-1711.028552018-04-25 https://scifaro.com/en/abs/constructive-discrepancy-minimization-with-hereditary-l2-guarantees-1711.028602018-12-14 https://scifaro.com/en/abs/run-compressed-rank-select-for-large-alphabets-1711.029102018-02-27 https://scifaro.com/en/abs/coresets-meet-edcs-algorithms-for-matching-and-vertex-cover-on-massive-graphs-1711.030762018-12-31 https://scifaro.com/en/abs/computing-exact-minimum-cuts-without-knowing-the-graph-1711.031652019-08-07 https://scifaro.com/en/abs/r-qps-serena-and-r-qps-serenade-two-novel-augmenting-path-based-algorithms-for-computing-approximate-maximum-weight-matching-1711.031782017-11-10 https://scifaro.com/en/abs/a-grammar-compression-algorithm-based-on-induced-suffix-sorting-1711.032052017-11-10 https://scifaro.com/en/abs/distances-in-and-layering-of-a-dag-1711.032562017-11-13 https://scifaro.com/en/abs/toward-perfect-reads-self-correction-of-short-reads-via-mapping-on-de-bruijn-graphs-1711.033362020-04-08 https://scifaro.com/en/abs/fast-distributed-approximation-for-tap-and-2-edge-connectivity-1711.033592019-05-13 https://scifaro.com/en/abs/counting-hypergraph-colorings-in-the-local-lemma-regime-1711.033962019-06-03 https://scifaro.com/en/abs/clustering-with-local-restrictions-1711.038852017-11-13 https://scifaro.com/en/abs/hamming-distance-completeness-and-sparse-matrix-multiplication-1711.038872018-05-07 https://scifaro.com/en/abs/on-the-hardness-of-losing-weight-1711.038942017-11-13 https://scifaro.com/en/abs/an-efficient-algorithm-computing-composition-factors-of-t-v-otimes-n-1711.043262017-11-15 https://scifaro.com/en/abs/dynamic-algorithms-for-graph-coloring-1711.043552017-11-15 https://scifaro.com/en/abs/longest-alignment-with-edits-in-data-streams-1711.043672017-11-15 https://scifaro.com/en/abs/tight-cell-probe-bounds-for-succinct-boolean-matrix-vector-multiplication-1711.044672017-11-15 https://scifaro.com/en/abs/linear-time-algorithms-for-maximum-weight-induced-matchings-and-minimum-chain-covers-in-convex-bipartite-graphs-1711.044962023-05-17 https://scifaro.com/en/abs/constraint-solving-via-fractional-edge-covers-1711.045062017-11-15 https://scifaro.com/en/abs/smaller-parameters-for-vertex-cover-kernelization-1711.046042017-11-15 https://scifaro.com/en/abs/heavy-hitters-and-the-structure-of-local-privacy-1711.047402017-11-15 https://scifaro.com/en/abs/estimating-graph-parameters-from-random-order-streams-1711.048812017-11-15 https://scifaro.com/en/abs/robust-online-speed-scaling-with-deadline-uncertainty-1711.049782017-11-15 https://scifaro.com/en/abs/similarity-aware-spectral-sparsification-by-edge-filtering-1711.051352018-04-10 https://scifaro.com/en/abs/deterministic-distributed-edge-coloring-with-fewer-colors-1711.054692017-11-16 https://scifaro.com/en/abs/a-friendly-smoothed-analysis-of-the-simplex-method-1711.056672019-06-12 https://scifaro.com/en/abs/online-allocation-with-traffic-spikes-mixing-adversarial-and-stochastic-models-1711.057642017-11-17 https://scifaro.com/en/abs/exact-and-heuristic-algorithms-for-cograph-editing-1711.058392018-01-11 https://scifaro.com/en/abs/optimizing-relinearization-in-circuits-for-homomorphic-encryption-1711.063192017-11-20 https://scifaro.com/en/abs/conditional-markov-chain-search-for-the-simple-plant-location-problem-improves-upper-bounds-on-twelve-k-orkel-ghosh-instances-1711.063472017-11-20 https://scifaro.com/en/abs/an-o-1-84-k-parameterized-algorithm-for-the-multiterminal-cut-problem-1711.063972017-11-20 https://scifaro.com/en/abs/multi-objective-maximization-of-monotone-submodular-functions-with-cardinality-constraint-1711.064282021-05-04 https://scifaro.com/en/abs/an-almost-linear-time-algorithm-for-uniform-random-spanning-tree-generation-1711.064552017-11-20 https://scifaro.com/en/abs/graph-clustering-using-effective-resistance-1711.065302017-11-20 https://scifaro.com/en/abs/dynamic-matching-reducing-integral-algorithms-to-approximately-maximal-fractional-algorithms-1711.066252018-03-01 https://scifaro.com/en/abs/fully-dynamic-almost-maximal-matching-breaking-the-polynomial-barrier-for-worst-case-time-bounds-1711.068832018-03-16 https://scifaro.com/en/abs/superlinear-lower-bounds-for-distributed-subgraph-detection-1711.069202017-11-21 https://scifaro.com/en/abs/list-decodable-robust-mean-estimation-and-learning-mixtures-of-spherical-gaussians-1711.072112017-11-21 https://scifaro.com/en/abs/a-separation-between-run-length-slps-and-lz77-1711.072702017-11-21 https://scifaro.com/en/abs/majority-model-on-random-regular-graphs-1711.074232017-11-21 https://scifaro.com/en/abs/mixture-models-robustness-and-sum-of-squares-proofs-1711.074542017-11-21 https://scifaro.com/en/abs/on-estimating-the-alphabet-size-of-a-discrete-random-source-1711.075452017-11-22 https://scifaro.com/en/abs/edge-estimation-with-independent-set-oracles-1711.075672020-03-13 https://scifaro.com/en/abs/approximating-geometric-knapsack-via-l-packings-1711.077102017-11-22 https://scifaro.com/en/abs/the-hidden-binary-search-tree-a-balanced-rotation-free-search-tree-in-the-avl-ram-model-1711.077462018-04-04 https://scifaro.com/en/abs/approximation-algorithms-for-rectangle-packing-problems-phd-thesis-1711.078512017-11-22 https://scifaro.com/en/abs/revisiting-connected-vertex-cover-fpt-algorithms-and-lossy-kernels-1711.078722018-10-08 https://scifaro.com/en/abs/fine-grained-i-o-complexity-via-reductions-new-lower-bounds-faster-algorithms-and-a-time-hierarchy-1711.079602017-12-06 https://scifaro.com/en/abs/the-set-cover-conjecture-and-subgraph-isomorphism-with-a-tree-pattern-1711.080412019-01-18 https://scifaro.com/en/abs/compressed-indexing-with-signature-grammars-1711.082172018-04-12 https://scifaro.com/en/abs/a-generic-framework-for-engineering-graph-canonization-algorithms-1711.082892017-11-23 https://scifaro.com/en/abs/identifying-user-habits-through-data-mining-on-call-data-records-1711.083982017-11-23 https://scifaro.com/en/abs/relief-based-feature-selection-introduction-and-review-1711.084212018-04-04 https://scifaro.com/en/abs/on-computing-min-degree-elimination-orderings-1711.084462017-11-23 https://scifaro.com/en/abs/lightweight-fingerprints-for-fast-approximate-keyword-matching-using-bitwise-operations-1711.084752017-11-27 https://scifaro.com/en/abs/deterministic-parallel-algorithms-for-bilinear-objective-functions-1711.084942023-10-13 https://scifaro.com/en/abs/interpolating-between-k-median-and-k-center-approximation-algorithms-for-ordered-k-median-1711.087152017-11-27 https://scifaro.com/en/abs/clustering-semi-random-mixtures-of-gaussians-1711.088412017-11-27 https://scifaro.com/en/abs/lower-bounds-for-symbolic-computation-on-graphs-strongly-connected-components-liveness-safety-and-diameter-1711.091482017-11-28 https://scifaro.com/en/abs/ship-a-scalable-high-performance-ipv6-lookup-algorithm-that-exploits-prefix-characteristics-1711.091552017-11-28 https://scifaro.com/en/abs/a-near-optimal-algorithm-for-edge-connectivity-based-hierarchical-graph-decomposition-1711.091892017-11-29 https://scifaro.com/en/abs/optimal-gossip-algorithms-for-exact-and-approximate-quantile-computations-1711.092582017-11-28 https://scifaro.com/en/abs/online-facility-location-on-semi-random-streams-1711.093842017-11-28 https://scifaro.com/en/abs/a-multi-objective-reliable-location-inventory-capacitated-disruption-facility-problem-with-penalty-cost-solve-with-efficient-meta-historic-algorithms-1711.094002017-11-28 https://scifaro.com/en/abs/approximating-the-permanent-of-a-random-matrix-with-vanishing-mean-1711.094572018-10-11 https://scifaro.com/en/abs/frameworks-for-designing-in-place-graph-algorithms-1711.098592017-11-28 https://scifaro.com/en/abs/saving-space-by-dynamic-algebraization-based-on-tree-decomposition-minimum-dominating-set-1711.100882017-11-29 https://scifaro.com/en/abs/on-structural-parameterizations-of-firefighting-1711.102272017-11-29 https://scifaro.com/en/abs/faster-range-minimum-queries-1711.103852017-11-29 https://scifaro.com/en/abs/online-knapsack-problem-under-expected-capacity-constraint-1711.106522017-11-30 https://scifaro.com/en/abs/cost-effective-seed-selection-in-online-social-networks-1711.106652017-12-21 https://scifaro.com/en/abs/on-the-approximability-and-hardness-of-the-minimum-connected-dominating-set-with-routing-cost-constraint-1711.106802018-02-20 https://scifaro.com/en/abs/local-access-to-huge-random-objects-through-partial-sampling-1711.106922020-12-08 https://scifaro.com/en/abs/a-cooperative-proof-of-work-scheme-for-distributed-consensus-protocols-1711.111502017-12-01 https://scifaro.com/en/abs/submodular-maximization-through-the-lens-of-linear-programming-1711.113162017-12-01 https://scifaro.com/en/abs/testing-conditional-independence-of-discrete-distributions-1711.115602018-07-03 https://scifaro.com/en/abs/outlier-robust-moment-estimation-via-sum-of-squares-1711.115812017-12-27 https://scifaro.com/en/abs/on-the-hardness-of-deriving-the-arithmetic-mean-component-competitive-ratio-1712.002142018-04-12 https://scifaro.com/en/abs/adaptive-group-testing-algorithms-to-estimate-the-number-of-defectives-1712.006152023-12-22 https://scifaro.com/en/abs/allsat-compressed-with-wildcards-an-invitation-for-c-programmers-1712.007512019-03-15 https://scifaro.com/en/abs/coarse-grained-parallel-selection-1712.008702020-11-09 https://scifaro.com/en/abs/boolean-function-analysis-meets-stochastic-optimization-an-approximation-scheme-for-stochastic-knapsack-1712.009182017-12-05 https://scifaro.com/en/abs/distributed-algorithms-made-secure-a-graph-theoretic-approach-1712.011392019-01-15 https://scifaro.com/en/abs/approximating-the-spectrum-of-a-graph-1712.017252017-12-06 https://scifaro.com/en/abs/optimal-fast-johnson-lindenstrauss-embeddings-for-large-data-sets-1712.017742020-04-30 https://scifaro.com/en/abs/pay-for-a-sliding-bloom-filter-and-get-counting-distinct-elements-and-entropy-for-free-1712.017792017-12-06 https://scifaro.com/en/abs/arithmetic-progression-hypergraphs-examining-the-second-moment-method-1712.017812017-12-06 https://scifaro.com/en/abs/deterministic-heavy-hitters-with-sublinear-query-time-1712.019712018-06-13 https://scifaro.com/en/abs/oblivious-routing-via-random-walks-1712.020762017-12-07 https://scifaro.com/en/abs/a-note-on-searching-sorted-unbalanced-three-dimensional-arrays-1712.023712017-12-08 https://scifaro.com/en/abs/core-discovery-in-hidden-graphs-1712.028272017-12-11 https://scifaro.com/en/abs/the-complexity-of-maximum-k-order-bounded-component-set-problem-1712.028702018-03-29 https://scifaro.com/en/abs/periortree-an-extention-of-r-tree-for-periodic-boundary-conditions-1712.029772017-12-11 https://scifaro.com/en/abs/graph-based-time-space-trade-offs-for-approximate-near-neighbors-1712.031582019-10-04 https://scifaro.com/en/abs/improved-space-efficient-linear-time-algorithms-for-some-classical-graph-problems-1712.033492017-12-12 https://scifaro.com/en/abs/risk-averse-single-machine-scheduling-complexity-and-approximation-1712.033712017-12-12 https://scifaro.com/en/abs/simulation-of-quantum-circuits-via-stabilizer-frames-1712.035542017-12-12 https://scifaro.com/en/abs/mining-non-redundant-local-process-models-from-sequence-databases-1712.041592018-09-24 https://scifaro.com/en/abs/dynamic-discrete-tomography-1712.042172018-11-08 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-string-kernel-based-sequence-classification-1712.042642017-12-13 https://scifaro.com/en/abs/ellipsoid-method-for-linear-programming-made-simple-1712.046372017-12-14 https://scifaro.com/en/abs/optimal-construction-of-compressed-indexes-for-highly-repetitive-texts-1712.048862020-12-09 https://scifaro.com/en/abs/b-slack-trees-highly-space-efficient-b-trees-1712.050202017-12-18 https://scifaro.com/en/abs/approximation-algorithms-for-replenishment-problems-with-fixed-turnover-times-1712.052182017-12-15 https://scifaro.com/en/abs/online-submodular-welfare-maximization-greedy-beats-1-2-in-random-order-1712.054502017-12-18 https://scifaro.com/en/abs/new-and-improved-algorithms-for-unordered-tree-inclusion-1712.055172021-06-16 https://scifaro.com/en/abs/optimal-top-dag-compression-1712.058222017-12-19 https://scifaro.com/en/abs/unifying-sparsest-cut-cluster-deletion-and-modularity-clustering-objectives-with-correlation-clustering-1712.058252018-07-17 https://scifaro.com/en/abs/bubble-flip-a-new-generation-algorithm-for-prefix-normal-words-1712.058762024-04-16 https://scifaro.com/en/abs/the-power-of-vertex-sparsifiers-in-dynamic-graph-algorithms-1712.064732017-12-19 https://scifaro.com/en/abs/solving-satisfiability-using-inclusion-exclusion-1712.065872017-12-20 https://scifaro.com/en/abs/an-experimental-evaluation-of-a-bounded-expansion-algorithmic-pipeline-1712.066902018-04-24 https://scifaro.com/en/abs/fast-algorithms-for-delta-separated-sparsity-projection-1712.067062017-12-20 https://scifaro.com/en/abs/a-tight-lower-bound-for-an-online-hypercube-packing-problem-and-bounds-for-prices-of-anarchy-of-a-related-game-1712.067632023-04-11 https://scifaro.com/en/abs/approximate-correlation-clustering-using-same-cluster-queries-1712.068652017-12-20 https://scifaro.com/en/abs/enumerating-maximal-cliques-in-link-streams-with-durations-1712.069702018-02-14 https://scifaro.com/en/abs/a-faster-drop-in-implementation-for-leaf-wise-exact-greedy-induction-of-decision-tree-using-pre-sorted-deque-1712.069892017-12-22 https://scifaro.com/en/abs/approximation-algorithms-for-stochastic-and-risk-averse-optimization-1712.069962017-12-20 https://scifaro.com/en/abs/the-cavity-approach-for-steiner-trees-packing-problems-1712.070412019-01-04 https://scifaro.com/en/abs/a-collection-of-lower-bounds-for-online-matching-on-the-line-1712.070992017-12-20 https://scifaro.com/en/abs/text-indexing-and-searching-in-sublinear-time-1712.074312019-07-16 https://scifaro.com/en/abs/on-counting-perfect-matchings-in-general-graphs-1712.075042017-12-21 https://scifaro.com/en/abs/a-fast-algorithm-for-separated-sparsity-via-perturbed-lagrangians-1712.081302017-12-22 https://scifaro.com/en/abs/tight-hardness-for-shortest-cycles-and-paths-in-sparse-graphs-1712.081472020-05-07 https://scifaro.com/en/abs/connected-vertex-cover-for-sp-1-p-5-free-graphs-1712.083622018-07-06 https://scifaro.com/en/abs/encoding-watermark-numbers-as-reducible-permutation-graphs-using-self-inverting-permutations-1712.084822017-12-25 https://scifaro.com/en/abs/lattice-based-locality-sensitive-hashing-is-optimal-1712.085582017-12-25 https://scifaro.com/en/abs/longest-common-substring-with-approximately-k-mismatches-1712.085732018-08-21 https://scifaro.com/en/abs/cartesian-trees-and-lyndon-trees-1712.087492017-12-27 https://scifaro.com/en/abs/lectures-on-randomized-numerical-linear-algebra-1712.088802017-12-27 https://scifaro.com/en/abs/stochastic-multi-armed-bandits-in-constant-space-1712.090072018-05-17 https://scifaro.com/en/abs/near-linear-time-algorithm-for-approximate-minimum-degree-spanning-trees-1712.091662020-06-02 https://scifaro.com/en/abs/space-efficient-algorithms-for-longest-increasing-subsequence-1712.092302017-12-27 https://scifaro.com/en/abs/sketching-for-kronecker-product-regression-and-p-splines-1712.094732017-12-29 https://scifaro.com/en/abs/analysis-of-concurrent-lock-free-hash-tries-with-constant-time-operations-1712.096362017-12-29 https://scifaro.com/en/abs/a-fast-and-accurate-failure-frequency-approximation-for-k-terminal-reliability-systems-1712.096662017-12-29 https://scifaro.com/en/abs/enumerating-consistent-subgraphs-of-directed-acyclic-graphs-an-insight-into-biomedical-ontologies-1712.096792017-12-29 https://scifaro.com/en/abs/tight-bounds-for-maximal-identifiability-of-failure-nodes-in-boolean-network-tomography-1712.098562019-10-25 https://scifaro.com/en/abs/optimal-lower-bounds-for-sketching-graph-cuts-1712.102612018-01-01 https://scifaro.com/en/abs/improved-online-algorithm-for-weighted-flow-time-1712.102732018-08-17 https://scifaro.com/en/abs/efficiently-enumerating-all-maximal-cliques-with-bit-parallelism-1801.002022018-01-03 https://scifaro.com/en/abs/approximating-node-weighted-k-mst-on-planar-graphs-1801.003132018-05-09 https://scifaro.com/en/abs/pull-and-push-pull-in-random-evolving-graphs-1801.003162018-02-06 https://scifaro.com/en/abs/broadcasting-spanning-forests-on-a-multiple-access-channel-1801.003652018-01-03 https://scifaro.com/en/abs/sorting-real-numbers-in-o-n-sqrt-log-n-time-and-linear-space-1801.007762018-12-04 https://scifaro.com/en/abs/effective-algorithms-for-homogeneous-utility-functions-1801.007772018-01-04 https://scifaro.com/en/abs/slowing-down-top-trees-for-better-worst-case-bounds-1801.010592018-01-04 https://scifaro.com/en/abs/string-periods-in-the-order-preserving-model-1801.014042018-01-08 https://scifaro.com/en/abs/heuristic-algorithms-for-the-min-max-edge-2-coloring-problem-1801.022392018-10-09 https://scifaro.com/en/abs/improved-algorithms-for-the-shortest-vector-problem-and-the-closest-vector-problem-in-the-infinity-norm-1801.023582018-05-16 https://scifaro.com/en/abs/better-and-simpler-error-analysis-of-the-sinkhorn-knopp-algorithm-for-matrix-scaling-1801.027902018-02-19 https://scifaro.com/en/abs/tight-bounds-on-the-round-complexity-of-the-distributed-maximum-coverage-problem-1801.027932018-08-24 https://scifaro.com/en/abs/adaptive-boolean-monotonicity-testing-in-total-influence-time-1801.028162018-01-10 https://scifaro.com/en/abs/risk-averse-matchings-over-uncertain-graph-databases-1801.031902018-01-11 https://scifaro.com/en/abs/online-maximum-matching-with-recourse-1801.034622021-01-06 https://scifaro.com/en/abs/parameterized-approximate-defective-coloring-1801.038792018-01-12 https://scifaro.com/en/abs/tight-bounds-for-ell-p-oblivious-subspace-embeddings-1801.044142018-04-10 https://scifaro.com/en/abs/longest-common-prefixes-with-k-errors-and-applications-1801.044252018-01-16 https://scifaro.com/en/abs/strategies-for-stable-merge-sorting-1801.046412019-02-12 https://scifaro.com/en/abs/searching-for-maximum-out-degree-vertices-in-tournaments-1801.047022018-01-16 https://scifaro.com/en/abs/approximating-the-incremental-knapsack-problem-1801.048012018-01-16 https://scifaro.com/en/abs/vehicle-routing-with-subtours-1801.049912018-01-17 https://scifaro.com/en/abs/toward-metric-indexes-for-incremental-insertion-and-querying-1801.050552018-01-17 https://scifaro.com/en/abs/longest-processing-time-rule-for-identical-parallel-machines-revisited-1801.054892018-01-18 https://scifaro.com/en/abs/efficient-computation-of-the-8-point-dct-via-summation-by-parts-1801.058322018-03-30 https://scifaro.com/en/abs/degree-constrained-2-partitions-of-graphs-1801.062162018-01-22 https://scifaro.com/en/abs/nae-sat-based-probabilistic-membership-filters-1801.062322018-01-22 https://scifaro.com/en/abs/minor-excluded-network-families-admit-fast-distributed-algorithms-1801.062372018-05-29 https://scifaro.com/en/abs/empowering-the-configuration-ip-new-ptas-results-for-scheduling-with-setups-times-1801.064602018-11-19 https://scifaro.com/en/abs/probabilistic-tools-for-the-analysis-of-randomized-optimization-heuristics-1801.067332021-09-22 https://scifaro.com/en/abs/linking-and-cutting-spanning-trees-1801.068462020-07-08 https://scifaro.com/en/abs/efficient-learning-of-optimal-markov-network-topology-with-k-tree-modeling-1801.069002018-01-23 https://scifaro.com/en/abs/sequence-covering-similarity-for-symbolic-sequence-comparison-1801.070132018-03-12 https://scifaro.com/en/abs/secure-k-ish-nearest-neighbors-classifier-1801.073012019-05-01 https://scifaro.com/en/abs/sliding-suffix-tree-using-lca-1801.074492018-09-07 https://scifaro.com/en/abs/heuristic-algorithms-for-the-maximum-colorful-subtree-problem-1801.074562018-02-14 https://scifaro.com/en/abs/improved-pseudo-polynomial-time-approximation-for-strip-packing-1801.075412018-01-24 https://scifaro.com/en/abs/an-efficient-primal-dual-algorithm-for-fair-combinatorial-optimization-problems-1801.075442018-01-24 https://scifaro.com/en/abs/byzantine-gathering-in-polynomial-time-1801.076562018-01-24 https://scifaro.com/en/abs/a-chronological-edge-driven-approach-to-temporal-subgraph-isomorphism-1801.080982018-01-25 https://scifaro.com/en/abs/finding-induced-subgraphs-in-scale-free-inhomogeneous-random-graphs-1801.082932019-08-30 https://scifaro.com/en/abs/on-bounded-pitch-inequalities-for-the-min-knapsack-polytope-1801.088502018-01-29 https://scifaro.com/en/abs/on-scheduling-two-stage-jobs-on-multiple-two-stage-flowshops-1801.090892018-01-30 https://scifaro.com/en/abs/faster-approximate-d-text-to-pattern-l1-distance-1801.091592018-05-04 https://scifaro.com/en/abs/generalized-leapfrogging-samplesort-a-class-of-o-n-log-2-n-worst-case-complexity-and-o-n-log-n-average-case-complexity-sorting-algorithms-1801.094312018-01-30 https://scifaro.com/en/abs/which-np-hard-sat-and-csp-problems-admit-exponentially-improved-algorithms-1801.094882018-01-30 https://scifaro.com/en/abs/once-and-once-counting-the-frequency-of-time-constrained-serial-episodes-in-a-streaming-sequence-1801.096392018-01-30 https://scifaro.com/en/abs/earthmover-resilience-and-testing-in-ordered-structures-1801.097982018-01-31 https://scifaro.com/en/abs/social-event-scheduling-1801.099732018-03-08 https://scifaro.com/en/abs/a-continuous-time-quantum-walk-for-attributed-graphs-matching-1801.103392018-02-01 https://scifaro.com/en/abs/efficient-algorithms-for-measuring-the-funnel-likeness-of-dags-1801.104012018-02-01 https://scifaro.com/en/abs/hardness-approximability-and-fixed-parameter-tractability-of-the-clustered-shortest-path-tree-problem-1801.104162018-02-01 https://scifaro.com/en/abs/parameterized-power-vertex-cover-1801.104762023-06-22 https://scifaro.com/en/abs/nc-algorithms-for-computing-a-perfect-matching-and-a-maximum-flow-in-one-crossing-minor-free-graphs-1802.000842021-06-29 https://scifaro.com/en/abs/on-polynomial-time-constructions-of-minimum-height-decision-tree-1802.002332018-02-02 https://scifaro.com/en/abs/solving-minimum-k-supplier-in-adleman-lipton-model-1802.003472018-02-02 https://scifaro.com/en/abs/nearly-optimal-dynamic-k-means-clustering-for-high-dimensional-data-1802.004592019-02-08 https://scifaro.com/en/abs/when-can-l-p-norm-objective-functions-be-minimized-via-graph-cuts-1802.006242019-09-10 https://scifaro.com/en/abs/a-model-for-learned-bloom-filters-and-related-structures-1802.008842018-02-06 https://scifaro.com/en/abs/smooth-q-gram-and-its-applications-to-detection-of-overlaps-among-long-error-prone-sequencing-reads-1802.011892018-02-06 https://scifaro.com/en/abs/counting-and-sampling-from-markov-equivalent-dags-using-clique-trees-1802.012392018-09-12 https://scifaro.com/en/abs/fast-approximations-for-metric-tsp-via-linear-programming-1802.012422018-02-06 https://scifaro.com/en/abs/shortest-k-disjoint-paths-via-determinants-1802.013382018-02-06 https://scifaro.com/en/abs/reducing-cmso-model-checking-to-highly-connected-graphs-1802.014532018-02-06 https://scifaro.com/en/abs/an-efficient-counting-method-for-the-colored-triad-census-1802.014812019-05-02 https://scifaro.com/en/abs/how-to-select-the-best-set-of-ads-can-we-do-better-than-greedy-algorithm-1802.017542018-02-07 https://scifaro.com/en/abs/strong-algorithms-for-the-ordinal-matroid-secretary-problem-1802.019972018-02-07 https://scifaro.com/en/abs/current-flow-group-closeness-centrality-for-complex-networks-1802.025562019-02-25 https://scifaro.com/en/abs/fair-by-design-matching-1802.025622020-01-09 https://scifaro.com/en/abs/minimizing-latency-in-online-ride-and-delivery-services-1802.027442018-02-09 https://scifaro.com/en/abs/distributed-spanner-approximation-1802.031602018-02-12 https://scifaro.com/en/abs/updating-dynamic-random-hyperbolic-graphs-in-sublinear-time-1802.032972018-02-12 https://scifaro.com/en/abs/network-flow-based-refinement-for-multilevel-hypergraph-partitioning-1802.035872018-02-15 https://scifaro.com/en/abs/searching-isomorphic-graphs-1802.036112018-02-13 https://scifaro.com/en/abs/on-the-tractability-of-k-i-coloring-1802.036342020-09-14 https://scifaro.com/en/abs/low-rank-methods-in-event-detection-and-subsampled-point-to-subspace-proximity-tests-1802.036492022-02-21 https://scifaro.com/en/abs/faster-distributed-shortest-path-approximations-via-shortcuts-1802.036712018-08-09 https://scifaro.com/en/abs/reducing-compare-and-swap-to-consensus-number-one-primitives-1802.038442018-08-21 https://scifaro.com/en/abs/how-to-match-when-all-vertices-arrive-online-1802.039052018-02-13 https://scifaro.com/en/abs/bagminhash-minwise-hashing-algorithm-for-weighted-sets-1802.039142018-07-24 https://scifaro.com/en/abs/on-minrank-and-the-lov-asz-theta-function-1802.039202018-02-22 https://scifaro.com/en/abs/algorithms-for-robust-production-scheduling-with-energy-consumption-limits-1802.039282018-02-14 https://scifaro.com/en/abs/computational-optimal-transport-complexity-by-accelerated-gradient-descent-is-better-than-by-sinkhorn-s-algorithm-1802.043672018-06-08 https://scifaro.com/en/abs/hierarchical-overlap-graph-1802.046322021-11-18 https://scifaro.com/en/abs/a-faster-isomorphism-test-for-graphs-of-small-degree-1802.046592025-04-21 https://scifaro.com/en/abs/sparse-matrix-multiplication-and-triangle-listing-in-the-congested-clique-model-1802.047892019-03-22 https://scifaro.com/en/abs/efficient-discovery-of-variable-length-time-series-motifs-with-large-length-range-in-million-scale-time-series-1802.048832018-02-15 https://scifaro.com/en/abs/quantum-versus-classical-online-streaming-algorithms-with-advice-1802.051342019-06-24 https://scifaro.com/en/abs/efficient-exact-paths-for-dyck-and-semi-dyck-labeled-path-reachability-1802.052392018-03-06 https://scifaro.com/en/abs/strongly-connected-components-algorithm-for-finding-the-strongly-connected-components-of-a-graph-1802.053872018-02-16 https://scifaro.com/en/abs/competitive-caching-with-machine-learned-advice-1802.053992020-08-24 https://scifaro.com/en/abs/smooth-heaps-and-a-dual-view-of-self-adjusting-data-structures-1802.054712019-01-01 https://scifaro.com/en/abs/grammar-based-compression-of-unranked-trees-1802.054902018-02-16 https://scifaro.com/en/abs/finding-small-width-connected-path-decompositions-in-polynomial-time-1802.055012021-01-19 https://scifaro.com/en/abs/an-o-1-approximation-algorithm-for-dynamic-weighted-vertex-cover-with-soft-capacity-1802.056232018-02-21 https://scifaro.com/en/abs/list-heaps-1802.056622018-02-16 https://scifaro.com/en/abs/a-faster-fptas-for-knapsack-1802.057912018-02-19 https://scifaro.com/en/abs/minimal-algorithmic-information-loss-methods-for-dimension-reduction-feature-selection-and-network-sparsification-1802.058432025-05-06 https://scifaro.com/en/abs/a-parameterized-strongly-polynomial-algorithm-for-block-structured-integer-programs-1802.058592021-02-25 https://scifaro.com/en/abs/refining-the-r-index-1802.059062019-07-05 https://scifaro.com/en/abs/parameterized-algorithms-for-zero-extension-and-metric-labelling-problems-1802.060262018-02-19 https://scifaro.com/en/abs/improving-the-florentine-algorithms-recovering-algorithms-for-motzkin-and-schr-oder-paths-1802.060302018-03-15 https://scifaro.com/en/abs/a-centrality-measure-for-cycles-and-subgraphs-ii-1802.060652019-09-12 https://scifaro.com/en/abs/approximate-set-union-via-approximate-randomization-1802.062042018-06-18 https://scifaro.com/en/abs/multi-pass-streaming-algorithms-for-monotone-submodular-function-maximization-1802.062122018-02-20 https://scifaro.com/en/abs/lower-bounds-on-sparse-spanners-emulators-and-diameter-reducing-shortcuts-1802.062712019-07-23 https://scifaro.com/en/abs/minimum-length-rna-folding-trajectories-1802.063282018-02-20 https://scifaro.com/en/abs/on-finding-dense-common-subgraphs-1802.063612018-02-20 https://scifaro.com/en/abs/linear-time-algorithm-for-long-lcf-with-k-mismatches-1802.063692018-02-20 https://scifaro.com/en/abs/capacitated-dynamic-programming-faster-knapsack-and-graph-algorithms-1802.064402018-07-16 https://scifaro.com/en/abs/an-efficient-local-search-for-the-minimum-independent-dominating-set-problem-1802.064782019-08-20 https://scifaro.com/en/abs/reconfiguration-of-colorable-sets-in-classes-of-perfect-graphs-1802.065112018-02-20 https://scifaro.com/en/abs/discrepancy-analysis-of-a-new-randomized-diffusion-algorithm-1802.065322018-05-15 https://scifaro.com/en/abs/upper-and-lower-bounds-for-dynamic-data-structures-on-strings-1802.065452018-02-20 https://scifaro.com/en/abs/a-natural-generalization-of-stable-matching-solved-via-new-insights-into-ideal-cuts-1802.066212018-04-04 https://scifaro.com/en/abs/maximal-exploration-of-trees-with-energy-constrained-agents-1802.066362018-02-20 https://scifaro.com/en/abs/a-simple-parallel-and-distributed-sampling-technique-local-glauber-dynamics-1802.066762018-05-16 https://scifaro.com/en/abs/on-local-distributed-sampling-and-counting-1802.066862018-02-20 https://scifaro.com/en/abs/an-adaptive-version-of-brandes-algorithm-for-betweenness-centrality-1802.067012020-05-14 https://scifaro.com/en/abs/breaking-the-linear-memory-barrier-in-mpc-fast-mis-on-trees-with-strongly-sublinear-memory-1802.067482019-05-28 https://scifaro.com/en/abs/communication-optimal-convolutional-neural-nets-1802.069052018-04-25 https://scifaro.com/en/abs/distributed-symmetry-breaking-in-sampling-optimal-distributed-randomly-coloring-with-fewer-colors-1802.069532018-06-22 https://scifaro.com/en/abs/sublinear-algorithms-for-maxcut-and-correlation-clustering-1802.069922018-02-21 https://scifaro.com/en/abs/selection-from-heaps-row-sorted-matrices-and-x-y-using-soft-heaps-1802.070412018-02-21 https://scifaro.com/en/abs/relative-worst-order-analysis-a-survey-1802.070802018-02-21 https://scifaro.com/en/abs/the-parameterized-complexity-of-packing-arc-disjoint-cycles-in-tournaments-1802.070902018-02-21 https://scifaro.com/en/abs/ilp-based-local-search-for-graph-partitioning-1802.071442018-02-21 https://scifaro.com/en/abs/the-parameterized-complexity-of-finding-a-2-sphere-in-a-simplicial-complex-1802.071752019-09-10 https://scifaro.com/en/abs/wireless-expanders-1802.071772018-02-21 https://scifaro.com/en/abs/periodicity-in-data-streams-with-wildcards-1802.073752018-03-06 https://scifaro.com/en/abs/constant-factor-approximation-algorithm-for-weighted-flow-time-on-a-single-machine-in-pseudo-polynomial-time-1802.074392018-08-21 https://scifaro.com/en/abs/max-size-popular-matchings-and-extensions-1802.074402018-02-22 https://scifaro.com/en/abs/a-framework-for-cost-constrained-genome-rearrangement-under-double-cut-and-join-1802.075152018-10-24 https://scifaro.com/en/abs/spanning-tree-congestion-and-computation-of-generalized-gy-h-o-ri-lov-a-sz-partition-1802.076322018-04-26 https://scifaro.com/en/abs/efficient-enumeration-of-dominating-sets-for-sparse-graphs-1802.078632020-09-23 https://scifaro.com/en/abs/the-clever-shopper-problem-1802.079442022-08-29 https://scifaro.com/en/abs/near-isometric-terminal-embeddings-for-doubling-metrics-1802.079672018-02-23 https://scifaro.com/en/abs/improved-massively-parallel-computation-algorithms-for-mis-matching-and-vertex-cover-1802.082372022-03-21 https://scifaro.com/en/abs/the-iisignature-library-efficient-calculation-of-iterated-integral-signatures-and-log-signatures-1802.082522018-02-26 https://scifaro.com/en/abs/proportional-volume-sampling-and-approximation-algorithms-for-a-optimal-design-1802.083182018-07-18 https://scifaro.com/en/abs/graph-similarity-and-approximate-isomorphism-1802.085092018-02-26 https://scifaro.com/en/abs/on-streaming-algorithms-for-the-steiner-cycle-and-path-cover-problem-on-interval-graphs-and-falling-platforms-in-video-games-1802.085772018-02-26 https://scifaro.com/en/abs/homomorphism-extension-1802.086562018-06-22 https://scifaro.com/en/abs/lov-asz-meets-weisfeiler-and-leman-1802.088762018-05-23 https://scifaro.com/en/abs/dimensionally-tight-bounds-for-second-order-hamiltonian-monte-carlo-1802.088982018-08-13 https://scifaro.com/en/abs/on-the-broadcast-routing-problem-in-computer-networks-1802.089552020-04-07 https://scifaro.com/en/abs/evaluating-and-tuning-n-fold-integer-programming-1802.090072019-04-08 https://scifaro.com/en/abs/a-new-algorithm-for-finding-closest-pair-of-vectors-1802.091042019-03-12 https://scifaro.com/en/abs/submodularity-on-hypergraphs-from-sets-to-sequences-1802.091102018-03-19 https://scifaro.com/en/abs/dynamic-effective-resistances-and-approximate-schur-complement-on-separable-graphs-1802.091112018-08-09 https://scifaro.com/en/abs/multi-commodity-flow-with-in-network-processing-1802.091182018-02-27 https://scifaro.com/en/abs/the-cut-and-dominating-set-problem-in-a-steganographer-network-1802.093332018-02-27 https://scifaro.com/en/abs/in-database-connected-component-analysis-1802.094782019-10-18 https://scifaro.com/en/abs/representations-of-sparse-distributed-networks-a-locality-sensitive-approach-1802.095152018-02-27 https://scifaro.com/en/abs/aggregative-coarsening-for-multilevel-hypergraph-partitioning-1802.096102022-06-16 https://scifaro.com/en/abs/polynomial-treedepth-bounds-in-linear-colorings-1802.096652018-07-26 https://scifaro.com/en/abs/fully-dynamic-maximal-independent-set-with-sublinear-update-time-1802.097092018-02-28 https://scifaro.com/en/abs/a-unified-framework-for-designing-eptas-s-for-load-balancing-on-parallel-machines-1802.098282018-02-28 https://scifaro.com/en/abs/optimization-over-the-boolean-hypercube-via-sums-of-nonnegative-circuit-polynomials-1802.100042018-02-28 https://scifaro.com/en/abs/parameterized-complexity-of-diameter-1802.100482020-12-22 https://scifaro.com/en/abs/incremental-strong-connectivity-and-2-connectivity-in-directed-graphs-1802.101892018-03-01 https://scifaro.com/en/abs/local-distributed-algorithms-in-highly-dynamic-networks-1802.101992018-12-10 https://scifaro.com/en/abs/online-non-preemptive-scheduling-on-unrelated-machines-with-rejections-1802.103092018-03-01 https://scifaro.com/en/abs/decompressing-lempel-ziv-compressed-text-1802.103472019-11-05 https://scifaro.com/en/abs/parameterized-aspects-of-strong-subgraph-closure-1802.103862018-03-01 https://scifaro.com/en/abs/survivable-network-design-for-group-connectivity-in-low-treewidth-graphs-1802.104032018-03-01 https://scifaro.com/en/abs/an-approximate-pareto-set-for-minimizing-the-maximum-lateness-and-makespan-on-parallel-machines-1802.104882018-03-01 https://scifaro.com/en/abs/characterizing-demand-graphs-for-fixed-parameter-shallow-light-steiner-network-1802.105662018-03-01 https://scifaro.com/en/abs/inspectre-privately-estimating-the-unseen-1803.000082018-03-02 https://scifaro.com/en/abs/simple-and-local-independent-set-approximation-1803.007862018-03-05 https://scifaro.com/en/abs/on-the-relation-of-strong-triadic-closure-and-cluster-deletion-1803.008072019-08-07 https://scifaro.com/en/abs/independence-number-and-the-number-of-maximum-independent-sets-in-pseudofractal-scale-free-web-and-sierpi-nski-gasket-1803.008292018-03-05 https://scifaro.com/en/abs/experimental-evaluation-of-parameterized-algorithms-for-feedback-vertex-set-1803.009252018-11-14 https://scifaro.com/en/abs/semi-supervised-algorithms-for-approximately-optimal-and-accurate-clustering-1803.009262018-11-07 https://scifaro.com/en/abs/finding-hamiltonian-cycle-in-graphs-of-bounded-treewidth-experimental-evaluation-1803.009272019-09-24 https://scifaro.com/en/abs/an-improved-fpt-algorithm-for-independent-feedback-vertex-set-1803.009372020-02-03 https://scifaro.com/en/abs/station-assignment-with-reallocation-1803.012762018-03-06 https://scifaro.com/en/abs/maximizing-efficiency-in-dynamic-matching-markets-1803.012852018-03-06 https://scifaro.com/en/abs/two-dimensional-block-trees-1803.013622018-03-06 https://scifaro.com/en/abs/optimizing-learned-bloom-filters-by-sandwiching-1803.014742018-03-06 https://scifaro.com/en/abs/string-attractors-verification-and-optimization-1803.016952020-12-09 https://scifaro.com/en/abs/optimal-substring-equality-queries-with-applications-to-sparse-text-indexing-1803.017232020-05-12 https://scifaro.com/en/abs/revisiting-frequency-moment-estimation-in-random-order-streams-1803.022702018-03-07 https://scifaro.com/en/abs/submodular-maximization-with-uncertain-knapsack-capacity-1803.025652018-03-08 https://scifaro.com/en/abs/compact-representations-of-event-sequences-1803.025762018-03-08 https://scifaro.com/en/abs/flexible-and-efficient-algorithms-for-abelian-matching-in-strings-1803.028072018-03-08 https://scifaro.com/en/abs/approximation-algorithms-for-two-machine-flow-shop-scheduling-with-a-conflict-graph-1803.028622018-03-09 https://scifaro.com/en/abs/improved-distributed-delta-coloring-1803.032482020-08-04 https://scifaro.com/en/abs/a-polynomial-kernel-for-diamond-free-editing-1803.033582018-05-04 https://scifaro.com/en/abs/the-electric-two-echelon-vehicle-routing-problem-1803.036282018-11-16 https://scifaro.com/en/abs/disconnected-cuts-in-claw-free-graphs-1803.036632018-03-13 https://scifaro.com/en/abs/multi-agent-submodular-optimization-1803.037672019-08-23 https://scifaro.com/en/abs/graph-based-clustering-under-differential-privacy-1803.038312018-03-13 https://scifaro.com/en/abs/efficient-enumeration-of-bipartite-subgraphs-in-graphs-1803.038392018-07-03 https://scifaro.com/en/abs/linear-time-in-place-dfs-and-bfs-on-the-word-ram-1803.042822019-01-30 https://scifaro.com/en/abs/geodabs-trajectory-indexing-meets-fingerprinting-at-scale-1803.042922018-03-13 https://scifaro.com/en/abs/new-algorithms-for-weighted-k-domination-and-total-k-domination-problems-in-proper-interval-graphs-1803.043272018-07-25 https://scifaro.com/en/abs/a-hybrid-quantum-classical-paradigm-to-mitigate-embedding-costs-in-quantum-annealing-1803.043402020-01-27 https://scifaro.com/en/abs/reactive-proximity-data-structures-for-graphs-1803.045552020-01-07 https://scifaro.com/en/abs/on-integer-programming-discrepancy-and-convolution-1803.047442022-07-27 https://scifaro.com/en/abs/mathematical-models-and-search-algorithms-for-the-capacitated-p-center-problem-1803.048652018-03-14 https://scifaro.com/en/abs/nearly-optimal-time-bounds-for-kpath-in-hypergraphs-1803.049402019-02-20 https://scifaro.com/en/abs/graph-ranking-and-the-cost-of-sybil-defense-1803.050012023-06-05 https://scifaro.com/en/abs/subexponential-time-and-fpt-algorithms-for-embedded-flat-clustered-planarity-1803.054652018-03-16 https://scifaro.com/en/abs/relaxed-locally-correctable-codes-in-computationally-bounded-channels-1803.056522018-09-19 https://scifaro.com/en/abs/a-generalized-matching-reconfiguration-problem-1803.058252020-05-07 https://scifaro.com/en/abs/average-cost-of-quickxsort-with-pivot-sampling-1803.059482019-05-07 https://scifaro.com/en/abs/reconfiguring-spanning-and-induced-subgraphs-1803.060742018-03-19 https://scifaro.com/en/abs/parameterized-low-rank-binary-matrix-approximation-1803.061022018-03-19 https://scifaro.com/en/abs/fast-approximation-and-exact-computation-of-negative-curvature-parameters-of-graphs-1803.063242019-06-07 https://scifaro.com/en/abs/differential-privacy-for-growing-databases-1803.064162018-03-20 https://scifaro.com/en/abs/leveraging-sparsity-to-speed-up-polynomial-feature-expansions-of-csr-matrices-using-k-simplex-numbers-1803.064182018-09-11 https://scifaro.com/en/abs/swapping-colored-tokens-on-graphs-1803.068162018-03-20 https://scifaro.com/en/abs/an-improved-isomorphism-test-for-bounded-tree-width-graphs-1803.068582018-03-20 https://scifaro.com/en/abs/exploiting-hopsets-improved-distance-oracles-for-graphs-of-constant-highway-dimension-and-beyond-1803.069772019-05-27 https://scifaro.com/en/abs/tilde-o-n-1-3-space-algorithm-for-the-grid-graph-reachability-problem-1803.070972019-09-23 https://scifaro.com/en/abs/twelve-simple-algorithms-to-compute-fibonacci-numbers-1803.071992018-04-16 https://scifaro.com/en/abs/adaptive-greedy-algorithms-for-stochastic-set-cover-problems-1803.076392018-06-19 https://scifaro.com/en/abs/introducing-higher-order-correlations-to-marginals-subset-of-multivariate-data-by-means-of-archimedean-copulas-1803.078132018-08-31 https://scifaro.com/en/abs/similar-elements-and-metric-labeling-on-complete-graphs-1803.080372018-03-28 https://scifaro.com/en/abs/data-streams-with-bounded-deletions-1803.087772018-03-26 https://scifaro.com/en/abs/minmax-centered-k-partitioning-of-trees-and-applications-to-sink-evacuation-with-dynamic-confluent-flows-1803.092892018-03-28 https://scifaro.com/en/abs/popular-matching-in-roommates-setting-is-np-hard-1803.093702018-03-28 https://scifaro.com/en/abs/unpopularity-factor-in-the-marriage-and-roommates-problems-1803.094352021-06-01 https://scifaro.com/en/abs/clustering-to-given-connectivities-1803.094832018-04-23 https://scifaro.com/en/abs/on-the-approximation-ratio-of-ordered-parsings-1803.095172019-10-29 https://scifaro.com/en/abs/universal-compressed-text-indexing-1803.095202020-12-17 https://scifaro.com/en/abs/extra-space-during-initialization-of-succinct-data-structures-and-dynamical-initializable-arrays-1803.096752018-04-30 https://scifaro.com/en/abs/a-faster-fptas-for-the-subset-sums-ratio-problem-1803.099522019-12-20 https://scifaro.com/en/abs/polynomial-time-algorithms-for-submodular-laplacian-systems-1803.109232018-03-30 https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-the-max-cut-problem-on-embedded-1-planar-graphs-1803.109832018-12-08 https://scifaro.com/en/abs/frequent-item-set-mining-without-ubiquitous-items-1803.111052018-03-30 https://scifaro.com/en/abs/prefix-free-parsing-for-building-big-bwts-1803.112452018-11-19 https://scifaro.com/en/abs/optimal-distributed-coloring-algorithms-for-planar-graphs-in-the-local-model-1804.001372018-04-03 https://scifaro.com/en/abs/the-popular-roommates-problem-1804.001412018-04-10 https://scifaro.com/en/abs/symbolic-algorithms-for-graphs-and-markov-decision-processes-with-fairness-objectives-1804.002062018-04-16 https://scifaro.com/en/abs/finding-stable-matchings-that-are-robust-to-errors-in-the-input-1804.005532018-12-17 https://scifaro.com/en/abs/holiest-minimum-cost-paths-and-flows-in-surface-graphs-1804.010452018-04-04 https://scifaro.com/en/abs/operator-scaling-via-geodesically-convex-optimization-invariant-theory-and-polynomial-identity-testing-1804.010762018-04-04 https://scifaro.com/en/abs/query-shortest-paths-amidst-growing-discs-1804.011812018-04-05 https://scifaro.com/en/abs/a-euclidean-algorithm-for-binary-cycles-with-minimal-variance-1804.012072018-04-05 https://scifaro.com/en/abs/losing-treewidth-by-separating-subsets-1804.013662018-10-24 https://scifaro.com/en/abs/on-line-chain-partitioning-approach-to-scheduling-1804.015672018-04-06 https://scifaro.com/en/abs/a-ptas-for-subset-tsp-in-minor-free-graphs-1804.015882019-11-01 https://scifaro.com/en/abs/optimal-streaming-and-tracking-distinct-elements-with-high-probability-1804.016422019-01-07 https://scifaro.com/en/abs/simple-dynamic-algorithms-for-maximal-independent-set-and-other-problems-1804.018232018-08-07 https://scifaro.com/en/abs/on-undetected-redundancy-in-the-burrows-wheeler-transform-1804.019372018-04-06 https://scifaro.com/en/abs/a-framework-for-searching-in-graphs-in-the-presence-of-errors-1804.020752024-01-26 https://scifaro.com/en/abs/red-black-trees-with-constant-update-time-1804.021122018-04-09 https://scifaro.com/en/abs/enumerating-graph-partitions-without-too-small-connected-components-using-zero-suppressed-binary-and-ternary-decision-diagrams-1804.021602018-04-09 https://scifaro.com/en/abs/improved-approximation-for-tree-augmentation-saving-by-rewiring-1804.022422018-04-09 https://scifaro.com/en/abs/a-subquadratic-approximation-scheme-for-partition-1804.022692019-05-07 https://scifaro.com/en/abs/bfs-enumeration-for-breaking-symmetries-in-graphs-1804.022732018-04-09 https://scifaro.com/en/abs/reconstructing-point-sets-from-distance-distributions-1804.024652021-04-27 https://scifaro.com/en/abs/varepsilon-coresets-for-clustering-with-outliers-in-doubling-metrics-1804.025302018-08-21 https://scifaro.com/en/abs/tight-lower-bounds-for-list-edge-coloring-1804.025372018-04-10 https://scifaro.com/en/abs/random-order-contention-resolution-schemes-1804.025842018-11-27 https://scifaro.com/en/abs/multi-level-steiner-trees-1804.026272024-09-17 https://scifaro.com/en/abs/a-3-2-approximation-algorithm-for-the-student-project-allocation-problem-1804.027312020-09-08 https://scifaro.com/en/abs/maximizing-the-number-of-spanning-trees-in-a-connected-graph-1804.027852018-07-17 https://scifaro.com/en/abs/a-5k-vertex-kernel-for-p-2-packing-1804.028012022-02-07 https://scifaro.com/en/abs/some-reduction-operations-to-pairwise-compatibility-graphs-1804.028872020-07-23 https://scifaro.com/en/abs/characterizing-star-pcgs-1804.028952020-07-23 https://scifaro.com/en/abs/from-regular-expression-matching-to-parsing-1804.029062019-01-30 https://scifaro.com/en/abs/set-similarity-search-for-skewed-data-1804.030542018-04-10 https://scifaro.com/en/abs/linear-programming-bounds-for-randomly-sampling-colorings-1804.031562018-06-08 https://scifaro.com/en/abs/contextual-search-via-intrinsic-volumes-1804.031952018-05-18 https://scifaro.com/en/abs/dynamic-set-cover-improved-algorithms-lower-bounds-1804.031972019-05-16 https://scifaro.com/en/abs/prompt-scheduling-for-selfish-agents-1804.032442018-04-11 https://scifaro.com/en/abs/parameterized-algorithms-for-the-matrix-completion-problem-1804.034232018-09-14 https://scifaro.com/en/abs/approximating-multiobjective-combinatorial-optimization-problems-with-the-owa-criterion-1804.035942018-04-11 https://scifaro.com/en/abs/optimal-document-exchange-and-new-codes-for-insertions-and-deletions-1804.036042019-09-27 https://scifaro.com/en/abs/testing-identity-of-multidimensional-histograms-1804.036362019-02-20 https://scifaro.com/en/abs/approximating-operator-norms-via-generalized-krivine-rounding-1804.036442019-11-07 https://scifaro.com/en/abs/enumerating-all-subgraphs-without-forbidden-induced-subgraphs-via-multivalued-decision-diagrams-1804.038222018-04-12 https://scifaro.com/en/abs/olcpm-an-online-framework-for-detecting-overlapping-communities-in-dynamic-social-networks-1804.038422018-04-12 https://scifaro.com/en/abs/weighted-proper-orientations-of-trees-and-graphs-of-bounded-treewidth-1804.038842018-04-12 https://scifaro.com/en/abs/a-synopsis-of-comparative-metrics-for-classifications-1804.039292018-04-12 https://scifaro.com/en/abs/a-ptas-for-euclidean-tsp-with-hyperplane-neighborhoods-1804.039532019-06-14 https://scifaro.com/en/abs/bipartitioning-problems-on-graphs-with-bounded-tree-width-1804.040162018-04-12 https://scifaro.com/en/abs/fully-dynamic-effective-resistances-1804.040382018-04-12 https://scifaro.com/en/abs/on-geodesically-convex-formulations-for-the-brascamp-lieb-constant-1804.040512018-04-12 https://scifaro.com/en/abs/subexponential-time-algorithms-for-maximum-independent-set-in-p-t-free-and-broom-free-graphs-1804.040772018-04-12 https://scifaro.com/en/abs/fast-feasible-and-unfeasible-matrix-multiplication-1804.041022018-04-12 https://scifaro.com/en/abs/approximating-edit-distance-in-truly-subquadratic-time-quantum-and-mapreduce-1804.041782018-04-27 https://scifaro.com/en/abs/graph-sketching-against-adaptive-adversaries-applied-to-the-minimum-degree-algorithm-1804.042392023-04-11 https://scifaro.com/en/abs/dualities-in-tree-representations-1804.042632018-04-16 https://scifaro.com/en/abs/fast-prefix-search-in-little-space-with-applications-1804.047202018-04-16 https://scifaro.com/en/abs/efficient-algorithms-for-tensor-scaling-quantum-marginals-and-moment-polytopes-1804.047392020-03-10 https://scifaro.com/en/abs/optimizing-bloom-filter-challenges-solutions-and-comparisons-1804.047772019-01-08 https://scifaro.com/en/abs/dynamic-low-stretch-trees-via-dynamic-low-diameter-decompositions-1804.049282019-08-01 https://scifaro.com/en/abs/on-asynchronous-non-dominated-sorting-for-steady-state-multiobjective-evolutionary-algorithms-1804.052082018-04-17 https://scifaro.com/en/abs/the-threshold-for-sdp-refutation-of-random-regular-nae-3sat-1804.052302018-04-17 https://scifaro.com/en/abs/submodular-maximization-with-nearly-optimal-approximation-and-adaptivity-in-nearly-linear-time-1804.053792018-11-01 https://scifaro.com/en/abs/a-weighted-generalization-of-the-graham-diaconis-inequality-for-ranked-list-similarity-1804.054202018-04-17 https://scifaro.com/en/abs/a-deterministic-distributed-algorithm-for-exact-weighted-all-pairs-shortest-paths-in-tilde-o-n-3-2-rounds-1804.054412018-04-17 https://scifaro.com/en/abs/adaptive-mapreduce-similarity-joins-1804.056152018-04-17 https://scifaro.com/en/abs/multimodal-dynamic-journey-planning-1804.056442018-04-17 https://scifaro.com/en/abs/deterministic-document-exchange-protocols-and-almost-optimal-binary-codes-for-edit-errors-1804.057762018-07-18 https://scifaro.com/en/abs/bend-minimum-orthogonal-drawings-in-quadratic-time-1804.058132018-09-06 https://scifaro.com/en/abs/k-maximum-subarrays-for-small-k-divide-and-conquer-made-simpler-1804.059562018-07-24 https://scifaro.com/en/abs/an-exponential-speedup-in-parallel-running-time-for-submodular-maximization-without-loss-in-approximation-1804.063552018-04-18 https://scifaro.com/en/abs/a-time-and-space-optimal-algorithm-for-the-many-visits-tsp-1804.063612020-04-22 https://scifaro.com/en/abs/local-search-is-a-ptas-for-feedback-vertex-set-in-minor-free-graphs-1804.064282019-06-04 https://scifaro.com/en/abs/faster-evaluation-of-subtraction-games-1804.065152018-04-19 https://scifaro.com/en/abs/independent-distributions-on-a-multi-branching-and-or-tree-of-height-2-1804.066012024-06-03 https://scifaro.com/en/abs/on-abelian-longest-common-factor-with-and-without-rle-1804.068092018-04-19 https://scifaro.com/en/abs/nearly-optimal-separation-between-partially-and-fully-retroactive-data-structures-1804.069322018-04-26 https://scifaro.com/en/abs/distributed-simulation-and-distributed-inference-1804.069522019-05-24 https://scifaro.com/en/abs/algorithms-and-conditional-lower-bounds-for-planning-problems-1804.070312018-04-20 https://scifaro.com/en/abs/exact-algorithms-for-the-maximum-planar-subgraph-problem-new-models-and-experiments-1804.071432018-04-20 https://scifaro.com/en/abs/light-spanners-for-high-dimensional-norms-via-stochastic-decompositions-1804.074562018-04-23 https://scifaro.com/en/abs/online-vertex-weighted-bipartite-matching-beating-1-1-e-with-random-arrivals-1804.074582019-09-13 https://scifaro.com/en/abs/optimal-sorting-with-persistent-comparison-errors-1804.075752018-04-23 https://scifaro.com/en/abs/sherali-adams-integrality-gaps-matching-the-log-density-threshold-1804.078422018-04-24 https://scifaro.com/en/abs/designing-practical-ptases-for-minimum-feedback-vertex-set-in-planar-graphs-1804.078692018-04-24 https://scifaro.com/en/abs/chain-generalization-of-covering-code-and-deterministic-algorithm-for-k-sat-1804.079012020-03-19 https://scifaro.com/en/abs/differentially-private-k-means-with-constant-multiplicative-error-1804.080012018-07-17 https://scifaro.com/en/abs/a-2-3-approximation-algorithm-for-vertex-weighted-matching-in-bipartite-graphs-1804.080162018-10-12 https://scifaro.com/en/abs/attenuate-locally-win-globally-an-attenuation-based-framework-for-online-stochastic-matching-with-timeouts-1804.080622019-06-24 https://scifaro.com/en/abs/a-primal-dual-online-deterministic-algorithm-for-matching-with-delays-1804.080972018-09-11 https://scifaro.com/en/abs/maximizing-profit-with-convex-costs-in-the-random-order-model-1804.081722018-04-24 https://scifaro.com/en/abs/nearly-linear-time-deterministic-algorithms-for-submodular-maximization-under-knapsack-constraint-and-beyond-1804.081782020-12-22 https://scifaro.com/en/abs/how-bad-is-the-freedom-to-flood-it-1804.082362018-04-24 https://scifaro.com/en/abs/succinct-oblivious-ram-1804.082852018-04-24 https://scifaro.com/en/abs/online-non-preemptive-scheduling-to-minimize-weighted-flow-time-on-unrelated-machines-1804.083172018-04-24 https://scifaro.com/en/abs/parallel-and-i-o-efficient-randomisation-of-massive-networks-using-global-curveball-trades-1804.084872018-08-20 https://scifaro.com/en/abs/entropy-bounds-for-grammar-compression-1804.085472020-05-21 https://scifaro.com/en/abs/individual-sensitivity-preprocessing-for-data-privacy-1804.086452019-01-24 https://scifaro.com/en/abs/maximum-integer-flows-in-directed-planar-graphs-with-multiple-sources-and-sinks-and-vertex-capacities-1804.086832021-05-26 https://scifaro.com/en/abs/longest-common-substring-made-fully-dynamic-1804.087312018-07-17 https://scifaro.com/en/abs/a-tight-4-3-approximation-for-capacitated-vehicle-routing-in-trees-1804.087912018-04-25 https://scifaro.com/en/abs/fast-and-efficient-distributed-computation-of-hamiltonian-cycles-in-random-graphs-1804.088192018-04-25 https://scifaro.com/en/abs/improved-algorithms-for-fully-dynamic-maximal-independent-set-1804.089082018-04-25 https://scifaro.com/en/abs/improved-local-search-based-approximation-algorithm-for-hard-uniform-capacitated-k-median-problem-1804.089482018-04-25 https://scifaro.com/en/abs/an-algorithm-for-generating-strongly-chordal-graphs-1804.090192018-04-25 https://scifaro.com/en/abs/reconfiguration-of-graph-minors-1804.092402018-04-26 https://scifaro.com/en/abs/a-quasi-linear-time-b-matching-algorithm-on-distance-hereditary-graphs-and-bounded-split-width-graphs-1804.093932018-04-26 https://scifaro.com/en/abs/the-use-of-a-pruned-modular-decomposition-for-maximum-matching-algorithms-on-some-graph-classes-1804.094072018-04-26 https://scifaro.com/en/abs/extensor-coding-1804.094482018-04-26 https://scifaro.com/en/abs/improved-algorithms-for-adaptive-compressed-sensing-1804.096732018-04-26 https://scifaro.com/en/abs/power-of-d-choices-with-simple-tabulation-1804.096842018-04-26 https://scifaro.com/en/abs/an-faster-network-motif-detection-tool-1804.097412018-04-27 https://scifaro.com/en/abs/on-the-structure-of-unique-shortest-paths-in-graphs-1804.097452018-10-18 https://scifaro.com/en/abs/analysis-of-a-canonical-labeling-algorithm-for-the-alignment-of-correlated-erd-h-o-s-r-enyi-graphs-1804.097582019-09-04 https://scifaro.com/en/abs/on-estimating-edit-distance-alignment-dimension-reduction-and-embeddings-1804.099072018-05-08 https://scifaro.com/en/abs/quantum-algorithm-for-dynamic-programming-approach-for-dags-applications-for-zhegalkin-polynomial-evaluation-and-some-problems-on-dags-1804.099502019-06-21 https://scifaro.com/en/abs/quickmergesort-practically-efficient-constant-factor-optimal-sorting-1804.100622018-04-27 https://scifaro.com/en/abs/efficient-and-adaptive-parameterized-algorithms-on-modular-decompositions-1804.101732018-04-27 https://scifaro.com/en/abs/edit-distance-between-unrooted-trees-in-cubic-time-1804.101862018-04-27 https://scifaro.com/en/abs/alternative-parameterizations-of-metric-dimension-1804.106702018-05-01 https://scifaro.com/en/abs/buffered-count-min-sketch-on-ssd-theory-and-experiments-1804.106732018-05-01 https://scifaro.com/en/abs/low-rank-approximation-in-the-presence-of-outliers-1804.106962018-05-14 https://scifaro.com/en/abs/qdr-tree-an-efficient-index-scheme-for-complex-spatial-keyword-query-1804.107262022-07-26 https://scifaro.com/en/abs/heavy-hitters-over-interval-queries-1804.107402018-11-15 https://scifaro.com/en/abs/new-algorithms-for-steiner-tree-reoptimization-1804.107912018-05-01 https://scifaro.com/en/abs/on-euclidean-k-means-clustering-with-alpha-center-proximity-1804.108272019-02-27 https://scifaro.com/en/abs/restricted-max-min-fair-allocation-1804.109022018-08-09 https://scifaro.com/en/abs/a-qptas-for-gapless-mec-1804.109302018-05-01 https://scifaro.com/en/abs/a-tight-approximation-for-submodular-maximization-with-mixed-packing-and-covering-constraints-1804.109472018-12-20 https://scifaro.com/en/abs/on-the-enumeration-of-maximal-delta-gamma-cliques-of-a-temporal-network-1804.109812018-05-01 https://scifaro.com/en/abs/a-subquadratic-algorithm-for-3xor-1804.110862018-05-01 https://scifaro.com/en/abs/colouring-p-r-p-s-free-graphs-1804.110912026-02-19 https://scifaro.com/en/abs/the-clustered-sparrow-algorithm-1804.111812026-04-13 https://scifaro.com/en/abs/on-improving-the-approximation-ratio-of-the-r-shortest-common-superstring-problem-1805.000602018-05-02 https://scifaro.com/en/abs/spectrally-robust-graph-isomorphism-1805.001812018-05-02 https://scifaro.com/en/abs/generic-single-edge-fault-tolerant-exact-distance-oracle-1805.001902018-05-02 https://scifaro.com/en/abs/nearly-optimal-distinct-elements-and-heavy-hitters-on-sliding-windows-1805.002122023-04-12 https://scifaro.com/en/abs/privately-learning-high-dimensional-distributions-1805.002162019-05-31 https://scifaro.com/en/abs/greedy-bipartite-matching-in-random-type-poisson-arrival-model-1805.005782018-05-03 https://scifaro.com/en/abs/the-story-of-hyperloglog-how-flajolet-processed-streams-with-coin-flips-1805.006122018-12-19 https://scifaro.com/en/abs/largest-weight-common-subtree-embeddings-with-distance-penalties-1805.008212018-05-03 https://scifaro.com/en/abs/maximum-cuts-in-edge-colored-graphs-1805.008582018-05-03 https://scifaro.com/en/abs/spectral-clustering-algorithms-for-the-detection-of-clusters-in-block-cyclic-and-block-acyclic-graphs-1805.008622018-05-09 https://scifaro.com/en/abs/how-to-secure-matchings-against-edge-failures-1805.012992018-12-06 https://scifaro.com/en/abs/efficiently-enumerating-hitting-sets-of-hypergraphs-arising-in-data-profiling-1805.013102021-10-25 https://scifaro.com/en/abs/scrambled-linear-pseudorandom-number-generators-1805.014072022-03-29 https://scifaro.com/en/abs/lower-and-upper-bound-for-computing-the-size-of-all-second-neighbourhoods-1805.016842018-05-07 https://scifaro.com/en/abs/detecting-mutations-by-ebwt-1805.018762018-05-11 https://scifaro.com/en/abs/dispatch-an-optimally-competitive-algorithm-for-maximum-online-perfect-bipartite-matching-with-i-i-d-arrivals-1805.020142019-06-03 https://scifaro.com/en/abs/approximate-minimum-selection-with-unreliable-comparisons-in-optimal-expected-time-1805.020332020-07-08 https://scifaro.com/en/abs/generalized-center-problems-with-outliers-1805.022172018-05-08 https://scifaro.com/en/abs/on-facility-location-with-general-lower-bounds-1805.022442018-05-08 https://scifaro.com/en/abs/nearly-efficient-algorithms-for-the-graph-matching-problem-on-correlated-random-graphs-1805.023492019-02-01 https://scifaro.com/en/abs/delta-1-coloring-in-the-congested-clique-model-1805.024572020-01-14 https://scifaro.com/en/abs/the-online-best-reply-algorithm-for-resource-allocation-problems-1805.025262019-07-18 https://scifaro.com/en/abs/dichotomy-results-for-classified-rank-maximal-matchings-and-popular-matchings-1805.028512018-10-09 https://scifaro.com/en/abs/massively-parallel-algorithms-for-finding-well-connected-components-in-sparse-graphs-1805.029742018-05-09 https://scifaro.com/en/abs/online-connected-dominating-set-leasing-1805.029942018-05-09 https://scifaro.com/en/abs/parallel-graph-connectivity-in-log-diameter-rounds-1805.030552018-05-09 https://scifaro.com/en/abs/round-hashing-for-data-storage-distributed-servers-and-external-memory-tables-1805.031582018-05-09 https://scifaro.com/en/abs/efficient-shortest-paths-in-scale-free-networks-with-underlying-hyperbolic-geometry-1805.032532022-03-17 https://scifaro.com/en/abs/optimally-sorting-evolving-data-1805.033502018-05-10 https://scifaro.com/en/abs/tight-bounds-for-undirected-graph-exploration-with-pebbles-and-multiple-agents-1805.034762018-05-10 https://scifaro.com/en/abs/deterministically-maintaining-a-2-epsilon-approximate-minimum-vertex-cover-in-o-1-epsilon-2-amortized-update-time-1805.034982018-07-13 https://scifaro.com/en/abs/minimum-segmentation-for-pan-genomic-founder-reconstruction-in-linear-time-1805.035742019-01-09 https://scifaro.com/en/abs/new-bounds-on-augmenting-steps-of-block-structured-integer-programs-1805.037412019-10-28 https://scifaro.com/en/abs/near-optimal-linear-algebra-in-the-online-and-sliding-window-models-1805.037652023-04-12 https://scifaro.com/en/abs/haplotype-aware-graph-indexes-1805.038342018-06-18 https://scifaro.com/en/abs/the-energy-complexity-of-diameter-and-minimum-cut-computation-in-bounded-genus-networks-1805.040712023-04-11 https://scifaro.com/en/abs/nearly-optimal-mergesorts-fast-practical-sorting-methods-that-optimally-adapt-to-existing-runs-1805.041542019-05-07 https://scifaro.com/en/abs/erasure-correction-for-noisy-radio-networks-1805.041652019-05-20 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-graph-modification-to-first-order-logic-properties-1805.043752019-02-27 https://scifaro.com/en/abs/capturing-complementarity-in-set-functions-by-going-beyond-submodularity-subadditivity-1805.044362018-11-29 https://scifaro.com/en/abs/distributed-minimum-vertex-coloring-and-maximum-independent-set-in-chordal-graphs-1805.045442018-05-15 https://scifaro.com/en/abs/peres-style-recursive-algorithms-1805.046102018-05-23 https://scifaro.com/en/abs/new-distributed-algorithms-in-almost-mixing-time-via-transformations-from-parallel-algorithms-1805.047642018-05-29 https://scifaro.com/en/abs/lock-free-search-data-structures-throughput-modelling-with-poisson-processes-1805.047942018-05-15 https://scifaro.com/en/abs/algorithms-and-complexity-of-range-clustering-1805.049842018-05-15 https://scifaro.com/en/abs/theoretically-efficient-parallel-graph-algorithms-can-be-fast-and-scalable-1805.052082019-08-22 https://scifaro.com/en/abs/assembling-omnitigs-using-hidden-order-de-bruijn-graphs-1805.052282018-05-15 https://scifaro.com/en/abs/on-the-approximability-of-the-stable-marriage-problem-with-one-sided-ties-1805.053912018-05-21 https://scifaro.com/en/abs/congested-clique-algorithms-for-graph-spanners-1805.054042018-05-16 https://scifaro.com/en/abs/online-interval-scheduling-to-maximize-total-satisfaction-1805.054362018-05-16 https://scifaro.com/en/abs/quadratic-time-algorithms-appear-to-be-optimal-for-sorting-evolving-data-1805.054432018-05-16 https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-some-matching-problems-under-the-color-spanning-model-1805.054482018-05-16 https://scifaro.com/en/abs/parallel-write-efficient-algorithms-and-data-structures-for-computational-geometry-1805.055922018-07-12 https://scifaro.com/en/abs/parallel-working-set-search-structures-1805.057872018-07-12 https://scifaro.com/en/abs/improved-worst-case-deterministic-parallel-dynamic-minimum-spanning-forest-1805.061512018-05-17 https://scifaro.com/en/abs/on-computing-average-common-substring-over-run-length-encoded-sequences-1805.061772018-05-17 https://scifaro.com/en/abs/on-fair-division-of-indivisible-items-1805.062322019-05-13 https://scifaro.com/en/abs/max-product-for-maximum-weight-matching-revisited-1805.062822018-05-17 https://scifaro.com/en/abs/short-schedules-for-fast-flow-rerouting-1805.063152018-05-22 https://scifaro.com/en/abs/wireless-coverage-prediction-via-parametric-shortest-paths-1805.064202018-05-17 https://scifaro.com/en/abs/dual-parameterization-of-weighted-coloring-1805.066992018-05-18 https://scifaro.com/en/abs/external-memory-bwt-and-lcp-computation-for-sequence-collections-with-applications-1805.068212020-09-10 https://scifaro.com/en/abs/deleting-edges-to-restrict-the-size-of-an-epidemic-in-temporal-networks-1805.068362021-02-12 https://scifaro.com/en/abs/revisiting-the-tree-edit-distance-and-its-backtracing-a-tutorial-1805.068692022-09-15 https://scifaro.com/en/abs/coding-for-interactive-communication-with-small-memory-and-applications-to-robust-circuits-1805.068722019-07-25 https://scifaro.com/en/abs/fast-maximization-of-non-submodular-monotonic-functions-on-the-integer-lattice-1805.069902018-05-21 https://scifaro.com/en/abs/multivariate-analysis-of-orthogonal-range-searching-and-graph-distances-parameterized-by-treewidth-1805.071352018-05-21 https://scifaro.com/en/abs/subset-feedback-vertex-set-on-graphs-of-bounded-independent-set-size-1805.071412018-05-21 https://scifaro.com/en/abs/deterministic-distributed-ruling-sets-of-line-graphs-1805.072092018-05-21 https://scifaro.com/en/abs/fast-approximation-of-centrality-and-distances-in-hyperbolic-graphs-1805.072322018-05-21 https://scifaro.com/en/abs/dynamic-monopolies-in-reversible-bootstrap-percolation-1805.073922019-05-20 https://scifaro.com/en/abs/subspace-selection-via-dr-submodular-maximization-on-lattices-1805.074552018-05-22 https://scifaro.com/en/abs/an-optimal-approximation-of-discrete-random-variables-with-respect-to-the-kolmogorov-distance-1805.075352018-05-22 https://scifaro.com/en/abs/on-testing-substitutability-1805.076422018-05-22 https://scifaro.com/en/abs/a-ptas-for-a-class-of-stochastic-dynamic-programs-1805.077422018-05-22 https://scifaro.com/en/abs/distributed-approximation-of-minimum-k-edge-connected-spanning-subgraphs-1805.077642018-05-22 https://scifaro.com/en/abs/randomized-strategies-for-robust-combinatorial-optimization-1805.078092018-05-22 https://scifaro.com/en/abs/a-frac-5-2-approximation-algorithm-for-coloring-rooted-subtrees-of-a-degree-3-tree-1805.078672018-05-22 https://scifaro.com/en/abs/the-adaptive-sampling-revisited-1805.080432019-05-17 https://scifaro.com/en/abs/distributed-algorithms-for-directed-betweenness-centrality-and-all-pairs-shortest-paths-1805.081242019-02-06 https://scifaro.com/en/abs/algorithmic-and-algebraic-aspects-of-unshuffling-permutations-1805.082552018-05-23 https://scifaro.com/en/abs/on-coresets-for-logistic-regression-1805.085712021-03-09 https://scifaro.com/en/abs/on-the-worst-case-complexity-of-timsort-1805.086122019-07-09 https://scifaro.com/en/abs/copmem-finding-maximal-exact-matches-via-sampling-both-genomes-1805.088162018-05-24 https://scifaro.com/en/abs/maximal-and-maximum-transitive-relation-contained-in-a-given-binary-relation-1805.089532018-05-24 https://scifaro.com/en/abs/online-shortest-paths-with-confidence-intervals-for-routing-in-a-time-varying-random-network-1805.092612018-05-24 https://scifaro.com/en/abs/optimal-hashing-in-external-memory-1805.094232018-05-25 https://scifaro.com/en/abs/incomplete-nested-dissection-1805.094422018-05-25 https://scifaro.com/en/abs/hierarchical-clustering-with-structural-constraints-1805.094762018-07-17 https://scifaro.com/en/abs/optimal-algorithms-for-continuous-non-monotone-submodular-and-dr-submodular-maximization-1805.094802018-05-25 https://scifaro.com/en/abs/non-preemptive-flow-time-minimization-via-rejections-1805.096022018-05-25 https://scifaro.com/en/abs/learning-and-testing-causal-models-with-interventions-1805.096972018-05-25 https://scifaro.com/en/abs/semi-random-graphs-with-planted-sparse-vertex-cuts-algorithms-for-exact-and-approximate-recovery-1805.097472018-05-25 https://scifaro.com/en/abs/super-stability-in-the-student-project-allocation-problem-with-ties-1805.098872020-08-04 https://scifaro.com/en/abs/longest-unbordered-factor-in-quasilinear-time-1805.099242018-07-03 https://scifaro.com/en/abs/improved-approximation-for-node-disjoint-paths-in-grids-with-sources-on-the-boundary-1805.099562018-05-28 https://scifaro.com/en/abs/algorithms-for-anti-powers-in-strings-1805.100422018-05-28 https://scifaro.com/en/abs/strong-link-between-bwt-and-xbw-via-aho-corasick-automaton-and-applications-to-run-length-encoding-1805.100702021-11-18 https://scifaro.com/en/abs/distributed-treewidth-computation-and-courcelle-s-theorem-in-the-congest-model-1805.107082025-07-16 https://scifaro.com/en/abs/a-note-on-block-and-bridge-preserving-maximum-common-subgraph-algorithms-for-outerplanar-graphs-1805.107542018-12-07 https://scifaro.com/en/abs/high-probability-frequency-moment-sketches-1805.108852018-05-29 https://scifaro.com/en/abs/evolutionary-algorithms-and-submodular-functions-benefits-of-heavy-tailed-mutations-1805.109022018-11-22 https://scifaro.com/en/abs/fast-random-integer-generation-in-an-interval-1805.109412019-06-10 https://scifaro.com/en/abs/strongly-polynomial-efficient-approximation-scheme-for-segmentation-1805.111702019-02-06 https://scifaro.com/en/abs/on-maximization-of-weakly-modular-functions-guarantees-of-multi-stage-algorithms-tractability-and-hardness-1805.112512019-10-04 https://scifaro.com/en/abs/succinct-data-structure-for-dynamic-trees-with-faster-queries-1805.112552018-05-30 https://scifaro.com/en/abs/more-applications-of-the-d-neighbor-equivalence-acyclicity-and-connectivity-constraints-1805.112752023-10-10 https://scifaro.com/en/abs/scheduling-under-dynamic-speed-scaling-for-minimizing-weighted-completion-time-and-energy-consumption-1805.112972018-05-30 https://scifaro.com/en/abs/space-efficient-dfs-and-applications-simpler-leaner-faster-1805.118642018-05-31 https://scifaro.com/en/abs/graph-sparsification-spectral-sketches-and-faster-resistance-computation-via-short-cycle-decompositions-1805.120512018-05-31 https://scifaro.com/en/abs/opinion-forming-in-erdos-renyi-random-graph-and-expanders-1805.121722018-09-11 https://scifaro.com/en/abs/a-faster-hafnian-formula-for-complex-matrices-and-its-benchmarking-on-a-supercomputer-1805.124982019-05-02 https://scifaro.com/en/abs/block-palindromes-a-new-generalization-of-palindromes-1806.001982018-08-07 https://scifaro.com/en/abs/joint-size-and-depth-optimization-of-sorting-networks-1806.003052018-06-04 https://scifaro.com/en/abs/on-minrank-and-forbidden-subgraphs-1806.006382018-06-05 https://scifaro.com/en/abs/minmax-regret-1-sink-for-aggregate-evacuation-time-on-path-networks-1806.008142018-06-05 https://scifaro.com/en/abs/principled-network-reliability-approximation-a-counting-based-approach-1806.009172019-05-03 https://scifaro.com/en/abs/covering-with-clubs-complexity-and-approximability-1806.011192018-06-05 https://scifaro.com/en/abs/labeling-algorithm-and-compact-routing-scheme-for-a-small-world-network-model-1806.014692019-11-13 https://scifaro.com/en/abs/graph-compression-using-pattern-matching-techniques-1806.015042018-06-06 https://scifaro.com/en/abs/dynamic-programming-optimization-in-line-of-sight-networks-1806.015812018-06-06 https://scifaro.com/en/abs/fast-dynamic-programming-on-graph-decompositions-1806.016672018-06-06 https://scifaro.com/en/abs/survey-and-taxonomy-of-lossless-graph-compression-and-space-efficient-graph-representations-1806.017992019-04-30 https://scifaro.com/en/abs/tree-path-majority-data-structures-1806.018042018-09-10 https://scifaro.com/en/abs/another-proof-of-cuckoo-hashing-with-new-variants-1806.020042018-06-07 https://scifaro.com/en/abs/online-makespan-minimization-the-power-of-restart-1806.022072018-06-07 https://scifaro.com/en/abs/alignment-free-sequence-comparison-using-absent-words-1806.027182018-06-08 https://scifaro.com/en/abs/optimal-design-of-process-flexibility-for-general-production-systems-1806.028942018-06-11 https://scifaro.com/en/abs/robust-node-generation-for-meshfree-discretizations-on-irregular-domains-and-surfaces-1806.029722018-06-11 https://scifaro.com/en/abs/compressed-communication-complexity-of-longest-common-prefixes-1806.031022018-06-11 https://scifaro.com/en/abs/the-well-tempered-lasso-1806.031902018-06-11 https://scifaro.com/en/abs/distributed-algorithms-for-minimum-degree-spanning-trees-1806.033652018-06-12 https://scifaro.com/en/abs/on-closeness-to-k-wise-uniformity-1806.035692018-06-12 https://scifaro.com/en/abs/cucotrack-cuckoo-filter-based-connection-tracking-1806.036112018-06-12 https://scifaro.com/en/abs/a-new-quadratic-time-number-theoretic-algorithm-to-solve-matrix-multiplication-problem-1806.037012019-01-30 https://scifaro.com/en/abs/deterministic-min-cost-matching-with-delays-1806.037082018-08-08 https://scifaro.com/en/abs/minmax-regret-k-sink-location-on-a-dynamic-tree-network-with-uniform-capacities-1806.038142025-07-28 https://scifaro.com/en/abs/scalable-approximation-algorithm-for-graph-summarization-1806.039362018-06-12 https://scifaro.com/en/abs/perturbation-resilient-clustering-for-k-center-and-related-problems-via-lp-relaxations-1806.042022018-06-13 https://scifaro.com/en/abs/efficient-enumeration-of-subgraphs-and-induced-subgraphs-with-bounded-girth-1806.043072018-09-21 https://scifaro.com/en/abs/mission-ultra-large-scale-feature-selection-using-count-sketches-1806.043102018-06-13 https://scifaro.com/en/abs/computing-directed-path-width-and-directed-tree-width-of-recursively-defined-digraphs-1806.044572018-06-13 https://scifaro.com/en/abs/minimum-shared-power-edge-cut-1806.047422018-06-14 https://scifaro.com/en/abs/o-n-log-n-time-text-compression-by-lz-style-longest-first-substitution-1806.048902018-06-14 https://scifaro.com/en/abs/stability-and-complexity-of-mixed-discriminants-1806.051052019-04-19 https://scifaro.com/en/abs/efficient-and-modular-coalgebraic-partition-refinement-1806.056542023-06-22 https://scifaro.com/en/abs/computation-aware-data-aggregation-1806.057012019-11-14 https://scifaro.com/en/abs/enhanced-string-factoring-from-alphabet-orderings-1806.059422018-06-18 https://scifaro.com/en/abs/solving-k-1-stable-instances-of-k-terminal-cut-with-isolating-cuts-1806.060912019-10-03 https://scifaro.com/en/abs/tight-bound-of-incremental-cover-trees-for-dynamic-diversification-1806.061262018-06-19 https://scifaro.com/en/abs/fast-distance-sensitivity-oracle-for-multiple-failures-1806.061822018-06-19 https://scifaro.com/en/abs/advice-complexity-of-priority-algorithms-1806.062232018-07-31 https://scifaro.com/en/abs/approximate-submodular-functions-and-performance-guarantees-1806.063232018-06-19 https://scifaro.com/en/abs/greedy-and-local-ratio-algorithms-in-the-mapreduce-model-1806.064212018-06-19 https://scifaro.com/en/abs/on-sketching-the-q-to-p-norms-1806.064292018-06-19 https://scifaro.com/en/abs/subspace-embedding-and-linear-regression-with-orlicz-norm-1806.064302018-06-19 https://scifaro.com/en/abs/mining-frequent-items-in-unstructured-p2p-networks-1806.065802018-10-18 https://scifaro.com/en/abs/a-flow-formulation-for-horizontal-coordinate-assignment-with-prescribed-width-1806.066172018-08-10 https://scifaro.com/en/abs/formulations-for-designing-robust-networks-an-application-to-wind-power-collection-1806.067042018-06-19 https://scifaro.com/en/abs/zip-trees-1806.067262022-02-23 https://scifaro.com/en/abs/matching-observations-to-distributions-efficient-estimation-via-sparsified-hungarian-algorithm-1806.067662019-10-01 https://scifaro.com/en/abs/deterministic-o-1-approximation-algorithms-to-1-center-clustering-with-outliers-1806.073562018-09-28 https://scifaro.com/en/abs/a-unifying-method-for-the-design-of-algorithms-canonizing-combinatorial-objects-1806.074662019-04-09 https://scifaro.com/en/abs/counting-shortest-two-disjoint-paths-in-cubic-planar-graphs-with-an-nc-algorithm-1806.075862018-06-21 https://scifaro.com/en/abs/a-faster-external-memory-priority-queue-with-decreasekeys-1806.075982018-06-21 https://scifaro.com/en/abs/the-compressions-of-reticulation-visible-networks-are-tree-child-1806.076252019-03-05 https://scifaro.com/en/abs/an-output-sensitive-algorithm-for-the-minimization-of-2-dimensional-string-covers-1806.081312019-05-03 https://scifaro.com/en/abs/hardness-and-algorithmic-results-for-the-approximate-cover-problem-1806.081352018-06-22 https://scifaro.com/en/abs/instance-optimality-in-the-noisy-value-and-comparison-model-accept-accept-strong-accept-which-papers-get-in-1806.081822018-11-06 https://scifaro.com/en/abs/a-connection-between-string-covers-and-cover-deterministic-finite-tree-automata-minimization-1806.082322018-06-22 https://scifaro.com/en/abs/cycles-to-the-rescue-novel-constraints-to-compute-maximum-planar-subgraphs-fast-1806.082832018-06-22 https://scifaro.com/en/abs/shortest-reconfiguration-sequence-for-sliding-tokens-on-spiders-1806.082912019-05-22 https://scifaro.com/en/abs/improved-bounds-for-multipass-pairing-heaps-and-path-balanced-binary-search-trees-1806.086922018-06-25 https://scifaro.com/en/abs/a-nearly-linear-bound-for-chasing-nested-convex-bodies-1806.088652018-11-16 https://scifaro.com/en/abs/approximating-the-shortest-path-problem-with-scenarios-1806.089362024-09-18 https://scifaro.com/en/abs/on-r-simple-k-path-and-related-problems-parameterized-by-k-r-1806.091082020-10-26 https://scifaro.com/en/abs/on-nondeterministic-derandomization-of-freivalds-algorithm-consequences-avenues-and-algorithmic-progress-1806.091892018-06-26 https://scifaro.com/en/abs/optimal-online-contention-resolution-schemes-via-ex-ante-prophet-inequalities-1806.092512018-06-26 https://scifaro.com/en/abs/a-new-benchmark-set-for-traveling-salesman-problem-and-hamiltonian-cycle-problem-1806.092852018-06-26 https://scifaro.com/en/abs/parameterized-algorithms-and-data-reduction-for-the-short-secluded-s-t-path-problem-1806.095402020-10-05 https://scifaro.com/en/abs/maximum-rooted-connected-expansion-1806.095492018-06-26 https://scifaro.com/en/abs/fast-entropy-bounded-string-dictionary-look-up-with-mismatches-1806.096462018-06-27 https://scifaro.com/en/abs/data-reduction-for-maximum-matching-on-real-world-graphs-theory-and-experiments-1806.096832021-05-10 https://scifaro.com/en/abs/linear-time-online-algorithm-inferring-the-shortest-path-from-a-walk-1806.098062019-02-22 https://scifaro.com/en/abs/beyond-worst-case-analysis-1806.098172018-06-27 https://scifaro.com/en/abs/approximate-nearest-neighbor-search-in-high-dimensions-1806.098232018-06-27 https://scifaro.com/en/abs/finding-a-maximum-weight-convex-set-in-a-chordal-graph-1806.099922018-06-27 https://scifaro.com/en/abs/fully-dynamic-maximal-independent-set-with-sublinear-in-n-update-time-1806.100512018-06-27 https://scifaro.com/en/abs/practical-access-to-dynamic-programming-on-tree-decompositions-1806.101762018-06-28 https://scifaro.com/en/abs/listing-all-maximal-k-plexes-in-temporal-graphs-1806.102102019-07-29 https://scifaro.com/en/abs/online-matching-in-a-ride-sharing-platform-1806.103272018-06-28 https://scifaro.com/en/abs/algorithmic-building-blocks-for-asymmetric-memories-1806.103702018-06-28 https://scifaro.com/en/abs/dynamic-trees-with-almost-optimal-access-cost-1806.104982018-06-28 https://scifaro.com/en/abs/computing-the-chromatic-number-using-graph-decompositions-via-matrix-rank-1806.105012018-06-28 https://scifaro.com/en/abs/sublinear-time-quadratic-minimization-via-spectral-decomposition-of-matrices-1806.106262018-06-29 https://scifaro.com/en/abs/the-stochastic-score-classification-problem-1806.106602018-06-29 https://scifaro.com/en/abs/decremental-spqr-trees-for-planar-graphs-1806.107722018-06-29 https://scifaro.com/en/abs/k-p-planarity-a-relaxation-of-hybrid-planarity-1806.114132018-09-25 https://scifaro.com/en/abs/representative-families-for-matroid-intersections-with-applications-to-location-packing-and-covering-problems-1806.115272021-09-14 https://scifaro.com/en/abs/high-dimensional-discrete-integration-over-the-hypergrid-1806.115422019-06-27 https://scifaro.com/en/abs/algorithmic-pirogov-sinai-theory-1806.115482023-06-19 https://scifaro.com/en/abs/deciding-the-closure-of-inconsistent-rooted-triples-is-np-complete-1807.000302018-07-03 https://scifaro.com/en/abs/approximate-nearest-neighbors-in-limited-space-1807.001122018-07-03 https://scifaro.com/en/abs/an-optimal-algorithm-for-2-bounded-delay-buffer-management-with-lookahead-1807.001212018-07-03 https://scifaro.com/en/abs/fast-characterization-of-segmental-duplications-in-genome-assemblies-1807.002052018-09-25 https://scifaro.com/en/abs/representation-of-ordered-trees-with-a-given-degree-distribution-1807.003712018-07-03 https://scifaro.com/en/abs/distributed-statistical-estimation-of-matrix-products-with-applications-1807.008782018-07-04 https://scifaro.com/en/abs/log-concave-polynomials-i-entropy-and-a-deterministic-approximation-algorithm-for-counting-bases-of-matroids-1807.009292018-11-06 https://scifaro.com/en/abs/variable-neighborhood-search-for-partitioning-sparse-biological-networks-into-the-maximum-edge-weighted-k-plexes-1807.011602019-10-25 https://scifaro.com/en/abs/approximation-algorithms-for-probabilistic-graphs-1807.011912018-07-10 https://scifaro.com/en/abs/ortho-polygon-visibility-representations-of-3-connected-1-plane-graphs-1807.012472018-08-03 https://scifaro.com/en/abs/a-novel-algorithm-for-the-all-best-swap-edge-problem-on-tree-spanners-1807.012602018-10-03 https://scifaro.com/en/abs/near-optimal-distance-emulator-for-planar-graphs-1807.014782018-07-05 https://scifaro.com/en/abs/tight-bounds-for-popping-algorithms-1807.016802018-12-14 https://scifaro.com/en/abs/optimal-ball-recycling-1807.018042018-11-05 https://scifaro.com/en/abs/partitioning-vectors-into-quadruples-worst-case-analysis-of-a-matching-based-algorithm-1807.019622018-07-06 https://scifaro.com/en/abs/analysis-of-nederlof-s-algorithm-for-subset-sum-1807.020752018-07-09 https://scifaro.com/en/abs/differentially-private-online-submodular-optimization-1807.022902018-07-09 https://scifaro.com/en/abs/flow-time-optimization-for-concurrent-open-shop-and-precedence-constrained-scheduling-models-1807.025532018-07-10 https://scifaro.com/en/abs/leveraging-well-conditioned-bases-streaming-distributed-summaries-in-minkowski-p-norms-1807.025712018-07-10 https://scifaro.com/en/abs/new-algorithms-for-subset-sum-problem-1807.026112018-07-17 https://scifaro.com/en/abs/efficient-reassembling-of-three-regular-planar-graphs-1807.034792018-07-11 https://scifaro.com/en/abs/theoretical-model-of-computation-and-algorithms-for-fpga-based-hardware-accelerators-1807.036112018-11-19 https://scifaro.com/en/abs/a-note-on-the-integrality-gap-of-the-configuration-lp-for-restricted-santa-claus-1807.036262018-07-11 https://scifaro.com/en/abs/improved-space-time-tradeoffs-for-ksum-1807.037182018-07-11 https://scifaro.com/en/abs/on-the-complexity-of-the-approximate-nearest-colored-node-problem-1807.037212019-01-14 https://scifaro.com/en/abs/constructing-concrete-hard-instances-of-the-maximum-independent-set-problem-1807.037392019-11-11 https://scifaro.com/en/abs/improved-time-and-space-bounds-for-dynamic-range-mode-1807.038272018-07-12 https://scifaro.com/en/abs/online-facility-location-with-deletions-1807.038392018-07-12 https://scifaro.com/en/abs/scalable-katz-ranking-computation-in-large-static-and-dynamic-graphs-1807.038472018-07-12 https://scifaro.com/en/abs/integrality-gap-of-the-configuration-lp-for-the-restricted-max-min-fair-allocation-1807.041522018-07-12 https://scifaro.com/en/abs/a-fixed-parameter-linear-time-algorithm-for-maximum-flow-in-planar-flow-networks-1807.041862018-07-12 https://scifaro.com/en/abs/a-framework-for-vehicle-routing-approximation-schemes-in-trees-1807.043082019-02-27 https://scifaro.com/en/abs/sliding-window-order-statistics-in-sublinear-space-1807.044002018-07-13 https://scifaro.com/en/abs/metrical-task-systems-on-trees-via-mirror-descent-and-unfair-gluing-1807.044042020-11-30 https://scifaro.com/en/abs/fast-exact-algorithms-using-hadamard-product-of-polynomials-1807.044962020-06-03 https://scifaro.com/en/abs/turning-big-data-into-tiny-data-constant-size-coresets-for-k-means-pca-and-projective-clustering-1807.045182018-07-13 https://scifaro.com/en/abs/a-new-graph-modelisation-for-molecule-similarity-1807.045282018-07-13 https://scifaro.com/en/abs/algorithmic-meta-theorems-for-monotone-submodular-maximization-1807.045752018-07-13 https://scifaro.com/en/abs/benchmarking-treewidth-as-a-practical-component-of-tensor-network-based-quantum-simulation-1807.045992019-03-06 https://scifaro.com/en/abs/push-down-trees-optimal-self-adjusting-complete-trees-1807.046132020-04-07 https://scifaro.com/en/abs/know-when-to-fold-em-self-assembly-of-shapes-by-folding-in-oritatami-1807.046822018-07-16 https://scifaro.com/en/abs/a-faster-algorithm-for-minimum-cost-bipartite-matching-in-minor-free-graphs-1807.048022018-07-16 https://scifaro.com/en/abs/algorithms-for-bis-hard-problems-on-expander-graphs-1807.048042020-03-25 https://scifaro.com/en/abs/fast-modular-subset-sum-using-linear-sketching-1807.048252018-07-16 https://scifaro.com/en/abs/linear-pseudo-polynomial-factor-algorithm-for-automaton-constrained-tree-knapsack-problem-1807.049422018-09-18 https://scifaro.com/en/abs/no-regret-algorithms-for-online-k-submodular-maximization-1807.049652018-07-16 https://scifaro.com/en/abs/spectral-sparsification-of-hypergraphs-1807.049742018-07-16 https://scifaro.com/en/abs/maintaning-maximal-matching-with-lookahead-1807.050092018-07-16 https://scifaro.com/en/abs/optimal-short-circuit-resilient-formulas-1807.050142022-08-04 https://scifaro.com/en/abs/optimal-algorithms-for-right-sizing-data-centers-extended-version-1807.051122021-08-02 https://scifaro.com/en/abs/mean-isoperimetry-with-control-on-outliers-exact-and-approximation-algorithms-1807.051252021-07-30 https://scifaro.com/en/abs/optimal-lower-bounds-for-distributed-and-streaming-spanning-forest-computation-1807.051352019-11-27 https://scifaro.com/en/abs/on-the-number-of-circuits-in-regular-matroids-with-connections-to-lattices-and-codes-1807.051642018-11-21 https://scifaro.com/en/abs/approximation-algorithms-for-clustering-via-weighted-impurity-measures-1807.052412018-07-17 https://scifaro.com/en/abs/a-matching-based-heuristic-algorithm-for-school-bus-routing-problems-1807.053112018-10-01 https://scifaro.com/en/abs/token-sliding-on-split-graphs-1807.053222019-01-29 https://scifaro.com/en/abs/a-simple-and-space-efficient-segment-tree-implementation-1807.053562018-07-17 https://scifaro.com/en/abs/matching-and-mis-for-uniformly-sparse-graphs-in-the-low-memory-mpc-model-1807.053742018-07-20 https://scifaro.com/en/abs/sat-encodings-for-sorting-networks-single-exception-sorting-networks-and-epsilon-halvers-1807.053772018-07-17 https://scifaro.com/en/abs/exact-algorithms-and-lower-bounds-for-stable-instances-of-euclidean-k-means-1807.054432024-02-01 https://scifaro.com/en/abs/online-submodular-maximization-beating-1-2-made-simple-1807.055292018-11-20 https://scifaro.com/en/abs/deterministic-1-2-epsilon-approximation-for-submodular-maximization-over-a-matroid-1807.055322018-07-17 https://scifaro.com/en/abs/a-new-lower-bound-for-classic-online-bin-packing-1807.055542018-07-17 https://scifaro.com/en/abs/improving-the-smoothed-complexity-of-flip-for-max-cut-problems-1807.056652018-07-17 https://scifaro.com/en/abs/faster-algorithms-for-all-pairs-bounded-min-cuts-1807.058032019-02-25 https://scifaro.com/en/abs/exact-distance-oracles-for-planar-graphs-with-failing-vertices-1807.059682021-08-31 https://scifaro.com/en/abs/a-ptas-for-ell-p-low-rank-approximation-1807.061012021-02-09 https://scifaro.com/en/abs/anaconda-a-non-adaptive-conditional-sampling-algorithm-for-distribution-testing-1807.061682018-11-06 https://scifaro.com/en/abs/waring-rank-parameterized-and-exact-algorithms-1807.061942019-06-10 https://scifaro.com/en/abs/sparsifying-distributed-algorithms-with-ramifications-in-massively-parallel-computation-and-centralized-local-computation-1807.062512018-07-18 https://scifaro.com/en/abs/almost-optimal-query-algorithm-for-hitting-set-using-a-subset-query-1807.062722023-05-09 https://scifaro.com/en/abs/using-statistical-encoding-to-achieve-tree-succinctness-never-seen-before-1807.063592018-07-18 https://scifaro.com/en/abs/tracking-the-ell-2-norm-with-constant-update-time-1807.064792019-09-02 https://scifaro.com/en/abs/dynamic-sampling-from-graphical-models-1807.064812018-11-15 https://scifaro.com/en/abs/optimization-of-the-n-dimensional-sliding-window-inter-channel-correlation-algorithm-for-multi-core-architecture-1807.065072018-07-18 https://scifaro.com/en/abs/distributed-triangle-detection-via-expander-decomposition-1807.066242018-07-19 https://scifaro.com/en/abs/the-online-k-taxi-problem-1807.066452018-11-07 https://scifaro.com/en/abs/derandomizing-the-lovasz-local-lemma-via-log-space-statistical-tests-1807.066722019-09-20 https://scifaro.com/en/abs/deterministic-oblivious-distribution-and-tight-compaction-in-linear-time-1807.067192018-07-19 https://scifaro.com/en/abs/the-scheduler-is-very-powerful-in-competitive-analysis-of-distributed-list-accessing-1807.068202018-07-19 https://scifaro.com/en/abs/an-information-theoretic-framework-for-the-lossy-compression-of-link-streams-1807.068742018-07-19 https://scifaro.com/en/abs/time-bounded-influence-diffusion-with-incentives-1807.069212018-07-19 https://scifaro.com/en/abs/the-parameterised-complexity-of-computing-the-maximum-modularity-of-a-graph-1807.069652022-12-22 https://scifaro.com/en/abs/quantified-boolean-formula-problem-1807.070052018-07-23 https://scifaro.com/en/abs/learning-sums-of-independent-random-variables-with-sparse-collective-support-1807.070132020-11-13 https://scifaro.com/en/abs/a-fixed-parameter-linear-time-algorithm-to-compute-principal-typings-of-planar-flow-networks-1807.070672018-07-20 https://scifaro.com/en/abs/reconstructing-latent-orderings-by-spectral-clustering-1807.071222018-07-20 https://scifaro.com/en/abs/fast-and-deterministic-approximations-for-k-cut-1807.071432018-11-20 https://scifaro.com/en/abs/approximation-schemes-for-low-rank-binary-matrix-approximation-problems-1807.071562018-07-20 https://scifaro.com/en/abs/a-phi-competitive-algorithm-for-scheduling-packets-with-deadlines-1807.071772023-10-24 https://scifaro.com/en/abs/a-tale-of-santa-claus-hypergraphs-and-matroids-1807.071892026-01-06 https://scifaro.com/en/abs/prophet-secretary-through-blind-strategies-1807.074832019-03-13 https://scifaro.com/en/abs/exact-algorithms-for-finding-well-connected-2-clubs-in-real-world-graphs-theory-and-experiments-1807.075162018-12-24 https://scifaro.com/en/abs/optimal-las-vegas-approximate-near-neighbors-in-ell-p-1807.075272018-07-20 https://scifaro.com/en/abs/the-colored-longest-common-prefix-array-computed-via-sequential-scans-1807.075962018-07-23 https://scifaro.com/en/abs/generalized-metric-repair-on-graphs-1807.076192018-07-23 https://scifaro.com/en/abs/quasi-polynomial-time-approximation-schemes-for-packing-and-covering-problems-in-planar-graphs-1807.076262018-07-23 https://scifaro.com/en/abs/multi-resolution-hashing-for-fast-pairwise-summations-1807.076352018-11-06 https://scifaro.com/en/abs/coloring-in-graph-streams-1807.076402018-07-26 https://scifaro.com/en/abs/distributed-local-approximation-algorithms-for-maximum-matching-in-graphs-and-hypergraphs-1807.076452023-10-13 https://scifaro.com/en/abs/on-euclidean-methods-for-cubic-and-quartic-jacobi-symbols-1807.077192018-07-23 https://scifaro.com/en/abs/biclustering-using-modified-matrix-bandwidth-minimization-and-biogeography-based-optimization-1807.078302018-07-23 https://scifaro.com/en/abs/submodular-maximization-with-nearly-optimal-approximation-adaptivity-and-query-complexity-1807.078892023-04-11 https://scifaro.com/en/abs/about-birds-project-bioinformatics-and-information-retrieval-data-structures-analysis-and-design-1807.079372018-07-23 https://scifaro.com/en/abs/red-blue-partitioned-mst-tsp-and-matching-1807.080652018-07-26 https://scifaro.com/en/abs/faster-exact-and-approximate-algorithms-for-k-cut-1807.081442019-03-22 https://scifaro.com/en/abs/subset-sum-made-simple-1807.082482018-07-24 https://scifaro.com/en/abs/independent-sets-in-vertex-arrival-streams-1807.083312018-07-24 https://scifaro.com/en/abs/on-minimum-connecting-transition-sets-in-graphs-1807.084632018-08-06 https://scifaro.com/en/abs/batch-sparse-recovery-or-how-to-leverage-the-average-sparsity-1807.084782018-07-24 https://scifaro.com/en/abs/set-cover-with-delay-clairvoyance-is-not-required-1807.085432020-06-24 https://scifaro.com/en/abs/an-improved-speedup-factor-for-sporadic-tasks-with-constrained-deadlines-under-dynamic-priority-scheduling-1807.085792018-07-24 https://scifaro.com/en/abs/submodular-function-maximization-in-parallel-via-the-multilinear-relaxation-1807.086782018-11-20 https://scifaro.com/en/abs/random-sampling-applied-to-the-mst-problem-in-the-node-congested-clique-model-1807.087382018-08-28 https://scifaro.com/en/abs/round-compression-for-parallel-graph-algorithms-in-strongly-sublinear-space-1807.087452018-07-24 https://scifaro.com/en/abs/a-deterministic-distributed-algorithm-for-weighted-all-pairs-shortest-paths-through-pipelining-1807.088242018-10-24 https://scifaro.com/en/abs/sublinear-algorithms-for-delta-1-vertex-coloring-1807.088862019-01-08 https://scifaro.com/en/abs/revisiting-the-challenges-of-maxclique-1807.090912023-05-26 https://scifaro.com/en/abs/zeros-of-holant-problems-locations-and-algorithms-1807.091292018-08-07 https://scifaro.com/en/abs/metric-sublinear-algorithms-via-linear-sampling-1807.093022018-07-26 https://scifaro.com/en/abs/shortest-path-queries-graph-partitioning-and-covering-problems-in-worst-and-beyond-worst-case-settings-1807.093892018-07-26 https://scifaro.com/en/abs/efficient-algorithms-for-robust-submodular-maximization-under-matroid-constraints-1807.094052018-07-26 https://scifaro.com/en/abs/shared-memory-parallel-maximal-clique-enumeration-1807.094172020-01-30 https://scifaro.com/en/abs/directory-reconciliation-1807.096862018-07-26 https://scifaro.com/en/abs/robust-set-reconciliation-via-locality-sensitive-hashing-1807.096942018-07-26 https://scifaro.com/en/abs/improving-the-integrality-gap-for-multiway-cut-1807.097352018-11-22 https://scifaro.com/en/abs/a-polynomial-time-constant-approximation-for-minimizing-total-weighted-flow-time-1807.098852018-07-27 https://scifaro.com/en/abs/mildly-exponential-time-approximation-algorithms-for-vertex-cover-uniform-sparsest-cut-and-related-problems-1807.098982018-07-27 https://scifaro.com/en/abs/faster-recovery-of-approximate-periods-over-edit-distance-1807.104832018-07-30 https://scifaro.com/en/abs/alternating-path-and-coloured-clustering-1807.105312018-07-30 https://scifaro.com/en/abs/the-impact-of-information-in-greedy-submodular-maximization-1807.106392019-01-11 https://scifaro.com/en/abs/solving-target-set-selection-with-bounded-thresholds-faster-than-2-n-1807.107892018-09-07 https://scifaro.com/en/abs/a-hybrid-quantum-classical-paradigm-to-mitigate-embedding-costs-in-quantum-annealing-abridged-version-1807.111352018-07-31 https://scifaro.com/en/abs/guidesort-simpler-optimal-deterministic-sorting-for-the-parallel-disk-model-1807.113282019-02-18 https://scifaro.com/en/abs/vertex-covers-revisited-indirect-certificates-and-fpt-algorithms-1807.113392018-07-31 https://scifaro.com/en/abs/high-dimensional-estimation-via-sum-of-squares-proofs-1807.114192019-08-07 https://scifaro.com/en/abs/non-monotone-submodular-maximization-in-exponentially-fewer-iterations-1807.114622018-07-31 https://scifaro.com/en/abs/on-approximating-sparse-covering-integer-programs-1807.115382018-11-20 https://scifaro.com/en/abs/a-simple-near-linear-pseudopolynomial-time-randomized-algorithm-for-subset-sum-1807.115972020-01-03 https://scifaro.com/en/abs/composable-core-sets-for-determinant-maximization-problems-via-spectral-spanners-1807.116482019-11-19 https://scifaro.com/en/abs/efficient-computation-of-sequence-mappability-1807.117022021-06-18 https://scifaro.com/en/abs/inserting-an-edge-into-a-geometric-embedding-1807.117112018-08-01 https://scifaro.com/en/abs/on-exploring-temporal-graphs-of-small-pathwidth-1807.118692018-08-01 https://scifaro.com/en/abs/a-class-of-weighted-tsps-with-applications-1808.006212018-08-03 https://scifaro.com/en/abs/reconstructing-strings-from-substrings-optimal-randomized-and-average-case-algorithms-1808.006742018-08-03 https://scifaro.com/en/abs/on-triangle-estimation-using-tripartite-independent-set-queries-1808.006912020-08-04 https://scifaro.com/en/abs/algorithms-for-noisy-broadcast-under-erasures-1808.008382018-08-03 https://scifaro.com/en/abs/scalable-string-and-suffix-sorting-algorithms-techniques-and-tools-1808.009632018-08-06 https://scifaro.com/en/abs/small-world-model-based-on-a-sphere-homeomorphic-geometry-1808.010282018-08-06 https://scifaro.com/en/abs/right-to-left-online-construction-of-parameterized-position-heaps-1808.010712018-08-06 https://scifaro.com/en/abs/coordinate-methods-for-accelerating-ell-infty-regression-and-faster-approximate-maximum-flow-1808.012782020-04-03 https://scifaro.com/en/abs/phase-transition-in-matched-formulas-and-a-heuristic-for-biclique-satisfiability-1808.017742018-08-07 https://scifaro.com/en/abs/time-dependent-shortest-path-queries-among-growing-discs-1808.019842018-08-07 https://scifaro.com/en/abs/test-without-trust-optimal-locally-private-distribution-testing-1808.021742018-08-08 https://scifaro.com/en/abs/hierarchical-clustering-better-than-average-linkage-1808.022272018-08-08 https://scifaro.com/en/abs/approximations-of-schatten-norms-via-taylor-expansions-1808.023482018-08-08 https://scifaro.com/en/abs/fair-packing-and-covering-on-a-relative-scale-1808.025172020-11-17 https://scifaro.com/en/abs/persistent-monitoring-of-dynamically-changing-environments-using-an-unmanned-vehicle-1808.025452019-06-05 https://scifaro.com/en/abs/parallel-and-streaming-algorithms-for-k-core-decomposition-1808.025462018-11-27 https://scifaro.com/en/abs/good-r-divisions-imply-optimal-amortised-decremental-biconnectivity-1808.025682019-04-16 https://scifaro.com/en/abs/a-practical-single-source-shortest-path-algorithm-for-random-directed-graphs-with-arbitrary-weight-in-expecting-linear-time-1808.025912018-09-19 https://scifaro.com/en/abs/steiner-point-removal-with-distortion-o-log-k-using-the-noisy-voronoi-algorithm-1808.028002018-08-09 https://scifaro.com/en/abs/separators-for-planar-graphs-that-are-almost-trees-1808.028152018-08-09 https://scifaro.com/en/abs/generalized-budgeted-submodular-set-function-maximization-1808.030852018-08-10 https://scifaro.com/en/abs/longest-increasing-subsequence-under-persistent-comparison-errors-1808.033072018-08-13 https://scifaro.com/en/abs/linear-time-algorithm-to-check-the-singularity-of-block-graphs-1808.034112018-11-21 https://scifaro.com/en/abs/the-power-of-cut-based-parameters-for-computing-edge-disjoint-paths-1808.034962018-08-13 https://scifaro.com/en/abs/maximum-weight-online-matching-with-deadlines-1808.035262018-08-13 https://scifaro.com/en/abs/dynamic-all-scores-matrices-for-lcs-score-1808.035532018-08-13 https://scifaro.com/en/abs/finding-a-small-number-of-colourful-components-1808.035612018-08-13 https://scifaro.com/en/abs/a-new-algorithm-for-the-robust-semi-random-independent-set-problem-1808.036332019-10-31 https://scifaro.com/en/abs/the-effective-entropy-of-next-previous-larger-smaller-value-queries-1808.036582018-08-14 https://scifaro.com/en/abs/local-decodability-of-the-burrows-wheeler-transform-1808.039782018-12-06 https://scifaro.com/en/abs/relaxed-schedulers-can-efficiently-parallelize-iterative-algorithms-1808.041552018-08-14 https://scifaro.com/en/abs/faster-deterministic-parameterized-algorithm-for-k-path-1808.041852019-01-25 https://scifaro.com/en/abs/stochastic-on-time-arrival-problem-in-transit-networks-1808.043602018-12-04 https://scifaro.com/en/abs/hashing-with-linear-probing-and-referential-integrity-1808.046022018-08-15 https://scifaro.com/en/abs/a-simple-primal-dual-approximation-algorithm-for-2-edge-connected-spanning-subgraphs-1808.046512018-11-21 https://scifaro.com/en/abs/testing-graph-clusterability-algorithms-and-lower-bounds-1808.048072018-09-19 https://scifaro.com/en/abs/an-experimental-study-of-algorithms-for-online-bipartite-matching-1808.048632018-08-16 https://scifaro.com/en/abs/the-sketching-complexity-of-graph-and-hypergraph-counting-1808.049952018-08-16 https://scifaro.com/en/abs/counting-minimal-transversals-of-beta-acyclic-hypergraphs-1808.050172018-08-16 https://scifaro.com/en/abs/edge-disjoint-spanning-trees-in-an-undirected-graph-with-e-2-v-1-1808.052562018-11-28 https://scifaro.com/en/abs/shared-memory-exact-minimum-cuts-1808.054582018-08-17 https://scifaro.com/en/abs/perfect-l-p-sampling-in-a-data-stream-1808.054972019-11-12 https://scifaro.com/en/abs/constant-arboricity-spectral-sparsifiers-1808.056622018-08-20 https://scifaro.com/en/abs/why-did-the-shape-of-your-network-change-on-detecting-network-anomalies-via-non-local-curvatures-1808.056762019-12-23 https://scifaro.com/en/abs/efficiently-learning-mixtures-of-mallows-models-1808.057312018-08-20 https://scifaro.com/en/abs/lp-relaxation-and-tree-packing-for-minimum-k-cuts-1808.057652018-08-20 https://scifaro.com/en/abs/scalable-edge-partitioning-1808.064112018-10-12 https://scifaro.com/en/abs/graph-connectivity-in-log-steps-using-label-propagation-1808.067052021-12-09 https://scifaro.com/en/abs/non-monotone-submodular-maximization-with-nearly-optimal-adaptivity-and-query-complexity-1808.069322023-04-11 https://scifaro.com/en/abs/group-activity-selection-with-few-agent-types-1808.069542018-08-22 https://scifaro.com/en/abs/greedy-harmony-search-algorithm-for-the-hop-constrained-connected-facility-location-1808.069582018-12-14 https://scifaro.com/en/abs/iterated-greedy-algorithms-for-the-hop-constrained-steiner-tree-problem-1808.069812018-08-22 https://scifaro.com/en/abs/one-more-line-on-the-most-ancient-algorithm-in-history-1808.079572019-10-17 https://scifaro.com/en/abs/ranked-schr-oder-trees-1808.083762019-01-15 https://scifaro.com/en/abs/the-complexity-of-delta-1-coloring-incongested-clique-massively-parallel-computation-and-centralized-local-computation-1808.084192018-11-06 https://scifaro.com/en/abs/towards-tight-approximation-bounds-for-graph-diameter-and-eccentricities-1808.084942021-03-31 https://scifaro.com/en/abs/empirical-analysis-of-common-subgraph-isomorphism-approaches-to-the-lost-in-space-star-identification-problem-1808.086862018-08-28 https://scifaro.com/en/abs/explicit-3-colorings-for-exponential-graphs-1808.086912019-03-15 https://scifaro.com/en/abs/turning-cliques-into-paths-to-achieve-planarity-1808.089252018-08-29 https://scifaro.com/en/abs/on-some-combinatorial-problems-in-cographs-1808.091172018-08-29 https://scifaro.com/en/abs/an-issue-in-the-martingale-analysis-of-the-influence-maximization-algorithm-imm-1808.093632018-11-01 https://scifaro.com/en/abs/shortest-paths-with-ordinal-weights-1808.094102018-09-07 https://scifaro.com/en/abs/enumerating-top-k-quasi-cliques-1808.095312020-02-04 https://scifaro.com/en/abs/approximately-counting-bases-of-bicircular-matroids-1808.095482021-01-27 https://scifaro.com/en/abs/recent-progress-on-scaling-algorithms-and-applications-1808.096692018-08-30 https://scifaro.com/en/abs/submodular-maximization-with-matroid-and-packing-constraints-in-parallel-1808.099872018-11-12 https://scifaro.com/en/abs/consistent-sampling-with-replacement-1808.100162018-08-31 https://scifaro.com/en/abs/fully-dynamic-mis-in-uniformly-sparse-graphs-1808.103162018-08-31 https://scifaro.com/en/abs/algorithms-and-bounds-for-drawing-directed-graphs-1808.103642018-08-31 https://scifaro.com/en/abs/improved-approximation-algorithms-for-hitting-3-vertex-paths-1808.103702019-02-25 https://scifaro.com/en/abs/on-rac-drawings-of-graphs-with-one-bend-per-edge-1808.104702018-09-03 https://scifaro.com/en/abs/a-heuristic-approach-towards-drawings-of-graphs-with-high-crossing-resolution-1808.105192018-09-03 https://scifaro.com/en/abs/hashing-based-estimators-for-kernel-density-in-high-dimensions-1808.105302018-09-03 https://scifaro.com/en/abs/orthogonal-and-smooth-orthogonal-layouts-of-1-planar-graphs-with-low-edge-complexity-1808.105362018-09-05 https://scifaro.com/en/abs/graph-reduction-with-spectral-and-cut-guarantees-1808.106502019-01-01 https://scifaro.com/en/abs/single-source-bottleneck-path-algorithm-faster-than-sorting-for-sparse-graphs-1808.106582018-09-03 https://scifaro.com/en/abs/enhanced-arc-flow-formulations-to-minimize-weighted-completion-time-on-identical-parallel-machines-1808.106612020-06-24 https://scifaro.com/en/abs/univariate-ideal-membership-parameterized-by-rank-degree-and-number-of-generators-1808.107872018-09-24 https://scifaro.com/en/abs/upward-planar-morphs-1808.108262018-10-15 https://scifaro.com/en/abs/queue-layouts-of-planar-3-trees-1808.108412018-09-10 https://scifaro.com/en/abs/collective-fast-delivery-by-energy-efficient-agents-1809.000772018-09-05 https://scifaro.com/en/abs/exchange-based-diffusion-in-hb-graphs-highlighting-complex-relationships-1809.001902019-05-30 https://scifaro.com/en/abs/mining-frequent-patterns-in-evolving-graphs-1809.003942018-09-11 https://scifaro.com/en/abs/the-complexity-landscape-of-decompositional-parameters-for-ilp-1809.005852018-09-05 https://scifaro.com/en/abs/block-edit-errors-with-transpositions-deterministic-document-exchange-protocols-and-almost-optimal-binary-codes-1809.007252019-04-30 https://scifaro.com/en/abs/treewidth-of-display-graphs-bounds-brambles-and-applications-1809.009072018-09-05 https://scifaro.com/en/abs/relaxed-voronoi-a-simple-framework-for-terminal-clustering-problems-1809.009422018-11-07 https://scifaro.com/en/abs/aesthetic-discrimination-of-graph-layouts-1809.010172018-09-05 https://scifaro.com/en/abs/sos-lower-bounds-with-hard-constraints-think-global-act-local-1809.012072018-09-06 https://scifaro.com/en/abs/fast-and-accurate-graph-stream-summarization-1809.012462018-09-06 https://scifaro.com/en/abs/multi-finger-binary-search-trees-1809.017592018-09-10 https://scifaro.com/en/abs/approximation-algorithms-for-stochastic-clustering-1809.022712023-10-13 https://scifaro.com/en/abs/top-k-overlapping-densest-subgraphs-approximation-and-complexity-1809.024342019-01-31 https://scifaro.com/en/abs/streaming-dictionary-matching-with-mismatches-1809.025172021-06-22 https://scifaro.com/en/abs/parameterized-algorithm-for-3-path-vertex-cover-1809.026362018-09-11 https://scifaro.com/en/abs/when-hashing-met-matching-efficient-spatio-temporal-search-for-ridesharing-1809.026802020-02-20 https://scifaro.com/en/abs/dynamic-resource-allocation-in-the-cloud-with-near-optimal-efficiency-1809.026882021-01-27 https://scifaro.com/en/abs/torpid-mixing-of-markov-chains-for-the-six-vertex-model-on-mathbb-z-2-1809.027032018-09-11 https://scifaro.com/en/abs/fully-functional-suffix-trees-and-optimal-text-searching-in-bwt-runs-bounded-space-1809.027922020-12-17 https://scifaro.com/en/abs/multitasking-capacity-hardness-results-and-improved-constructions-1809.028352018-09-11 https://scifaro.com/en/abs/strong-coresets-for-k-median-and-subspace-approximation-goodbye-dimension-1809.029612022-04-15 https://scifaro.com/en/abs/on-solving-linear-systems-in-sublinear-time-1809.029952026-02-23 https://scifaro.com/en/abs/optimal-partition-of-a-tree-with-social-distance-1809.033922018-11-13 https://scifaro.com/en/abs/massively-parallel-dynamic-programming-on-trees-1809.036852018-09-18 https://scifaro.com/en/abs/a-new-exact-algorithm-for-solving-single-machine-scheduling-problems-with-learning-effects-and-deteriorating-jobs-1809.037952018-09-12 https://scifaro.com/en/abs/maximally-consistent-sampling-and-the-jaccard-index-of-probability-distributions-1809.040522019-01-04 https://scifaro.com/en/abs/packing-sporadic-real-time-tasks-on-identical-multiprocessor-systems-1809.043552018-09-13 https://scifaro.com/en/abs/finding-cheeger-cuts-in-hypergraphs-via-heat-equation-1809.043962019-09-12 https://scifaro.com/en/abs/graph-powering-and-spectral-robustness-1809.048182020-10-15 https://scifaro.com/en/abs/tire-noise-optimization-problem-a-mixed-integer-linear-program-approach-1809.050582018-09-14 https://scifaro.com/en/abs/submodular-secretary-problem-with-shortlists-1809.050822018-09-18 https://scifaro.com/en/abs/approximate-query-processing-over-static-sets-and-sliding-windows-1809.054192018-09-17 https://scifaro.com/en/abs/multi-modal-route-planning-in-road-and-transit-networks-1809.054812018-09-17 https://scifaro.com/en/abs/approximation-algorithms-for-the-three-machine-proportionate-mixed-shop-scheduling-1809.057452018-09-18 https://scifaro.com/en/abs/constant-factor-fpt-approximation-for-capacitated-k-median-1809.057912018-09-18 https://scifaro.com/en/abs/calculation-of-extended-gcd-by-normalization-1809.058442018-09-24 https://scifaro.com/en/abs/on-the-reconstruction-of-static-and-dynamic-discrete-structures-1809.061412018-11-08 https://scifaro.com/en/abs/a-strongly-polynomial-algorithm-for-linear-exchange-markets-1809.062662022-02-03 https://scifaro.com/en/abs/on-the-partition-set-cover-problem-1809.065062018-12-04 https://scifaro.com/en/abs/a-simple-approximation-for-a-hard-routing-problem-1809.065622018-09-19 https://scifaro.com/en/abs/utilizing-network-structure-to-bound-the-convergence-rate-in-markov-chain-monte-carlo-algorithms-1809.065642020-09-01 https://scifaro.com/en/abs/connectivity-and-structure-in-large-networks-1809.065682020-09-01 https://scifaro.com/en/abs/optimal-strategies-for-patrolling-fences-1809.067272019-06-14 https://scifaro.com/en/abs/branch-and-bound-for-bi-objective-integer-programming-1809.068232018-09-19 https://scifaro.com/en/abs/finding-k-dissimilar-paths-with-minimum-collective-length-1809.068312018-10-25 https://scifaro.com/en/abs/sublinear-time-low-rank-approximation-of-distance-matrices-1809.069862018-09-20 https://scifaro.com/en/abs/data-driven-clustering-via-parameterized-lloyd-s-families-1809.069872019-05-27 https://scifaro.com/en/abs/encoding-two-dimensional-range-top-k-queries-1809.070672021-07-13 https://scifaro.com/en/abs/compressing-and-indexing-aligned-readsets-1809.073202021-06-02 https://scifaro.com/en/abs/local-density-estimation-in-high-dimensions-1809.074712018-09-21 https://scifaro.com/en/abs/small-uncolored-and-colored-choice-dictionaries-1809.076612018-09-21 https://scifaro.com/en/abs/simple-local-computation-algorithms-for-the-general-lovasz-local-lemma-1809.079102020-07-08 https://scifaro.com/en/abs/compressed-sensing-with-adversarial-sparse-noise-via-l1-regression-1809.080552019-01-08 https://scifaro.com/en/abs/data-compression-for-parametrized-counting-problems-on-sparse-graphs-1809.081602018-09-26 https://scifaro.com/en/abs/adaptive-shivers-sort-an-alternative-sorting-algorithm-1809.084112020-09-09 https://scifaro.com/en/abs/a-2-approximation-algorithm-for-feedback-vertex-set-in-tournaments-1809.084372018-09-25 https://scifaro.com/en/abs/legal-assignments-and-fast-eadam-with-consent-via-classical-theory-of-stable-matchings-1809.085062020-08-07 https://scifaro.com/en/abs/collapsing-superstring-conjecture-1809.086692020-06-05 https://scifaro.com/en/abs/almost-optimal-algorithms-for-diameter-optimally-augmenting-trees-1809.088222018-10-03 https://scifaro.com/en/abs/improved-parallel-cache-oblivious-algorithms-for-dynamic-programming-and-linear-algebra-1809.093302019-08-22 https://scifaro.com/en/abs/finding-sparse-solutions-for-packing-and-covering-semidefinite-programs-1809.096982019-02-19 https://scifaro.com/en/abs/an-algorithm-for-reducing-approximate-nearest-neighbor-to-approximate-near-neighbor-with-o-logn-query-time-1809.097762018-09-27 https://scifaro.com/en/abs/scheduling-on-un-related-machines-with-setup-times-1809.104282018-09-28 https://scifaro.com/en/abs/industrial-and-tramp-ship-routing-problems-closing-the-gap-for-real-scale-instances-1809.105842019-12-18 https://scifaro.com/en/abs/minimization-of-gini-impurity-via-connections-with-the-k-means-problem-1810.000292018-10-02 https://scifaro.com/en/abs/on-line-partitioning-of-width-w-posets-into-w-o-log-log-w-chains-1810.002702020-03-31 https://scifaro.com/en/abs/online-resource-allocation-under-partially-predictable-demand-1810.004472018-10-02 https://scifaro.com/en/abs/slaying-hydrae-improved-bounds-for-generalized-k-server-in-uniform-metrics-1810.005802019-09-18 https://scifaro.com/en/abs/fusion-hashing-a-general-framework-for-self-improvement-of-hashing-1810.006442018-10-02 https://scifaro.com/en/abs/fully-dynamic-3-2-approximate-maximum-cardinality-matching-in-o-sqrt-n-update-time-1810.010732018-11-06 https://scifaro.com/en/abs/a-deterministic-polynomial-kernel-for-odd-cycle-transversal-and-vertex-multiway-cut-in-planar-graphs-1810.011362018-12-13 https://scifaro.com/en/abs/near-linear-approximation-algorithms-for-scheduling-problems-with-batch-setup-times-1810.012232019-05-02 https://scifaro.com/en/abs/sketching-streaming-and-fine-grained-complexity-of-weighted-lcs-1810.012382018-10-03 https://scifaro.com/en/abs/contracting-to-a-longest-path-in-h-free-graphs-1810.015422018-10-04 https://scifaro.com/en/abs/approximating-approximate-pattern-matching-1810.016762019-07-24 https://scifaro.com/en/abs/fault-tolerant-and-fully-dynamic-dfs-in-undirected-graphs-simple-yet-efficient-1810.017262019-03-28 https://scifaro.com/en/abs/submodular-stochastic-probing-with-prices-1810.017302019-01-09 https://scifaro.com/en/abs/efficient-fastest-path-computations-in-road-maps-1810.017762018-10-04 https://scifaro.com/en/abs/weighted-dynamic-finger-in-binary-search-trees-1810.017852018-10-04 https://scifaro.com/en/abs/reverse-greedy-is-bad-for-k-center-1810.018342019-12-13 https://scifaro.com/en/abs/a-comparison-of-i-o-efficient-algorithms-for-visibility-computation-on-massive-grid-terrains-1810.019462018-10-05 https://scifaro.com/en/abs/longest-property-preserved-common-factor-1810.020992018-10-05 https://scifaro.com/en/abs/compound-binary-search-tree-and-algorithms-1810.022702018-10-05 https://scifaro.com/en/abs/perron-frobenius-theory-in-nearly-linear-time-positive-eigenvectors-m-matrices-graph-kernels-and-other-applications-1810.023482018-10-05 https://scifaro.com/en/abs/parameterized-leaf-power-recognition-via-embedding-into-graph-products-1810.024522020-08-11 https://scifaro.com/en/abs/mathematical-models-for-stable-matching-problems-with-ties-and-incomplete-lists-1810.027112019-09-10 https://scifaro.com/en/abs/a-survey-of-neighbourhood-construction-models-for-categorizing-data-points-1810.030832018-10-09 https://scifaro.com/en/abs/counting-homomorphisms-in-plain-exponential-time-1810.030872018-10-09 https://scifaro.com/en/abs/spectral-subspace-sparsification-1810.032242018-10-09 https://scifaro.com/en/abs/on-the-discrepancy-of-random-low-degree-set-systems-1810.033742018-10-09 https://scifaro.com/en/abs/an-improved-algorithm-for-incremental-cycle-detection-and-topological-ordering-in-sparse-graphs-1810.034912018-10-09 https://scifaro.com/en/abs/time-message-trade-offs-in-distributed-algorithms-1810.035132018-10-09 https://scifaro.com/en/abs/approximate-online-pattern-matching-in-sub-linear-time-1810.035512018-11-06 https://scifaro.com/en/abs/approximating-edit-distance-within-constant-factor-in-truly-sub-quadratic-time-1810.036642021-02-17 https://scifaro.com/en/abs/a-note-on-max-k-vertex-cover-faster-fpt-as-smaller-approximate-kernel-and-improved-approximation-1810.037922018-10-10 https://scifaro.com/en/abs/guess-free-maximization-of-submodular-and-linear-sums-1810.038132018-10-10 https://scifaro.com/en/abs/the-andoni-krauthgamer-razenshteyn-characterization-of-sketchable-norms-fails-for-sketchable-metrics-1810.043212018-10-11 https://scifaro.com/en/abs/assignment-mechanisms-under-distributional-constraints-1810.043312019-05-02 https://scifaro.com/en/abs/classifying-k-edge-colouring-for-h-free-graphs-1810.043792018-10-11 https://scifaro.com/en/abs/parameterized-complexity-of-independent-set-in-h-free-graphs-1810.046202019-02-21 https://scifaro.com/en/abs/path-matrix-and-path-energy-of-graphs-1810.048702019-02-20 https://scifaro.com/en/abs/short-cycles-via-low-diameter-decompositions-1810.051432019-01-15 https://scifaro.com/en/abs/a-constraint-propagation-algorithm-for-sums-of-squares-formulas-over-the-integers-1810.051632018-10-15 https://scifaro.com/en/abs/stochastic-ell-p-load-balancing-and-moment-problems-via-the-l-function-method-1810.052452018-10-15 https://scifaro.com/en/abs/parallelism-in-randomized-incremental-algorithms-1810.053032018-10-15 https://scifaro.com/en/abs/xorshift1024-xorshift1024-xorshift128-and-xoroshiro128-fail-statistical-tests-for-linearity-1810.053132019-01-08 https://scifaro.com/en/abs/relative-compression-of-trajectories-1810.057532018-10-16 https://scifaro.com/en/abs/approximating-pairwise-correlations-in-the-ising-model-1810.058302021-06-16 https://scifaro.com/en/abs/approximating-optimal-transport-with-linear-programs-1810.059572018-10-23 https://scifaro.com/en/abs/super-strong-eth-is-false-for-random-k-sat-1810.060812018-10-16 https://scifaro.com/en/abs/no-place-to-hide-catching-fraudulent-entities-in-tensors-1810.062302019-02-26 https://scifaro.com/en/abs/small-space-stream-summary-for-matroid-center-1810.062672020-07-21 https://scifaro.com/en/abs/cadbots-algorithmic-aspects-of-manipulating-programmable-matter-with-finite-automata-1810.063602018-10-16 https://scifaro.com/en/abs/an-illuminating-algorithm-for-the-light-bulb-problem-1810.067402018-10-17 https://scifaro.com/en/abs/on-finding-dense-subgraphs-in-bipartite-graphs-linear-algorithms-1810.068092018-11-06 https://scifaro.com/en/abs/multi-budgeted-directed-cuts-1810.068482019-07-09 https://scifaro.com/en/abs/randomized-contractions-meet-lean-decompositions-1810.068642020-09-29 https://scifaro.com/en/abs/nearly-optimal-space-efficient-algorithm-for-depth-first-search-1810.072592018-10-18 https://scifaro.com/en/abs/graph-compression-using-the-regularity-method-1810.072752018-12-17 https://scifaro.com/en/abs/fast-and-longest-rollercoasters-1810.074222019-08-08 https://scifaro.com/en/abs/k-servers-with-a-smile-online-algorithms-via-projections-1810.075082018-12-21 https://scifaro.com/en/abs/an-eptas-for-machine-scheduling-with-bag-constraints-1810.075102018-10-18 https://scifaro.com/en/abs/payment-network-design-with-fees-1810.075852018-10-18 https://scifaro.com/en/abs/algorithmic-blockchain-channel-design-1810.076032018-10-18 https://scifaro.com/en/abs/towards-optimal-running-times-for-optimal-transport-1810.077172020-01-29 https://scifaro.com/en/abs/the-matching-augmentation-problem-a-frac74-approximation-algorithm-1810.078162019-04-24 https://scifaro.com/en/abs/finding-maximal-sets-of-laminar-3-separators-in-planar-graphs-in-linear-time-1810.078252018-10-22 https://scifaro.com/en/abs/solving-linear-programs-in-the-current-matrix-multiplication-time-1810.078962020-10-21 https://scifaro.com/en/abs/tight-competitive-ratios-of-classic-matching-algorithms-in-the-fully-online-model-1810.079032018-10-19 https://scifaro.com/en/abs/locally-private-mean-estimation-z-test-and-tight-confidence-intervals-1810.080542019-04-12 https://scifaro.com/en/abs/best-of-two-worlds-analysis-of-online-search-1810.081092018-10-19 https://scifaro.com/en/abs/testing-matrix-rank-optimally-1810.081712018-10-19 https://scifaro.com/en/abs/fpt-algorithms-to-recognize-well-covered-graphs-1810.082762023-06-22 https://scifaro.com/en/abs/bilu-linial-stability-certified-algorithms-and-the-independent-set-problem-1810.084142021-11-30 https://scifaro.com/en/abs/new-and-simplified-distributed-algorithms-for-weighted-all-pairs-shortest-paths-1810.085442018-10-22 https://scifaro.com/en/abs/theoretical-and-practical-aspects-of-the-linear-tape-scheduling-problem-1810.090052018-10-23 https://scifaro.com/en/abs/massively-parallel-approximate-distance-sketches-1810.090272019-09-13 https://scifaro.com/en/abs/optimal-terminal-dimensionality-reduction-in-euclidean-space-1810.092502018-10-23 https://scifaro.com/en/abs/a-belief-propagation-algorithm-based-on-domain-decomposition-1810.100052018-10-25 https://scifaro.com/en/abs/lower-bounds-for-max-cut-in-h-free-graphs-via-semidefinite-programming-1810.100442020-04-28 https://scifaro.com/en/abs/approximating-the-quadratic-transportation-metric-in-near-linear-time-1810.100462018-12-18 https://scifaro.com/en/abs/novel-adaptive-algorithms-for-estimating-betweenness-coverage-and-k-path-centralities-1810.100942018-10-25 https://scifaro.com/en/abs/faster-approximation-algorithms-for-computing-shortest-cycles-on-weighted-graphs-1810.102292018-10-25 https://scifaro.com/en/abs/a-maximum-edge-weight-clique-extraction-algorithm-based-on-branch-and-bound-1810.102582018-10-25 https://scifaro.com/en/abs/scheduling-computations-with-provably-low-synchronization-overheads-1810.106152019-04-30 https://scifaro.com/en/abs/minsum-k-sink-problem-on-path-networks-1810.106312018-10-26 https://scifaro.com/en/abs/lower-bounds-for-oblivious-data-structures-1810.106352018-10-26 https://scifaro.com/en/abs/batch-parallel-euler-tour-trees-1810.107382022-03-08 https://scifaro.com/en/abs/exactly-solving-the-maximum-weight-independent-set-problem-on-large-real-world-graphs-1810.108342018-10-26 https://scifaro.com/en/abs/approximation-of-trees-by-self-nested-trees-1810.108602018-10-26 https://scifaro.com/en/abs/on-policies-for-single-leg-revenue-management-with-limited-demand-information-1810.109002020-01-20 https://scifaro.com/en/abs/a-deamortization-approach-for-dynamic-spanner-and-dynamic-maximal-matching-1810.109322021-03-12 https://scifaro.com/en/abs/maximum-independent-sets-in-subcubic-graphs-new-results-1810.109402018-10-26 https://scifaro.com/en/abs/towards-a-compact-representation-of-temporal-rasters-1810.109652018-10-26 https://scifaro.com/en/abs/fr-echet-distance-under-translation-conditional-hardness-and-an-algorithm-via-offline-dynamic-grid-reachability-1810.109822021-10-13 https://scifaro.com/en/abs/optimizing-capacitated-vehicle-scheduling-with-time-windows-a-case-study-of-rmc-delivery-1810.111342018-10-29 https://scifaro.com/en/abs/efficient-and-high-quality-seeded-graph-matching-employing-high-order-structural-information-1810.111522018-10-29 https://scifaro.com/en/abs/packing-returning-secretaries-1810.112162020-02-06 https://scifaro.com/en/abs/probabilistic-analysis-of-optimization-problems-on-generalized-random-shortest-path-metrics-1810.112322020-02-28 https://scifaro.com/en/abs/some-comments-on-the-structure-of-the-best-known-networks-sorting-16-elements-1810.112622018-10-29 https://scifaro.com/en/abs/interruptible-algorithms-for-multiproblem-solving-1810.112912018-10-29 https://scifaro.com/en/abs/sub-o-log-n-out-of-order-sliding-window-aggregation-1810.113082018-10-29 https://scifaro.com/en/abs/mining-maximal-induced-bicliques-using-odd-cycle-transversals-1810.114212019-01-28 https://scifaro.com/en/abs/minimizing-branching-vertices-in-distance-preserving-subgraphs-1810.116562018-10-30 https://scifaro.com/en/abs/near-linear-time-insertion-deletion-codes-and-1-varepsilon-approximating-edit-distance-via-indexing-1810.118632019-04-11 https://scifaro.com/en/abs/smoothed-analysis-of-discrete-tensor-decomposition-and-assemblies-of-neurons-1810.118962018-10-30 https://scifaro.com/en/abs/r-bbg-2-recursive-bipartition-of-bi-connected-graphs-1810.119652018-10-30 https://scifaro.com/en/abs/simple-and-fast-blockquicksort-using-lomuto-s-partitioning-scheme-1810.120472018-10-30 https://scifaro.com/en/abs/a-study-on-load-balanced-variants-of-the-bin-packing-problem-1810.120862018-10-30 https://scifaro.com/en/abs/challenges-designs-and-performances-of-a-distributed-algorithm-for-minimum-latency-of-data-aggregation-in-multi-channel-wsns-1810.121302018-10-30 https://scifaro.com/en/abs/a-maximum-linear-arrangement-problem-on-directed-graphs-1810.122772025-12-18 https://scifaro.com/en/abs/sesquickselect-one-and-a-half-pivots-for-cache-efficient-selection-1810.123222019-05-07 https://scifaro.com/en/abs/distinct-sampling-on-streaming-data-with-near-duplicates-1810.123882018-10-31 https://scifaro.com/en/abs/submodular-maximization-under-a-matroid-constraint-asking-more-from-an-old-friend-the-greedy-algorithm-1810.128612018-10-31 https://scifaro.com/en/abs/improved-bounds-for-randomly-sampling-colorings-via-linear-programming-1810.129802018-11-01 https://scifaro.com/en/abs/weighted-vertex-cover-on-graphs-with-maximum-degree-3-1810.129822018-11-01 https://scifaro.com/en/abs/non-empty-bins-with-simple-tabulation-hashing-1810.131872018-11-01 https://scifaro.com/en/abs/multilevel-planarity-1810.132972018-11-01 https://scifaro.com/en/abs/a-two-query-adaptive-bitprobe-scheme-storing-five-elements-1810.133312019-10-24 https://scifaro.com/en/abs/stochastic-submodular-cover-with-limited-adaptivity-1810.133512018-11-01 https://scifaro.com/en/abs/testing-halfspaces-over-rotation-invariant-distributions-1811.001392018-11-02 https://scifaro.com/en/abs/quantum-principal-component-analysis-only-achieves-an-exponential-speedup-because-of-its-state-preparation-assumptions-1811.004142021-08-10 https://scifaro.com/en/abs/on-new-approaches-of-maximum-weighted-target-coverage-and-sensor-connectivity-hardness-and-approximation-1811.004872018-11-02 https://scifaro.com/en/abs/an-o-n-log-n-time-algorithm-for-computing-the-path-length-distance-between-trees-1811.006192018-11-05 https://scifaro.com/en/abs/on-subexponential-running-times-for-approximating-directed-steiner-tree-and-related-problems-1811.007102018-11-05 https://scifaro.com/en/abs/planar-graphs-of-bounded-degree-have-constant-queue-number-1811.008162019-08-12 https://scifaro.com/en/abs/worst-case-efficient-sorting-with-quickmergesort-1811.008332018-11-05 https://scifaro.com/en/abs/competitively-chasing-convex-bodies-1811.008872018-11-05 https://scifaro.com/en/abs/spectral-methods-from-tensor-networks-1811.009442018-11-05 https://scifaro.com/en/abs/near-linear-time-algorithm-for-n-fold-ilps-via-color-coding-1811.009502018-11-05 https://scifaro.com/en/abs/local-search-breaks-1-75-for-graph-balancing-1811.009552018-11-05 https://scifaro.com/en/abs/chasing-nested-convex-bodies-nearly-optimally-1811.009992021-08-16 https://scifaro.com/en/abs/dynamic-pricing-and-assortment-under-a-static-calendar-1811.010772020-11-24 https://scifaro.com/en/abs/optimal-sequence-length-requirements-for-phylogenetic-tree-reconstruction-with-indels-1811.011212019-02-22 https://scifaro.com/en/abs/efficient-projection-onto-the-perfect-phylogeny-model-1811.011292018-12-31 https://scifaro.com/en/abs/improved-approximation-algorithms-for-path-vertex-covers-in-regular-graphs-1811.011622018-11-06 https://scifaro.com/en/abs/optimal-rank-and-select-queries-on-dictionary-compressed-text-1811.012092018-12-24 https://scifaro.com/en/abs/multidimensional-segment-trees-can-do-range-updates-in-poly-logarithmic-time-1811.012262020-12-08 https://scifaro.com/en/abs/compressed-multiple-pattern-matching-1811.012482019-04-02 https://scifaro.com/en/abs/quickxsort-a-fast-sorting-scheme-in-theory-and-practice-1811.012592018-11-06 https://scifaro.com/en/abs/tight-complexity-lower-bounds-for-integer-linear-programming-with-few-constraints-1811.012962019-07-24 https://scifaro.com/en/abs/lower-bounds-for-external-memory-integer-sorting-via-network-coding-1811.013132018-11-06 https://scifaro.com/en/abs/towards-a-zero-one-law-for-column-subset-selection-1811.014422020-04-20 https://scifaro.com/en/abs/repair-in-compressed-space-and-time-1811.014722018-11-06 https://scifaro.com/en/abs/how-to-aggregate-top-lists-approximation-algorithms-via-scores-and-average-ranks-1811.015372021-09-21 https://scifaro.com/en/abs/almost-optimal-distance-oracles-for-planar-graphs-1811.015512018-11-06 https://scifaro.com/en/abs/on-a-generalization-of-iterated-and-randomized-rounding-1811.015972019-07-19 https://scifaro.com/en/abs/log-concave-polynomials-ii-high-dimensional-walks-and-an-fpras-for-counting-bases-of-a-matroid-1811.018162019-01-23 https://scifaro.com/en/abs/learning-two-layer-rectified-neural-networks-in-polynomial-time-1811.018852018-11-06 https://scifaro.com/en/abs/towards-a-unified-theory-of-sparsification-for-matching-problems-1811.020092018-11-08 https://scifaro.com/en/abs/an-improved-exact-algorithm-and-an-np-completeness-proof-for-sparse-matrix-bipartitioning-1811.020432020-05-08 https://scifaro.com/en/abs/optimal-succinct-rank-data-structure-via-approximate-nonnegative-tensor-decomposition-1811.020782019-04-08 https://scifaro.com/en/abs/motif-and-hypergraph-correlation-clustering-1811.020892018-11-07 https://scifaro.com/en/abs/the-entropy-of-lies-playing-twenty-questions-with-a-liar-1811.021772018-11-07 https://scifaro.com/en/abs/characterizations-and-directed-path-width-of-sequence-digraphs-1811.022592018-11-07 https://scifaro.com/en/abs/tunneling-on-wheeler-graphs-1811.024572019-05-30 https://scifaro.com/en/abs/interactive-coding-resilient-to-an-unknown-number-of-erasures-1811.025272019-09-17 https://scifaro.com/en/abs/weighted-upper-edge-cover-complexity-and-approximability-1811.025992018-11-08 https://scifaro.com/en/abs/oblivious-set-maxima-for-intersection-of-convex-polygons-1811.026762021-07-02 https://scifaro.com/en/abs/flow-cut-gaps-and-face-covers-in-planar-graphs-1811.026852018-11-08 https://scifaro.com/en/abs/static-data-structure-lower-bounds-imply-rigidity-1811.027252019-02-15 https://scifaro.com/en/abs/weighted-matchings-via-unweighted-augmentations-1811.027602018-11-08 https://scifaro.com/en/abs/a-tight-analysis-of-bethe-approximation-for-permanent-1811.029332019-12-11 https://scifaro.com/en/abs/every-testable-infinite-property-of-bounded-degree-graphs-contains-an-infinite-hyperfinite-subproperty-1811.029372018-11-08 https://scifaro.com/en/abs/o-log-2k-log-log-k-approximation-algorithm-for-directed-steiner-tree-a-tight-quasi-polynomial-time-algorithm-1811.030202018-11-08 https://scifaro.com/en/abs/branch-and-bound-algorithm-for-the-traveling-salesman-problem-is-not-a-direct-type-algorithm-1811.030312018-11-08 https://scifaro.com/en/abs/an-optimal-approximation-for-submodular-maximization-under-a-matroid-constraint-in-the-adaptive-complexity-model-1811.030932018-11-09 https://scifaro.com/en/abs/election-with-bribed-voter-uncertainty-hardness-and-approximation-algorithm-1811.031582018-11-12 https://scifaro.com/en/abs/performance-of-johnson-lindenstrauss-transform-for-k-means-and-k-medians-clustering-1811.031952020-04-10 https://scifaro.com/en/abs/an-efficient-algorithm-for-high-dimensional-log-concave-maximum-likelihood-1811.032042018-11-09 https://scifaro.com/en/abs/stochastic-matching-with-few-queries-new-algorithms-and-tools-1811.032242018-11-09 https://scifaro.com/en/abs/nonlinear-dimension-reduction-via-outer-bi-lipschitz-extensions-1811.035912018-11-09 https://scifaro.com/en/abs/an-o-2-619-k-algorithm-for-4-path-vertex-cover-1811.035922019-01-08 https://scifaro.com/en/abs/towards-instance-optimal-private-query-release-1811.037632018-11-12 https://scifaro.com/en/abs/minimizing-and-computing-the-inverse-geodesic-length-on-trees-1811.038362019-10-01 https://scifaro.com/en/abs/a-complexity-dichotomy-for-critical-values-of-the-b-chromatic-number-of-graphs-1811.039662019-02-12 https://scifaro.com/en/abs/an-estimation-of-the-greedy-algorithm-s-accuracy-for-a-set-cover-problem-instance-1811.040372019-02-13 https://scifaro.com/en/abs/polynomial-time-approximation-scheme-for-minimum-k-cut-in-planar-and-minor-free-graphs-1811.040522018-11-12 https://scifaro.com/en/abs/two-party-distribution-testing-communication-and-security-1811.040652018-11-12 https://scifaro.com/en/abs/count-min-optimal-estimation-and-tight-error-bounds-using-empirical-error-distributions-1811.041502018-11-13 https://scifaro.com/en/abs/an-efficient-branch-and-bound-algorithm-for-submodular-function-maximization-1811.041772018-11-13 https://scifaro.com/en/abs/efficiently-approximating-edit-distance-between-pseudorandom-strings-1811.043002018-11-13 https://scifaro.com/en/abs/coverage-centrality-maximization-in-undirected-networks-1811.043312018-11-13 https://scifaro.com/en/abs/faster-sublinear-approximations-of-k-cliques-for-low-arboricity-graphs-1811.044252018-11-13 https://scifaro.com/en/abs/tractability-of-konig-edge-deletion-problems-1811.045602019-09-26 https://scifaro.com/en/abs/mr-repair-grammar-compression-based-on-maximal-repeats-1811.045962019-02-19 https://scifaro.com/en/abs/a-review-for-weighted-minhash-algorithms-1811.046332018-11-13 https://scifaro.com/en/abs/quantum-inspired-sublinear-classical-algorithms-for-solving-low-rank-linear-systems-1811.048522018-11-13 https://scifaro.com/en/abs/quantum-inspired-low-rank-stochastic-regression-with-logarithmic-dependence-on-the-dimension-1811.049092018-11-13 https://scifaro.com/en/abs/approximation-algorithms-for-minimum-norm-and-ordered-optimization-problems-1811.050222018-11-14 https://scifaro.com/en/abs/balancing-relevance-and-diversity-in-online-bipartite-matching-via-submodularity-1811.051002018-11-14 https://scifaro.com/en/abs/approximating-minimum-representations-of-key-horn-functions-1811.051602019-03-25 https://scifaro.com/en/abs/submodular-optimization-over-streams-with-inhomogeneous-decays-1811.056522018-11-15 https://scifaro.com/en/abs/robustness-of-spectral-methods-for-community-detection-1811.058082019-06-27 https://scifaro.com/en/abs/a-duality-based-2-approximation-algorithm-for-maximum-agreement-forest-1811.059162018-11-15 https://scifaro.com/en/abs/randomisation-algorithms-for-large-sparse-matrices-1811.059742019-06-05 https://scifaro.com/en/abs/communication-optimal-distributed-dynamic-graph-clustering-1811.060722018-11-16 https://scifaro.com/en/abs/prophet-inequalities-for-i-i-d-random-variables-from-an-unknown-distribution-1811.061142021-04-08 https://scifaro.com/en/abs/vectorized-character-counting-for-faster-pattern-matching-1811.061272019-09-04 https://scifaro.com/en/abs/computing-quartet-distance-is-equivalent-to-counting-4-cycles-1811.062442020-12-03 https://scifaro.com/en/abs/secretary-ranking-with-minimal-inversions-1811.064442018-11-16 https://scifaro.com/en/abs/unconstrained-submodular-maximization-with-constant-adaptive-complexity-1811.066032018-11-20 https://scifaro.com/en/abs/robust-recoverable-0-1-optimization-problems-under-polyhedral-uncertainty-1811.067192018-11-19 https://scifaro.com/en/abs/compact-i-o-efficient-representation-of-separable-graphs-and-optimal-tree-layouts-1811.067492018-11-19 https://scifaro.com/en/abs/a-constructive-arboricity-approximation-scheme-1811.068032019-09-06 https://scifaro.com/en/abs/nearly-eth-tight-algorithms-for-planar-steiner-tree-with-terminals-on-few-faces-1811.068712018-11-19 https://scifaro.com/en/abs/a-tight-kernel-for-computing-the-tree-bisection-and-reconnection-distance-between-two-phylogenetic-trees-1811.068922021-04-13 https://scifaro.com/en/abs/efficient-construction-of-a-complete-index-for-pan-genomics-read-alignment-1811.069332018-11-19 https://scifaro.com/en/abs/the-preemptive-resource-allocation-problem-1811.074132018-11-20 https://scifaro.com/en/abs/sorting-permutations-with-a-transposition-tree-1811.074432018-11-20 https://scifaro.com/en/abs/testing-local-properties-of-arrays-1811.074482018-11-20 https://scifaro.com/en/abs/towards-nearly-linear-time-algorithms-for-submodular-maximization-with-a-matroid-constraint-1811.074642018-11-20 https://scifaro.com/en/abs/fast-submodular-maximization-subject-to-k-extendible-system-constraints-1811.076732018-11-20 https://scifaro.com/en/abs/experimental-evaluation-of-parameterized-algorithms-for-graph-separation-problems-half-integral-relaxations-and-matroid-based-kernelization-1811.077792018-11-20 https://scifaro.com/en/abs/a-simple-sublinear-time-algorithm-for-counting-arbitrary-subgraphs-via-edge-sampling-1811.077802018-11-20 https://scifaro.com/en/abs/pareto-optimization-for-subset-selection-with-dynamic-cost-constraints-1811.078062021-10-12 https://scifaro.com/en/abs/experimental-evaluation-of-kernelization-algorithms-to-dominating-set-1811.078312018-11-20 https://scifaro.com/en/abs/private-selection-from-private-candidates-1811.079712018-11-21 https://scifaro.com/en/abs/simulating-random-walks-on-graphs-in-the-streaming-model-1811.082052020-01-03 https://scifaro.com/en/abs/a-general-framework-for-handling-commitment-in-online-throughput-maximization-1811.082382018-11-21 https://scifaro.com/en/abs/on-a-hypergraph-probabilistic-graphical-model-1811.083722018-11-22 https://scifaro.com/en/abs/on-compact-representations-of-voronoi-cells-of-lattices-1811.085322020-01-08 https://scifaro.com/en/abs/breaking-symmetries-to-rescue-sum-of-squares-in-the-case-of-makespan-scheduling-1811.085392020-05-19 https://scifaro.com/en/abs/k-cut-a-simple-approximately-uniform-method-for-sampling-ballots-in-post-election-audits-1811.088112019-01-04 https://scifaro.com/en/abs/generic-partition-refinement-and-weighted-tree-automata-1811.088502019-07-11 https://scifaro.com/en/abs/dispersing-obnoxious-facilities-on-a-graph-1811.089182018-11-26 https://scifaro.com/en/abs/approximate-multi-matroid-intersection-via-iterative-refinement-1811.090272018-11-26 https://scifaro.com/en/abs/tight-approximation-for-unconstrained-xos-maximization-1811.090452020-07-09 https://scifaro.com/en/abs/utilizing-dynamic-properties-of-sharing-bits-and-registers-to-estimate-user-cardinalities-over-time-1811.091262018-11-27 https://scifaro.com/en/abs/rept-a-streaming-algorithm-of-approximating-global-and-local-triangle-counts-in-parallel-1811.091362018-11-27 https://scifaro.com/en/abs/better-bounds-for-online-line-chasing-1811.092332019-09-23 https://scifaro.com/en/abs/your-rugby-mates-don-t-need-to-know-your-colleagues-triadic-closure-with-edge-colors-1811.094112021-03-12 https://scifaro.com/en/abs/what-is-known-about-vertex-cover-kernelization-1811.094292019-05-15 https://scifaro.com/en/abs/a-lower-bound-for-online-rectangle-packing-1811.095732018-11-26 https://scifaro.com/en/abs/parallel-approach-to-sliding-window-sums-1811.100742019-09-04 https://scifaro.com/en/abs/fptas-for-barrier-covering-problem-with-equal-circles-in-2d-1811.101612021-01-05 https://scifaro.com/en/abs/on-the-cost-of-essentially-fair-clusterings-1811.103192018-11-27 https://scifaro.com/en/abs/clustering-residential-electricity-load-curves-via-community-detection-in-network-1811.103562018-11-27 https://scifaro.com/en/abs/analysis-of-large-sparse-graphs-using-regular-decomposition-of-graph-distance-matrices-1811.104702018-12-24 https://scifaro.com/en/abs/solving-directed-laplacian-systems-in-nearly-linear-time-through-sparse-lu-factorizations-1811.107222018-11-28 https://scifaro.com/en/abs/the-batched-set-cover-problem-1811.107672018-11-28 https://scifaro.com/en/abs/exploiting-numerical-sparsity-for-efficient-learning-faster-eigenvector-computation-and-regression-1811.108662018-11-28 https://scifaro.com/en/abs/an-optimal-space-lower-bound-for-approximating-max-cut-1811.108792018-11-28 https://scifaro.com/en/abs/hermitian-laplacians-and-a-cheeger-inequality-for-the-max-2-lin-problem-1811.109092018-11-28 https://scifaro.com/en/abs/an-analytical-approach-to-improving-time-warping-on-multidimensional-time-series-1811.110762018-11-28 https://scifaro.com/en/abs/the-structure-of-optimal-private-tests-for-simple-hypotheses-1811.111482019-04-04 https://scifaro.com/en/abs/a-tutorial-on-formulating-and-using-qubo-models-1811.115382019-11-06 https://scifaro.com/en/abs/attendance-maximization-for-successful-social-event-planning-1811.115932018-11-29 https://scifaro.com/en/abs/approximate-schedules-for-non-migratory-parallel-jobs-in-speed-scaled-multiprocessor-systems-1811.115952018-11-29 https://scifaro.com/en/abs/prepare-for-the-expected-worst-algorithms-for-reconfigurable-resources-under-uncertainty-1811.116352019-07-23 https://scifaro.com/en/abs/approximation-algorithms-for-the-vertex-weighted-grade-of-service-steiner-tree-problem-1811.117002019-05-07 https://scifaro.com/en/abs/efficient-measuring-of-congruence-on-high-dimensional-time-series-1811.118562018-11-30 https://scifaro.com/en/abs/adversarial-bandits-with-knapsacks-1811.118812023-03-08 https://scifaro.com/en/abs/an-equivalence-class-for-orthogonal-vectors-1811.120172018-11-30 https://scifaro.com/en/abs/an-exact-cutting-plane-algorithm-to-solve-the-selective-graph-coloring-problem-in-perfect-graphs-1811.120942021-01-01 https://scifaro.com/en/abs/smoothed-analysis-in-unsupervised-learning-via-decoupling-1811.123612019-04-25 https://scifaro.com/en/abs/small-hazard-free-transducers-1811.123692025-01-29 https://scifaro.com/en/abs/algorithms-and-hardness-for-diameter-in-dynamic-graphs-1811.125272019-12-18 https://scifaro.com/en/abs/the-inverse-voronoi-problem-in-graphs-1811.125472020-10-06 https://scifaro.com/en/abs/parallelizing-greedy-for-submodular-set-function-maximization-in-matroids-and-beyond-1811.125682018-12-03 https://scifaro.com/en/abs/optimal-algorithms-for-scheduling-under-time-of-use-tariffs-1811.126572018-12-03 https://scifaro.com/en/abs/optimal-time-dictionary-compressed-indexes-1811.127792019-09-06 https://scifaro.com/en/abs/binary-decision-diagrams-for-bin-packing-with-minimum-color-fragmentation-1812.000592018-12-04 https://scifaro.com/en/abs/semi-online-bipartite-matching-1812.001342019-09-06 https://scifaro.com/en/abs/universal-streaming-of-subset-norms-1812.002412020-04-07 https://scifaro.com/en/abs/locally-consistent-parsing-for-text-indexing-in-small-space-1812.003592020-04-28 https://scifaro.com/en/abs/sequence-searching-allowing-for-non-overlapping-adjacent-unbalanced-translocations-1812.004212018-12-04 https://scifaro.com/en/abs/online-scheduling-of-jobs-with-favorite-machines-1812.013432019-12-30 https://scifaro.com/en/abs/conflict-free-colouring-using-maximum-independent-set-and-minimum-colouring-1812.014592020-01-02 https://scifaro.com/en/abs/a-parallel-double-greedy-algorithm-for-submodular-maximization-1812.015912018-12-05 https://scifaro.com/en/abs/diameter-spanners-eccentricity-spanners-and-approximating-extremal-distances-1812.016022019-02-21 https://scifaro.com/en/abs/quasi-polynomial-algorithms-for-submodular-tree-orienteering-and-other-directed-network-design-problems-1812.017682019-04-03 https://scifaro.com/en/abs/voting-and-bribing-in-single-exponential-time-1812.018522018-12-06 https://scifaro.com/en/abs/correlation-clustering-in-data-streams-1812.020232018-12-06 https://scifaro.com/en/abs/a-highly-scalable-labelling-approach-for-exact-distance-queries-in-complex-networks-1812.023632021-02-18 https://scifaro.com/en/abs/a-novel-bin-design-problem-and-high-performance-algorithm-for-e-commerce-logistics-system-1812.025652018-12-10 https://scifaro.com/en/abs/compression-with-wildcards-abstract-simplicial-complexes-1812.025702021-03-10 https://scifaro.com/en/abs/confirmation-sampling-for-exact-nearest-neighbor-search-1812.026032018-12-07 https://scifaro.com/en/abs/an-improved-cost-function-for-hierarchical-cluster-trees-1812.027152018-12-19 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-the-weighted-max-cut-problem-on-embedded-1-planar-graphs-1812.030742020-12-01 https://scifaro.com/en/abs/kernelization-of-packing-problems-1812.031552018-12-10 https://scifaro.com/en/abs/approximate-calculation-of-tukey-s-depth-and-median-with-high-dimensional-data-1812.031742018-12-11 https://scifaro.com/en/abs/fleet-butterfly-estimation-from-a-bipartite-graph-stream-1812.033982019-08-30 https://scifaro.com/en/abs/on-balanced-clustering-with-tree-like-structures-over-clusters-1812.035352018-12-11 https://scifaro.com/en/abs/rounding-semidefinite-programs-for-large-domain-problems-via-brownian-motion-1812.035722018-12-11 https://scifaro.com/en/abs/a-unified-approach-to-scalable-spectral-sparsification-of-directed-graphs-1812.041652020-05-04 https://scifaro.com/en/abs/a-non-iterative-parallelizable-eigenbasis-algorithm-for-johnson-graphs-1812.042302018-12-12 https://scifaro.com/en/abs/lzrr-lz77-parsing-with-right-reference-1812.042612018-12-12 https://scifaro.com/en/abs/finding-tutte-paths-in-linear-time-1812.045432019-03-13 https://scifaro.com/en/abs/an-improved-scheme-in-the-two-query-adaptive-bitprobe-model-1812.048022018-12-13 https://scifaro.com/en/abs/optimal-algorithm-for-profiling-dynamic-arrays-with-finite-values-1812.053062018-12-14 https://scifaro.com/en/abs/shortest-reconfiguration-of-matchings-1812.054192018-12-14 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-maximum-likelihood-estimation-of-multivariate-log-concave-densities-1812.055242018-12-14 https://scifaro.com/en/abs/the-glauber-dynamics-for-edge-colourings-of-trees-1812.055772020-07-31 https://scifaro.com/en/abs/a-trivial-yet-optimal-solution-to-vertex-fault-tolerant-spanners-1812.057782019-06-04 https://scifaro.com/en/abs/partial-function-extension-with-applications-to-learning-and-property-testing-1812.058212018-12-17 https://scifaro.com/en/abs/graph-classes-and-forbidden-patterns-on-three-vertices-1812.059132020-07-21 https://scifaro.com/en/abs/simple-concurrent-labeling-algorithms-for-connected-components-1812.061772020-03-04 https://scifaro.com/en/abs/algorithmic-theory-of-odes-and-sampling-from-well-conditioned-logconcave-densities-1812.062432018-12-18 https://scifaro.com/en/abs/efficient-structured-matrix-recovery-and-nearly-linear-time-algorithms-for-solving-inverse-symmetric-m-matrices-1812.062952018-12-18 https://scifaro.com/en/abs/the-stochastic-critical-node-problem-over-trees-1812.064562019-05-30 https://scifaro.com/en/abs/comparing-linear-width-parameters-for-directed-graphs-1812.066532018-12-18 https://scifaro.com/en/abs/information-theoretical-clustering-is-hard-to-approximate-1812.070752019-11-19 https://scifaro.com/en/abs/a-scalable-heuristic-for-fastest-path-computation-on-very-large-road-maps-1812.074412020-09-09 https://scifaro.com/en/abs/efficient-autotuning-of-hyperparameters-in-approximate-nearest-neighbor-search-1812.074842019-04-25 https://scifaro.com/en/abs/approximation-schemes-for-capacitated-clustering-in-doubling-metrics-1812.077212019-11-07 https://scifaro.com/en/abs/sticky-brownian-rounding-and-its-applications-to-constraint-satisfaction-problems-1812.077692019-10-22 https://scifaro.com/en/abs/two-stage-combinatorial-optimization-problems-under-risk-1812.078262018-12-20 https://scifaro.com/en/abs/efficient-representation-and-counting-of-antipower-factors-in-words-1812.081012020-05-12 https://scifaro.com/en/abs/the-query-complexity-of-a-permutation-based-variant-of-mastermind-1812.084802018-12-21 https://scifaro.com/en/abs/temporal-matching-1812.086152019-02-08 https://scifaro.com/en/abs/near-linear-time-approximation-schemes-for-clustering-in-doubling-metrics-1812.086642020-05-21 https://scifaro.com/en/abs/core-decomposition-in-multilayer-networks-theory-algorithms-and-applications-1812.087122019-11-18 https://scifaro.com/en/abs/a-universal-sampling-method-for-reconstructing-signals-with-simple-fourier-transforms-1812.087232018-12-24 https://scifaro.com/en/abs/nearly-linear-time-spectral-graph-reduction-for-scalable-graph-partitioning-and-data-visualization-1812.089422018-12-24 https://scifaro.com/en/abs/expander-decomposition-and-pruning-faster-stronger-and-simpler-1812.089582021-12-17 https://scifaro.com/en/abs/a-simple-algorithm-for-computing-the-document-array-1812.090942020-09-10 https://scifaro.com/en/abs/lower-bounds-for-text-indexing-with-mismatches-and-differences-1812.091202018-12-24 https://scifaro.com/en/abs/a-local-search-4-3-approximation-algorithm-for-the-minimum-3-path-partition-problem-1812.093532018-12-27 https://scifaro.com/en/abs/fast-post-hoc-method-for-updating-moments-of-large-datasets-1812.093722018-12-27 https://scifaro.com/en/abs/anchorhash-a-scalable-consistent-hash-1812.096742020-11-24 https://scifaro.com/en/abs/the-online-event-detection-problem-1812.098242018-12-27 https://scifaro.com/en/abs/approximating-activation-edge-cover-and-facility-location-problems-1812.098802018-12-27 https://scifaro.com/en/abs/sherali-adams-strikes-back-1812.099672018-12-27 https://scifaro.com/en/abs/on-approximate-data-reduction-for-the-rural-postman-problem-theory-and-experiments-1812.101312021-01-14 https://scifaro.com/en/abs/two-algorithms-for-the-package-exchange-robot-routing-problem-1812.102152018-12-27 https://scifaro.com/en/abs/applying-predicate-detection-to-the-constrained-optimization-problems-1812.104312018-12-27 https://scifaro.com/en/abs/the-prophet-inequality-can-be-solved-optimally-with-a-single-set-of-samples-1812.105632018-12-31 https://scifaro.com/en/abs/hierarchical-clustering-for-euclidean-data-1812.105822018-12-31 https://scifaro.com/en/abs/complexity-of-reconfiguration-problems-for-constraint-satisfaction-1812.106292018-12-31 https://scifaro.com/en/abs/complex-semidefinite-programming-and-max-k-cut-1812.107702018-12-31 https://scifaro.com/en/abs/above-guarantee-parameterization-for-vertex-cover-on-graphs-with-maximum-degree-4-1812.108082018-12-31 https://scifaro.com/en/abs/on-the-approximability-of-time-disjoint-walks-1812.108372020-02-19 https://scifaro.com/en/abs/fair-coresets-and-streaming-algorithms-for-fair-k-means-clustering-1812.108542021-03-10 https://scifaro.com/en/abs/fast-breadth-first-search-in-still-less-space-1812.109502019-02-18 https://scifaro.com/en/abs/a-grammar-based-compressed-representation-of-3d-trajectories-1812.109742018-12-31 https://scifaro.com/en/abs/compact-and-efficient-representation-of-general-graph-databases-1812.109772018-12-31 https://scifaro.com/en/abs/using-compressed-suffix-arrays-for-a-compact-representation-of-temporal-graphs-1812.112442019-01-01 https://scifaro.com/en/abs/a-compact-representation-for-trips-over-networks-built-on-self-indexes-1812.112492019-01-01 https://scifaro.com/en/abs/a-dynamically-turbo-charged-greedy-heuristic-for-graph-coloring-1812.112542019-02-26 https://scifaro.com/en/abs/inference-under-information-constraints-i-lower-bounds-from-chi-square-contraction-1812.114762020-10-02 https://scifaro.com/en/abs/spectral-methods-for-testing-cluster-structure-of-graphs-1812.115642019-01-01 https://scifaro.com/en/abs/joint-overlap-analysis-of-multiple-genomic-interval-sets-1812.115942019-01-01 https://scifaro.com/en/abs/tighter-bounds-for-online-bipartite-matching-1812.117742019-01-01 https://scifaro.com/en/abs/towards-the-locality-of-vizing-s-theorem-1901.004792019-04-11 https://scifaro.com/en/abs/real-time-eeg-classification-via-coresets-for-bci-applications-1901.005122020-07-27 https://scifaro.com/en/abs/efficient-race-detection-with-futures-1901.006222019-01-04 https://scifaro.com/en/abs/a-fast-sketch-method-for-mining-user-similarities-over-fully-dynamic-graph-streams-1901.006502019-01-17 https://scifaro.com/en/abs/almost-optimal-distribution-free-junta-testing-1901.007172020-06-09 https://scifaro.com/en/abs/mergeable-dictionaries-with-shifts-1901.007182019-01-04 https://scifaro.com/en/abs/sparsification-of-binary-csps-1901.007542020-03-25 https://scifaro.com/en/abs/about-the-complexity-of-two-stage-stochastic-ips-1901.011352019-02-22 https://scifaro.com/en/abs/faster-and-smaller-two-level-index-for-network-based-trajectories-1901.011722019-01-07 https://scifaro.com/en/abs/new-algorithms-and-lower-bounds-for-all-pairs-max-flow-in-undirected-graphs-1901.014122019-07-11 https://scifaro.com/en/abs/multiple-set-matching-and-pre-filtering-with-bloom-multifilters-1901.018252019-01-14 https://scifaro.com/en/abs/an-in-place-subquadratic-algorithm-for-permutation-inversion-1901.019262020-04-22 https://scifaro.com/en/abs/a-compact-representation-of-raster-time-series-1901.019442019-01-08 https://scifaro.com/en/abs/subset-feedback-vertex-set-in-chordal-and-split-graphs-1901.022092019-01-09 https://scifaro.com/en/abs/fair-algorithms-for-clustering-1901.023932019-06-18 https://scifaro.com/en/abs/faster-parameterized-algorithm-for-pumpkin-vertex-deletion-set-1901.024912019-01-10 https://scifaro.com/en/abs/fast-generalized-dfts-for-all-finite-groups-1901.025362019-01-10 https://scifaro.com/en/abs/fragile-complexity-of-comparison-based-algorithms-1901.028572019-09-04 https://scifaro.com/en/abs/entropy-bounds-for-grammar-based-tree-compressors-1901.031552020-05-21 https://scifaro.com/en/abs/quantum-inspired-sublinear-algorithm-for-solving-low-rank-semidefinite-programming-1901.032542020-08-07 https://scifaro.com/en/abs/on-kernelization-for-edge-dominating-set-under-structural-parameters-1901.035822019-01-14 https://scifaro.com/en/abs/decremental-strongly-connected-components-and-single-source-reachability-in-near-linear-time-1901.036152019-03-15 https://scifaro.com/en/abs/destroying-bicolored-p-3-s-by-deleting-few-edges-1901.036272023-06-22 https://scifaro.com/en/abs/depth-first-search-in-the-semi-streaming-model-1901.036892019-01-14 https://scifaro.com/en/abs/exponentially-faster-massively-parallel-maximal-matching-1901.037442023-10-17 https://scifaro.com/en/abs/on-huang-and-wong-s-algorithm-for-generalized-binary-split-trees-1901.037832022-02-15 https://scifaro.com/en/abs/quotient-hash-tables-efficiently-detecting-duplicates-in-streaming-data-1901.043582019-01-15 https://scifaro.com/en/abs/online-inventory-management-with-application-to-energy-procurement-in-data-centers-1901.043722019-01-15 https://scifaro.com/en/abs/platoon-forming-algorithms-for-intelligent-street-intersections-1901.045832024-12-20 https://scifaro.com/en/abs/a-constant-fpt-approximation-algorithm-for-hard-capacitated-k-means-1901.046282019-05-01 https://scifaro.com/en/abs/an-algorithm-for-bounding-the-probability-of-r-core-formation-in-k-uniform-random-hypergraphs-1901.049342019-01-16 https://scifaro.com/en/abs/the-bayesian-prophet-a-low-regret-framework-for-online-decision-making-1901.050282020-02-28 https://scifaro.com/en/abs/space-efficient-computation-of-the-lcp-array-from-the-burrows-wheeler-transform-1901.052262019-01-23 https://scifaro.com/en/abs/solving-simple-stochastic-games-with-few-random-nodes-faster-using-bland-s-rule-1901.053162019-01-17 https://scifaro.com/en/abs/an-analysis-of-the-geodesic-distance-and-other-comparative-metrics-for-tree-like-structures-1901.055492019-01-18 https://scifaro.com/en/abs/boolean-matrix-factorization-meets-consecutive-ones-property-1901.057972019-05-16 https://scifaro.com/en/abs/tight-bounds-on-the-minimum-size-of-a-dynamic-monopoly-1901.059172019-01-18 https://scifaro.com/en/abs/accelerated-experimental-design-for-pairwise-comparisons-1901.060802019-01-21 https://scifaro.com/en/abs/on-efficient-optimal-transport-an-analysis-of-greedy-and-accelerated-mirror-descent-algorithms-1901.064822021-07-27 https://scifaro.com/en/abs/dynamic-partition-bloom-filters-a-bounded-false-positive-solution-for-dynamic-set-membership-extended-abstract-1901.064932019-01-23 https://scifaro.com/en/abs/approximation-algorithms-for-the-a-priori-travelingrepairman-1901.065812019-01-23 https://scifaro.com/en/abs/fast-algorithms-at-low-temperatures-via-markov-chains-1901.066532021-04-14 https://scifaro.com/en/abs/iterative-refinement-for-ell-p-norm-regression-1901.067642024-12-20 https://scifaro.com/en/abs/mixed-integer-formulations-using-natural-variables-for-single-machine-scheduling-around-a-common-due-date-1901.068802021-02-15 https://scifaro.com/en/abs/a-ptas-for-bounded-capacity-vehicle-routing-in-planar-graphs-1901.070322019-01-23 https://scifaro.com/en/abs/analyzing-branch-and-bound-algorithms-for-the-multiprocessor-scheduling-problem-1901.070702019-01-23 https://scifaro.com/en/abs/using-a-min-cut-generalisation-to-go-beyond-boolean-surjective-vcsps-1901.071072022-07-05 https://scifaro.com/en/abs/a-space-efficient-parameterized-algorithm-for-the-hamiltonian-cycle-problem-by-dynamic-algebraziation-1901.071182019-01-23 https://scifaro.com/en/abs/convergence-of-the-non-uniform-physarum-dynamics-1901.072312020-03-02 https://scifaro.com/en/abs/a-4-epsilon-approximation-for-k-connected-subgraphs-1901.072462019-01-23 https://scifaro.com/en/abs/lower-bounds-for-testing-graphical-models-colorings-and-antiferromagnetic-ising-models-1901.073612019-06-21 https://scifaro.com/en/abs/solve-for-shortest-paths-problem-within-logarithm-runtime-1901.074632019-01-23 https://scifaro.com/en/abs/faster-parameterized-algorithm-for-cluster-vertex-deletion-1901.076092019-01-24 https://scifaro.com/en/abs/a-randomized-strategy-in-the-mirror-game-1901.078092019-01-24 https://scifaro.com/en/abs/solving-unconstrained-0-1-polynomial-programs-through-quadratic-convex-reformulation-1901.079042019-01-24 https://scifaro.com/en/abs/how-many-passengers-can-we-serve-with-ride-sharing-1901.079062019-01-24 https://scifaro.com/en/abs/the-self-concordant-perceptron-is-efficient-on-a-sub-family-feasibility-instances-1901.085252026-02-17 https://scifaro.com/en/abs/dolha-an-efficient-and-exact-data-structure-for-streaming-graphs-1901.086392019-01-28 https://scifaro.com/en/abs/a-laplacian-approach-to-ell-1-norm-minimization-1901.088362023-05-16 https://scifaro.com/en/abs/finding-a-mediocre-player-1901.090172020-11-17 https://scifaro.com/en/abs/star-routing-between-vehicle-routing-and-vertex-cover-1901.091542019-01-29 https://scifaro.com/en/abs/large-minors-in-expanders-1901.093492019-01-30 https://scifaro.com/en/abs/note-on-distance-matrix-hashing-1901.095052019-01-30 https://scifaro.com/en/abs/envy-free-matchings-in-bipartite-graphs-and-their-applications-to-fair-division-1901.095272022-04-15 https://scifaro.com/en/abs/utility-preserving-secure-private-data-release-1901.098582019-03-18 https://scifaro.com/en/abs/efficient-multiparty-interactive-coding-for-insertions-deletions-and-substitutions-1901.098632022-08-04 https://scifaro.com/en/abs/dominating-sets-and-connected-dominating-sets-in-dynamic-graphs-1901.098772019-01-29 https://scifaro.com/en/abs/online-algorithms-for-constructing-linear-size-suffix-trie-1901.100452019-04-11 https://scifaro.com/en/abs/fully-functional-bidirectional-burrows-wheeler-indexes-1901.101652019-06-11 https://scifaro.com/en/abs/canonisation-and-definability-for-graphs-of-bounded-rank-width-1901.103302023-05-30 https://scifaro.com/en/abs/matching-is-as-easy-as-the-decision-problem-in-the-nc-model-1901.103872020-11-10 https://scifaro.com/en/abs/simulating-the-dna-string-graph-in-succinct-space-1901.104532019-12-02 https://scifaro.com/en/abs/efficient-n-to-n-collision-detection-for-space-debris-using-4d-aabb-trees-extended-report-1901.104752019-01-31 https://scifaro.com/en/abs/efficiently-computing-runs-on-a-trie-1901.106332021-04-21 https://scifaro.com/en/abs/online-pandora-s-boxes-and-bandits-1901.106982019-01-31 https://scifaro.com/en/abs/computing-longest-palindromic-substring-after-single-character-or-block-wise-edits-1901.107222021-01-11 https://scifaro.com/en/abs/comparing-election-methods-where-each-voter-ranks-only-few-candidates-1901.108482019-01-31 https://scifaro.com/en/abs/multistage-knapsack-1901.112602019-02-01 https://scifaro.com/en/abs/quasi-linear-time-algorithm-for-longest-common-circular-factor-1901.113052019-02-01 https://scifaro.com/en/abs/the-superm-tree-indexing-metric-spaces-with-sized-objects-1901.114532019-02-05 https://scifaro.com/en/abs/an-extension-of-linear-size-suffix-tries-for-parameterized-strings-1902.002162019-09-05 https://scifaro.com/en/abs/the-application-of-bipartite-matching-in-assignment-problem-1902.002562019-02-04 https://scifaro.com/en/abs/an-efficient-sorting-algorithm-ultimate-heapsort-uhs-1902.002572019-02-04 https://scifaro.com/en/abs/scheduling-with-predictions-and-the-price-of-misprediction-1902.007322019-05-24 https://scifaro.com/en/abs/itemsets-for-real-valued-datasets-1902.008042019-02-05 https://scifaro.com/en/abs/study-representation-and-applications-of-hypergraph-minimal-transversals-1902.009112019-02-05 https://scifaro.com/en/abs/a-faster-fptas-for-knapsack-problem-with-cardinality-constraint-1902.009192020-12-15 https://scifaro.com/en/abs/ranking-episodes-using-a-partition-model-1902.010022019-02-05 https://scifaro.com/en/abs/regular-languages-meet-prefix-sorting-1902.010882020-12-17 https://scifaro.com/en/abs/a-unified-framework-for-marketing-budget-allocation-1902.011282019-05-23 https://scifaro.com/en/abs/a-new-class-of-searchable-and-provably-highly-compressible-string-transformations-1902.012802019-02-05 https://scifaro.com/en/abs/safe-projections-of-binary-data-sets-1902.013312019-02-05 https://scifaro.com/en/abs/distances-between-data-sets-based-on-summary-statistics-1902.013342019-02-05 https://scifaro.com/en/abs/near-optimal-adaptivity-gaps-for-stochastic-multi-value-probing-1902.014612019-02-07 https://scifaro.com/en/abs/faster-way-to-agony-discovering-hierarchies-in-directed-graphs-1902.014772019-02-06 https://scifaro.com/en/abs/discovering-nested-communities-1902.014832019-02-06 https://scifaro.com/en/abs/window-based-streaming-graph-partitioning-algorithm-1902.015432019-02-06 https://scifaro.com/en/abs/an-optimal-algorithm-for-online-freeze-tag-1902.016092019-02-06 https://scifaro.com/en/abs/accuracy-evaluation-of-overlapping-and-multi-resolution-clustering-algorithms-on-large-datasets-1902.016912019-02-18 https://scifaro.com/en/abs/stochastic-enumeration-with-importance-sampling-1902.016982019-02-06 https://scifaro.com/en/abs/network-resilience-assessment-via-qos-degradation-metrics-an-algorithmic-approach-1902.017012019-02-06 https://scifaro.com/en/abs/a-sequential-importance-sampling-algorithm-for-estimating-linear-extensions-1902.017042020-09-07 https://scifaro.com/en/abs/discovering-bursts-revisited-guaranteed-optimization-of-the-model-parameters-1902.017272019-02-06 https://scifaro.com/en/abs/hamiltonicity-below-dirac-s-condition-1902.017452019-02-06 https://scifaro.com/en/abs/hierarchical-matrix-operations-on-gpus-matrix-vector-multiplication-and-compression-1902.018292019-02-06 https://scifaro.com/en/abs/inferring-the-strength-of-social-ties-a-community-driven-approach-1902.018322019-02-06 https://scifaro.com/en/abs/dynamic-hierarchies-in-temporal-directed-networks-1902.018732019-02-07 https://scifaro.com/en/abs/average-case-complexity-of-a-branch-and-bound-algorithm-for-min-dominating-set-1902.018742019-02-07 https://scifaro.com/en/abs/a-composable-coreset-for-k-center-in-doubling-metrics-1902.018962019-04-25 https://scifaro.com/en/abs/firefighting-on-trees-1902.021592019-02-07 https://scifaro.com/en/abs/top-tree-compression-of-tries-1902.021872019-09-23 https://scifaro.com/en/abs/toward-a-dichotomy-for-approximation-of-h-coloring-1902.022012022-11-23 https://scifaro.com/en/abs/new-amortized-cell-probe-lower-bounds-for-dynamic-problems-1902.023042019-02-07 https://scifaro.com/en/abs/finding-good-itemsets-by-packing-data-1902.023922019-02-08 https://scifaro.com/en/abs/on-mean-estimation-for-general-norms-with-statistical-queries-1902.024592019-02-08 https://scifaro.com/en/abs/a-fast-algorithm-for-constructing-balanced-binary-search-trees-1902.024992022-07-20 https://scifaro.com/en/abs/going-far-from-degeneracy-1902.025262019-02-15 https://scifaro.com/en/abs/significance-of-episodes-based-on-minimal-windows-1902.027552019-02-08 https://scifaro.com/en/abs/the-long-and-the-short-of-it-summarising-event-sequences-with-serial-episodes-1902.028342019-02-11 https://scifaro.com/en/abs/discovering-descriptive-tile-trees-by-mining-optimal-geometric-subtiles-1902.028612019-02-11 https://scifaro.com/en/abs/space-efficient-merging-of-succinct-de-bruijn-graphs-1902.028892020-09-10 https://scifaro.com/en/abs/are-your-items-in-order-1902.029212019-02-11 https://scifaro.com/en/abs/faster-repetition-aware-compressed-suffix-trees-based-on-block-trees-1902.032742019-02-12 https://scifaro.com/en/abs/fast-sequence-segmentation-using-log-linear-models-1902.032852019-02-12 https://scifaro.com/en/abs/fast-approximation-schemes-for-bin-packing-1902.034222019-02-12 https://scifaro.com/en/abs/linear-time-algorithms-for-multiple-cluster-scheduling-and-multiple-strip-packing-1902.034282019-02-12 https://scifaro.com/en/abs/scalable-fair-clustering-1902.035192019-06-12 https://scifaro.com/en/abs/multi-dimensional-balanced-graph-partitioning-via-projected-gradient-descent-1902.035222019-02-19 https://scifaro.com/en/abs/set-cover-in-sub-linear-time-1902.035342019-02-12 https://scifaro.com/en/abs/approximating-k-connected-m-dominating-sets-1902.035482019-02-12 https://scifaro.com/en/abs/balancing-straight-line-programs-1902.035682020-07-02 https://scifaro.com/en/abs/on-the-convergence-of-network-systems-1902.041212020-02-11 https://scifaro.com/en/abs/compressed-range-minimum-queries-1902.044272019-05-30 https://scifaro.com/en/abs/learning-ising-models-with-independent-failures-1902.047282019-02-14 https://scifaro.com/en/abs/constructing-antidictionaries-in-output-sensitive-space-1902.047852019-02-14 https://scifaro.com/en/abs/efficient-continuous-multi-query-processing-over-graph-streams-1902.051342019-02-15 https://scifaro.com/en/abs/space-efficient-data-structures-for-lattices-1902.051662020-06-17 https://scifaro.com/en/abs/conversion-from-rlbwt-to-lz77-1902.052242019-02-15 https://scifaro.com/en/abs/search-and-rescue-in-the-face-of-uncertain-threats-1902.054322019-12-25 https://scifaro.com/en/abs/finding-nearest-neighbors-in-graphs-locally-1902.056382019-02-18 https://scifaro.com/en/abs/a-2-3-approximation-algorithm-for-vertex-weighted-matching-1902.058772019-02-18 https://scifaro.com/en/abs/cost-vs-information-tradeoffs-for-treasure-hunt-in-the-plane-1902.060902019-02-19 https://scifaro.com/en/abs/interlaced-greedy-algorithm-for-maximization-of-submodular-functions-in-nearly-linear-time-1902.061792019-10-28 https://scifaro.com/en/abs/improved-convergence-for-ell-infty-and-ell-1-regression-via-iteratively-reweighted-least-squares-1902.063912019-07-11 https://scifaro.com/en/abs/extending-upward-planar-graph-drawings-1902.065752019-02-19 https://scifaro.com/en/abs/sub-linear-memory-sketches-for-near-neighbor-search-on-streaming-data-1902.066872020-09-15 https://scifaro.com/en/abs/sfcm-r-a-novel-algorithm-for-the-hamiltonian-sequence-problem-1902.067132019-06-19 https://scifaro.com/en/abs/constructive-heuristics-for-min-power-bounded-hops-symmetric-connectivity-problem-1902.067962019-02-20 https://scifaro.com/en/abs/characterizing-the-integrality-gap-of-the-subtour-lp-for-the-circulant-traveling-salesman-problem-1902.068082019-07-24 https://scifaro.com/en/abs/the-complexity-of-max-min-k-partitioning-1902.068122019-02-20 https://scifaro.com/en/abs/a-sub-quadratic-algorithm-for-the-longest-common-increasing-subsequence-problem-1902.068642020-01-31 https://scifaro.com/en/abs/covering-vectors-by-spaces-in-perturbed-graphic-matroids-and-their-duals-1902.069572019-02-20 https://scifaro.com/en/abs/travelling-on-graphs-with-small-highway-dimension-1902.070402019-07-15 https://scifaro.com/en/abs/hardness-of-exact-distance-queries-in-sparse-graphs-through-hub-labeling-1902.070552019-06-25 https://scifaro.com/en/abs/computational-hardness-of-certifying-bounds-on-constrained-pca-problems-1902.073242019-04-09 https://scifaro.com/en/abs/in-oder-aus-1902.073532019-02-21 https://scifaro.com/en/abs/load-balancing-for-parallel-delaunay-triangulations-1902.075542019-02-21 https://scifaro.com/en/abs/on-polynomial-time-combinatorial-algorithms-for-maximum-l-bounded-flow-1902.075682019-02-21 https://scifaro.com/en/abs/fast-small-and-simple-document-listing-on-repetitive-text-collections-1902.075992019-02-21 https://scifaro.com/en/abs/towards-work-efficient-parallel-parameterized-algorithms-1902.076602019-02-21 https://scifaro.com/en/abs/finding-big-matchings-in-planar-graphs-quickly-1902.078122019-02-22 https://scifaro.com/en/abs/the-markovian-price-of-information-1902.078562019-02-22 https://scifaro.com/en/abs/locality-1902.079282022-01-14 https://scifaro.com/en/abs/with-great-speed-come-small-buffers-space-bandwidth-tradeoffs-for-routing-1902.080692019-02-22 https://scifaro.com/en/abs/covering-a-tree-with-rooted-subtrees-1902.082182019-02-25 https://scifaro.com/en/abs/local-computation-algorithms-for-spanners-1902.082662019-02-25 https://scifaro.com/en/abs/a-time-distance-trade-off-for-gdd-with-preprocessing-instantiating-the-dlw-heuristic-1902.083402019-02-26 https://scifaro.com/en/abs/a-simple-upper-bound-for-trace-function-of-a-hypergraph-with-applications-1902.083662019-03-08 https://scifaro.com/en/abs/preconditioning-for-the-geometric-transportation-problem-1902.083842019-02-25 https://scifaro.com/en/abs/nonconvex-sampling-with-the-metropolis-adjusted-langevin-algorithm-1902.084522019-04-10 https://scifaro.com/en/abs/parameterized-k-clustering-the-distance-matters-1902.085592019-02-25 https://scifaro.com/en/abs/ell-1-sparsity-approximation-bounds-for-packing-integer-programs-1902.086982019-02-26 https://scifaro.com/en/abs/optimal-algorithm-to-reconstruct-a-tree-from-a-subtree-distance-1902.087422019-02-26 https://scifaro.com/en/abs/faster-and-simpler-algorithms-for-finding-large-patterns-in-permutations-1902.088092019-04-17 https://scifaro.com/en/abs/generation-of-tree-child-phylogenetic-networks-1902.090152020-07-01 https://scifaro.com/en/abs/fpras-for-the-potts-model-and-the-number-of-k-colorings-1902.091142019-02-28 https://scifaro.com/en/abs/succinct-data-structures-for-families-of-interval-graphs-1902.092282020-04-28 https://scifaro.com/en/abs/adaptive-estimation-for-approximate-k-nearest-neighbor-computations-1902.094652020-03-25 https://scifaro.com/en/abs/on-the-extension-complexity-of-scheduling-1902.102712019-02-28 https://scifaro.com/en/abs/weighted-maximum-independent-set-of-geometric-objects-in-turnstile-streams-1902.103282020-03-26 https://scifaro.com/en/abs/reconciliation-k-median-clustering-with-non-polarized-representatives-1902.104192021-07-29 https://scifaro.com/en/abs/dimension-independent-sparse-fourier-transform-1902.106332019-02-28 https://scifaro.com/en/abs/padovan-heaps-1902.108122019-03-01 https://scifaro.com/en/abs/improved-algorithms-for-correlation-clustering-with-local-objectives-1902.108292019-06-25 https://scifaro.com/en/abs/lower-bounds-for-multiplication-via-network-coding-1902.109352019-03-01 https://scifaro.com/en/abs/graph-and-string-parameters-connections-between-pathwidth-cutwidth-and-the-locality-number-1902.109832024-04-26 https://scifaro.com/en/abs/fast-concurrent-data-sketches-1902.109952019-12-06 https://scifaro.com/en/abs/on-the-area-requirements-of-planar-straight-line-orthogonal-drawings-of-ternary-trees-1902.110442019-03-01 https://scifaro.com/en/abs/ratio-balanced-maximum-flows-1902.110472019-03-01 https://scifaro.com/en/abs/parallel-weighted-random-sampling-1903.002272021-07-20 https://scifaro.com/en/abs/superseding-traditional-indexes-by-orchestrating-learning-and-geometry-1903.005072019-03-12 https://scifaro.com/en/abs/an-fptas-for-stochastic-unbounded-min-knapsack-problem-1903.005472019-04-16 https://scifaro.com/en/abs/online-graph-exploration-on-a-restricted-graph-class-optimal-solutions-for-tadpole-graphs-1903.005812020-04-21 https://scifaro.com/en/abs/one-table-to-count-them-all-parallel-frequency-estimation-on-single-board-computers-1903.007292019-03-05 https://scifaro.com/en/abs/deterministic-sparse-fourier-transform-with-an-ell-infty-guarantee-1903.009952020-05-08 https://scifaro.com/en/abs/an-fpt-algorithm-for-minimum-additive-spanner-problem-1903.010472019-03-05 https://scifaro.com/en/abs/decomposition-of-map-graphs-with-applications-1903.012912019-03-05 https://scifaro.com/en/abs/a-simple-solution-to-the-level-ancestor-problem-1903.013872021-11-09 https://scifaro.com/en/abs/lightweight-merging-of-compressed-indices-based-on-bwt-variants-1903.014652019-03-06 https://scifaro.com/en/abs/faster-biclique-mining-in-near-bipartite-graphs-1903.015382019-03-06 https://scifaro.com/en/abs/semi-dynamic-shortest-path-tree-algorithms-for-directed-graphs-with-arbitrary-weights-1903.017562019-03-06 https://scifaro.com/en/abs/an-widetilde-mathcal-o-m-varepsilon-3-5-cost-algorithm-for-semidefinite-programs-with-diagonal-constraints-1903.018592021-12-07 https://scifaro.com/en/abs/lempel-ziv-like-parsing-in-small-space-1903.019092020-05-12 https://scifaro.com/en/abs/an-efficient-algorithm-for-enumerating-chordal-bipartite-induced-subgraphs-in-sparse-graphs-1903.021612020-09-23 https://scifaro.com/en/abs/stable-noncrossing-matchings-1903.021852019-10-30 https://scifaro.com/en/abs/runtime-analysis-of-rls-and-1-1-ea-for-the-dynamic-weighted-vertex-cover-problem-1903.021952019-03-07 https://scifaro.com/en/abs/an-adaptive-grid-algorithm-for-computing-the-homology-group-of-semialgebraic-set-1903.023882019-03-07 https://scifaro.com/en/abs/the-parameterized-complexity-of-motion-planning-for-snake-like-robots-1903.024452019-03-07 https://scifaro.com/en/abs/entropy-trees-and-range-minimum-queries-in-optimal-average-case-space-1903.025332019-03-07 https://scifaro.com/en/abs/encoding-3sum-1903.026452019-03-08 https://scifaro.com/en/abs/stronger-l2-l2-compressed-sensing-without-iterating-1903.027422019-03-08 https://scifaro.com/en/abs/a-face-cover-perspective-to-ell-1-embeddings-of-planar-graphs-1903.027582024-07-30 https://scifaro.com/en/abs/the-robust-bilevel-continuous-knapsack-problem-with-uncertain-coefficients-in-the-follower-s-objective-1903.028102022-07-19 https://scifaro.com/en/abs/halin-graphs-are-3-vertex-colorable-except-even-wheels-1903.029042019-03-08 https://scifaro.com/en/abs/tiers-for-peers-a-practical-algorithm-for-discovering-hierarchy-in-weighted-networks-1903.029992019-04-24 https://scifaro.com/en/abs/fast-exact-dynamic-time-warping-on-run-length-encoded-time-series-1903.030032020-04-21 https://scifaro.com/en/abs/cache-oblivious-priority-queues-with-decrease-key-and-applications-to-graph-algorithms-1903.031472020-08-05 https://scifaro.com/en/abs/accelerating-generalized-linear-models-with-mlweaving-a-one-size-fits-all-system-for-any-precision-learning-technical-report-1903.034042019-03-29 https://scifaro.com/en/abs/set-crdt-com-m-ultiplas-pol-iticas-de-resolu-c-c-ao-de-conflitos-1903.034872019-03-11 https://scifaro.com/en/abs/the-one-way-communication-complexity-of-dynamic-time-warping-distance-1903.035202019-03-11 https://scifaro.com/en/abs/belga-b-trees-1903.035602019-03-11 https://scifaro.com/en/abs/near-optimal-online-algorithms-and-fast-approximation-algorithms-for-resource-allocation-problems-1903.039442019-03-12 https://scifaro.com/en/abs/asymptotically-faster-algorithm-for-counting-self-avoiding-walks-and-self-avoiding-polygons-1903.040542019-11-27 https://scifaro.com/en/abs/bus-manufacturing-workshop-scheduling-method-with-routing-buffer-1903.040972019-03-26 https://scifaro.com/en/abs/coresets-for-ordered-weighted-clustering-1903.043512019-03-12 https://scifaro.com/en/abs/optimal-randomized-parallel-algorithms-in-the-binary-forking-model-1903.046502020-06-26 https://scifaro.com/en/abs/the-k-d-tree-data-structure-and-a-proof-for-neighborhood-computation-in-expected-logarithmic-time-1903.049362019-03-13 https://scifaro.com/en/abs/new-dependencies-of-hierarchies-in-polynomial-optimization-1903.049962019-03-13 https://scifaro.com/en/abs/efficient-shortest-path-algorithm-using-an-unique-and-novel-graph-matrix-representation-1903.053772020-02-12 https://scifaro.com/en/abs/distributed-and-streaming-linear-programming-in-low-dimensions-1903.056172019-03-14 https://scifaro.com/en/abs/an-exact-algorithm-for-minimum-weight-vertex-cover-problem-in-large-graphs-1903.059482019-03-15 https://scifaro.com/en/abs/maximum-cut-parameterized-by-crossing-number-1903.060612020-07-23 https://scifaro.com/en/abs/the-parameterized-position-heap-of-a-trie-1903.062892019-03-18 https://scifaro.com/en/abs/fast-algorithms-for-the-shortest-unique-palindromic-substring-problem-on-run-length-encoded-strings-1903.062902020-03-25 https://scifaro.com/en/abs/subset-selection-for-matrices-with-fixed-blocks-1903.063502020-03-04 https://scifaro.com/en/abs/scalebf-a-high-scalable-membership-filter-using-3d-bloom-filter-1903.065702019-03-18 https://scifaro.com/en/abs/dynamic-planar-point-location-in-external-memory-1903.066012019-03-18 https://scifaro.com/en/abs/on-line-balancing-of-random-inputs-1903.068982020-07-14 https://scifaro.com/en/abs/diversity-of-solutions-an-exploration-through-the-lens-of-fixed-parameter-tractability-theory-1903.074102026-02-19 https://scifaro.com/en/abs/the-norms-of-graph-spanners-1903.074182019-03-19 https://scifaro.com/en/abs/counting-independent-sets-and-colorings-on-random-regular-bipartite-graphs-1903.075312019-03-19 https://scifaro.com/en/abs/a-new-lower-bound-for-semigroup-orthogonal-range-searching-1903.079672019-03-20 https://scifaro.com/en/abs/independent-range-sampling-revisited-again-1903.080142019-03-20 https://scifaro.com/en/abs/faster-algorithms-for-the-geometric-transportation-problem-1903.082632019-03-21 https://scifaro.com/en/abs/a-novel-dynamic-programming-approach-to-the-train-marshalling-problem-1903.083642020-08-10 https://scifaro.com/en/abs/rapid-convergence-of-the-unadjusted-langevin-algorithm-isoperimetry-suffices-1903.085682022-03-04 https://scifaro.com/en/abs/parallel-batch-dynamic-graph-connectivity-1903.087942020-05-19 https://scifaro.com/en/abs/raire-risk-limiting-audits-for-irv-elections-1903.088042019-10-30 https://scifaro.com/en/abs/an-empirical-analysis-of-exact-algorithms-for-the-unbounded-knapsack-problem-1903.089362019-03-22 https://scifaro.com/en/abs/efficient-algorithms-for-geometric-partial-matching-1903.093582019-03-25 https://scifaro.com/en/abs/determining-satisfiability-of-3-sat-in-polynomial-time-1903.100812020-07-02 https://scifaro.com/en/abs/topfiberm-scalable-and-efficient-boolean-matrix-factorization-1903.103262019-03-26 https://scifaro.com/en/abs/algorithms-to-compute-the-burrows-wheeler-similarity-distribution-1903.105832020-09-10 https://scifaro.com/en/abs/on-the-tractability-of-the-maximum-clique-problem-1903.107002019-05-20 https://scifaro.com/en/abs/syntactic-view-of-sigma-tau-generation-of-permutations-1903.107012019-03-27 https://scifaro.com/en/abs/malleable-scheduling-beyond-identical-machines-1903.110162020-04-08 https://scifaro.com/en/abs/testing-isomorphism-of-circular-arc-graphs-in-polynomial-time-1903.110622019-07-15 https://scifaro.com/en/abs/probabilistic-analysis-of-facility-location-on-random-shortest-path-metrics-1903.119802019-03-29 https://scifaro.com/en/abs/dynamic-streaming-spectral-sparsification-in-nearly-linear-time-and-space-1903.121502019-03-29 https://scifaro.com/en/abs/faster-spectral-sparsification-in-dynamic-streams-1903.121652019-03-29 https://scifaro.com/en/abs/data-structures-to-represent-a-set-of-k-long-dna-sequences-1903.123122020-06-15 https://scifaro.com/en/abs/a-force-directed-approach-for-offline-gps-trajectory-map-matching-1903.124002019-04-01 https://scifaro.com/en/abs/multiplication-method-for-factoring-natural-numbers-1903.124492019-04-01 https://scifaro.com/en/abs/shed-more-light-on-bloom-filter-s-variants-1903.125252019-04-01 https://scifaro.com/en/abs/connected-max-cut-is-polynomial-for-graphs-without-k-5-backslash-e-as-a-minor-1903.126412019-04-25 https://scifaro.com/en/abs/dynamic-data-structures-for-interval-coloring-1904.006922020-01-28 https://scifaro.com/en/abs/distributed-metropolis-sampler-with-optimal-parallelism-1904.009432019-07-16 https://scifaro.com/en/abs/incorrect-implementations-of-the-floyd-warshall-algorithm-give-correct-solutions-after-three-repeats-1904.012102019-04-03 https://scifaro.com/en/abs/a-rearrangement-distance-for-fully-labelled-trees-1904.013212019-04-03 https://scifaro.com/en/abs/slow-mixing-of-glauber-dynamics-for-the-six-vertex-model-in-the-ordered-phases-1904.014952020-12-23 https://scifaro.com/en/abs/weisfeiler-and-leman-go-sparse-towards-scalable-higher-order-graph-embeddings-1904.015432020-10-20 https://scifaro.com/en/abs/oriented-coloring-on-recursively-defined-digraphs-1904.015702019-06-12 https://scifaro.com/en/abs/sanns-scaling-up-secure-approximate-k-nearest-neighbors-search-1904.020332020-03-10 https://scifaro.com/en/abs/orthogonal-voronoi-diagram-and-treemap-1904.023482020-09-17 https://scifaro.com/en/abs/quasi-polynomial-algorithms-for-list-coloring-of-nearly-intersecting-hypergraphs-1904.024252019-04-05 https://scifaro.com/en/abs/compact-error-resilient-self-assembly-of-recursively-defined-patterns-1904.027632019-04-09 https://scifaro.com/en/abs/taming-the-knight-s-tour-minimizing-turns-and-crossings-1904.028242022-01-19 https://scifaro.com/en/abs/achieving-optimal-backlog-in-multi-processor-cup-games-1904.028612019-04-08 https://scifaro.com/en/abs/hitting-topological-minors-is-fpt-1904.029442020-01-08 https://scifaro.com/en/abs/knot-diagrams-of-treewidth-two-1904.031172019-04-09 https://scifaro.com/en/abs/spectral-analysis-of-matrix-scaling-and-operator-scaling-1904.032132019-04-09 https://scifaro.com/en/abs/network-design-for-s-t-effective-resistance-1904.032192019-04-09 https://scifaro.com/en/abs/average-sensitivity-of-graph-algorithms-1904.032482020-04-14 https://scifaro.com/en/abs/density-friendly-graph-decomposition-1904.034672020-01-16 https://scifaro.com/en/abs/the-kikuchi-hierarchy-and-tensor-pca-1904.038582025-08-21 https://scifaro.com/en/abs/parametrized-metrical-task-systems-1904.038742019-04-09 https://scifaro.com/en/abs/two-sided-matching-markets-with-correlated-random-preferences-1904.038902021-12-14 https://scifaro.com/en/abs/from-independent-sets-and-vertex-colorings-to-isotropic-spaces-and-isotropic-decompositions-1904.039502019-09-24 https://scifaro.com/en/abs/subsets-and-supermajorities-optimal-hashing-based-set-similarity-search-1904.040452020-04-21 https://scifaro.com/en/abs/weighted-reservoir-sampling-from-distributed-streams-1904.041262019-04-09 https://scifaro.com/en/abs/a-note-on-cunningham-s-algorithm-for-matroid-intersection-1904.041292019-04-09 https://scifaro.com/en/abs/string-synchronizing-sets-sublinear-time-bwt-construction-and-optimal-lce-data-structure-1904.042282020-12-09 https://scifaro.com/en/abs/the-fault-tolerant-metric-dimension-of-cographs-1904.042432019-04-10 https://scifaro.com/en/abs/distributed-edge-connectivity-in-sublinear-time-1904.043412019-04-10 https://scifaro.com/en/abs/discovering-bands-from-graphs-1904.044032019-04-10 https://scifaro.com/en/abs/breaking-quadratic-time-for-small-vertex-connectivity-and-an-approximation-scheme-1904.044532021-02-19 https://scifaro.com/en/abs/testing-isomorphism-of-circular-arc-graphs-hsu-s-approach-revisited-1904.045012019-07-16 https://scifaro.com/en/abs/towards-a-complete-perspective-on-labeled-tree-indexing-new-size-bounds-efficient-constructions-and-beyond-1904.045132022-01-04 https://scifaro.com/en/abs/polynomial-pass-lower-bounds-for-graph-streaming-algorithms-1904.047202019-04-10 https://scifaro.com/en/abs/lower-bounds-for-oblivious-near-neighbor-search-1904.048282019-04-11 https://scifaro.com/en/abs/bridging-between-0-1-and-linear-programming-via-random-walks-1904.048602019-04-11 https://scifaro.com/en/abs/the-complexity-of-subtree-intersection-representation-of-chordal-graphs-and-linear-time-chordal-graph-generation-1904.049162019-05-20 https://scifaro.com/en/abs/an-fpt-algorithm-for-max-cut-parameterized-by-crossing-number-1904.050112019-05-27 https://scifaro.com/en/abs/minimum-spanning-trees-in-weakly-dynamic-graphs-1904.050662019-04-11 https://scifaro.com/en/abs/the-mobile-server-problem-1904.052202019-04-11 https://scifaro.com/en/abs/testing-unateness-nearly-optimally-1904.053092019-04-11 https://scifaro.com/en/abs/constant-factor-approximation-of-near-linear-edit-distance-in-near-linear-time-1904.053902020-01-29 https://scifaro.com/en/abs/reducing-approximate-longest-common-subsequence-to-approximate-edit-distance-1904.054512019-04-12 https://scifaro.com/en/abs/constant-factor-approximations-to-edit-distance-on-far-input-pairs-in-nearly-linear-time-1904.054592019-05-10 https://scifaro.com/en/abs/efficient-distributed-workload-re-embedding-1904.054742019-04-12 https://scifaro.com/en/abs/beyond-trace-reconstruction-population-recovery-from-the-deletion-channel-1904.055322019-04-12 https://scifaro.com/en/abs/tight-bounds-for-the-subspace-sketch-problem-with-applications-1904.055432019-10-15 https://scifaro.com/en/abs/quasi-popular-matchings-optimality-and-extended-formulations-1904.059742020-05-06 https://scifaro.com/en/abs/low-rank-binary-matrix-approximation-in-column-sum-norm-1904.061412019-04-15 https://scifaro.com/en/abs/maximizing-online-utilization-with-commitment-1904.061502019-04-15 https://scifaro.com/en/abs/the-perfect-matching-reconfiguration-problem-1904.061842019-04-15 https://scifaro.com/en/abs/online-bin-covering-with-limited-migration-1904.065432019-04-16 https://scifaro.com/en/abs/approximating-the-noise-sensitivity-of-a-monotone-boolean-function-1904.067452019-04-16 https://scifaro.com/en/abs/general-framework-for-metric-optimization-problems-with-delay-or-with-deadlines-1904.071312019-04-16 https://scifaro.com/en/abs/bounded-and-approximate-strong-satisfiability-in-workflows-1904.072342019-04-17 https://scifaro.com/en/abs/distance-generalized-core-decomposition-1904.072622019-04-17 https://scifaro.com/en/abs/stochastic-load-balancing-on-unrelated-machines-1904.072712019-04-17 https://scifaro.com/en/abs/approximation-algorithms-for-distributionally-robust-stochastic-optimization-with-black-box-distributions-1904.073812023-10-25 https://scifaro.com/en/abs/point-width-and-max-csps-1904.073882020-09-21 https://scifaro.com/en/abs/c-trie-a-dynamic-trie-tailored-for-fast-prefix-searches-1904.074672020-10-08 https://scifaro.com/en/abs/p-adic-scaled-space-filling-curve-indices-for-high-dimensional-data-1904.077002019-04-17 https://scifaro.com/en/abs/heuristic-algorithms-for-the-longest-filled-common-subsequence-problem-1904.079022019-08-06 https://scifaro.com/en/abs/almost-smooth-histograms-and-sliding-window-graph-algorithms-1904.079572022-05-26 https://scifaro.com/en/abs/improved-distributed-expander-decomposition-and-nearly-optimal-triangle-enumeration-1904.080372019-05-28 https://scifaro.com/en/abs/a-scaled-space-filling-curve-index-applied-to-tropical-rain-forest-tree-distributions-1904.080532019-04-26 https://scifaro.com/en/abs/a-brief-note-on-single-source-fault-tolerant-reachability-1904.081502019-04-18 https://scifaro.com/en/abs/online-matching-with-general-arrivals-1904.082552019-04-18 https://scifaro.com/en/abs/jgrapht-a-java-library-for-graph-data-structures-and-algorithms-1904.083552020-02-04 https://scifaro.com/en/abs/a-faster-local-algorithm-for-detecting-bounded-size-cuts-with-applications-to-higher-connectivity-problems-1904.083822019-04-23 https://scifaro.com/en/abs/new-subgraph-isomorphism-algorithms-vertex-versus-path-at-a-time-matching-1904.088192019-04-19 https://scifaro.com/en/abs/convex-graph-invariant-relaxations-for-graph-edit-distance-1904.089342019-04-22 https://scifaro.com/en/abs/an-efficient-algorithm-for-the-fast-delivery-problem-1904.091422019-08-20 https://scifaro.com/en/abs/beyond-submodular-maximization-via-one-sided-smoothness-1904.092162020-06-03 https://scifaro.com/en/abs/tight-bounds-for-online-edge-coloring-1904.092222019-04-22 https://scifaro.com/en/abs/stochastic-online-metric-matching-1904.092842019-04-22 https://scifaro.com/en/abs/submodular-maximization-beyond-non-negativity-guarantees-fast-algorithms-and-applications-1904.093542019-04-23 https://scifaro.com/en/abs/decomposing-a-graph-into-unigraphs-1904.094382019-04-23 https://scifaro.com/en/abs/cluster-deletion-on-interval-graphs-and-split-related-graphs-1904.094702019-04-23 https://scifaro.com/en/abs/an-improved-fptas-for-0-1-knapsack-1904.095622020-01-03 https://scifaro.com/en/abs/trace-reconstruction-generalized-and-parameterized-1904.096182021-03-16 https://scifaro.com/en/abs/scheduling-to-approximate-minimization-objectives-on-identical-machines-1904.096672019-04-23 https://scifaro.com/en/abs/dynamic-time-warping-in-strongly-subquadratic-time-algorithms-for-the-low-distance-regime-and-approximate-evaluation-1904.096902019-05-27 https://scifaro.com/en/abs/robust-clustering-oracle-and-local-reconstructor-of-cluster-structure-of-graphs-1904.097102019-04-23 https://scifaro.com/en/abs/simple-heuristics-yield-provable-algorithms-for-masked-low-rank-approximation-1904.098412020-12-01 https://scifaro.com/en/abs/almost-optimal-testers-for-concise-representations-1904.099582023-06-22 https://scifaro.com/en/abs/hierarchical-b-matching-1904.102102019-04-24 https://scifaro.com/en/abs/multicast-communications-in-tree-networks-with-heterogeneous-capacity-constraints-1904.102152020-05-25 https://scifaro.com/en/abs/normalizers-and-permutational-isomorphisms-in-simply-exponential-time-1904.104542019-06-11 https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-facility-location-on-planar-graphs-1904.106802019-04-25 https://scifaro.com/en/abs/faster-algorithms-for-all-pairs-non-decreasing-paths-problem-1904.107012019-04-25 https://scifaro.com/en/abs/reoptimization-of-path-vertex-cover-problem-1904.107192019-04-25 https://scifaro.com/en/abs/building-a-nest-by-an-automaton-1904.108502024-01-26 https://scifaro.com/en/abs/summarizing-data-succinctly-with-the-most-informative-itemsets-1904.111342019-04-30 https://scifaro.com/en/abs/on-adaptive-algorithms-for-maximum-matching-1904.112442019-04-26 https://scifaro.com/en/abs/stochastic-rounding-and-reduced-precision-fixed-point-arithmetic-for-solving-neural-ordinary-differential-equations-1904.112632020-01-23 https://scifaro.com/en/abs/detecting-and-counting-small-patterns-in-planar-graphs-in-subexponential-parameterized-time-1904.112852019-04-26 https://scifaro.com/en/abs/tight-approximation-algorithms-for-bichromatic-graph-diameter-and-related-problems-1904.116012019-04-29 https://scifaro.com/en/abs/approximation-algorithms-for-min-distance-problems-1904.116062019-06-18 https://scifaro.com/en/abs/the-minimum-cost-query-problem-on-matroids-with-uncertainty-areas-1904.116682019-04-29 https://scifaro.com/en/abs/the-potential-of-restarts-for-probsat-1904.117572020-05-11 https://scifaro.com/en/abs/tight-bounds-for-online-weighted-tree-augmentation-1904.117772019-04-29 https://scifaro.com/en/abs/dynamic-inference-in-probabilistic-graphical-models-1904.118072020-11-30 https://scifaro.com/en/abs/retracting-graphs-to-cycles-1904.119462019-04-29 https://scifaro.com/en/abs/performance-of-a-quantum-annealer-for-ising-ground-state-computations-on-chimera-graphs-1904.119652019-04-30 https://scifaro.com/en/abs/a-linear-time-algorithm-for-radius-optimally-augmenting-paths-in-a-metric-space-1904.120612019-04-30 https://scifaro.com/en/abs/generalizing-the-covering-path-problem-on-a-grid-1904.122582019-04-30 https://scifaro.com/en/abs/tight-fpt-approximations-for-k-median-and-k-means-1904.123342019-04-30 https://scifaro.com/en/abs/compact-fenwick-trees-for-dynamic-ranking-and-selection-1904.123702019-10-15 https://scifaro.com/en/abs/improved-dynamic-graph-coloring-1904.124272020-06-23 https://scifaro.com/en/abs/a-fast-scalable-heuristic-for-bin-packing-1904.124672019-04-30 https://scifaro.com/en/abs/composing-dynamic-programming-tree-decomposition-based-algorithms-1904.125002024-08-07 https://scifaro.com/en/abs/solving-vertex-cover-in-polynomial-time-on-hyperbolic-random-graphs-1904.125032020-02-20 https://scifaro.com/en/abs/graph-planarity-testing-with-hierarchical-embedding-constraints-1904.125962019-11-19 https://scifaro.com/en/abs/an-efficient-branch-and-cut-algorithm-for-approximately-submodular-function-maximization-1904.126822019-04-30 https://scifaro.com/en/abs/pushing-lines-helps-efficient-universal-centralised-transformations-for-programmable-matter-1904.127772019-04-30 https://scifaro.com/en/abs/the-i-o-complexity-of-hybrid-algorithms-for-square-matrix-multiplication-1904.128042019-04-30 https://scifaro.com/en/abs/estimating-the-frequency-of-a-clustered-signal-1904.130432019-05-01 https://scifaro.com/en/abs/a-quantum-inspired-similarity-measure-for-the-analysis-of-complete-weighted-graphs-1904.132392019-05-01 https://scifaro.com/en/abs/phase-transition-in-democratic-opinion-dynamics-1904.133092019-05-01 https://scifaro.com/en/abs/simpler-and-better-algorithms-for-minimum-norm-load-balancing-1905.000442019-05-02 https://scifaro.com/en/abs/online-bin-covering-with-advice-1905.000662020-06-03 https://scifaro.com/en/abs/permutation-code-equivalence-is-not-harder-than-graph-isomorphism-when-hulls-are-trivial-1905.000732021-03-05 https://scifaro.com/en/abs/using-non-linear-difference-equations-to-study-quicksort-algorithms-1905.001182020-02-27 https://scifaro.com/en/abs/inventory-routing-problem-with-facility-location-1905.001482019-05-02 https://scifaro.com/en/abs/separate-chaining-meets-compact-hashing-1905.001632019-05-02 https://scifaro.com/en/abs/independent-set-reconfiguration-parameterized-by-modular-width-1905.003402019-05-02 https://scifaro.com/en/abs/fast-hashing-with-strong-concentration-bounds-1905.003692020-08-11 https://scifaro.com/en/abs/reconfiguring-undirected-paths-1905.005182019-05-03 https://scifaro.com/en/abs/graph-coloring-via-degeneracy-in-streaming-and-other-space-conscious-models-1905.005662019-05-03 https://scifaro.com/en/abs/online-circle-packing-1905.006122019-05-03 https://scifaro.com/en/abs/tight-approximation-bounds-for-maximum-multi-coverage-1905.006402022-05-24 https://scifaro.com/en/abs/efficient-approximation-schemes-for-uniform-cost-clustering-problems-in-planar-graphs-1905.006562019-05-03 https://scifaro.com/en/abs/static-pricing-universal-guarantees-for-reusable-resources-1905.007312020-02-12 https://scifaro.com/en/abs/scalable-and-jointly-differentially-private-packing-1905.007672019-05-03 https://scifaro.com/en/abs/near-optimal-jointly-private-packing-algorithms-via-dual-multiplicative-weight-update-1905.008122019-05-03 https://scifaro.com/en/abs/log-diameter-rounds-algorithms-for-2-vertex-and-2-edge-connectivity-1905.008502019-05-03 https://scifaro.com/en/abs/positive-instance-driven-dynamic-programming-for-graph-searching-1905.011342019-05-06 https://scifaro.com/en/abs/fully-dynamic-single-source-reachability-in-practice-an-experimental-study-1905.012162020-02-04 https://scifaro.com/en/abs/rle-edit-distance-in-near-optimal-time-1905.012542019-05-06 https://scifaro.com/en/abs/breaking-the-bellman-ford-shortest-path-bound-1905.013252019-06-19 https://scifaro.com/en/abs/new-reduction-rules-for-the-tree-bisection-and-reconnection-distance-1905.014682021-04-13 https://scifaro.com/en/abs/new-notions-and-constructions-of-sparsification-for-graphs-and-hypergraphs-1905.014952019-05-07 https://scifaro.com/en/abs/testable-properties-in-general-graphs-and-random-order-streaming-1905.016442019-05-07 https://scifaro.com/en/abs/faster-polytope-rounding-sampling-and-volume-computation-via-a-sublinear-ball-walk-1905.017452019-09-17 https://scifaro.com/en/abs/mapreduce-meets-fine-grained-complexity-mapreduce-algorithms-for-apsp-matrix-multiplication-3-sum-and-beyond-1905.017482019-05-07 https://scifaro.com/en/abs/fpt-algorithms-for-conflict-free-coloring-of-graphs-and-chromatic-terrain-guarding-1905.018222019-05-07 https://scifaro.com/en/abs/non-clairvoyant-precedence-constrained-scheduling-1905.021332019-05-07 https://scifaro.com/en/abs/efficient-second-order-shape-constrained-function-fitting-1905.021492019-05-30 https://scifaro.com/en/abs/elastic-degenerate-string-matching-via-fast-matrix-multiplication-1905.022982021-05-05 https://scifaro.com/en/abs/optimal-convergence-rate-of-hamiltonian-monte-carlo-for-strongly-logconcave-distributions-1905.023132019-05-08 https://scifaro.com/en/abs/parallel-cut-pursuit-for-minimization-of-the-graph-total-variation-1905.023162019-05-08 https://scifaro.com/en/abs/orthogonal-range-reporting-and-rectangle-stabbing-for-fat-rectangles-1905.023222019-05-08 https://scifaro.com/en/abs/prsim-sublinear-time-simrank-computation-on-large-power-law-graphs-1905.023542019-05-08 https://scifaro.com/en/abs/separations-and-equivalences-between-turnstile-streaming-and-linear-sketching-1905.023582021-01-06 https://scifaro.com/en/abs/adversarially-robust-submodular-maximization-under-knapsack-constraints-1905.023672019-05-08 https://scifaro.com/en/abs/equal-subset-sum-faster-than-the-meet-in-the-middle-1905.024242019-07-04 https://scifaro.com/en/abs/robust-two-stage-combinatorial-optimization-problems-under-convex-uncertainty-1905.024692019-05-08 https://scifaro.com/en/abs/self-adjusting-linear-networks-1905.024722019-05-08 https://scifaro.com/en/abs/order-preserving-pattern-matching-indeterminate-strings-1905.025892019-05-08 https://scifaro.com/en/abs/distributed-construction-of-light-networks-1905.025922019-05-08 https://scifaro.com/en/abs/external-memory-planar-point-location-with-fast-updates-1905.026202022-03-31 https://scifaro.com/en/abs/hiring-under-uncertainty-1905.027092019-05-08 https://scifaro.com/en/abs/online-and-offline-greedy-algorithms-for-routing-with-switching-costs-1905.028002019-05-09 https://scifaro.com/en/abs/network-coding-gaps-for-completion-times-of-multiple-unicasts-1905.028052020-04-30 https://scifaro.com/en/abs/testing-bipartitness-in-an-augmented-vdf-bounded-degree-graph-model-1905.030702019-06-06 https://scifaro.com/en/abs/finding-cuts-of-bounded-degree-complexity-fpt-and-exact-algorithms-and-kernelization-1905.031342019-05-09 https://scifaro.com/en/abs/zeros-and-approximations-of-holant-polynomials-on-the-complex-plane-1905.031942023-06-22 https://scifaro.com/en/abs/efficient-on-line-computation-of-visibility-graphs-1905.032042020-04-29 https://scifaro.com/en/abs/on-the-approximate-compressibility-of-connected-vertex-cover-1905.033792020-04-30 https://scifaro.com/en/abs/an-invertible-transform-for-efficient-string-matching-in-labeled-digraphs-1905.034242021-11-24 https://scifaro.com/en/abs/variable-neighborhood-search-for-the-bin-packing-problem-with-compatible-categories-1905.034272019-05-10 https://scifaro.com/en/abs/linear-work-generation-of-r-mat-graphs-1905.035252020-10-14 https://scifaro.com/en/abs/typical-sequences-revisited-computing-width-parameters-of-graphs-1905.036432020-01-15 https://scifaro.com/en/abs/finding-optimal-longest-paths-by-dynamic-programming-in-parallel-1905.036452019-05-10 https://scifaro.com/en/abs/coresets-for-minimum-enclosing-balls-over-sliding-windows-1905.037182019-05-13 https://scifaro.com/en/abs/a-tight-lower-bound-for-comparison-based-quantile-summaries-1905.038382026-01-27 https://scifaro.com/en/abs/refined-complexity-of-pca-with-outliers-1905.041242019-05-13 https://scifaro.com/en/abs/online-multistage-subset-maximization-problems-1905.041622019-05-13 https://scifaro.com/en/abs/variable-elimination-in-binary-csps-1905.042092019-05-13 https://scifaro.com/en/abs/good-things-come-to-those-who-swap-objects-on-paths-1905.042192019-05-13 https://scifaro.com/en/abs/solving-empirical-risk-minimization-in-the-current-matrix-multiplication-time-1905.044472019-05-14 https://scifaro.com/en/abs/a-new-shortest-path-algorithm-generalized-on-dynamic-graph-for-commercial-intelligent-navigation-for-transportation-management-1905.044692019-05-14 https://scifaro.com/en/abs/privatejobmatch-a-privacy-oriented-deferred-multi-match-recommender-system-for-stable-employment-1905.045642019-05-14 https://scifaro.com/en/abs/continuous-time-systems-for-solving-0-1-integer-linear-programming-feasibility-problems-1905.046122019-05-14 https://scifaro.com/en/abs/list-decodable-learning-via-sum-of-squares-1905.046602019-05-14 https://scifaro.com/en/abs/algorithms-for-online-matching-assortment-and-pricing-with-tight-weight-dependent-competitive-ratios-1905.047702019-05-14 https://scifaro.com/en/abs/maximum-weighted-matching-with-few-edge-crossings-for-2-layered-bipartite-graph-1905.048532019-09-17 https://scifaro.com/en/abs/streaming-algorithms-for-bin-packing-and-vector-scheduling-1905.048972026-01-27 https://scifaro.com/en/abs/an-improved-algorithm-for-the-submodular-secretary-problem-with-a-cardinality-constraint-1905.049412019-05-14 https://scifaro.com/en/abs/dynamic-matrix-inverse-improved-algorithms-and-matching-conditional-lower-bounds-1905.050672019-05-14 https://scifaro.com/en/abs/optimal-multithreaded-batch-parallel-2-3-trees-1905.052542021-10-25 https://scifaro.com/en/abs/5-4-approximation-for-symmetric-tsp-1905.052912021-04-27 https://scifaro.com/en/abs/computing-and-testing-small-vertex-connectivity-in-near-linear-time-and-queries-1905.053292019-07-09 https://scifaro.com/en/abs/dimensionality-reduction-for-tukey-regression-1905.053762019-05-15 https://scifaro.com/en/abs/online-computation-with-untrusted-advice-1905.056552024-04-17 https://scifaro.com/en/abs/list-decodable-linear-regression-1905.056792019-05-31 https://scifaro.com/en/abs/restricted-max-min-allocation-approximation-and-integrality-gap-1905.060842019-05-16 https://scifaro.com/en/abs/tight-kernel-query-complexity-of-kernel-ridge-regression-and-kernel-k-means-clustering-1905.063942019-05-17 https://scifaro.com/en/abs/two-sided-profile-based-optimality-in-the-stable-marriage-problem-1905.066262020-09-14 https://scifaro.com/en/abs/efficiently-generating-geometric-inhomogeneous-and-hyperbolic-random-graphs-1905.067062019-08-26 https://scifaro.com/en/abs/time-energy-tradeoffs-for-evacuation-by-two-robots-in-the-wireless-model-1905.067832019-05-17 https://scifaro.com/en/abs/switches-in-eulerian-graphs-1905.068952019-05-17 https://scifaro.com/en/abs/target-set-in-threshold-models-1905.068962019-05-17 https://scifaro.com/en/abs/separating-structure-from-noise-in-large-graphs-using-the-regularity-lemma-1905.069172019-05-22 https://scifaro.com/en/abs/stay-or-switch-competitive-online-algorithms-for-energy-plan-selection-in-energy-markets-with-retail-choice-1905.071452024-06-19 https://scifaro.com/en/abs/parallel-decompression-of-gzip-compressed-files-and-random-access-to-dna-sequences-1905.072242019-05-20 https://scifaro.com/en/abs/randomization-of-approximate-bilinear-computation-for-matrix-multiplication-1905.074392022-01-11 https://scifaro.com/en/abs/shortest-path-algorithms-between-theory-and-practice-1905.074482021-06-25 https://scifaro.com/en/abs/speeding-up-the-karatsuba-algorithm-1905.074552020-05-05 https://scifaro.com/en/abs/deterministic-combinatorial-replacement-paths-and-distance-sensitivity-oracles-1905.074832019-05-21 https://scifaro.com/en/abs/covering-metric-spaces-by-few-trees-1905.075592019-05-21 https://scifaro.com/en/abs/robust-online-algorithms-for-dynamic-problems-1905.079862019-05-21 https://scifaro.com/en/abs/a-new-algebraic-approach-to-the-graph-isomorphism-and-clique-problems-1905.080332020-11-25 https://scifaro.com/en/abs/inference-under-information-constraints-ii-communication-constraints-and-shared-randomness-1905.083022020-10-02 https://scifaro.com/en/abs/efficient-profile-maximum-likelihood-for-universal-symmetric-property-estimation-1905.084482019-05-22 https://scifaro.com/en/abs/approximation-results-for-makespan-minimization-with-budgeted-uncertainty-1905.085922019-05-22 https://scifaro.com/en/abs/an-optimal-monotone-contention-resolution-scheme-for-bipartite-matchings-via-a-polyhedral-viewpoint-1905.086582019-05-22 https://scifaro.com/en/abs/parallel-reachability-in-almost-linear-work-and-square-root-depth-1905.088412019-12-09 https://scifaro.com/en/abs/cartesian-tree-matching-and-indexing-1905.089742019-05-23 https://scifaro.com/en/abs/a-memory-efficient-sketch-method-for-estimating-high-similarities-in-streaming-sets-1905.089772019-05-23 https://scifaro.com/en/abs/graph-searches-and-their-end-vertices-1905.095052019-05-24 https://scifaro.com/en/abs/on-the-average-case-of-mergeinsertion-1905.096562019-05-24 https://scifaro.com/en/abs/approximation-schemes-for-the-generalized-extensible-bin-packing-problem-1905.097502019-05-24 https://scifaro.com/en/abs/an-efficient-approach-for-super-and-nested-term-indexing-and-retrieval-1905.097612019-05-24 https://scifaro.com/en/abs/fast-algorithms-for-computational-optimal-transport-and-wasserstein-barycenter-1905.099522020-06-16 https://scifaro.com/en/abs/the-effectiveness-of-uniform-sampling-for-center-based-clustering-with-outliers-1905.101432020-05-04 https://scifaro.com/en/abs/hardness-of-distributed-optimization-1905.102842019-05-27 https://scifaro.com/en/abs/efficiently-estimating-erdos-renyi-graphs-with-node-differential-privacy-1905.104772019-05-28 https://scifaro.com/en/abs/subgraph-isomorphism-on-graph-classes-that-exclude-a-substructure-1905.106702019-05-28 https://scifaro.com/en/abs/deterministic-distributed-dominating-set-approximation-in-the-congest-model-1905.107752019-12-24 https://scifaro.com/en/abs/minimum-age-tdma-scheduling-1905.108092019-05-31 https://scifaro.com/en/abs/improved-distributed-approximations-for-minimum-weight-two-edge-connected-spanning-subgraph-1905.108332019-06-04 https://scifaro.com/en/abs/engineering-kernelization-for-maximum-cut-1905.109022019-05-28 https://scifaro.com/en/abs/a-new-algorithm-for-decremental-single-source-shortest-paths-with-applications-to-vertex-capacitated-flow-and-cut-problems-1905.115122019-05-29 https://scifaro.com/en/abs/adaptive-reduced-rank-regression-1905.115662020-10-27 https://scifaro.com/en/abs/a-near-optimal-algorithm-for-approximating-the-john-ellipsoid-1905.115802020-02-19 https://scifaro.com/en/abs/certified-lattice-reduction-1905.117432019-05-29 https://scifaro.com/en/abs/chasing-convex-bodies-with-linear-competitive-ratio-1905.118772020-01-08 https://scifaro.com/en/abs/paper-matching-with-local-fairness-constraints-1905.119242019-05-29 https://scifaro.com/en/abs/private-identity-testing-for-high-dimensional-distributions-1905.119472022-03-07 https://scifaro.com/en/abs/chasing-convex-bodies-optimally-1905.119682021-11-25 https://scifaro.com/en/abs/improved-analysis-of-highest-degree-branching-for-feedback-vertex-set-1905.122332019-05-30 https://scifaro.com/en/abs/reallocating-multiple-facilities-on-the-line-1905.123792019-05-30 https://scifaro.com/en/abs/on-the-clique-width-of-unigraphs-1905.124612022-02-01 https://scifaro.com/en/abs/clustering-without-over-representation-1905.127532019-05-31 https://scifaro.com/en/abs/online-matching-with-stochastic-rewards-optimal-competitive-ratio-via-path-based-formulation-1905.127782022-05-12 https://scifaro.com/en/abs/space-efficient-algorithms-for-computing-minimal-shortest-unique-substrings-1905.128542020-09-15 https://scifaro.com/en/abs/inducing-the-lyndon-array-1905.129872020-09-10 https://scifaro.com/en/abs/private-hypothesis-selection-1905.132292021-01-05 https://scifaro.com/en/abs/parallel-algorithm-for-non-monotone-dr-submodular-maximization-1905.132722019-06-03 https://scifaro.com/en/abs/a-weighted-linear-matroid-parity-algorithm-1905.133712019-06-03 https://scifaro.com/en/abs/majorisation-minimisation-algorithms-for-minimising-the-difference-between-lattice-submodular-functions-1905.134922019-06-03 https://scifaro.com/en/abs/principal-fairness-removing-bias-via-projections-1905.136512021-03-09 https://scifaro.com/en/abs/parameterization-of-tensor-network-contraction-1906.000132019-06-04 https://scifaro.com/en/abs/sample-optimal-low-rank-approximation-of-distance-matrices-1906.003392019-06-05 https://scifaro.com/en/abs/the-number-of-minimum-k-cuts-improving-the-karger-stein-bound-1906.004172019-06-04 https://scifaro.com/en/abs/on-the-use-of-randomness-in-local-distributed-graph-algorithms-1906.004822019-06-04 https://scifaro.com/en/abs/direct-linear-time-construction-of-parameterized-suffix-and-lcp-arrays-for-constant-alphabets-1906.005632019-06-04 https://scifaro.com/en/abs/a-direct-tilde-o-1-epsilon-iteration-parallel-algorithm-for-optimal-transport-1906.006182019-06-04 https://scifaro.com/en/abs/rpair-rescaling-repair-with-rsync-1906.008092019-06-04 https://scifaro.com/en/abs/cores-and-other-dense-structures-in-complex-networks-1906.010502019-06-05 https://scifaro.com/en/abs/a-separator-based-method-for-generating-weakly-chordal-graphs-1906.010562019-06-05 https://scifaro.com/en/abs/on-the-efficiency-of-entropic-regularized-algorithms-for-optimal-transport-1906.014372022-05-19 https://scifaro.com/en/abs/counting-independent-sets-in-unbalanced-bipartite-graphs-1906.016662019-06-06 https://scifaro.com/en/abs/scalable-spatial-scan-statistics-for-trajectories-1906.016932019-06-06 https://scifaro.com/en/abs/fair-near-neighbor-search-independent-range-sampling-in-high-dimensions-1906.018592020-06-16 https://scifaro.com/en/abs/a-note-on-submodular-maximization-over-independence-systems-1906.023152019-06-11 https://scifaro.com/en/abs/optimal-algebraic-breadth-first-search-for-sparse-graphs-1906.031132021-05-14 https://scifaro.com/en/abs/finding-a-shortest-non-zero-path-in-group-labeled-graphs-1906.040622021-09-10 https://scifaro.com/en/abs/parallel-streaming-random-sampling-1906.041202019-06-11 https://scifaro.com/en/abs/pure-entropic-regularization-for-metrical-task-systems-1906.042702020-09-04 https://scifaro.com/en/abs/almost-optimal-semi-streaming-maximization-for-k-extendible-systems-1906.044492019-06-12 https://scifaro.com/en/abs/study-of-compressed-randomized-utv-decompositions-for-low-rank-matrix-approximations-in-data-science-1906.045722019-06-12 https://scifaro.com/en/abs/unlimited-transfers-for-multi-modal-route-planning-an-efficient-solution-1906.048322023-02-02 https://scifaro.com/en/abs/similarity-problems-in-high-dimensions-1906.048422019-06-13 https://scifaro.com/en/abs/prefix-block-interchanges-on-binary-and-ternary-strings-1906.048972019-06-13 https://scifaro.com/en/abs/prophet-inequalities-on-the-intersection-of-a-matroid-and-a-graph-1906.048992019-07-17 https://scifaro.com/en/abs/sorted-top-k-in-rounds-1906.052082019-06-13 https://scifaro.com/en/abs/the-tandem-duplication-distance-is-np-hard-1906.052662019-06-13 https://scifaro.com/en/abs/loop-programming-practices-that-simplify-quicksort-implementations-1906.053842019-06-14 https://scifaro.com/en/abs/lower-bounds-for-the-happy-coloring-problems-1906.054222019-07-12 https://scifaro.com/en/abs/on-longest-common-property-preserved-substring-queries-1906.054862019-06-14 https://scifaro.com/en/abs/a-turing-kernelization-dichotomy-for-structural-parameterizations-of-mathcal-f-minor-free-deletion-1906.055652019-07-17 https://scifaro.com/en/abs/the-communication-complexity-of-optimization-1906.058322019-11-01 https://scifaro.com/en/abs/dynamic-path-decomposed-tries-1906.060152020-07-23 https://scifaro.com/en/abs/a-new-family-of-tractable-ising-models-1906.064312019-06-18 https://scifaro.com/en/abs/the-sdp-value-for-random-two-eigenvalue-csps-1906.067322019-06-18 https://scifaro.com/en/abs/matching-patterns-with-variables-1906.069652019-07-30 https://scifaro.com/en/abs/relaxing-concurrent-data-structure-semantics-for-increasing-performance-a-multi-structure-2d-design-framework-1906.071052025-11-11 https://scifaro.com/en/abs/orienting-undirected-phylogenetic-networks-1906.074302023-10-02 https://scifaro.com/en/abs/on-the-constrained-least-cost-tour-problem-1906.077542019-06-20 https://scifaro.com/en/abs/indexing-graph-search-trees-and-applications-1906.078712019-06-20 https://scifaro.com/en/abs/space-efficient-algorithms-for-breadth-depth-search-1906.078742019-06-20 https://scifaro.com/en/abs/tutorial-on-algebraic-deletion-correction-codes-1906.078872019-06-20 https://scifaro.com/en/abs/extensions-of-self-improving-sorters-1906.084482019-06-21 https://scifaro.com/en/abs/coresets-for-clustering-with-fairness-constraints-1906.084842019-12-18 https://scifaro.com/en/abs/fairness-and-utilization-in-allocating-resources-with-uncertain-demand-1906.090502020-10-20 https://scifaro.com/en/abs/domination-above-r-independence-does-sparseness-help-1906.091802019-06-24 https://scifaro.com/en/abs/faster-fpt-algorithm-for-5-path-vertex-cover-1906.092132022-01-19 https://scifaro.com/en/abs/multidimensional-dominance-drawings-1906.092242019-06-24 https://scifaro.com/en/abs/text-nfa-admits-an-fpras-efficient-enumeration-counting-and-uniform-generation-for-logspace-classes-1906.092262021-06-24 https://scifaro.com/en/abs/collective-mobile-sequential-recommendation-a-recommender-system-for-multiple-taxicabs-1906.093722019-06-25 https://scifaro.com/en/abs/algorithms-for-similarity-search-and-pseudorandomness-1906.094302019-06-25 https://scifaro.com/en/abs/dynamic-maximal-independent-set-1906.095952019-06-25 https://scifaro.com/en/abs/constant-amortized-time-enumeration-of-independent-sets-for-graphs-with-bounded-clique-number-1906.096802021-05-14 https://scifaro.com/en/abs/dynamic-palindrome-detection-1906.097322019-06-25 https://scifaro.com/en/abs/on-strong-diameter-padded-decompositions-1906.097832024-01-09 https://scifaro.com/en/abs/algorithms-for-deletion-problems-on-split-graphs-1906.100122019-07-26 https://scifaro.com/en/abs/flows-in-almost-linear-time-via-adaptive-preconditioning-1906.103402019-06-26 https://scifaro.com/en/abs/quantum-speedup-of-branch-and-bound-algorithms-1906.103752020-01-22 https://scifaro.com/en/abs/l-path-vertex-cover-is-easier-than-l-hitting-set-for-small-l-1906.105232019-06-26 https://scifaro.com/en/abs/fully-dynamic-spectral-vertex-sparsifiers-and-applications-1906.105302019-06-26 https://scifaro.com/en/abs/krivine-diffusions-attain-the-goemans-williamson-approximation-ratio-1906.106152019-06-26 https://scifaro.com/en/abs/upper-and-lower-bounds-on-approximating-weighted-mixed-domination-1906.108012019-06-27 https://scifaro.com/en/abs/lawn-an-unbound-low-latency-timer-data-structure-for-large-scale-high-throughput-systems-1906.108602019-07-16 https://scifaro.com/en/abs/parameterized-approximation-schemes-for-independent-set-of-rectangles-and-geometric-knapsack-1906.109822019-06-27 https://scifaro.com/en/abs/combinatorial-algorithms-for-string-sanitization-1906.110302020-01-01 https://scifaro.com/en/abs/making-a-sieve-random-improved-semi-streaming-algorithm-for-submodular-maximization-under-a-cardinality-constraint-1906.112372019-06-27 https://scifaro.com/en/abs/the-adversarial-robustness-of-sampling-1906.113272019-06-28 https://scifaro.com/en/abs/quantum-entropy-scoring-for-fast-robust-mean-estimation-and-improved-outlier-detection-1906.113662019-06-28 https://scifaro.com/en/abs/a-tight-analysis-of-greedy-yields-subexponential-time-approximation-for-uniform-decision-tree-1906.113852019-10-23 https://scifaro.com/en/abs/vector-programming-using-generative-recursion-1906.114232019-06-28 https://scifaro.com/en/abs/efficient-algorithms-for-modifying-and-sampling-from-a-categorical-distribution-1906.117002019-06-28 https://scifaro.com/en/abs/faster-and-better-nested-dissection-orders-for-customizable-contraction-hierarchies-1906.118112020-04-28 https://scifaro.com/en/abs/puffinn-parameterless-and-universally-fast-finding-of-nearest-neighbors-1906.122112019-07-01 https://scifaro.com/en/abs/detecting-feedback-vertex-sets-of-size-k-in-o-star-2-7-k-time-1906.122982019-11-04 https://scifaro.com/en/abs/algorithms-for-weighted-independent-transversals-and-strong-colouring-1907.000332023-10-13 https://scifaro.com/en/abs/min-max-correlation-clustering-via-multicut-1907.001172019-07-02 https://scifaro.com/en/abs/upper-bounding-the-graph-edit-distance-based-on-rings-and-machine-learning-1907.002032021-01-29 https://scifaro.com/en/abs/streaming-quantiles-algorithms-with-small-space-and-update-time-1907.002362019-07-02 https://scifaro.com/en/abs/most-abundant-isotope-peaks-and-efficient-selection-on-y-x-1-x-2-cdots-x-m-1907.002782019-07-02 https://scifaro.com/en/abs/waiting-is-not-easy-but-worth-it-the-online-tsp-on-the-line-revisited-1907.003172025-07-10 https://scifaro.com/en/abs/approximate-mathbb-f-2-sketching-of-valuation-functions-1907.005242019-07-02 https://scifaro.com/en/abs/exponential-time-quantum-algorithms-for-graph-coloring-problems-1907.005292019-07-02 https://scifaro.com/en/abs/online-multidimensional-packing-problems-in-the-random-order-model-1907.006052019-07-02 https://scifaro.com/en/abs/space-efficient-vertex-separators-for-treewidth-1907.006762020-10-01 https://scifaro.com/en/abs/graph-based-nearest-neighbor-search-from-practice-to-theory-1907.008452020-08-21 https://scifaro.com/en/abs/enumeration-of-preferred-extensions-in-almost-oriented-digraphs-1907.010062019-07-03 https://scifaro.com/en/abs/representing-fitness-landscapes-by-valued-constraints-to-understand-the-complexity-of-local-search-1907.012182020-11-13 https://scifaro.com/en/abs/efficient-isomorphism-for-s-d-graphs-and-t-graphs-1907.014952022-03-24 https://scifaro.com/en/abs/approximate-similarity-search-under-edit-distance-using-locality-sensitive-hashing-1907.016002020-07-10 https://scifaro.com/en/abs/learning-from-satisfying-assignments-under-continuous-distributions-1907.016192019-07-04 https://scifaro.com/en/abs/computing-k-modal-embeddings-of-planar-digraphs-1907.016302019-07-04 https://scifaro.com/en/abs/cache-friendly-search-trees-or-in-which-everything-beats-std-set-1907.016312019-07-04 https://scifaro.com/en/abs/shortest-reconfiguration-of-perfect-matchings-via-alternating-cycles-1907.017002019-07-04 https://scifaro.com/en/abs/generalized-assignment-via-submodular-optimization-with-reserved-capacity-1907.017452019-09-17 https://scifaro.com/en/abs/circular-pattern-matching-with-k-mismatches-1907.018152020-01-14 https://scifaro.com/en/abs/evaluation-of-a-flow-based-hypergraph-bipartitioning-algorithm-1907.020532019-07-04 https://scifaro.com/en/abs/towards-improving-christofides-algorithm-on-fundamental-classes-by-gluing-convex-combinations-of-tours-1907.021202022-03-29 https://scifaro.com/en/abs/linear-size-sparsifier-and-the-geometry-of-the-operator-norm-ball-1907.021452019-11-01 https://scifaro.com/en/abs/sampling-sketches-for-concave-sublinear-functions-of-frequencies-1907.022182019-12-24 https://scifaro.com/en/abs/reliable-hubs-for-partially-dynamic-all-pairs-shortest-paths-in-directed-graphs-1907.022662019-07-05 https://scifaro.com/en/abs/min-cost-flow-in-unit-capacity-planar-graphs-1907.022742019-07-05 https://scifaro.com/en/abs/the-alternating-bwt-an-algorithmic-perspective-1907.023082019-07-05 https://scifaro.com/en/abs/hashgraph-scalable-hash-tables-using-a-sparse-graph-data-structure-1907.029002019-07-08 https://scifaro.com/en/abs/hitting-topological-minor-models-in-planar-graphs-is-fixed-parameter-tractable-1907.029192022-11-01 https://scifaro.com/en/abs/improved-local-search-for-graph-edit-distance-1907.029292019-11-27 https://scifaro.com/en/abs/near-optimal-fully-dynamic-densest-subgraph-1907.030372020-03-12 https://scifaro.com/en/abs/constant-factor-approximation-algorithms-for-parity-constrained-facility-location-problems-1907.031292019-07-09 https://scifaro.com/en/abs/towards-testing-monotonicity-of-distributions-over-general-posets-1907.031822019-07-09 https://scifaro.com/en/abs/composable-core-sets-for-determinant-maximization-a-simple-near-optimal-algorithm-1907.031972019-07-09 https://scifaro.com/en/abs/fast-and-simple-edge-coloring-algorithms-1907.032012021-03-02 https://scifaro.com/en/abs/bidirectional-text-compression-in-external-memory-1907.032352019-12-04 https://scifaro.com/en/abs/complexity-of-planar-signed-graph-homomorphisms-to-cycles-1907.032662020-12-08 https://scifaro.com/en/abs/more-hierarchy-in-route-planning-using-edge-hierarchies-1907.035352019-09-11 https://scifaro.com/en/abs/contraction-clustering-raster-a-very-fast-big-data-algorithm-for-sequential-and-parallel-density-based-clustering-in-linear-time-constant-memory-and-a-single-pass-1907.036202026-01-27 https://scifaro.com/en/abs/faster-deterministic-distributed-coloring-through-recursive-list-coloring-1907.037972019-07-10 https://scifaro.com/en/abs/the-densest-k-subgraph-problem-in-b-outerplanar-graphs-1907.038632019-07-10 https://scifaro.com/en/abs/near-optimal-repair-of-reed-solomon-codes-with-low-sub-packetization-1907.039312019-07-10 https://scifaro.com/en/abs/online-matching-frameworks-under-stochastic-rewards-product-ranking-and-unknown-patience-1907.039632023-06-27 https://scifaro.com/en/abs/trustworthy-graph-algorithms-1907.040652019-07-10 https://scifaro.com/en/abs/stochastic-monotone-submodular-maximization-with-queries-1907.040832020-06-29 https://scifaro.com/en/abs/ptas-and-exact-algorithms-for-r-gathering-problems-on-tree-1907.040872019-07-10 https://scifaro.com/en/abs/r-gather-clustering-and-r-gathering-on-spider-fpt-algorithms-and-hardness-1907.040882019-07-10 https://scifaro.com/en/abs/linear-mim-width-of-trees-1907.041322019-07-10 https://scifaro.com/en/abs/reconstruction-under-outliers-for-fourier-sparse-functions-1907.042742019-10-08 https://scifaro.com/en/abs/multiple-knapsack-constrained-monotone-dr-submodular-maximization-on-distributive-lattice-continuous-greedy-algorithm-on-median-complex-1907.042792019-07-10 https://scifaro.com/en/abs/better-sample-random-subset-sum-in-2-0-255n-and-its-impact-on-decoding-random-linear-codes-1907.042952019-10-22 https://scifaro.com/en/abs/nearly-optimal-edge-estimation-with-independent-set-queries-1907.043812019-07-11 https://scifaro.com/en/abs/the-power-of-the-combined-basic-lp-and-affine-relaxation-for-promise-csps-1907.043832020-12-03 https://scifaro.com/en/abs/diameter-computation-on-h-minor-free-graphs-and-graphs-of-bounded-distance-vc-dimension-1907.043852019-10-31 https://scifaro.com/en/abs/l-p-pattern-matching-in-a-stream-1907.044052020-11-10 https://scifaro.com/en/abs/faster-provable-sieving-algorithms-for-the-shortest-vector-problem-and-the-closest-vector-problem-on-lattices-in-ell-p-norm-1907.044062021-12-21 https://scifaro.com/en/abs/on-approximating-partial-set-cover-and-generalizations-1907.044132019-07-11 https://scifaro.com/en/abs/hitting-minors-on-bounded-treewidth-graphs-iv-an-optimal-algorithm-1907.044422021-03-12 https://scifaro.com/en/abs/speed-scaling-with-tandem-servers-1907.044982019-07-11 https://scifaro.com/en/abs/computing-valuations-of-the-dieudonn-e-determinants-1907.045122021-02-17 https://scifaro.com/en/abs/quasi-polynomial-time-approximation-schemes-for-the-maximum-weight-independent-set-problem-in-h-free-graphs-1907.045852023-11-15 https://scifaro.com/en/abs/polytopes-lattices-and-spherical-codes-for-the-nearest-neighbor-problem-1907.046282020-06-30 https://scifaro.com/en/abs/evolutionary-techniques-in-lattice-sieving-algorithms-1907.046292019-10-04 https://scifaro.com/en/abs/approximate-voronoi-cells-for-lattices-revisited-1907.046302019-07-11 https://scifaro.com/en/abs/string-attractors-and-combinatorics-on-words-1907.046602019-07-11 https://scifaro.com/en/abs/coresets-for-clustering-in-graphs-of-bounded-treewidth-1907.047332022-12-13 https://scifaro.com/en/abs/constant-time-dynamic-delta-1-coloring-and-weight-approximation-for-minimum-spanning-forest-dynamic-algorithms-meet-property-testing-1907.047452019-07-11 https://scifaro.com/en/abs/dense-peelable-random-uniform-hypergraphs-1907.047492019-07-11 https://scifaro.com/en/abs/efficient-gauss-elimination-for-near-quadratic-matrices-with-one-short-random-block-per-row-with-applications-1907.047502019-11-13 https://scifaro.com/en/abs/sparse-regular-expression-matching-1907.047522023-11-07 https://scifaro.com/en/abs/approximately-counting-and-sampling-small-witnesses-using-a-colourful-decision-oracle-1907.048262022-03-09 https://scifaro.com/en/abs/cake-cutting-on-graphs-a-discrete-and-bounded-proportional-protocol-1907.050832019-07-15 https://scifaro.com/en/abs/analysis-of-ward-s-method-1907.050942019-07-12 https://scifaro.com/en/abs/towards-a-better-understanding-of-randomized-greedy-matching-1907.051352020-03-10 https://scifaro.com/en/abs/state-of-the-art-sparse-direct-solvers-1907.053092019-07-12 https://scifaro.com/en/abs/competitive-analysis-with-a-sample-and-the-secretary-problem-1907.053502019-07-12 https://scifaro.com/en/abs/quantum-and-classical-algorithms-for-approximate-submodular-function-minimization-1907.053782020-01-16 https://scifaro.com/en/abs/walking-randomly-massively-and-efficiently-1907.053912019-11-07 https://scifaro.com/en/abs/computational-concentration-of-measure-optimal-bounds-reductions-and-more-1907.054012019-07-12 https://scifaro.com/en/abs/schatten-norms-in-matrix-streams-hello-sparsity-goodbye-dimension-1907.054572020-02-28 https://scifaro.com/en/abs/non-uniform-geometric-set-cover-and-scheduling-on-multiple-machines-1907.054732020-07-21 https://scifaro.com/en/abs/a-quantum-inspired-classical-algorithm-for-separable-non-negative-matrix-factorization-1907.055682019-07-15 https://scifaro.com/en/abs/space-efficient-approximation-to-maximum-matching-size-from-uniform-edge-samples-1907.057252019-07-15 https://scifaro.com/en/abs/towards-optimal-moment-estimation-in-streaming-and-distributed-models-1907.058162019-07-15 https://scifaro.com/en/abs/finding-irrelevant-vertices-in-linear-time-on-bounded-genus-graphs-1907.059402026-05-01 https://scifaro.com/en/abs/online-learning-for-min-max-discrete-problems-1907.059442020-06-24 https://scifaro.com/en/abs/efficient-average-case-population-recovery-in-the-presence-of-insertions-and-deletions-1907.059642019-07-16 https://scifaro.com/en/abs/the-two-sided-game-of-googol-and-sample-based-prophet-inequalities-1907.060012019-07-16 https://scifaro.com/en/abs/perfect-sampling-from-spatial-mixing-1907.060332020-04-27 https://scifaro.com/en/abs/zeros-of-ferromagnetic-2-spin-systems-1907.061562019-07-16 https://scifaro.com/en/abs/on-happy-colorings-cuts-and-structural-parameterizations-1907.061722019-07-16 https://scifaro.com/en/abs/splaying-preorders-and-postorders-1907.063092019-07-16 https://scifaro.com/en/abs/a-foundation-for-proving-splay-is-dynamically-optimal-1907.063102022-05-10 https://scifaro.com/en/abs/seedless-graph-matching-via-tail-of-degree-distribution-for-correlated-erdos-renyi-graphs-1907.063342020-09-29 https://scifaro.com/en/abs/improved-budgeted-connected-domination-and-budgeted-edge-vertex-domination-1907.065762020-03-26 https://scifaro.com/en/abs/matrices-of-optimal-tree-depth-and-a-row-invariant-parameterized-algorithm-for-integer-programming-1907.066882022-02-02 https://scifaro.com/en/abs/binary-decision-diagrams-from-tree-compaction-to-sampling-1907.067432020-05-26 https://scifaro.com/en/abs/designing-perfect-simulation-algorithms-using-local-correctness-1907.067482019-07-17 https://scifaro.com/en/abs/some-black-box-reductions-for-objective-robust-discrete-optimization-problems-based-on-their-lp-relaxations-1907.067862019-07-17 https://scifaro.com/en/abs/labelings-vs-embeddings-on-distributed-representations-of-distances-1907.068572023-09-21 https://scifaro.com/en/abs/lossless-prioritized-embeddings-1907.069832019-07-17 https://scifaro.com/en/abs/on-the-termination-of-a-flooding-process-1907.070782019-07-17 https://scifaro.com/en/abs/fast-provably-convergent-irls-algorithm-for-p-norm-linear-regression-1907.071672020-01-13 https://scifaro.com/en/abs/the-complexity-of-partial-function-extension-for-coverage-functions-1907.072302019-07-18 https://scifaro.com/en/abs/improved-algorithms-for-time-decay-streams-1907.075742019-07-18 https://scifaro.com/en/abs/efficient-computation-of-the-jacobi-symbol-1907.077952019-07-19 https://scifaro.com/en/abs/approximating-constraint-satisfaction-problems-on-high-dimensional-expanders-1907.078332019-07-19 https://scifaro.com/en/abs/on-the-m-eternal-domination-number-of-cactus-graphs-1907.079102019-07-19 https://scifaro.com/en/abs/sensitive-distance-and-reachability-oracles-for-large-batch-updates-1907.079822019-07-23 https://scifaro.com/en/abs/stack-sorting-with-restricted-stacks-1907.081422019-07-19 https://scifaro.com/en/abs/finding-first-and-most-beautiful-queens-by-integer-programming-1907.082462019-07-22 https://scifaro.com/en/abs/a-constant-factor-approximation-for-capacitated-min-max-tree-cover-1907.083042019-12-13 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-log-concave-maximum-likelihood-via-locally-exponential-families-1907.083062019-07-22 https://scifaro.com/en/abs/data-structures-meet-cryptography-3sum-with-preprocessing-1907.083552024-11-14 https://scifaro.com/en/abs/sparse-recovery-for-orthogonal-polynomial-transforms-1907.083622019-07-22 https://scifaro.com/en/abs/cluster-deletion-revisited-1907.083992019-07-22 https://scifaro.com/en/abs/on-approximate-range-mode-and-range-selection-1907.085792019-07-22 https://scifaro.com/en/abs/the-competitive-ratio-of-threshold-policies-for-online-unit-density-knapsack-problems-1907.087352025-04-08 https://scifaro.com/en/abs/domain-compression-and-its-application-to-randomness-optimal-distributed-goodness-of-fit-1907.087432019-07-23 https://scifaro.com/en/abs/deep-learning-service-for-efficient-data-distribution-aware-sorting-1907.088172024-12-16 https://scifaro.com/en/abs/the-generalized-trust-region-subproblem-solution-complexity-and-convex-hull-results-1907.088432020-11-17 https://scifaro.com/en/abs/a-constant-approximation-for-colorful-k-center-1907.089062019-07-23 https://scifaro.com/en/abs/strategyproof-mechanism-for-two-heterogeneous-facilities-with-constant-approximation-ratio-1907.089182019-07-23 https://scifaro.com/en/abs/combining-the-connection-scan-algorithm-with-contraction-hierarchies-1907.090412019-07-23 https://scifaro.com/en/abs/semidefinite-programming-relaxations-of-the-traveling-salesman-problem-and-their-integrality-gaps-1907.090542019-07-23 https://scifaro.com/en/abs/succinct-representation-for-non-deterministic-finite-automata-1907.092712019-07-24 https://scifaro.com/en/abs/optimal-in-place-algorithms-for-basic-graph-problems-1907.092802019-07-24 https://scifaro.com/en/abs/managing-multiple-mobile-resources-1907.098342019-07-24 https://scifaro.com/en/abs/an-fpt-algorithm-for-orthogonal-buttons-and-scissors-1907.102302019-07-25 https://scifaro.com/en/abs/constant-delay-traversal-of-grammar-compressed-graphs-with-bounded-rank-1907.104442019-07-25 https://scifaro.com/en/abs/p-slocal-completeness-of-maximum-independent-set-approximation-1907.104992019-12-24 https://scifaro.com/en/abs/constant-girth-approximation-for-directed-graphs-in-subquadratic-time-1907.107792020-04-15 https://scifaro.com/en/abs/how-to-store-a-random-walk-1907.108742019-07-26 https://scifaro.com/en/abs/polylogarithmic-time-deterministic-network-decomposition-and-distributed-derandomization-1907.109372020-05-12 https://scifaro.com/en/abs/enumerating-range-modes-1907.109842019-07-26 https://scifaro.com/en/abs/approximating-apsp-without-scaling-equivalence-of-approximate-min-plus-and-exact-min-max-1907.110782019-07-26 https://scifaro.com/en/abs/the-strong-3sum-indexing-conjecture-is-false-1907.112062019-07-26 https://scifaro.com/en/abs/integrality-gap-of-the-vertex-cover-linear-programming-relaxation-1907.112092019-07-26 https://scifaro.com/en/abs/exhaustive-exact-string-matching-the-analysis-of-the-full-human-genome-1907.112322019-07-29 https://scifaro.com/en/abs/new-alpha-beta-spanners-and-hopsets-1907.114022020-01-22 https://scifaro.com/en/abs/on-approximating-degree-bounded-network-design-problems-1907.114042020-04-28 https://scifaro.com/en/abs/almost-shortest-paths-with-near-additive-error-in-weighted-graphs-1907.114222022-07-13 https://scifaro.com/en/abs/adventures-in-abstraction-reachability-in-hierarchical-drawings-1907.116622019-07-29 https://scifaro.com/en/abs/a-tight-degree-4-sum-of-squares-lower-bound-for-the-sherrington-kirkpatrick-hamiltonian-1907.116862020-11-10 https://scifaro.com/en/abs/low-rank-matrix-completion-a-contemporary-survey-1907.117052019-07-30 https://scifaro.com/en/abs/minimal-absent-words-in-rooted-and-unrooted-trees-1907.120342019-10-31 https://scifaro.com/en/abs/parameterized-pre-coloring-extension-and-list-coloring-problems-1907.120612019-07-30 https://scifaro.com/en/abs/a-lower-bound-on-cycle-finding-in-sparse-digraphs-1907.121062019-07-30 https://scifaro.com/en/abs/a-fast-minimum-degree-algorithm-and-matching-lower-bound-1907.121192023-04-11 https://scifaro.com/en/abs/a-join-based-hybrid-parameter-for-constraint-satisfaction-1907.123352019-07-30 https://scifaro.com/en/abs/distributed-dense-subgraph-detection-and-low-outdegree-orientation-1907.124432022-09-13 https://scifaro.com/en/abs/deterministic-coloring-algorithms-in-the-local-model-1907.128572019-08-01 https://scifaro.com/en/abs/improved-randomized-algorithm-for-k-submodular-function-maximization-1907.129422019-07-31 https://scifaro.com/en/abs/iterative-budgeted-exponential-search-1907.130622019-07-31 https://scifaro.com/en/abs/evolutionary-dataset-optimisation-learning-algorithm-quality-through-evolution-1907.135082019-11-01 https://scifaro.com/en/abs/level-planar-drawings-with-few-slopes-1907.135582019-08-02 https://scifaro.com/en/abs/binary-component-decomposition-part-ii-the-asymmetric-case-1907.136022019-08-01 https://scifaro.com/en/abs/binary-component-decomposition-part-i-the-positive-semidefinite-case-1907.136032019-08-01 https://scifaro.com/en/abs/a-model-of-random-industrial-sat-1908.000892022-02-04 https://scifaro.com/en/abs/sliced-subwindow-search-a-sublinear-complexity-solution-to-the-maximum-rectangle-problem-1908.001402023-04-11 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-tsp-in-the-half-integral-case-1908.002272019-08-02 https://scifaro.com/en/abs/distributed-data-summarization-in-well-connected-networks-1908.002362019-08-07 https://scifaro.com/en/abs/new-techniques-for-graph-edit-distance-computation-1908.002652019-08-02 https://scifaro.com/en/abs/sparse-regression-via-range-counting-1908.003512020-01-01 https://scifaro.com/en/abs/an-spqr-tree-like-embedding-representation-for-upward-planarity-1908.003522019-08-02 https://scifaro.com/en/abs/online-payment-network-design-1908.004322019-08-02 https://scifaro.com/en/abs/on-cycle-transversals-and-their-connected-variants-in-the-absence-of-a-small-linear-forest-1908.004912019-08-02 https://scifaro.com/en/abs/dynamic-optimality-refuted-for-tournament-heaps-1908.005632019-08-05 https://scifaro.com/en/abs/submodular-cost-submodular-cover-with-an-approximate-oracle-1908.006532019-08-05 https://scifaro.com/en/abs/competitive-online-search-trees-on-trees-1908.008482019-08-05 https://scifaro.com/en/abs/an-efficient-evolutionary-algorithm-for-minimum-cost-submodular-cover-1908.010292019-08-06 https://scifaro.com/en/abs/the-power-of-the-weighted-sum-scalarization-for-approximating-multiobjective-optimization-problems-1908.011812021-12-15 https://scifaro.com/en/abs/faster-algorithms-for-cograph-edge-modification-problems-1908.012232020-01-01 https://scifaro.com/en/abs/faster-guarantees-of-evolutionary-algorithms-for-maximization-of-monotone-submodular-functions-1908.012302021-07-07 https://scifaro.com/en/abs/matching-reads-to-many-genomes-with-the-r-index-1908.012632019-08-06 https://scifaro.com/en/abs/computing-the-inverse-geodesic-length-in-planar-graphs-and-graphs-of-bounded-treewidth-1908.013172021-11-18 https://scifaro.com/en/abs/graph-drawing-with-morphing-partial-edges-1908.014412019-10-03 https://scifaro.com/en/abs/heuristic-algorithm-for-generalized-function-matching-1908.015622019-08-06 https://scifaro.com/en/abs/learned-clause-minimization-in-parallel-sat-solvers-1908.016242019-08-06 https://scifaro.com/en/abs/on-the-cyclic-regularities-of-strings-1908.016642019-08-06 https://scifaro.com/en/abs/parallel-batch-dynamic-graphs-algorithms-and-lower-bounds-1908.019562019-08-07 https://scifaro.com/en/abs/engineering-negative-cycle-canceling-for-wind-farm-cabling-1908.021292023-07-31 https://scifaro.com/en/abs/on-the-maximum-number-of-minimal-connected-dominating-sets-in-convex-bipartite-graphs-1908.021742019-08-07 https://scifaro.com/en/abs/an-index-for-sequencing-reads-based-on-the-colored-de-bruijn-graph-1908.022112019-12-02 https://scifaro.com/en/abs/fully-dynamic-hierarchical-diameter-k-clustering-and-k-center-1908.026452019-08-08 https://scifaro.com/en/abs/parallel-finger-search-structures-1908.027412019-10-11 https://scifaro.com/en/abs/small-cuts-and-connectivity-certificates-a-fault-tolerant-approach-1908.030222020-08-04 https://scifaro.com/en/abs/efficient-generation-of-different-topological-representations-of-graphs-beyond-planarity-1908.030422019-08-27 https://scifaro.com/en/abs/on-symbolic-approaches-for-computing-the-matrix-permanent-1908.032522019-08-12 https://scifaro.com/en/abs/shorter-labeling-schemes-for-planar-graphs-1908.033412020-04-20 https://scifaro.com/en/abs/parameterized-algorithms-for-maximum-cut-with-connectivity-constraints-1908.033892019-08-12 https://scifaro.com/en/abs/a-simple-and-efficient-algorithm-for-finding-minimum-spanning-tree-replacement-edges-1908.034732023-01-02 https://scifaro.com/en/abs/improved-network-decompositions-using-small-messages-with-applications-on-mis-neighborhood-covers-and-beyond-1908.035002019-08-12 https://scifaro.com/en/abs/on-the-planar-edge-length-ratio-of-planar-graphs-1908.035862020-04-14 https://scifaro.com/en/abs/kernel-for-kt-free-edge-deletion-1908.036002019-08-13 https://scifaro.com/en/abs/slide-reduction-revisited-filling-the-gaps-in-svp-approximation-1908.037242019-08-13 https://scifaro.com/en/abs/fully-dynamic-k-center-clustering-in-doubling-metrics-1908.039482020-02-11 https://scifaro.com/en/abs/a-natural-quadratic-approach-to-the-generalized-graph-layering-problem-1908.041042019-08-13 https://scifaro.com/en/abs/shared-memory-branch-and-reduce-for-multiterminal-cuts-1908.041412019-08-20 https://scifaro.com/en/abs/hyperedge-estimation-using-polylogarithmic-subset-queries-1908.041962020-09-08 https://scifaro.com/en/abs/efficient-contraction-of-large-tensor-networks-for-weighted-model-counting-through-graph-decompositions-1908.043812020-04-29 https://scifaro.com/en/abs/multi-objective-scheduling-on-two-dedicated-processors-1908.044522021-01-05 https://scifaro.com/en/abs/private-rank-aggregation-under-local-differential-privacy-1908.044862020-07-01 https://scifaro.com/en/abs/beyond-the-inverted-index-1908.045172019-08-14 https://scifaro.com/en/abs/finding-and-counting-permutations-via-csps-1908.046732019-08-14 https://scifaro.com/en/abs/space-efficient-construction-of-compressed-suffix-trees-1908.046862019-08-14 https://scifaro.com/en/abs/re-pair-in-small-space-1908.049332019-11-19 https://scifaro.com/en/abs/fast-cartesian-tree-matching-1908.049372019-08-15 https://scifaro.com/en/abs/correlation-clustering-with-same-cluster-queries-bounded-by-optimal-cost-1908.049762019-08-15 https://scifaro.com/en/abs/algorithms-the-min-max-regret-0-1-integer-linear-programming-problem-with-interval-data-1908.050822019-08-15 https://scifaro.com/en/abs/learned-frequency-estimation-algorithms-under-zipfian-distribution-1908.051982020-08-12 https://scifaro.com/en/abs/loads-of-space-local-order-agnosticism-and-bit-flip-efficient-data-structure-codes-1908.054152019-08-16 https://scifaro.com/en/abs/efficient-online-string-matching-based-on-characters-distance-text-sampling-1908.059302019-08-19 https://scifaro.com/en/abs/guarantees-of-stochastic-greedy-algorithms-for-non-monotone-submodular-maximization-with-cardinality-constraint-1908.062422020-01-13 https://scifaro.com/en/abs/a-sharp-threshold-phenomenon-for-the-distributed-complexity-of-the-lov-asz-local-lemma-1908.062702019-08-21 https://scifaro.com/en/abs/comparison-based-indexing-from-first-principles-1908.063182019-08-20 https://scifaro.com/en/abs/revisiting-the-graph-isomorphism-problem-with-semidefinite-programming-1908.063202019-10-29 https://scifaro.com/en/abs/the-maximum-common-subgraph-problem-a-portfolio-approach-1908.064182020-11-09 https://scifaro.com/en/abs/the-smallest-grammar-problem-revisited-1908.064282019-08-20 https://scifaro.com/en/abs/a-new-k-shortest-path-search-approach-based-on-graph-reduction-1908.064602019-08-20 https://scifaro.com/en/abs/the-landscape-of-minimum-label-cut-hedge-connectivity-problem-1908.065412019-08-21 https://scifaro.com/en/abs/a-computational-model-for-tensor-core-units-1908.066492020-07-10 https://scifaro.com/en/abs/balanced-schnyder-woods-for-planar-triangulations-an-experimental-study-with-applications-to-graph-drawing-and-graph-separators-1908.066882019-08-20 https://scifaro.com/en/abs/on-bin-packing-with-clustering-and-bin-packing-with-delays-1908.067272019-08-20 https://scifaro.com/en/abs/wegotyoucovered-the-winning-solver-from-the-pace-2019-implementation-challenge-vertex-cover-track-1908.067952019-08-21 https://scifaro.com/en/abs/a-new-fast-weighted-all-pairs-shortest-path-search-algorithm-based-on-pruning-by-shortest-path-trees-1908.067982019-08-20 https://scifaro.com/en/abs/a-new-fast-unweighted-all-pairs-shortest-path-search-algorithm-based-on-pruning-by-shortest-path-trees-1908.068062019-08-20 https://scifaro.com/en/abs/a-game-of-cops-and-robbers-on-graphs-with-periodic-edge-connectivity-1908.068282019-08-20 https://scifaro.com/en/abs/improved-job-sequencing-bounds-from-decision-diagrams-1908.070762019-08-21 https://scifaro.com/en/abs/discrete-and-fast-fourier-transform-made-clear-1908.071542019-08-21 https://scifaro.com/en/abs/an-algorithm-for-destroying-claws-and-diamonds-1908.073182019-08-21 https://scifaro.com/en/abs/optimization-bounds-from-the-branching-dual-1908.075842019-08-22 https://scifaro.com/en/abs/a-quality-metric-for-visualization-of-clusters-in-graphs-1908.077922019-08-22 https://scifaro.com/en/abs/engineering-faster-sorters-for-small-sets-of-items-1908.081112019-08-23 https://scifaro.com/en/abs/multi-level-graph-drawing-using-infomap-clustering-1908.081512019-08-23 https://scifaro.com/en/abs/covering-convex-bodies-and-the-closest-vector-problem-1908.083842021-11-03 https://scifaro.com/en/abs/generalized-metric-repair-on-graphs-1908.084112019-08-23 https://scifaro.com/en/abs/clustered-hierarchical-entropy-scaling-search-of-astronomical-and-biological-data-1908.085512019-11-12 https://scifaro.com/en/abs/on-vr-spatial-query-for-dual-entangled-worlds-1908.086912019-08-26 https://scifaro.com/en/abs/the-quasefe-problem-1908.087082019-08-26 https://scifaro.com/en/abs/revisiting-consistent-hashing-with-bounded-loads-1908.087622020-06-17 https://scifaro.com/en/abs/simultaneous-representation-of-proper-and-unit-interval-graphs-1908.088822019-08-26 https://scifaro.com/en/abs/parameterized-algorithms-for-book-embedding-problems-1908.089112019-08-26 https://scifaro.com/en/abs/mixed-linear-layouts-complexity-heuristics-and-experiments-1908.089382019-08-26 https://scifaro.com/en/abs/a-center-in-your-neighborhood-fairness-in-facility-location-1908.090412019-09-02 https://scifaro.com/en/abs/when-a-dollar-makes-a-bwt-1908.091252021-03-15 https://scifaro.com/en/abs/subadditive-load-balancing-1908.091352019-08-27 https://scifaro.com/en/abs/circle-graph-isomorphism-in-almost-linear-time-1908.091512019-08-27 https://scifaro.com/en/abs/graph-stories-in-small-area-1908.093182019-08-28 https://scifaro.com/en/abs/fine-grained-complexity-of-k-opt-in-bounded-degree-graphs-for-solving-tsp-1908.093252019-09-04 https://scifaro.com/en/abs/a-parallel-priority-queue-with-fast-updates-for-gpu-architectures-1908.093782023-05-15 https://scifaro.com/en/abs/constraint-generation-algorithm-for-the-minimum-connectivity-inference-problem-1908.095862019-08-27 https://scifaro.com/en/abs/a-waste-efficient-algorithm-for-single-droplet-sample-preparation-on-microfluidic-chips-1908.096182019-11-07 https://scifaro.com/en/abs/multi-stage-and-multi-customer-assortment-optimization-with-inventory-constraints-1908.098082020-07-28 https://scifaro.com/en/abs/measuring-what-matters-a-hybrid-approach-to-dynamic-programming-with-treewidth-1908.101322019-08-28 https://scifaro.com/en/abs/partial-sums-on-the-ultra-wide-word-ram-1908.101592020-10-01 https://scifaro.com/en/abs/learning-very-large-graphs-with-unknown-vertex-distributions-1908.101702019-09-04 https://scifaro.com/en/abs/one-exact-approximate-pareto-sets-1908.105612019-08-29 https://scifaro.com/en/abs/bloom-filter-variants-for-multiple-sets-a-comparative-assessment-1908.106442022-05-06 https://scifaro.com/en/abs/eliminating-left-recursion-without-the-epsilon-1908.108882024-11-12 https://scifaro.com/en/abs/the-single-face-ideal-orientation-problem-in-planar-graphs-1908.109422019-12-04 https://scifaro.com/en/abs/funseqset-towards-a-purely-functional-data-structure-for-the-linearisation-case-of-dynamic-trees-problem-1908.111052019-08-30 https://scifaro.com/en/abs/efficient-implementation-of-color-coding-algorithm-for-subgraph-isomorphism-problem-1908.112482019-08-30 https://scifaro.com/en/abs/want-to-gather-no-need-to-chatter-1908.114022019-09-02 https://scifaro.com/en/abs/minimum-label-s-t-cut-has-large-integrality-gaps-1908.114912019-09-02 https://scifaro.com/en/abs/on-a-weighted-linear-matroid-intersection-algorithm-by-deg-det-computation-1908.115292020-03-06 https://scifaro.com/en/abs/approximation-algorithms-for-partially-colorable-graphs-1908.116312019-09-02 https://scifaro.com/en/abs/property-testing-of-the-boolean-and-binary-rank-1908.116322019-09-02 https://scifaro.com/en/abs/a-simple-algorithm-for-minimum-cuts-in-near-linear-time-1908.118292020-06-11 https://scifaro.com/en/abs/near-optimal-approximate-discrete-and-continuous-submodular-function-minimization-1909.001712019-09-11 https://scifaro.com/en/abs/faster-algorithms-for-edge-connectivity-via-random-2-out-contractions-1909.008442019-09-04 https://scifaro.com/en/abs/de-con-struction-of-the-lazy-f-loop-improving-performance-of-smith-waterman-alignment-1909.008992019-09-04 https://scifaro.com/en/abs/discovering-interesting-cycles-in-directed-graphs-1909.010602019-09-04 https://scifaro.com/en/abs/efficient-computation-of-optimal-temporal-walks-under-waiting-time-constraints-1909.011522020-03-12 https://scifaro.com/en/abs/oblivious-sketching-of-high-degree-polynomial-kernels-1909.014102020-12-23 https://scifaro.com/en/abs/engineering-boolean-matrix-multiplication-for-multiple-accelerator-shared-memory-architectures-1909.015542019-09-05 https://scifaro.com/en/abs/a-cost-scaling-algorithm-for-minimum-cost-node-capacitated-multiflow-problem-1909.015992019-09-05 https://scifaro.com/en/abs/on-a-conjecture-of-lov-asz-on-circle-representations-of-simple-4-regular-planar-graphs-1909.017212019-09-05 https://scifaro.com/en/abs/stochastic-submodular-probing-with-state-dependent-costs-1909.017952021-11-12 https://scifaro.com/en/abs/analysis-of-sparsehash-an-efficient-embedding-of-set-similarity-via-sparse-projections-1909.018022019-09-05 https://scifaro.com/en/abs/almost-optimal-tensor-sketch-1909.018212019-09-05 https://scifaro.com/en/abs/a-simple-reduction-for-full-permuted-pattern-matching-problems-on-multi-track-strings-1909.023642019-12-02 https://scifaro.com/en/abs/on-ultrametric-1-median-selection-1909.024002019-09-06 https://scifaro.com/en/abs/strongly-chordal-graph-generation-using-intersection-graph-characterisation-1909.025452019-09-06 https://scifaro.com/en/abs/strong-bounds-for-resource-constrained-project-scheduling-preprocessing-and-cutting-planes-1909.027372019-09-09 https://scifaro.com/en/abs/minimal-unique-substrings-and-minimal-absent-words-in-a-sliding-window-1909.028042019-09-16 https://scifaro.com/en/abs/distribution-free-testing-of-linear-functions-on-r-n-1909.033912019-09-10 https://scifaro.com/en/abs/target-set-selection-for-conservative-populations-1909.034222019-09-10 https://scifaro.com/en/abs/fully-dynamic-maximal-independent-set-in-expected-poly-log-update-time-1909.034452021-04-02 https://scifaro.com/en/abs/fully-dynamic-maximal-independent-set-with-polylogarithmic-update-time-1909.034782019-09-10 https://scifaro.com/en/abs/convex-set-disjointness-distributed-learning-of-halfspaces-and-lp-feasibility-1909.035472019-09-10 https://scifaro.com/en/abs/information-gathering-in-ad-hoc-radio-networks-1909.036362019-11-19 https://scifaro.com/en/abs/a-complete-transient-analysis-for-the-incremental-lms-algorithm-1909.038592019-09-10 https://scifaro.com/en/abs/differentially-private-algorithms-for-learning-mixtures-of-separated-gaussians-1909.039512019-10-17 https://scifaro.com/en/abs/hypergraph-partitioning-with-embeddings-1909.040162022-06-16 https://scifaro.com/en/abs/the-outer-limits-of-contention-resolution-on-matroids-and-connections-to-the-secretary-problem-1909.042682020-04-30 https://scifaro.com/en/abs/constant-factor-approximation-of-max-clique-1909.043962019-09-20 https://scifaro.com/en/abs/well-behaved-online-load-balancing-against-strategic-jobs-1909.044812019-09-11 https://scifaro.com/en/abs/approximating-vertex-cover-using-structural-rounding-1909.046112019-11-04 https://scifaro.com/en/abs/faster-quantum-and-classical-sdp-approximations-for-quadratic-binary-optimization-1909.046132022-01-26 https://scifaro.com/en/abs/electrical-flows-over-spanning-trees-1909.047592023-08-24 https://scifaro.com/en/abs/online-linear-programming-dual-convergence-new-algorithms-and-regret-bounds-1909.054992021-04-20 https://scifaro.com/en/abs/optimal-routing-schedules-for-robots-operating-in-aisle-structures-1909.057112019-09-17 https://scifaro.com/en/abs/branch-and-cut-and-iterated-local-search-for-the-weighted-k-traveling-repairman-problem-an-application-to-the-maintenance-of-speed-cameras-1909.062262019-09-16 https://scifaro.com/en/abs/enumerating-isolated-cliques-in-temporal-networks-1909.062922021-03-05 https://scifaro.com/en/abs/sample-complexity-of-probabilistic-roadmaps-via-epsilon-nets-1909.063632019-09-24 https://scifaro.com/en/abs/dynamic-graph-algorithms-and-graph-sparsification-new-techniques-and-connections-1909.064132019-09-17 https://scifaro.com/en/abs/multi-perspective-simultaneous-embedding-1909.064852020-08-07 https://scifaro.com/en/abs/a-tree-structure-for-dynamic-facility-location-1909.066532019-09-17 https://scifaro.com/en/abs/algorithms-for-manipulating-sequential-allocation-1909.067472019-09-17 https://scifaro.com/en/abs/noisy-beeping-networks-1909.068112022-08-04 https://scifaro.com/en/abs/explicit-near-ramanujan-graphs-of-every-degree-1909.069882022-11-29 https://scifaro.com/en/abs/multitype-integer-monoid-optimization-and-applications-1909.073262019-09-17 https://scifaro.com/en/abs/regular-partitions-and-their-use-in-structural-pattern-recognition-1909.074202020-03-27 https://scifaro.com/en/abs/three-in-a-tree-in-near-linear-time-1909.074462022-01-06 https://scifaro.com/en/abs/streaming-ptas-for-constrained-k-means-1909.075112020-02-20 https://scifaro.com/en/abs/multiplicative-rank-1-approximation-using-length-squared-sampling-1909.075152019-10-30 https://scifaro.com/en/abs/generalized-dictionary-matching-under-substring-consistent-equivalence-relations-1909.075382019-11-06 https://scifaro.com/en/abs/object-reachability-via-swaps-under-strict-and-weak-preferences-1909.075572020-07-23 https://scifaro.com/en/abs/communication-efficient-weighted-sampling-and-quantile-summary-for-gbdt-1909.076332019-09-18 https://scifaro.com/en/abs/a-heuristic-use-of-dynamic-programming-to-upperbound-treewidth-1909.076472019-10-25 https://scifaro.com/en/abs/preprocessing-and-cutting-planes-with-conflict-graphs-1909.077802021-01-13 https://scifaro.com/en/abs/trade-offs-in-dynamic-coloring-for-bipartite-and-general-graphs-1909.078542020-02-28 https://scifaro.com/en/abs/finding-maximum-edge-disjoint-paths-between-multiple-terminals-1909.079192022-12-02 https://scifaro.com/en/abs/deterministic-algorithms-for-the-lovasz-local-lemma-simpler-more-general-and-more-parallel-1909.080652023-10-13 https://scifaro.com/en/abs/hypergraph-partitions-1909.083072019-09-19 https://scifaro.com/en/abs/when-maximum-stable-set-can-be-solved-in-fpt-time-1909.084262019-09-19 https://scifaro.com/en/abs/efficient-computation-of-multi-modal-public-transit-traffic-assignments-using-ultra-1909.085192019-09-19 https://scifaro.com/en/abs/linear-time-recognition-of-double-threshold-graphs-1909.093712021-12-14 https://scifaro.com/en/abs/manipulation-attacks-in-local-differential-privacy-1909.096302019-09-23 https://scifaro.com/en/abs/spectral-lower-bounds-on-the-i-o-complexity-of-computation-graphs-1909.097912020-05-26 https://scifaro.com/en/abs/optimal-learning-of-joint-alignments-with-a-faulty-oracle-1909.099122019-09-24 https://scifaro.com/en/abs/online-knapsack-problems-with-a-resource-buffer-1909.100162019-09-24 https://scifaro.com/en/abs/sliding-window-property-testing-for-regular-languages-1909.102612019-09-25 https://scifaro.com/en/abs/improved-bounds-for-perfect-sampling-of-k-colorings-in-graphs-1909.103232020-05-22 https://scifaro.com/en/abs/lp-based-algorithms-for-multistage-minimization-problems-1909.103542019-09-24 https://scifaro.com/en/abs/a-characterization-of-graph-properties-testable-for-general-planar-graphs-with-one-sided-error-it-is-all-about-forbidden-subgraphs-1909.106472019-09-25 https://scifaro.com/en/abs/the-query-complexity-of-mastermind-with-ell-p-distances-1909.106682019-09-25 https://scifaro.com/en/abs/analysis-of-a-model-for-generating-weakly-scale-free-networks-1909.107192023-06-22 https://scifaro.com/en/abs/the-space-complexity-of-inner-product-filters-1909.107662020-01-14 https://scifaro.com/en/abs/dynamic-approximate-shortest-paths-and-beyond-subquadratic-and-worst-case-update-time-1909.108502019-10-18 https://scifaro.com/en/abs/a-common-approximation-framework-for-the-early-work-the-late-work-and-resource-leveling-problems-with-unit-time-jobs-1909.110862020-04-27 https://scifaro.com/en/abs/nearly-sample-optimal-sparse-fourier-transform-in-any-dimension-ripless-and-filterless-1909.111232019-09-26 https://scifaro.com/en/abs/experimental-evaluation-of-algorithms-for-computing-quasiperiods-1909.113362019-09-26 https://scifaro.com/en/abs/weighted-shortest-common-supersequence-problem-revisited-1909.114332019-09-26 https://scifaro.com/en/abs/internal-dictionary-matching-1909.115772019-09-26 https://scifaro.com/en/abs/a-new-deterministic-algorithm-for-dynamic-set-cover-1909.116002019-09-26 https://scifaro.com/en/abs/streaming-ptas-for-binary-ell-0-low-rank-approximation-1909.117442019-09-27 https://scifaro.com/en/abs/string-indexing-with-compressed-patterns-1909.119302024-02-15 https://scifaro.com/en/abs/approximation-algorithms-for-scheduling-with-class-constraints-1909.119702019-09-27 https://scifaro.com/en/abs/heuristics-for-symmetric-rectilinear-matrix-partitioning-1909.122092020-01-01 https://scifaro.com/en/abs/interactive-particle-systems-on-hypergraphs-drift-analysis-and-the-walksat-algorithm-1909.123532019-09-30 https://scifaro.com/en/abs/total-least-squares-regression-in-input-sparsity-time-1909.124412019-09-30 https://scifaro.com/en/abs/beating-greedy-for-stochastic-bipartite-matching-1909.127602019-10-15 https://scifaro.com/en/abs/computing-the-inversion-indel-distance-1909.128772019-10-01 https://scifaro.com/en/abs/characterization-and-linear-time-recognition-of-paired-threshold-graphs-1909.130292019-10-01 https://scifaro.com/en/abs/modeling-single-picker-routing-problems-in-classical-and-modern-warehouses-1909.133442019-10-01 https://scifaro.com/en/abs/parallel-machine-scheduling-to-minimize-energy-consumption-1909.133452019-10-01 https://scifaro.com/en/abs/optimal-sketching-for-kronecker-product-regression-and-low-rank-approximation-1909.133842019-10-01 https://scifaro.com/en/abs/an-average-compress-algorithm-for-the-sample-mean-problem-under-dynamic-time-warping-1909.135412020-02-26 https://scifaro.com/en/abs/a-relaxation-of-the-directed-disjoint-paths-problem-a-global-congestion-metric-helps-1909.138482021-12-21 https://scifaro.com/en/abs/polynomial-time-data-reduction-for-weighted-problems-beyond-additive-goal-functions-1910.002772022-12-26 https://scifaro.com/en/abs/incorporating-trip-chaining-within-online-demand-estimation-1910.004002019-11-21 https://scifaro.com/en/abs/estimating-the-percolation-centrality-of-large-networks-through-pseudo-dimension-theory-1910.004942020-02-18 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-reconfiguration-of-connected-dominating-sets-1910.005812019-10-03 https://scifaro.com/en/abs/spherical-k-nearest-neighbors-interpolation-1910.007042019-10-03 https://scifaro.com/en/abs/streaming-balanced-clustering-1910.007882019-10-03 https://scifaro.com/en/abs/on-the-hardness-of-set-disjointness-and-set-intersection-with-bounded-universe-1910.008312019-10-03 https://scifaro.com/en/abs/advice-complexity-of-adaptive-priority-algorithms-1910.008682022-01-27 https://scifaro.com/en/abs/node-multiway-cut-and-subset-feedback-vertex-set-on-graphs-of-bounded-mim-width-1910.008872022-01-19 https://scifaro.com/en/abs/computing-the-largest-bond-of-a-graph-1910.010712019-10-03 https://scifaro.com/en/abs/online-geometric-discrepancy-for-stochastic-arrivals-with-applications-to-envy-minimization-1910.010732019-10-03 https://scifaro.com/en/abs/graph-modification-for-edge-coloured-and-signed-graph-homomorphism-problems-parameterized-and-classical-complexity-1910.010992022-05-04 https://scifaro.com/en/abs/path-and-ancestor-queries-on-trees-with-multidimensional-weight-vectors-1910.011472019-10-04 https://scifaro.com/en/abs/best-first-search-algorithm-for-non-convex-sparse-minimization-1910.012962019-10-04 https://scifaro.com/en/abs/extensions-of-the-algorithmic-lovasz-local-lemma-1910.015522020-08-17 https://scifaro.com/en/abs/finding-monotone-patterns-in-sublinear-time-1910.017492019-10-07 https://scifaro.com/en/abs/width-parameterizations-for-knot-free-vertex-deletion-on-digraphs-1910.017832019-10-07 https://scifaro.com/en/abs/efficient-symmetric-norm-regression-via-linear-sketching-1910.017882019-10-08 https://scifaro.com/en/abs/fpt-inapproximability-of-directed-cut-and-connectivity-problems-1910.019342019-10-07 https://scifaro.com/en/abs/c-planarity-testing-of-embedded-clustered-graphs-with-bounded-dual-carving-width-1910.020572021-08-18 https://scifaro.com/en/abs/fully-dynamic-delta-1-coloring-in-constant-update-time-1910.020632019-10-07 https://scifaro.com/en/abs/towards-a-definitive-compressibility-measure-for-repetitive-sequences-1910.021512021-01-18 https://scifaro.com/en/abs/template-based-minor-embedding-for-adiabatic-quantum-optimization-1910.021792021-01-21 https://scifaro.com/en/abs/a-new-algorithm-for-graph-center-computation-and-graph-partitioning-according-to-the-distance-to-the-center-1910.022482019-10-08 https://scifaro.com/en/abs/clustering-case-statements-for-indirect-branch-predictors-1910.023512019-11-05 https://scifaro.com/en/abs/discovering-polarized-communities-in-signed-networks-1910.024382019-10-08 https://scifaro.com/en/abs/fast-detection-of-outliers-in-data-streams-with-the-q-n-estimator-1910.024592020-01-10 https://scifaro.com/en/abs/approximation-algorithms-for-maximally-balanced-connected-graph-partition-1910.024702019-10-08 https://scifaro.com/en/abs/exact-and-or-fast-nearest-neighbors-1910.024782019-11-21 https://scifaro.com/en/abs/understanding-zadimoghaddam-s-edge-weighted-online-matching-algorithm-unweighted-case-1910.025692019-10-08 https://scifaro.com/en/abs/rambo-repeated-and-merged-bloom-filter-for-ultra-fast-multiple-set-membership-testing-msmt-on-large-scale-data-1910.026112020-07-21 https://scifaro.com/en/abs/faster-minimum-k-cut-of-a-simple-graph-1910.026652019-10-08 https://scifaro.com/en/abs/er-index-a-referential-index-for-encrypted-genomic-databases-1910.028512020-12-29 https://scifaro.com/en/abs/a-fast-exact-algorithm-for-airplane-refueling-problem-1910.032412019-10-09 https://scifaro.com/en/abs/parallel-online-algorithms-for-the-bin-packing-problem-1910.032492019-10-09 https://scifaro.com/en/abs/understanding-zadimoghaddam-s-edge-weighted-online-matching-algorithm-weighted-case-1910.032872019-10-09 https://scifaro.com/en/abs/upper-and-lower-bounds-for-fully-retroactive-graph-problems-1910.033322021-12-02 https://scifaro.com/en/abs/a-note-on-computational-approaches-for-the-antibandwidth-problem-1910.033672019-10-09 https://scifaro.com/en/abs/length-bounded-cuts-proper-interval-graphs-and-structural-parameters-1910.034092019-10-09 https://scifaro.com/en/abs/fast-diameter-computation-within-split-graphs-1910.034382023-06-22 https://scifaro.com/en/abs/stack-sorting-with-increasing-and-decreasing-stacks-1910.035782019-10-10 https://scifaro.com/en/abs/span-core-decomposition-for-temporal-networks-algorithms-and-applications-1910.036452020-12-09 https://scifaro.com/en/abs/improved-bounds-for-two-query-adaptive-bitprobe-schemes-storing-five-elements-1910.036512020-03-25 https://scifaro.com/en/abs/prophets-secretaries-and-maximizing-the-probability-of-choosing-the-best-1910.037982019-10-10 https://scifaro.com/en/abs/scalable-nearest-neighbor-search-for-optimal-transport-1910.041262020-09-30 https://scifaro.com/en/abs/cost-aware-targeted-viral-marketing-approximation-with-less-samples-1910.041342020-02-11 https://scifaro.com/en/abs/minimum-cuts-in-surface-graphs-1910.042782019-10-11 https://scifaro.com/en/abs/a-fast-max-flow-algorithm-1910.048482019-10-14 https://scifaro.com/en/abs/truly-subcubic-min-plus-product-for-less-structured-matrices-with-applications-1910.049112019-10-14 https://scifaro.com/en/abs/regret-bounds-for-batched-bandits-1910.049592020-02-19 https://scifaro.com/en/abs/a-quality-metric-for-symmetric-graph-drawings-1910.049742019-10-14 https://scifaro.com/en/abs/iterated-decomposition-of-biased-permutations-via-new-bounds-on-the-spectral-gap-of-markov-chains-1910.051842019-10-14 https://scifaro.com/en/abs/near-optimal-massively-parallel-graph-connectivity-1910.053852020-03-13 https://scifaro.com/en/abs/reachability-and-shortest-paths-in-the-broadcast-congest-model-1910.056452019-10-15 https://scifaro.com/en/abs/bring-your-own-greedy-max-near-optimal-1-2-approximations-for-submodular-knapsack-1910.056462019-10-15 https://scifaro.com/en/abs/fast-fourier-sparsity-testing-1910.056862019-10-15 https://scifaro.com/en/abs/quantum-inspired-classical-algorithms-for-singular-value-transformation-1910.056992021-10-05 https://scifaro.com/en/abs/fastsv-a-distributed-memory-connected-component-algorithm-with-fast-convergence-1910.059712020-01-07 https://scifaro.com/en/abs/sampling-based-sublinear-low-rank-matrix-arithmetic-framework-for-dequantizing-quantum-machine-learning-1910.061512023-07-13 https://scifaro.com/en/abs/the-pgm-index-a-multicriteria-compressed-and-learned-approach-to-data-indexing-1910.061692020-05-08 https://scifaro.com/en/abs/an-improved-fpt-algorithm-for-the-flip-distance-problem-1910.061852019-10-15 https://scifaro.com/en/abs/recsplit-minimal-perfect-hashing-via-recursive-splitting-1910.064162019-12-03 https://scifaro.com/en/abs/it-is-high-time-we-let-go-of-the-mersenne-twister-1910.064372025-06-23 https://scifaro.com/en/abs/principal-component-projection-and-regression-in-nearly-linear-time-through-asymmetric-svrg-1910.065172019-10-16 https://scifaro.com/en/abs/apply-sorting-algorithms-to-fast-problem-1910.069202019-10-16 https://scifaro.com/en/abs/flowless-extracting-densest-subgraphs-without-flow-computations-1910.070872019-10-18 https://scifaro.com/en/abs/practical-random-access-to-slp-compressed-texts-1910.071452020-07-21 https://scifaro.com/en/abs/envy-freeness-and-relaxed-stability-under-lower-quotas-1910.071592020-05-19 https://scifaro.com/en/abs/algorithms-and-hardness-results-for-the-maximum-balanced-connected-subgraph-problem-1910.073052020-03-11 https://scifaro.com/en/abs/node-weighted-network-design-in-planar-and-minor-closed-families-of-graphs-1910.076162019-10-18 https://scifaro.com/en/abs/the-distributed-bloom-filter-1910.077822020-02-20 https://scifaro.com/en/abs/engineering-top-down-weight-balanced-trees-1910.078492020-02-11 https://scifaro.com/en/abs/faster-parameterized-algorithm-for-bicluter-editing-1910.079442019-10-18 https://scifaro.com/en/abs/deterministic-graph-cuts-in-subquadratic-time-sparse-balanced-and-k-vertex-1910.079502019-10-21 https://scifaro.com/en/abs/a-deterministic-algorithm-for-balanced-cut-with-applications-to-dynamic-connectivity-flows-and-beyond-1910.080252020-05-05 https://scifaro.com/en/abs/solving-linear-programs-with-sqrt-rank-linear-system-solves-1910.080332020-09-02 https://scifaro.com/en/abs/weighted-edge-sampling-for-static-graphs-1910.082832019-10-21 https://scifaro.com/en/abs/approximating-weighted-completion-time-for-order-scheduling-with-setup-times-1910.083602019-10-22 https://scifaro.com/en/abs/temporal-network-sampling-1910.086572021-01-08 https://scifaro.com/en/abs/planted-models-for-k-way-edge-and-vertex-expansion-1910.088892019-10-22 https://scifaro.com/en/abs/a-new-connection-between-node-and-edge-depth-robust-graphs-1910.089202020-12-14 https://scifaro.com/en/abs/worst-case-polylog-incremental-spqr-trees-embeddings-planarity-and-triconnectivity-1910.090052019-10-22 https://scifaro.com/en/abs/adaptive-learned-bloom-filter-ada-bf-efficient-utilization-of-the-classifier-1910.091312019-10-22 https://scifaro.com/en/abs/shortest-feasible-paths-with-charging-stops-for-battery-electric-vehicles-1910.098122019-10-23 https://scifaro.com/en/abs/simultaneous-fpq-ordering-and-hybrid-planarity-testing-1910.101132019-10-23 https://scifaro.com/en/abs/vertex-sparsifiers-for-c-edge-connectivity-1910.103592019-10-24 https://scifaro.com/en/abs/parameterized-coloring-problems-on-threshold-graphs-1910.103642020-05-29 https://scifaro.com/en/abs/analyzing-trade-offs-in-reversible-linear-and-binary-search-algorithms-1910.104062019-10-24 https://scifaro.com/en/abs/a-story-of-diameter-radius-and-helly-property-1910.104122019-11-12 https://scifaro.com/en/abs/faster-p-norm-minimizing-flows-via-smoothed-q-norm-problems-1910.105712020-01-10 https://scifaro.com/en/abs/resolution-of-the-burrows-wheeler-transform-conjecture-1910.106312021-04-13 https://scifaro.com/en/abs/mimicking-networks-parameterized-by-connectivity-1910.106652020-07-15 https://scifaro.com/en/abs/communication-efficient-weighted-reservoir-sampling-from-fully-distributed-data-streams-1910.110692020-02-26 https://scifaro.com/en/abs/tractable-minor-free-generalization-of-planar-zero-field-ising-models-1910.111422021-09-15 https://scifaro.com/en/abs/non-rectangular-convolutions-and-sub-cadences-with-three-elements-1910.115642019-10-28 https://scifaro.com/en/abs/a-curious-link-between-prime-numbers-the-maundy-cake-problem-and-parallel-sorting-1910.117492019-11-05 https://scifaro.com/en/abs/optimal-orthogonal-drawings-of-planar-3-graphs-in-linear-time-1910.117822019-10-28 https://scifaro.com/en/abs/a-deterministic-linear-program-solver-in-current-matrix-multiplication-time-1910.119572020-04-21 https://scifaro.com/en/abs/selection-on-x-1-x-2-cdots-x-m-with-layer-ordered-heaps-1910.119932020-08-18 https://scifaro.com/en/abs/facility-location-problem-in-differential-privacy-model-revisited-1910.120502019-10-29 https://scifaro.com/en/abs/near-optimal-bounds-for-online-caching-with-machine-learned-advice-1910.121722019-10-31 https://scifaro.com/en/abs/cilkmem-algorithms-for-analyzing-the-memory-high-water-mark-of-fork-join-parallel-programs-1910.123402019-10-29 https://scifaro.com/en/abs/a-fast-and-tight-heuristic-for-a-in-road-networks-1910.125262021-03-29 https://scifaro.com/en/abs/space-efficient-fast-and-exact-routing-in-time-dependent-road-networks-1910.127262021-03-29 https://scifaro.com/en/abs/bounded-degree-group-steiner-tree-problems-1910.128482019-10-29 https://scifaro.com/en/abs/a-survey-on-subgraph-counting-concepts-algorithms-and-applications-to-network-motifs-and-graphlets-1910.130112021-12-30 https://scifaro.com/en/abs/flexible-graph-connectivity-approximating-network-design-problems-between-1-and-2-connectivity-1910.132972020-01-14 https://scifaro.com/en/abs/nc-algorithms-for-popular-matchings-in-one-sided-preference-systems-and-related-problems-1910.133862019-12-23 https://scifaro.com/en/abs/practical-repetition-aware-grammar-compression-1910.134792019-10-31 https://scifaro.com/en/abs/achieving-optimal-backlog-in-the-vanilla-multi-processor-cup-game-1910.135332019-10-31 https://scifaro.com/en/abs/an-adaptive-step-toward-the-multiphase-conjecture-1910.135432019-10-31 https://scifaro.com/en/abs/group-centrality-maximization-for-large-scale-graphs-1910.138742019-10-31 https://scifaro.com/en/abs/on-a-decentralized-delta-1-graph-coloring-algorithm-1910.139002019-11-21 https://scifaro.com/en/abs/improved-local-computation-algorithm-for-set-cover-via-sparsification-1910.141542019-11-06 https://scifaro.com/en/abs/faster-energy-maximization-for-faster-maximum-flow-1910.142762019-11-01 https://scifaro.com/en/abs/computing-and-testing-small-connectivity-in-near-linear-time-and-queries-via-fast-local-cut-algorithms-1910.143442019-11-01 https://scifaro.com/en/abs/efficient-synthesis-of-weighted-marked-graphs-with-circular-reachability-graph-and-beyond-1910.143872019-11-01 https://scifaro.com/en/abs/allsat-compressed-with-wildcards-frequent-set-mining-1910.145082019-11-18 https://scifaro.com/en/abs/a-poset-metric-from-the-directed-maximum-common-edge-subgraph-1910.146382020-12-07 https://scifaro.com/en/abs/edge-minimization-in-de-bruijn-graphs-1911.000442020-01-20 https://scifaro.com/en/abs/a-simple-and-efficient-method-to-compute-a-single-linkage-dendrogram-1911.002232019-11-04 https://scifaro.com/en/abs/thaad-efficient-matching-queries-under-temporal-abstraction-for-anomaly-detection-1911.003362019-11-05 https://scifaro.com/en/abs/cnf-encodings-of-cardinality-constraints-based-on-comparator-networks-1911.005862019-11-05 https://scifaro.com/en/abs/probminhash-a-class-of-locality-sensitive-hash-algorithms-for-the-probability-jaccard-similarity-1911.006752020-10-27 https://scifaro.com/en/abs/minimum-cut-in-o-m-log-2-n-time-1911.011452020-08-04 https://scifaro.com/en/abs/optimal-adaptive-detection-of-monotone-patterns-1911.011692019-11-05 https://scifaro.com/en/abs/fast-sampling-and-counting-k-sat-solutions-in-the-local-lemma-regime-1911.013192019-11-05 https://scifaro.com/en/abs/bitcoin-coin-selection-with-leverage-1911.013302019-11-14 https://scifaro.com/en/abs/nearly-optimal-static-las-vegas-succinct-dictionary-1911.013482020-09-01 https://scifaro.com/en/abs/faster-update-time-for-turnstile-streaming-algorithms-1911.013512019-11-05 https://scifaro.com/en/abs/counting-small-permutation-patterns-1911.014142021-09-14 https://scifaro.com/en/abs/an-empirical-estimation-for-time-and-memory-algorithm-complexities-newly-developed-r-package-1911.014202020-10-22 https://scifaro.com/en/abs/pan-private-uniformity-testing-1911.014522020-07-20 https://scifaro.com/en/abs/the-parameterized-complexity-of-clustering-incomplete-data-1911.014652021-04-08 https://scifaro.com/en/abs/metropolized-forest-recombination-for-monte-carlo-sampling-of-graph-partitions-1911.015032021-05-11 https://scifaro.com/en/abs/statistical-physics-approaches-to-unique-games-1911.015042021-03-05 https://scifaro.com/en/abs/unbounded-lower-bound-for-k-server-against-weak-adversaries-1911.015922020-04-22 https://scifaro.com/en/abs/faster-parallel-algorithm-for-approximate-shortest-path-1911.016262022-06-02 https://scifaro.com/en/abs/pandora-s-box-with-correlations-learning-and-approximation-1911.016322020-04-17 https://scifaro.com/en/abs/fast-multiple-pattern-cartesian-tree-matching-1911.016442019-11-06 https://scifaro.com/en/abs/weighted-min-cut-sequential-cut-query-and-streaming-algorithms-1911.016512021-02-19 https://scifaro.com/en/abs/a-heuristic-algorithm-based-on-tour-rebuilding-operator-for-the-traveling-salesman-problem-1911.016632019-11-12 https://scifaro.com/en/abs/an-efficient-word-lookup-system-by-using-improved-trie-algorithm-1911.017632019-11-06 https://scifaro.com/en/abs/fully-dynamic-matching-beating-2-approximation-in-delta-epsilon-update-time-1911.018392019-11-06 https://scifaro.com/en/abs/the-bron-kerbosch-algorithm-with-vertex-ordering-is-output-sensitive-1911.019512024-02-13 https://scifaro.com/en/abs/parallel-approximate-undirected-shortest-paths-via-low-hop-emulators-1911.019562019-11-06 https://scifaro.com/en/abs/local-statistics-semidefinite-programming-and-community-detection-1911.019602020-09-22 https://scifaro.com/en/abs/efficiently-learning-structured-distributions-from-untrusted-batches-1911.020352019-11-07 https://scifaro.com/en/abs/breaching-the-2-approximation-barrier-for-connectivity-augmentation-a-reduction-to-steiner-tree-1911.022592019-11-11 https://scifaro.com/en/abs/in-search-of-dense-subgraphs-how-good-is-greedy-peeling-1911.023562019-11-07 https://scifaro.com/en/abs/from-symmetry-to-asymmetry-generalizing-tsp-approximations-by-parametrization-1911.024532020-02-27 https://scifaro.com/en/abs/algorithms-and-adaptivity-gaps-for-stochastic-k-tsp-1911.025062019-11-07 https://scifaro.com/en/abs/distributed-mst-a-smoothed-analysis-1911.026282019-11-11 https://scifaro.com/en/abs/analysis-of-two-variable-recurrence-relations-with-application-to-parameterized-approximations-1911.026532025-06-10 https://scifaro.com/en/abs/efficient-computation-of-positional-population-counts-using-simd-instructions-1911.026962021-08-19 https://scifaro.com/en/abs/trichotomy-for-the-reconfiguration-problem-of-integer-linear-systems-1911.027862019-11-11 https://scifaro.com/en/abs/towards-better-compressed-representations-1911.028892019-11-18 https://scifaro.com/en/abs/probabilistic-watershed-sampling-all-spanning-forests-for-seeded-segmentation-and-semi-supervised-learning-1911.029212019-11-11 https://scifaro.com/en/abs/reconfiguring-k-path-vertex-covers-1911.030262022-04-11 https://scifaro.com/en/abs/on-the-complexity-of-bwt-runs-minimization-via-alphabet-reordering-1911.030352020-02-19 https://scifaro.com/en/abs/estimating-normalizing-constants-for-log-concave-distributions-algorithms-and-lower-bounds-1911.030432020-06-25 https://scifaro.com/en/abs/on-dynamic-succinct-graph-representations-1911.031952019-12-09 https://scifaro.com/en/abs/structural-parameterizations-for-equitable-coloring-1911.032972020-12-15 https://scifaro.com/en/abs/local-search-for-group-closeness-maximization-on-big-graphs-1911.033602019-11-11 https://scifaro.com/en/abs/fully-dynamic-planarity-testing-in-polylogarithmic-time-1911.034492019-12-11 https://scifaro.com/en/abs/space-efficient-construction-of-lyndon-arrays-in-linear-time-1911.035422019-12-11 https://scifaro.com/en/abs/worst-case-analysis-for-randomly-collected-data-1911.036052020-10-27 https://scifaro.com/en/abs/gract-a-grammar-based-compressed-index-for-trajectory-data-1911.041982019-11-12 https://scifaro.com/en/abs/dv2v-a-dynamic-variable-to-variable-compressor-1911.042022019-11-12 https://scifaro.com/en/abs/a-polynomial-kernel-for-3-leaf-power-deletion-1911.042492023-10-24 https://scifaro.com/en/abs/information-carefull-worstcase-decreasekey-heaps-with-simple-nonmeld-variant-1911.043722019-11-12 https://scifaro.com/en/abs/grass-graph-spectral-sparsification-leveraging-scalable-spectral-perturbation-analysis-1911.043822020-04-30 https://scifaro.com/en/abs/online-stochastic-matching-with-edge-arrivals-1911.046862020-07-17 https://scifaro.com/en/abs/fpt-algorithms-for-diverse-collections-of-hitting-sets-1911.050322019-12-10 https://scifaro.com/en/abs/fully-dynamic-space-efficient-dictionaries-and-filters-with-constant-number-of-memory-accesses-1911.050602019-11-13 https://scifaro.com/en/abs/nested-dataflow-algorithms-for-dynamic-programming-recurrences-with-more-than-o-1-dependency-1911.053332019-11-14 https://scifaro.com/en/abs/a-polynomial-kernel-for-funnel-arc-deletion-set-1911.055202020-09-29 https://scifaro.com/en/abs/rounding-dynamic-matchings-against-an-adaptive-adversary-1911.055452020-06-17 https://scifaro.com/en/abs/strong-self-concordance-and-sampling-1911.056562020-07-13 https://scifaro.com/en/abs/enumerative-data-compression-with-non-uniquely-decodable-codes-1911.056762019-11-14 https://scifaro.com/en/abs/linear-time-subgraph-counting-graph-degeneracy-and-the-chasm-at-size-six-1911.058962019-12-02 https://scifaro.com/en/abs/recent-advances-in-algorithmic-high-dimensional-robust-statistics-1911.059112019-11-15 https://scifaro.com/en/abs/graph-spanners-in-the-message-passing-model-1911.059912019-11-19 https://scifaro.com/en/abs/1-0-1-apsp-and-min-max-product-problems-1911.061322019-11-15 https://scifaro.com/en/abs/in-search-of-the-fastest-concurrent-union-find-algorithm-1911.063472019-11-18 https://scifaro.com/en/abs/weighted-triangle-free-2-matching-problem-with-edge-disjoint-forbidden-triangles-1911.064362019-11-18 https://scifaro.com/en/abs/new-query-lower-bounds-for-submodular-function-minimization-1911.068892019-11-19 https://scifaro.com/en/abs/delta-stepping-sssp-from-vertices-and-edges-to-graphblas-implementations-1911.068952020-09-18 https://scifaro.com/en/abs/strategy-stealing-is-non-constructive-1911.069072019-11-19 https://scifaro.com/en/abs/approximating-the-distance-to-monotonicity-of-boolean-functions-1911.069242021-02-26 https://scifaro.com/en/abs/memory-efficient-performance-monitoring-on-programmable-switches-with-lean-algorithms-1911.069512019-11-19 https://scifaro.com/en/abs/regularized-weighted-low-rank-approximation-1911.069582019-11-20 https://scifaro.com/en/abs/constructing-the-bijective-and-the-extended-burrows-wheeler-transform-in-linear-time-1911.069852021-04-23 https://scifaro.com/en/abs/counting-solutions-to-random-cnf-formulas-1911.070202021-05-25 https://scifaro.com/en/abs/faster-integer-multiplication-using-preprocessing-1911.071242019-12-12 https://scifaro.com/en/abs/a-one-phase-tree-based-algorithm-for-mining-high-utility-itemsets-from-a-transaction-database-1911.071512019-11-19 https://scifaro.com/en/abs/sparse-hopsets-in-congested-clique-1911.071542020-01-22 https://scifaro.com/en/abs/a-new-approximation-algorithm-for-the-minimum-2-edge-connected-spanning-subgraph-problem-1911.072322023-05-10 https://scifaro.com/en/abs/approximation-of-steiner-forest-via-the-bidirected-cut-relaxation-1911.072342019-11-19 https://scifaro.com/en/abs/testing-properties-of-multiple-distributions-with-few-samples-1911.073242019-11-19 https://scifaro.com/en/abs/robust-algorithms-for-the-secretary-problem-1911.073522019-12-02 https://scifaro.com/en/abs/random-restrictions-of-high-dimensional-distributions-and-uniformity-testing-with-subcube-conditioning-1911.073572021-02-08 https://scifaro.com/en/abs/top-down-induction-of-decision-trees-rigorous-guarantees-and-inherent-limitations-1911.073752019-11-19 https://scifaro.com/en/abs/finding-skewed-subcubes-under-a-distribution-1911.073782020-11-16 https://scifaro.com/en/abs/algorithmic-discrepancy-minimization-1911.074172019-11-19 https://scifaro.com/en/abs/implicit-enumeration-of-topological-minor-embeddings-and-its-application-to-planar-subgraph-enumeration-1911.074652019-11-19 https://scifaro.com/en/abs/optimal-single-choice-prophet-inequalities-from-samples-1911.079452025-09-12 https://scifaro.com/en/abs/learning-assisted-competitive-algorithms-for-peak-aware-energy-scheduling-1911.079722019-11-20 https://scifaro.com/en/abs/consistent-recovery-threshold-of-hidden-nearest-neighbor-graphs-1911.080042019-11-21 https://scifaro.com/en/abs/low-rank-toeplitz-matrix-estimation-via-random-ultra-sparse-rulers-1911.080152019-11-20 https://scifaro.com/en/abs/mapping-np-hard-and-np-complete-optimisation-problems-to-quadratic-unconstrained-binary-optimisation-problems-1911.080432020-08-04 https://scifaro.com/en/abs/outlier-robust-high-dimensional-sparse-estimation-via-iterative-filtering-1911.080852019-11-20 https://scifaro.com/en/abs/property-testing-of-lp-type-problems-1911.083202019-11-20 https://scifaro.com/en/abs/the-power-of-factorization-mechanisms-in-local-and-central-differential-privacy-1911.083392019-11-20 https://scifaro.com/en/abs/improved-compressed-string-dictionaries-1911.083722019-11-20 https://scifaro.com/en/abs/concurrent-expandable-amqs-on-the-basis-of-quotient-filters-1911.083742019-11-20 https://scifaro.com/en/abs/extending-general-compact-querieable-representations-to-gis-applications-1911.083762019-11-20 https://scifaro.com/en/abs/frequent-elements-with-witnesses-in-data-streams-1911.088322021-02-16 https://scifaro.com/en/abs/new-algorithms-for-mixed-dominating-set-1911.089642023-06-22 https://scifaro.com/en/abs/faster-dynamic-compressed-d-ary-relations-1911.089712019-11-21 https://scifaro.com/en/abs/new-structures-to-solve-aggregated-queries-for-trips-over-public-transportation-networks-1911.090442019-11-21 https://scifaro.com/en/abs/grammar-compressed-sequences-with-rank-select-support-1911.090772019-11-25 https://scifaro.com/en/abs/polylogarithmic-approximation-algorithm-for-k-connected-directed-steiner-tree-on-quasi-bipartite-graphs-1911.091502019-11-22 https://scifaro.com/en/abs/the-karger-stein-algorithm-is-optimal-for-k-cut-1911.091652019-11-22 https://scifaro.com/en/abs/energy-consumption-in-compact-integer-vectors-a-study-case-1911.093702019-11-22 https://scifaro.com/en/abs/s-raster-contraction-clustering-for-evolving-data-streams-1911.094472020-09-17 https://scifaro.com/en/abs/navigating-planar-topologies-in-near-optimal-space-and-time-1911.094982021-12-14 https://scifaro.com/en/abs/towards-a-theory-of-parameterized-streaming-algorithms-1911.096502019-11-22 https://scifaro.com/en/abs/leveraging-special-purpose-hardware-for-local-search-heuristics-1911.098102020-12-01 https://scifaro.com/en/abs/privately-learning-thresholds-closing-the-exponential-gap-1911.101372019-11-25 https://scifaro.com/en/abs/an-algorithm-for-strong-stability-in-the-student-project-allocation-problem-with-ties-1911.102622019-11-26 https://scifaro.com/en/abs/subexponential-lps-approximate-max-cut-1911.103042020-04-20 https://scifaro.com/en/abs/smoothed-complexity-of-local-max-cut-and-binary-max-csp-1911.103812019-11-26 https://scifaro.com/en/abs/faster-matroid-intersection-1911.107652019-11-26 https://scifaro.com/en/abs/coloring-outerplanar-graphs-and-planar-3-trees-with-small-monochromatic-components-1911.108632019-12-03 https://scifaro.com/en/abs/breaking-the-barrier-of-2-for-the-storage-allocation-problem-1911.108712019-11-26 https://scifaro.com/en/abs/listing-conflicting-triples-in-optimal-time-1911.110482019-11-26 https://scifaro.com/en/abs/downgrading-to-minimize-connectivity-1911.112292019-11-27 https://scifaro.com/en/abs/graph-isomorphism-in-quasipolynomial-time-parameterized-by-treewidth-1911.112572020-04-21 https://scifaro.com/en/abs/finding-route-hotspots-in-large-labeled-networks-1911.113542019-11-27 https://scifaro.com/en/abs/fast-fibonacci-heaps-with-worst-case-extensions-1911.116372019-11-27 https://scifaro.com/en/abs/robustly-clustering-a-mixture-of-gaussians-1911.118382020-06-02 https://scifaro.com/en/abs/faster-algorithms-for-parametric-global-minimum-cut-problems-1911.118472019-11-28 https://scifaro.com/en/abs/a-unified-view-of-graph-regularity-via-matrix-decompositions-1911.118682025-05-30 https://scifaro.com/en/abs/approximating-permanent-of-random-matrices-with-vanishing-mean-made-better-and-simpler-1911.119622019-12-02 https://scifaro.com/en/abs/measuring-similarity-between-two-mixture-trees-using-mixture-distance-metric-and-algorithms-1911.120032019-11-28 https://scifaro.com/en/abs/online-hashing-with-efficient-updating-of-binary-codes-1911.121252019-12-05 https://scifaro.com/en/abs/scheduling-with-non-renewable-resources-minimizing-the-sum-of-completion-times-1911.121382019-11-28 https://scifaro.com/en/abs/single-machine-batch-scheduling-to-minimize-the-weighted-number-of-tardy-jobs-1911.123502019-11-28 https://scifaro.com/en/abs/roundtrip-spanners-with-2k-1-stretch-1911.124112020-05-01 https://scifaro.com/en/abs/permutation-strikes-back-the-power-of-recourse-in-online-metric-matching-1911.127782019-12-02 https://scifaro.com/en/abs/optimal-streaming-algorithms-for-submodular-maximization-with-cardinality-constraints-1911.129592020-08-11 https://scifaro.com/en/abs/sat-encodings-for-treecut-width-and-treedepth-1911.129952019-12-02 https://scifaro.com/en/abs/minimization-of-weighted-completion-times-in-path-based-coflow-scheduling-1911.130852020-02-18 https://scifaro.com/en/abs/shortest-path-centrality-and-the-apsp-problem-via-vc-dimension-and-rademacher-averages-1911.131442020-05-06 https://scifaro.com/en/abs/tight-bounds-for-planar-strongly-connected-steiner-subgraph-with-fixed-number-of-terminals-and-extensions-1911.131612019-12-02 https://scifaro.com/en/abs/adversarially-robust-low-dimensional-representations-1911.132682021-08-16 https://scifaro.com/en/abs/algorithms-for-flows-over-time-with-scheduling-costs-1912.000822019-12-03 https://scifaro.com/en/abs/improved-approximation-algorithms-for-inventory-problems-1912.001012019-12-03 https://scifaro.com/en/abs/mix-and-match-markov-chains-mixing-times-for-matching-in-rideshare-1912.002252019-12-03 https://scifaro.com/en/abs/scalable-graph-algorithms-1912.002452019-12-03 https://scifaro.com/en/abs/pfaffian-pairs-and-parities-counting-on-linear-matroid-intersection-and-parity-problems-1912.006202020-05-11 https://scifaro.com/en/abs/noisy-greedy-and-not-so-greedy-k-means-1912.006532019-12-03 https://scifaro.com/en/abs/ptas-for-steiner-tree-on-map-graphs-1912.007172019-12-03 https://scifaro.com/en/abs/concave-connection-cost-facility-location-and-the-star-inventory-routing-problem-1912.007702020-10-13 https://scifaro.com/en/abs/on-clearing-prices-in-matching-markets-a-simple-characterization-without-duality-1912.007862019-12-03 https://scifaro.com/en/abs/improved-algorithm-for-tolerant-junta-testing-1912.008372021-06-30 https://scifaro.com/en/abs/properties-of-nowhere-dense-graph-classes-related-to-independent-set-problem-1912.009482019-12-03 https://scifaro.com/en/abs/the-polynomial-transform-1912.011552019-12-11 https://scifaro.com/en/abs/approximating-star-cover-problems-1912.011952019-12-04 https://scifaro.com/en/abs/soft-robust-solutions-to-possibilistic-optimization-problems-1912.015162020-09-15 https://scifaro.com/en/abs/faster-lattice-enumeration-1912.017812019-12-05 https://scifaro.com/en/abs/popular-branchings-and-their-dual-certificates-1912.018542019-12-05 https://scifaro.com/en/abs/mining-top-k-trajectory-patterns-from-anonymized-data-1912.018612019-12-05 https://scifaro.com/en/abs/on-computing-the-hamiltonian-index-of-graphs-1912.019902019-12-05 https://scifaro.com/en/abs/assessing-the-best-edit-in-perturbation-based-iterative-refinement-algorithms-to-compute-the-median-string-1912.022172019-12-06 https://scifaro.com/en/abs/sub-linear-race-sketches-for-approximate-kernel-density-estimation-on-streaming-data-1912.022832019-12-06 https://scifaro.com/en/abs/power-of-pre-processing-production-scheduling-with-variable-energy-pricing-and-power-saving-states-1912.024302020-12-16 https://scifaro.com/en/abs/algorithm-for-finding-the-maximum-clique-based-on-continuous-time-quantum-walk-1912.027282020-05-26 https://scifaro.com/en/abs/complexity-of-a-root-clustering-algorithm-1912.028202019-12-09 https://scifaro.com/en/abs/settling-the-relationship-between-wilber-s-bounds-for-dynamic-optimality-1912.028582020-06-30 https://scifaro.com/en/abs/pinning-down-the-strong-wilber-1-bound-for-binary-search-trees-1912.029002019-12-24 https://scifaro.com/en/abs/lower-bounds-for-compressed-sensing-with-generative-models-1912.029382019-12-09 https://scifaro.com/en/abs/on-the-complexity-of-the-stability-problem-of-binary-freezing-totalistic-cellular-automata-1912.029532019-12-09 https://scifaro.com/en/abs/scheduling-on-hybrid-platforms-improved-approximability-window-1912.030882020-02-11 https://scifaro.com/en/abs/parameterized-complexity-of-partial-scheduling-1912.031852020-10-02 https://scifaro.com/en/abs/general-multi-state-rework-network-and-reliability-algorithm-1912.033092020-06-18 https://scifaro.com/en/abs/online-vector-balancing-and-geometric-discrepancy-1912.033502020-04-14 https://scifaro.com/en/abs/parameterized-algorithms-for-milps-with-small-treedepth-1912.035012019-12-10 https://scifaro.com/en/abs/flattened-exponential-histogram-for-sliding-window-queries-over-data-streams-1912.035262019-12-10 https://scifaro.com/en/abs/approximating-the-determinant-of-well-conditioned-matrices-by-shallow-circuits-1912.038242019-12-10 https://scifaro.com/en/abs/robust-and-sample-optimal-algorithms-for-psd-low-rank-approximation-1912.041772021-06-16 https://scifaro.com/en/abs/a-deterministic-algorithm-for-the-mst-problem-in-constant-rounds-of-congested-clique-1912.042392020-06-11 https://scifaro.com/en/abs/algebraic-and-euclidean-lattices-optimal-lattice-reduction-and-beyond-1912.045862019-12-11 https://scifaro.com/en/abs/probabilistic-methods-of-bypassing-the-maze-using-stones-and-a-random-number-sensor-1912.047012020-05-12 https://scifaro.com/en/abs/asymptotic-performance-of-the-grimmett-mcdiarmid-heuristic-1912.047722019-12-11 https://scifaro.com/en/abs/graph-pricing-with-limited-supply-1912.050102019-12-12 https://scifaro.com/en/abs/crossing-reduction-of-sankey-diagram-with-barycentre-ordering-via-markov-chain-1912.053392019-12-24 https://scifaro.com/en/abs/graph-sparsification-for-derandomizing-massively-parallel-computation-with-low-space-1912.053902020-02-20 https://scifaro.com/en/abs/efficient-construction-of-directed-hopsets-and-parallel-approximate-shortest-paths-1912.055062019-12-12 https://scifaro.com/en/abs/a-constant-factor-approximation-for-directed-latency-in-quasi-polynomial-time-1912.061982020-04-17 https://scifaro.com/en/abs/theoretically-efficient-and-practical-parallel-dbscan-1912.062552021-01-29 https://scifaro.com/en/abs/the-sbp-algorithm-for-maximizing-revenue-in-online-dial-a-ride-1912.063002019-12-16 https://scifaro.com/en/abs/construction-and-maintenance-of-swarm-drones-1912.063602019-12-16 https://scifaro.com/en/abs/approximate-and-robust-bounded-job-start-scheduling-for-royal-mail-delivery-offices-1912.068622021-02-09 https://scifaro.com/en/abs/a-column-generation-based-matheuristic-for-periodic-train-timetabling-with-integrated-passenger-routing-1912.069412021-03-02 https://scifaro.com/en/abs/fpt-algorithms-for-generalized-feedback-vertex-set-problems-1912.069662019-12-17 https://scifaro.com/en/abs/bisect-and-conquer-hierarchical-clustering-via-max-uncut-bisection-1912.069832019-12-17 https://scifaro.com/en/abs/matrix-bloom-filter-an-efficient-probabilistic-data-structure-for-2-tuple-batch-lookup-1912.071532019-12-17 https://scifaro.com/en/abs/a-new-frequency-estimation-sketch-for-data-streams-1912.076002020-01-07 https://scifaro.com/en/abs/learning-mixtures-of-linear-regressions-in-subexponential-time-via-fourier-moments-1912.076292019-12-18 https://scifaro.com/en/abs/finding-the-mode-of-a-kernel-density-estimate-1912.076732019-12-18 https://scifaro.com/en/abs/approximating-mis-over-equilateral-b-1-vpg-graphs-1912.079572019-12-18 https://scifaro.com/en/abs/xor-filters-faster-and-smaller-than-bloom-and-cuckoo-filters-1912.082582020-10-12 https://scifaro.com/en/abs/the-planted-matching-problem-phase-transitions-and-exact-results-1912.088802020-11-11 https://scifaro.com/en/abs/slim-graph-practical-lossy-graph-compression-for-approximate-graph-processing-storage-and-analytics-1912.089502021-08-04 https://scifaro.com/en/abs/the-power-of-synergy-in-differential-privacy-combining-a-small-curator-with-local-randomizers-1912.089512019-12-23 https://scifaro.com/en/abs/optimal-tree-decompositions-revisited-a-simpler-linear-time-fpt-algorithm-1912.091442020-03-19 https://scifaro.com/en/abs/energy-minimization-in-dag-scheduling-on-mpsocs-at-run-time-theory-and-practice-1912.091702019-12-20 https://scifaro.com/en/abs/improved-quantum-algorithm-for-the-random-subset-sum-problem-1912.092642020-02-14 https://scifaro.com/en/abs/imposing-edges-in-minimum-spanning-tree-1912.093602019-12-21 https://scifaro.com/en/abs/an-tilde-o-log-2-n-approximation-algorithm-for-2-edge-connected-dominating-set-1912.096622019-12-23 https://scifaro.com/en/abs/circ-tree-a-b-tree-variant-with-circular-design-for-persistent-memory-1912.097832020-02-12 https://scifaro.com/en/abs/string-factorisations-with-maximum-or-minimum-dimension-1912.101402019-12-24 https://scifaro.com/en/abs/approximate-maximum-matching-in-random-streams-1912.104972019-12-24 https://scifaro.com/en/abs/online-throughput-maximization-on-unrelated-machines-commitment-is-no-burden-1912.107692021-12-02 https://scifaro.com/en/abs/finding-optimal-triangulations-parameterized-by-edge-clique-cover-1912.109892022-02-08 https://scifaro.com/en/abs/a-near-linear-time-minimum-steiner-cut-algorithm-for-planar-graphs-1912.111032020-01-01 https://scifaro.com/en/abs/an-algorithm-to-evaluate-the-spectral-expansion-1912.114442021-06-10 https://scifaro.com/en/abs/planar-diameter-via-metric-compression-1912.114912019-12-30 https://scifaro.com/en/abs/parallel-optimization-of-fiber-bundle-segmentation-for-massive-tractography-datasets-1912.114942019-12-30 https://scifaro.com/en/abs/twinless-articulation-points-and-some-related-problems-1912.117992019-12-30 https://scifaro.com/en/abs/space-and-time-efficient-storage-of-lidar-point-clouds-1912.118592019-12-30 https://scifaro.com/en/abs/efficient-processing-of-raster-and-vector-data-1912.118662020-04-07 https://scifaro.com/en/abs/on-the-reproducibility-of-experiments-of-indexing-repetitive-document-collections-1912.119442019-12-30 https://scifaro.com/en/abs/dimensionality-reduction-for-sum-of-distances-metric-1912.120032021-06-25 https://scifaro.com/en/abs/a-water-filling-primal-dual-algorithm-for-approximating-non-linear-covering-problems-1912.121512019-12-30 https://scifaro.com/en/abs/online-rainbow-coloring-in-graphs-1912.124092020-01-01 https://scifaro.com/en/abs/minmax-regret-for-sink-location-on-paths-with-general-capacities-1912.124472020-01-22 https://scifaro.com/en/abs/a-fine-grained-perspective-on-approximating-subset-sum-and-partition-1912.125292020-10-28 https://scifaro.com/en/abs/adaptive-algorithm-for-finding-connected-dominating-sets-in-uncertain-graphs-1912.126652020-01-01 https://scifaro.com/en/abs/deleting-to-structured-trees-1912.127652020-01-01 https://scifaro.com/en/abs/computing-2-twinless-blocks-1912.127902022-05-10 https://scifaro.com/en/abs/exact-exponential-algorithms-for-two-poset-problems-1912.131172020-06-15 https://scifaro.com/en/abs/graph-realizations-maximum-and-minimum-degree-in-vertex-neighborhoods-1912.132862020-01-01 https://scifaro.com/en/abs/efficiently-realizing-interval-sequences-1912.132872020-01-01 https://scifaro.com/en/abs/2-edge-twinless-blocks-1912.133472022-05-10 https://scifaro.com/en/abs/proximity-search-for-maximal-subgraph-enumeration-1912.134462021-08-19 https://scifaro.com/en/abs/new-competitive-analysis-results-of-online-list-scheduling-algorithm-2001.000042020-01-03 https://scifaro.com/en/abs/near-optimal-schedules-for-simultaneous-multicasts-2001.000722021-05-04 https://scifaro.com/en/abs/partitioning-algorithms-for-weighted-trees-and-cactus-graphs-2001.002042022-03-03 https://scifaro.com/en/abs/approximating-text-to-pattern-hamming-distances-2001.002112020-01-03 https://scifaro.com/en/abs/spectral-independence-in-high-dimensional-expanders-and-applications-to-the-hardcore-model-2001.003032020-09-21 https://scifaro.com/en/abs/analysis-and-evaluation-of-non-blocking-interpolation-search-trees-2001.004132020-01-03 https://scifaro.com/en/abs/a-cutting-plane-algorithm-for-the-steiner-team-orienteering-problem-2001.008582020-01-06 https://scifaro.com/en/abs/submodular-matroid-secretary-problem-with-shortlists-2001.008942020-01-06 https://scifaro.com/en/abs/on-the-finite-optimal-convergence-of-logic-based-benders-decomposition-in-solving-0-1-min-max-regret-optimization-problems-with-interval-costs-2001.009432020-01-07 https://scifaro.com/en/abs/discovering-and-certifying-lower-bounds-for-the-online-bin-stretching-problem-2001.011252022-10-17 https://scifaro.com/en/abs/new-lower-bounds-for-massively-parallel-computation-from-query-complexity-2001.011462020-01-07 https://scifaro.com/en/abs/learning-fine-grained-search-space-pruning-and-heuristics-for-combinatorial-optimization-2001.012302020-01-07 https://scifaro.com/en/abs/equivalences-between-non-trivial-variants-of-3ldt-and-conv3ldt-2001.012892025-04-24 https://scifaro.com/en/abs/a-hybrid-approach-to-temporal-pattern-matching-2001.016612020-01-27 https://scifaro.com/en/abs/an-approximation-algorithm-for-fully-planar-edge-disjoint-paths-2001.017152021-12-14 https://scifaro.com/en/abs/complexity-issues-of-string-to-graph-approximate-matching-2001.019612020-01-08 https://scifaro.com/en/abs/computing-the-rearrangement-distance-of-natural-genomes-2001.021392021-08-11 https://scifaro.com/en/abs/easy-capacitated-facility-location-problems-with-connections-to-lot-sizing-2001.027272020-01-10 https://scifaro.com/en/abs/hypergraph-cuts-with-general-splitting-functions-2001.028172020-01-10 https://scifaro.com/en/abs/improved-analysis-of-higher-order-random-walks-and-applications-2001.028272020-02-07 https://scifaro.com/en/abs/achieving-competitiveness-in-online-problems-2001.030152020-01-10 https://scifaro.com/en/abs/maximizing-diversity-over-clustered-data-2001.030502021-04-13 https://scifaro.com/en/abs/parameterized-complexity-of-geodetic-set-2001.030982020-10-01 https://scifaro.com/en/abs/online-minimum-cost-matching-on-the-line-with-recourse-2001.031072020-01-10 https://scifaro.com/en/abs/forming-compatible-teams-in-signed-networks-2001.031282020-10-29 https://scifaro.com/en/abs/age-partitioned-bloom-filters-2001.031472020-01-10 https://scifaro.com/en/abs/improved-kernels-for-tracking-path-problem-2001.031612020-08-24 https://scifaro.com/en/abs/assignment-based-path-choice-estimation-for-metro-systems-using-smart-card-data-2001.031962020-01-17 https://scifaro.com/en/abs/on-polynomial-modular-number-systems-over-mathbb-z-p-mathbb-z-2001.037412024-06-07 https://scifaro.com/en/abs/minimum-2-vertex-twinless-connected-spanning-subgraph-problem-2001.037882020-01-14 https://scifaro.com/en/abs/universal-algorithms-for-parity-games-and-nested-fixpoints-2001.043332022-08-30 https://scifaro.com/en/abs/scattering-and-sparse-partitions-and-their-applications-2001.044472024-03-15 https://scifaro.com/en/abs/fast-generation-of-big-random-binary-trees-2001.045052020-01-15 https://scifaro.com/en/abs/optimal-approximate-sampling-from-discrete-probability-distributions-2001.045552020-03-10 https://scifaro.com/en/abs/simulation-computation-in-grammar-compressed-graphs-2001.047602020-01-15 https://scifaro.com/en/abs/efficient-parameterized-algorithms-for-computing-all-pairs-shortest-paths-2001.049082020-01-15 https://scifaro.com/en/abs/weighted-completion-time-minimization-for-unrelated-machines-via-iterative-fair-contention-resolution-2001.050152020-01-16 https://scifaro.com/en/abs/tight-static-lower-bounds-for-non-adaptive-data-structures-2001.050532024-04-19 https://scifaro.com/en/abs/a-color-avoiding-approach-to-subgraph-counting-in-bounded-expansion-classes-2001.052362020-01-16 https://scifaro.com/en/abs/optimal-skeleton-huffman-trees-revisited-2001.052392020-03-25 https://scifaro.com/en/abs/computationally-easy-spectrally-good-multipliers-for-congruential-pseudorandom-number-generators-2001.053042021-09-28 https://scifaro.com/en/abs/solving-connectivity-problems-parameterized-by-treedepth-in-single-exponential-time-and-polynomial-space-2001.053642021-06-28 https://scifaro.com/en/abs/improvement-of-an-approximated-self-improving-sorter-and-error-analysis-of-its-estimated-entropy-2001.054512021-03-16 https://scifaro.com/en/abs/faster-str-ec-lcs-computation-2001.056712020-01-17 https://scifaro.com/en/abs/generalised-pattern-matching-revisited-2001.059762020-01-20 https://scifaro.com/en/abs/elements-of-scheduling-2001.060052020-01-20 https://scifaro.com/en/abs/a-new-fairness-model-based-on-user-s-objective-for-multi-user-multi-processor-online-scheduling-2001.061592020-01-20 https://scifaro.com/en/abs/grover-s-algorithm-and-many-valued-quantum-logic-2001.063162020-01-20 https://scifaro.com/en/abs/counting-difficult-tree-pairs-with-respect-to-the-rotation-distance-problem-2001.064072020-03-05 https://scifaro.com/en/abs/an-efficient-sampling-algorithm-for-difficult-tree-pairs-2001.064222020-01-20 https://scifaro.com/en/abs/lower-density-selection-schemes-via-small-universal-hitting-sets-with-short-remaining-path-length-2001.065502020-01-22 https://scifaro.com/en/abs/circllhist-a-log-linear-histogram-data-structure-for-it-infrastructure-monitoring-2001.065612020-01-22 https://scifaro.com/en/abs/the-power-of-pivoting-for-exact-clique-counting-2001.067842020-01-22 https://scifaro.com/en/abs/dynamic-weighted-fairness-with-minimal-disruptions-2001.068412020-01-22 https://scifaro.com/en/abs/chaining-with-overlaps-revisited-2001.068642020-04-27 https://scifaro.com/en/abs/a-survey-of-parameterized-algorithms-and-the-complexity-of-edge-modification-2001.068672020-02-19 https://scifaro.com/en/abs/approximation-algorithms-and-lp-relaxations-for-scheduling-problems-related-to-min-sum-set-cover-2001.070112020-01-22 https://scifaro.com/en/abs/a-2-competitive-largest-job-on-least-loaded-machine-online-algorithm-based-on-multi-lists-scheduling-model-2001.070612020-01-22 https://scifaro.com/en/abs/high-quality-hierarchical-process-mapping-2001.071342020-01-23 https://scifaro.com/en/abs/finding-path-motifs-in-large-temporal-graphs-using-algebraic-fingerprints-2001.071582020-07-28 https://scifaro.com/en/abs/a-node-charge-graph-based-online-carshare-rebalancing-policy-with-capacitated-electric-charging-2001.072822021-09-07 https://scifaro.com/en/abs/near-additive-spanners-and-near-exact-hopsets-a-unified-view-2001.074772020-01-22 https://scifaro.com/en/abs/streaming-complexity-of-spanning-tree-computation-2001.076722020-01-22 https://scifaro.com/en/abs/a-note-on-distance-preserving-graph-sparsification-2001.077412021-05-10 https://scifaro.com/en/abs/closed-form-distance-formula-for-the-balanced-multiple-travelling-salesmen-2001.077492020-01-31 https://scifaro.com/en/abs/faster-and-enhanced-inclusion-minimal-cograph-completion-2001.077652020-01-23 https://scifaro.com/en/abs/scheduling-for-weighted-flow-and-completion-times-in-reconfigurable-networks-2001.077842020-01-23 https://scifaro.com/en/abs/a-pseudopolynomial-algorithm-to-minimize-maximum-lateness-on-multiple-related-machines-2001.078872020-01-23 https://scifaro.com/en/abs/a-greedy-algorithm-for-local-heating-2001.084092020-01-24 https://scifaro.com/en/abs/arc-routing-for-winter-road-maintenance-2001.084162020-11-17 https://scifaro.com/en/abs/sorting-permutations-with-fixed-pinnacle-set-2001.084172020-01-29 https://scifaro.com/en/abs/strongly-stable-and-maximum-weakly-stable-noncrossing-matchings-2001.084682020-06-29 https://scifaro.com/en/abs/bibliography-of-distributed-approximation-beyond-bounded-degree-2001.085102023-11-10 https://scifaro.com/en/abs/approximation-algorithms-for-scheduling-a-group-of-heat-pumps-2001.086322020-01-24 https://scifaro.com/en/abs/fixed-parameter-tractable-algorithms-for-tracking-shortest-paths-2001.089772020-08-19 https://scifaro.com/en/abs/improved-mixing-time-for-k-subgraph-sampling-2001.094532020-01-28 https://scifaro.com/en/abs/approximations-for-throughput-maximization-2001.100372020-02-14 https://scifaro.com/en/abs/business-process-full-compliance-with-respect-to-a-set-of-conditional-obligation-in-polynomial-time-2001.101482020-01-29 https://scifaro.com/en/abs/peeling-close-to-the-orientability-threshold-spatial-coupling-in-hashing-based-data-structures-2001.105002020-11-03 https://scifaro.com/en/abs/path-query-data-structures-in-practice-2001.105672020-04-21 https://scifaro.com/en/abs/prophet-inequalities-with-linear-correlations-and-augmentations-2001.106002020-05-26 https://scifaro.com/en/abs/new-algorithms-and-hardness-for-incremental-single-source-shortest-paths-in-directed-graphs-2001.107512020-01-30 https://scifaro.com/en/abs/fully-dynamic-all-pairs-shortest-paths-improved-worst-case-time-and-space-bounds-2001.108012020-02-20 https://scifaro.com/en/abs/deterministic-algorithms-for-decremental-approximate-shortest-paths-faster-and-simpler-2001.108092020-01-30 https://scifaro.com/en/abs/decremental-sssp-in-weighted-digraphs-faster-and-against-an-adaptive-adversary-2001.108212020-01-30 https://scifaro.com/en/abs/algorithms-for-new-types-of-fair-stable-matchings-2001.108752020-04-17 https://scifaro.com/en/abs/optimal-and-perfectly-parallel-algorithms-for-on-demand-data-flow-analysis-2001.110702020-04-16 https://scifaro.com/en/abs/a-new-1-375-approximation-algorithm-for-sorting-by-transpositions-2001.115702021-11-05 https://scifaro.com/en/abs/optimally-selecting-the-top-k-values-from-x-y-with-layer-ordered-heaps-2001.116072020-10-07 https://scifaro.com/en/abs/efficient-differentially-private-f-0-linear-sketching-2001.119322020-09-30 https://scifaro.com/en/abs/ultimate-greedy-approximation-of-independent-sets-in-subcubic-graphs-2001.119972020-02-03 https://scifaro.com/en/abs/stochastic-extensible-bin-packing-2002.000602022-03-07 https://scifaro.com/en/abs/rigorous-guarantees-for-tyler-s-m-estimator-via-quantum-expansion-2002.000712021-09-16 https://scifaro.com/en/abs/solving-the-joint-order-batching-and-picker-routing-problem-for-large-instances-2002.001672020-02-04 https://scifaro.com/en/abs/edge-cuts-optimized-for-average-weight-a-new-alternative-to-ford-and-fulkerson-2002.002632020-02-26 https://scifaro.com/en/abs/faster-fully-dynamic-transitive-closure-in-practice-2002.008132020-02-04 https://scifaro.com/en/abs/removing-connected-obstacles-in-the-plane-is-fpt-2002.012182020-02-05 https://scifaro.com/en/abs/from-tree-matching-to-sparse-graph-alignment-2002.012582020-11-02 https://scifaro.com/en/abs/extracting-dense-and-connected-subgraphs-in-dual-networks-by-network-alignment-2002.012892020-09-04 https://scifaro.com/en/abs/simplifying-activity-on-edge-graphs-2002.016102020-02-06 https://scifaro.com/en/abs/online-primal-dual-meets-online-matching-with-stochastic-rewards-configuration-lp-to-the-rescue-2002.018022020-02-06 https://scifaro.com/en/abs/fair-correlation-clustering-2002.022742020-03-04 https://scifaro.com/en/abs/solving-tall-dense-linear-programs-in-nearly-linear-time-2002.023042021-08-24 https://scifaro.com/en/abs/asymptotically-optimal-competitive-ratio-for-online-allocation-of-reusable-resources-2002.024302024-09-17 https://scifaro.com/en/abs/the-sum-composition-problem-2002.024762020-02-10 https://scifaro.com/en/abs/efficient-algorithms-for-generating-provably-near-optimal-cluster-descriptors-for-explainability-2002.024872020-02-10 https://scifaro.com/en/abs/computational-aspects-of-sturdy-and-flimsy-numbers-2002.027312020-02-10 https://scifaro.com/en/abs/recursive-pgfs-for-bsts-and-dsts-2002.028092020-02-10 https://scifaro.com/en/abs/multilevel-acyclic-hypergraph-partitioning-2002.029622020-10-16 https://scifaro.com/en/abs/list-decodable-subspace-recovery-2002.030042020-02-11 https://scifaro.com/en/abs/the-bloom-tree-2002.030572020-02-20 https://scifaro.com/en/abs/curvature-of-feasible-sets-in-offline-and-online-optimization-2002.032132021-05-12 https://scifaro.com/en/abs/streaming-submodular-maximization-under-a-k-set-system-constraint-2002.033522020-02-11 https://scifaro.com/en/abs/monotone-probability-distributions-over-the-boolean-cube-can-be-learned-with-sublinear-samples-2002.034152020-02-11 https://scifaro.com/en/abs/approximating-text-to-pattern-distance-via-dimensionality-reduction-2002.034592020-05-04 https://scifaro.com/en/abs/fair-correlation-clustering-2002.035082020-02-11 https://scifaro.com/en/abs/approximation-algorithms-for-steiner-tree-based-on-star-contractions-a-unified-view-2002.035832026-01-06 https://scifaro.com/en/abs/edge-colouring-game-on-trees-with-maximum-degree-delta-4-2002.038162020-02-11 https://scifaro.com/en/abs/palindromic-k-factorization-in-pure-linear-time-2002.039652020-07-07 https://scifaro.com/en/abs/2-node-connectivity-network-design-2002.040482022-08-19 https://scifaro.com/en/abs/on-the-unreasonable-effectiveness-of-the-greedy-algorithm-greedy-adapts-to-sharpness-2002.040632020-02-12 https://scifaro.com/en/abs/optimizing-item-and-subgroup-configurations-for-social-aware-vr-shopping-2002.043382020-02-18 https://scifaro.com/en/abs/hamiltonian-cycle-parameterized-by-treedepth-in-single-exponential-time-and-polynomial-space-2002.043682020-07-13 https://scifaro.com/en/abs/an-optimal-algorithm-for-online-multiple-knapsack-2002.045432020-04-29 https://scifaro.com/en/abs/a-polynomial-time-parallel-algorithm-for-graph-isomorphism-using-a-quasipolynomial-number-of-processors-2002.046382020-02-13 https://scifaro.com/en/abs/a-simple-certifying-algorithm-for-3-edge-connectivity-2002.047272022-02-01 https://scifaro.com/en/abs/genomic-problems-involving-copy-number-profiles-complexity-and-algorithms-2002.047782020-02-13 https://scifaro.com/en/abs/positive-semidefinite-programming-mixed-parallel-and-width-independent-2002.048302021-07-13 https://scifaro.com/en/abs/the-0-1-knapsack-problem-with-qualitative-levels-2002.048502020-02-13 https://scifaro.com/en/abs/on-the-i-o-complexity-of-the-k-nearest-neighbor-problem-2002.048702020-04-02 https://scifaro.com/en/abs/uniform-linked-lists-contraction-2002.050342021-01-08 https://scifaro.com/en/abs/the-complexity-of-binary-matrix-completion-under-diameter-constraints-2002.050682022-10-21 https://scifaro.com/en/abs/an-optimal-decentralized-delta-1-coloring-algorithm-2002.051212021-05-04 https://scifaro.com/en/abs/parallel-batch-dynamic-trees-via-change-propagation-2002.051292020-10-27 https://scifaro.com/en/abs/list-decodable-subspace-recovery-dimension-independent-error-in-polynomial-time-2002.051392021-01-08 https://scifaro.com/en/abs/optimal-multiple-stopping-rule-for-warm-starting-sequential-selection-2002.051602020-02-21 https://scifaro.com/en/abs/efficient-distance-approximation-for-structured-high-dimensional-distributions-via-learning-2002.053782020-02-17 https://scifaro.com/en/abs/approximability-of-monotone-submodular-function-maximization-under-cardinality-and-matroid-constraints-in-the-streaming-model-2002.054772020-02-14 https://scifaro.com/en/abs/drawing-graphs-as-spanners-2002.055802020-02-14 https://scifaro.com/en/abs/engineering-faster-sorters-for-small-sets-of-items-2002.055992020-10-05 https://scifaro.com/en/abs/on-two-measures-of-distance-between-fully-labelled-trees-2002.056002020-04-30 https://scifaro.com/en/abs/work-efficient-batch-incremental-minimum-spanning-trees-with-applications-to-the-sliding-window-model-2002.057102020-10-27 https://scifaro.com/en/abs/online-algorithms-for-multi-shop-ski-rental-with-machine-learned-advice-2002.058082020-10-26 https://scifaro.com/en/abs/a-simple-1-1-e-approximation-for-oblivious-bipartite-matching-2002.060372020-02-17 https://scifaro.com/en/abs/on-the-complexity-of-finding-large-odd-induced-subgraphs-and-odd-colorings-2002.060782021-04-30 https://scifaro.com/en/abs/on-extensions-of-maximal-repeats-in-compressed-strings-2002.062652020-02-18 https://scifaro.com/en/abs/sparse-coresets-for-svd-on-infinite-streams-2002.062962020-11-30 https://scifaro.com/en/abs/kruskal-based-approximation-algorithm-for-the-multi-level-steiner-tree-problem-2002.064212020-05-18 https://scifaro.com/en/abs/individual-fairness-for-k-clustering-2002.067422020-09-23 https://scifaro.com/en/abs/computing-covers-under-substring-consistent-equivalence-relations-2002.067642020-07-31 https://scifaro.com/en/abs/parameterized-dawgs-efficient-constructions-and-bidirectional-pattern-searches-2002.067862022-09-19 https://scifaro.com/en/abs/detecting-k-sub-cadences-and-equidistant-subsequence-occurrences-2002.067962020-02-18 https://scifaro.com/en/abs/approximate-distance-oracles-subject-to-multiple-vertex-failures-2002.068122020-12-29 https://scifaro.com/en/abs/approximating-multistage-matching-problems-2002.068872021-05-11 https://scifaro.com/en/abs/a-note-on-arc-disjoint-cycles-in-bipartite-tournaments-2002.069122020-02-18 https://scifaro.com/en/abs/finding-all-global-minimum-cuts-in-practice-2002.069482020-02-18 https://scifaro.com/en/abs/hypergraph-isomorphism-for-groups-with-restricted-composition-factors-2002.069972022-10-26 https://scifaro.com/en/abs/an-experimental-study-of-ilp-formulations-for-the-longest-induced-path-problem-2002.070122020-10-20 https://scifaro.com/en/abs/semi-dynamic-algorithms-for-strongly-chordal-graphs-2002.072072020-02-19 https://scifaro.com/en/abs/spectrum-preserving-short-cycle-removal-on-regular-graphs-2002.072112020-02-19 https://scifaro.com/en/abs/sorting-and-ranking-of-self-delimiting-numbers-with-applications-to-outerplanar-graph-isomorphism-2002.072872024-09-04 https://scifaro.com/en/abs/the-power-of-adaptivity-in-source-identification-with-time-queries-on-the-path-2002.073362021-12-30 https://scifaro.com/en/abs/an-upper-bound-for-sorting-r-n-with-lre-2002.073422020-02-19 https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-parity-problems-2002.074152021-08-05 https://scifaro.com/en/abs/coreset-based-strategies-for-robust-center-type-problems-2002.074632020-02-19 https://scifaro.com/en/abs/connecting-mapreduce-computations-to-realistic-machine-models-2002.075532020-02-19 https://scifaro.com/en/abs/manipulating-districts-to-win-elections-fine-grained-complexity-2002.076072020-02-19 https://scifaro.com/en/abs/building-large-k-cores-from-sparse-graphs-2002.076122020-07-08 https://scifaro.com/en/abs/how-to-solve-fair-k-center-in-massive-data-models-2002.076822020-02-25 https://scifaro.com/en/abs/computing-the-k-densest-subgraphs-of-a-graph-2002.076952021-11-24 https://scifaro.com/en/abs/dynamics-of-cycles-in-polyhedra-i-the-isolation-lemma-2002.076982020-04-21 https://scifaro.com/en/abs/faster-algorithms-for-orienteering-and-k-tsp-2002.077272022-04-22 https://scifaro.com/en/abs/fixed-parameter-tractability-of-the-weighted-edge-clique-partition-problem-2002.077612020-05-21 https://scifaro.com/en/abs/an-efficient-framework-for-balancing-submodularity-and-cost-2002.077822021-09-06 https://scifaro.com/en/abs/k-means-few-more-steps-yield-constant-approximation-2002.077842020-02-19 https://scifaro.com/en/abs/probabilistically-faulty-searching-on-a-half-line-2002.077972020-02-19 https://scifaro.com/en/abs/polynomial-time-algorithms-for-tracking-path-problems-2002.077992020-02-19 https://scifaro.com/en/abs/dynamic-graph-algorithms-with-batch-updates-in-the-massively-parallel-computation-model-2002.078002021-01-12 https://scifaro.com/en/abs/fair-clustering-with-multiple-colors-2002.078922021-03-09 https://scifaro.com/en/abs/simplex-based-steiner-tree-instances-yield-large-integrality-gaps-for-the-bidirected-cut-relaxation-2002.079122020-02-20 https://scifaro.com/en/abs/improved-classical-and-quantum-algorithms-for-the-shortest-vector-problem-via-bounded-distance-decoding-2002.079552025-08-19 https://scifaro.com/en/abs/fast-and-linear-time-string-matching-algorithms-based-on-the-distances-of-q-gram-occurrences-2002.080042020-04-14 https://scifaro.com/en/abs/translating-between-wavelet-tree-and-wavelet-matrix-construction-2002.080612020-02-20 https://scifaro.com/en/abs/span-recovery-for-deep-neural-networks-with-applications-to-input-obfuscation-2002.082022020-02-20 https://scifaro.com/en/abs/efficient-construction-of-behavior-graphs-for-uncertain-event-data-2002.082252022-04-11 https://scifaro.com/en/abs/subexponential-parameterized-algorithms-and-kernelization-on-almost-chordal-graphs-2002.082262020-06-23 https://scifaro.com/en/abs/massively-parallel-algorithms-for-small-subgraph-counting-2002.082992022-07-19 https://scifaro.com/en/abs/u-bubble-model-for-mixed-unit-interval-graphs-and-its-applications-the-maxcut-problem-revisited-2002.083112026-02-19 https://scifaro.com/en/abs/online-policies-for-efficient-volunteer-crowdsourcing-2002.084742021-08-02 https://scifaro.com/en/abs/fast-multi-subset-transform-and-weighted-sums-over-acyclic-digraphs-2002.084752020-09-02 https://scifaro.com/en/abs/space-efficient-deterministic-approximation-of-string-measures-2002.084982020-07-28 https://scifaro.com/en/abs/maximum-edge-colorable-subgraph-and-strong-triadic-closure-parameterized-by-distance-to-low-degree-graphs-2002.086592020-02-21 https://scifaro.com/en/abs/quasipolynomial-multicut-mimicking-networks-and-kernelization-of-multiway-cut-problems-2002.088252021-03-09 https://scifaro.com/en/abs/a-general-kernelization-technique-for-domination-and-independence-problems-in-sparse-classes-2002.090282021-10-07 https://scifaro.com/en/abs/compressed-data-structures-for-binary-relations-in-practice-2002.090412020-02-24 https://scifaro.com/en/abs/a-polynomial-lower-bound-on-adaptive-complexity-of-submodular-maximization-2002.091302020-04-22 https://scifaro.com/en/abs/a-symmetric-alternating-minimization-algorithm-for-total-variation-minimization-2002.091802020-06-08 https://scifaro.com/en/abs/practical-estimation-of-renyi-entropy-2002.092642020-02-24 https://scifaro.com/en/abs/minimizing-localized-ratio-cut-objectives-in-hypergraphs-2002.094412020-07-02 https://scifaro.com/en/abs/parameterized-correlation-clustering-in-hypergraphs-and-bipartite-graphs-2002.094602020-06-22 https://scifaro.com/en/abs/privately-learning-markov-random-fields-2002.094632020-08-17 https://scifaro.com/en/abs/private-mean-estimation-of-heavy-tailed-distributions-2002.094642021-02-17 https://scifaro.com/en/abs/locally-private-hypothesis-selection-2002.094652020-06-23 https://scifaro.com/en/abs/chronofold-a-data-structure-for-versioned-text-2002.095112020-04-27 https://scifaro.com/en/abs/compression-with-wildcards-all-spanning-trees-with-prescribed-vertex-degrees-2002.097072022-02-15 https://scifaro.com/en/abs/checking-phylogenetic-decisiveness-in-theory-and-in-practice-2002.097222020-02-25 https://scifaro.com/en/abs/testing-the-agreement-of-trees-with-internal-labels-2002.097252020-02-25 https://scifaro.com/en/abs/online-stochastic-max-weight-matching-prophet-inequality-for-vertex-and-edge-arrival-models-2002.098072020-02-27 https://scifaro.com/en/abs/sketching-transformed-matrices-with-applications-to-natural-language-processing-2002.098122020-02-25 https://scifaro.com/en/abs/mixed-integer-programming-for-searching-maximum-quasi-bicliques-2002.098802020-02-25 https://scifaro.com/en/abs/speeding-up-the-aifv-2-dynamic-programs-by-two-orders-of-magnitude-using-range-minimum-queries-2002.098852020-02-25 https://scifaro.com/en/abs/structural-parameterizations-with-modulator-oblivion-2002.099722020-02-25 https://scifaro.com/en/abs/computing-bi-lipschitz-outlier-embeddings-into-the-line-2002.100392020-02-25 https://scifaro.com/en/abs/parallel-clique-counting-and-peeling-algorithms-2002.100472021-07-19 https://scifaro.com/en/abs/explicit-and-implicit-dynamic-coloring-of-graphs-with-bounded-arboricity-2002.101422020-02-25 https://scifaro.com/en/abs/upper-tail-analysis-of-bucket-sort-and-random-tries-2002.104992020-02-26 https://scifaro.com/en/abs/the-power-of-recourse-better-algorithms-for-facility-location-in-online-and-dynamic-models-2002.106582020-02-26 https://scifaro.com/en/abs/efficient-and-simple-algorithms-for-fault-tolerant-spanners-2002.108892020-05-26 https://scifaro.com/en/abs/integer-plane-multiflow-maximisation-flow-cut-gap-and-one-quarter-approximation-2002.109272020-03-19 https://scifaro.com/en/abs/improved-lower-bound-for-competitive-graph-exploration-2002.109582020-02-26 https://scifaro.com/en/abs/stochastic-makespan-minimization-in-structured-set-systems-2002.111532021-06-25 https://scifaro.com/en/abs/2-dimensional-palindromes-with-k-mismatches-2002.111572020-02-27 https://scifaro.com/en/abs/dynamic-set-cover-improved-amortized-and-worst-case-update-time-2002.111712020-04-20 https://scifaro.com/en/abs/spectral-sparsification-via-bounded-independence-sampling-2002.112372020-04-21 https://scifaro.com/en/abs/computational-aspects-of-geometric-algebra-products-of-two-homogeneous-multivectors-2002.113132020-02-27 https://scifaro.com/en/abs/asymmetric-streaming-algorithms-for-edit-distance-and-lcs-2002.113422020-04-17 https://scifaro.com/en/abs/space-efficient-representations-of-finite-groups-2002.113912020-02-27 https://scifaro.com/en/abs/on-learning-a-hidden-directed-graph-with-path-queries-2002.115412021-03-17 https://scifaro.com/en/abs/query-efficient-correlation-clustering-2002.115572020-02-27 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-almost-optimal-vertex-fault-tolerant-spanners-2002.116172020-03-09 https://scifaro.com/en/abs/data-structures-algorithms-for-exact-inference-in-hierarchical-clustering-2002.116612020-10-23 https://scifaro.com/en/abs/limitations-of-greed-influence-maximization-in-undirected-networks-re-visited-2002.116792022-06-15 https://scifaro.com/en/abs/bitvectors-with-runs-and-the-successor-predecessor-problem-2002.116912020-02-27 https://scifaro.com/en/abs/polynomial-algorithms-for-p-dispersion-problems-in-a-planar-pareto-front-2002.118302023-07-04 https://scifaro.com/en/abs/stochastic-matching-with-few-queries-1-varepsilon-approximation-2002.118802020-02-28 https://scifaro.com/en/abs/the-complexity-of-contracts-2002.120342020-02-28 https://scifaro.com/en/abs/semantrix-a-compressed-semantic-matrix-2002.120502020-03-02 https://scifaro.com/en/abs/random-order-models-2002.121592020-02-28 https://scifaro.com/en/abs/fast-indexes-for-gapped-pattern-matching-2002.126622020-03-02 https://scifaro.com/en/abs/edge-disjoint-branchings-in-temporal-graphs-2002.126942020-03-02 https://scifaro.com/en/abs/a-probably-optimal-algorithm-for-bisection-on-bounded-treewidth-graphs-2002.127062020-09-17 https://scifaro.com/en/abs/improved-algorithm-for-min-cuts-in-distributed-networks-2003.000942020-03-03 https://scifaro.com/en/abs/communication-optimal-tilings-for-projective-nested-loops-with-arbitrary-bounds-2003.001192020-03-03 https://scifaro.com/en/abs/distributed-testing-of-graph-isomorphism-in-the-congest-model-2003.004682020-03-03 https://scifaro.com/en/abs/an-algorithm-for-consensus-trees-2003.004882020-03-09 https://scifaro.com/en/abs/connected-components-on-a-pram-in-log-diameter-time-2003.006142021-04-22 https://scifaro.com/en/abs/recent-advances-in-scalable-network-generation-2003.007362020-03-03 https://scifaro.com/en/abs/a-general-framework-for-symmetric-property-estimation-2003.008442020-03-03 https://scifaro.com/en/abs/eth-tight-algorithms-for-long-path-and-cycle-on-unit-disk-graphs-2003.009382020-03-03 https://scifaro.com/en/abs/efficient-algorithms-for-the-potts-model-on-small-set-expanders-2003.011542024-02-06 https://scifaro.com/en/abs/massively-parallel-algorithms-for-distance-approximation-and-spanners-2003.012542021-06-30 https://scifaro.com/en/abs/scalable-distributed-approximation-of-internal-measures-for-clustering-evaluation-2003.014302021-01-21 https://scifaro.com/en/abs/optimal-contextual-pricing-and-extensions-2003.017032021-02-25 https://scifaro.com/en/abs/notes-on-randomized-algorithms-2003.019022025-12-22 https://scifaro.com/en/abs/the-interval-greedy-algorithm-for-discrete-optimization-problems-with-interval-objective-function-2003.019372020-09-29 https://scifaro.com/en/abs/time-space-tradeoffs-for-finding-a-long-common-substring-2003.020162020-04-29 https://scifaro.com/en/abs/online-metric-algorithms-with-untrusted-predictions-2003.021442023-04-07 https://scifaro.com/en/abs/the-online-min-sum-set-cover-problem-2003.021612022-06-30 https://scifaro.com/en/abs/pivot-selection-for-median-string-problem-2003.021692020-03-05 https://scifaro.com/en/abs/scheduling-kernels-via-configuration-lp-2003.021872020-03-05 https://scifaro.com/en/abs/a-data-relocation-approach-for-terrain-surface-analysis-on-multi-gpu-systems-a-case-study-on-the-total-viewshed-problem-2003.022002021-01-25 https://scifaro.com/en/abs/an-inverse-olympic-medal-tally-transformation-for-optimal-lane-level-road-network-path-traversal-2003.023022020-03-06 https://scifaro.com/en/abs/approximating-optimal-bidirectional-macro-schemes-2003.023362020-03-06 https://scifaro.com/en/abs/fast-noise-removal-for-k-means-clustering-2003.024332020-04-14 https://scifaro.com/en/abs/optimal-discretization-is-fixed-parameter-tractable-2003.024752026-03-16 https://scifaro.com/en/abs/parameterized-algorithms-for-generalizations-of-directed-feedback-vertex-set-2003.024832020-03-06 https://scifaro.com/en/abs/simple-and-fast-algorithm-for-binary-integer-and-online-linear-programming-2003.025132020-07-07 https://scifaro.com/en/abs/simple-and-sharp-analysis-of-k-means-2003.025182020-07-03 https://scifaro.com/en/abs/linear-time-parameterized-algorithms-with-limited-local-resources-2003.028662020-03-09 https://scifaro.com/en/abs/lsf-join-locality-sensitive-filtering-for-distributed-all-pairs-set-similarity-under-skew-2003.029722020-03-09 https://scifaro.com/en/abs/exponentially-faster-shortest-paths-in-the-congested-clique-2003.030582020-03-09 https://scifaro.com/en/abs/generating-a-gray-code-for-prefix-normal-words-in-amortized-polylogarithmic-time-per-word-2003.032222024-04-16 https://scifaro.com/en/abs/multiset-synchronization-with-counting-cuckoo-filters-2003.038012020-03-10 https://scifaro.com/en/abs/adaptive-fibonacci-and-pairing-heaps-2003.039592020-03-10 https://scifaro.com/en/abs/smoothed-analysis-of-trie-height-by-star-like-pfas-2003.041012020-03-10 https://scifaro.com/en/abs/b-coloring-parameterized-by-clique-width-2003.042542022-07-20 https://scifaro.com/en/abs/adjacency-labelling-for-planar-graphs-and-beyond-2003.042802021-12-03 https://scifaro.com/en/abs/optimal-size-problem-kernels-for-d-hitting-set-in-linear-time-and-space-2003.045782021-01-14 https://scifaro.com/en/abs/maximizing-happiness-in-graphs-of-bounded-clique-width-2003.046052020-03-11 https://scifaro.com/en/abs/circulation-control-for-faster-minimum-cost-flow-in-unit-capacity-graphs-2003.048632020-04-10 https://scifaro.com/en/abs/online-graph-matching-problems-with-a-worst-case-reassignment-budget-2003.051752020-03-12 https://scifaro.com/en/abs/induced-subgraphs-of-bounded-treewidth-and-the-container-method-2003.051852020-03-12 https://scifaro.com/en/abs/scheduling-jl-collaborative-and-reproducible-scheduling-research-with-julia-2003.052172020-03-12 https://scifaro.com/en/abs/hitting-long-directed-cycles-is-fixed-parameter-tractable-2003.052672020-03-12 https://scifaro.com/en/abs/balanced-independent-and-dominating-sets-on-colored-interval-graphs-2003.052892022-03-29 https://scifaro.com/en/abs/on-hop-constrained-steiner-trees-in-tree-like-metrics-2003.056992022-10-12 https://scifaro.com/en/abs/joint-alignment-from-pairwise-differences-with-a-noisy-oracle-2003.060762020-12-08 https://scifaro.com/en/abs/approximation-schemes-for-subset-sum-ratio-problems-2003.066222020-03-17 https://scifaro.com/en/abs/graph-profiling-for-vertex-cover-targeted-reductions-in-a-branch-and-reduce-solver-2003.066392020-03-17 https://scifaro.com/en/abs/shorter-labels-for-routing-in-trees-2003.066912020-03-17 https://scifaro.com/en/abs/universal-function-approximation-on-graphs-2003.067062020-10-27 https://scifaro.com/en/abs/four-dimensional-dominance-range-reporting-in-linear-space-2003.067422020-03-17 https://scifaro.com/en/abs/adversarial-perturbations-of-opinion-dynamics-in-networks-2003.070102020-07-14 https://scifaro.com/en/abs/faster-minimization-of-tardy-processing-time-on-a-single-machine-2003.071042020-04-22 https://scifaro.com/en/abs/scheduling-lower-bounds-via-and-subset-sum-2003.071132020-04-28 https://scifaro.com/en/abs/approximating-lcs-in-linear-time-beating-the-sqrt-n-barrier-2003.072852020-03-17 https://scifaro.com/en/abs/a-scaling-algorithm-for-weighted-f-factors-in-general-graphs-2003.075892020-03-18 https://scifaro.com/en/abs/np-completeness-results-for-graph-burning-on-geometric-graphs-2003.077462021-02-02 https://scifaro.com/en/abs/a-spectral-approach-to-network-design-2003.078102020-03-19 https://scifaro.com/en/abs/speeding-up-linear-programming-using-randomized-linear-algebra-2003.080722020-03-19 https://scifaro.com/en/abs/grammar-compression-with-probabilistic-context-free-grammar-2003.080972020-03-19 https://scifaro.com/en/abs/an-efficient-implementation-of-manacher-s-algorithm-2003.082112020-03-20 https://scifaro.com/en/abs/the-strahler-number-of-a-parity-game-2003.086272020-08-04 https://scifaro.com/en/abs/faster-divergence-maximization-for-faster-maximum-flow-2003.089292020-04-16 https://scifaro.com/en/abs/dynamic-averaging-load-balancing-on-cycles-2003.092972020-03-23 https://scifaro.com/en/abs/efficiency-guarantees-for-parallel-incremental-algorithms-under-relaxed-schedulers-2003.093632020-03-24 https://scifaro.com/en/abs/fast-and-memory-optimal-dimension-reduction-using-kac-s-walk-2003.100692020-07-15 https://scifaro.com/en/abs/on-the-complexity-of-broadcast-domination-and-multipacking-in-digraphs-2003.105702022-01-25 https://scifaro.com/en/abs/approximate-aggregate-queries-under-additive-inequalities-2003.105882020-05-04 https://scifaro.com/en/abs/a-distributed-algorithm-for-spectral-sparsification-of-graphs-with-applications-to-data-clustering-2003.106122021-04-13 https://scifaro.com/en/abs/parameterized-algorithms-for-red-blue-weighted-vertex-cover-on-trees-2003.106982020-03-25 https://scifaro.com/en/abs/efficient-algorithms-for-multidimensional-segmented-regression-2003.110862020-03-26 https://scifaro.com/en/abs/polynomial-kernels-for-paw-free-edge-modification-problems-2003.112732020-03-26 https://scifaro.com/en/abs/simple-deterministic-approximation-for-submodular-multiple-knapsack-problem-2003.114502023-07-20 https://scifaro.com/en/abs/the-exact-query-complexity-of-yes-no-permutation-mastermind-2003.115382020-03-27 https://scifaro.com/en/abs/further-results-on-colored-range-searching-2003.116042020-03-27 https://scifaro.com/en/abs/on-structural-parameterizations-of-node-kayles-2003.117752021-07-15 https://scifaro.com/en/abs/succinct-dynamic-ordered-sets-with-random-access-2003.118352020-03-27 https://scifaro.com/en/abs/a-blind-permutation-similarity-algorithm-2003.119982020-03-27 https://scifaro.com/en/abs/advanced-flow-based-multilevel-hypergraph-partitioning-2003.121102020-03-30 https://scifaro.com/en/abs/miniature-robot-path-planning-for-bridge-inspection-min-max-cycle-cover-based-approach-2003.121342020-03-30 https://scifaro.com/en/abs/large-independent-sets-on-random-d-regular-graphs-with-fixed-degree-d-2003.122932021-08-18 https://scifaro.com/en/abs/an-enhanced-pinwheel-algorithm-for-the-bamboo-garden-trimming-problem-2003.124602020-06-04 https://scifaro.com/en/abs/intermittent-inverse-square-l-evy-walks-are-optimal-for-finding-targets-of-all-sizes-2003.130412021-07-23 https://scifaro.com/en/abs/how-the-degeneracy-helps-for-triangle-counting-in-graph-streams-2003.131512020-03-31 https://scifaro.com/en/abs/how-to-find-a-point-in-the-convex-hull-privately-2003.131922020-03-31 https://scifaro.com/en/abs/the-one-way-communication-complexity-of-submodular-maximization-with-applications-to-streaming-and-robustness-2003.134592020-03-31 https://scifaro.com/en/abs/parallel-batch-dynamic-k-clique-counting-2003.135852020-12-15 https://scifaro.com/en/abs/a-faster-subquadratic-algorithm-for-the-longest-common-increasing-subsequence-problem-2003.135892020-03-31 https://scifaro.com/en/abs/generating-weakly-chordal-graphs-from-arbitrary-graphs-2003.137862020-04-01 https://scifaro.com/en/abs/a-framework-for-adversarially-robust-streaming-algorithms-2003.142652022-07-04 https://scifaro.com/en/abs/engineering-exact-quasi-threshold-editing-2003.143172020-04-01 https://scifaro.com/en/abs/the-discrete-gaussian-for-differential-privacy-2004.000102024-11-19 https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-compute-the-connected-tree-width-of-a-series-parallel-graph-2004.005472021-01-28 https://scifaro.com/en/abs/parameterized-analysis-of-assignment-under-multiple-preferences-2004.006552021-05-24 https://scifaro.com/en/abs/grammar-compressed-indexes-with-logarithmic-search-time-2004.010322020-04-03 https://scifaro.com/en/abs/on-locating-paths-in-compressed-tries-2004.011202020-12-18 https://scifaro.com/en/abs/no-repetition-fast-streaming-with-highly-concentrated-hashing-2004.011562020-04-03 https://scifaro.com/en/abs/towards-ptas-for-precedence-constrained-scheduling-via-combinatorial-algorithms-2004.012312020-04-28 https://scifaro.com/en/abs/from-generic-partition-refinement-to-weighted-tree-automata-minimization-2004.012502020-11-26 https://scifaro.com/en/abs/r-enum-enumeration-of-characteristic-substrings-in-bwt-runs-bounded-space-2004.014932021-03-03 https://scifaro.com/en/abs/relative-error-streaming-quantiles-2004.016682023-08-25 https://scifaro.com/en/abs/correction-to-a-practical-provably-linear-time-in-place-and-stable-merge-algorithm-via-the-perfect-shuffle-2004.020352020-04-07 https://scifaro.com/en/abs/maximum-parsimony-distance-on-phylogenetictrees-a-linear-kernel-and-constant-factor-approximation-algorithm-2004.022982020-04-07 https://scifaro.com/en/abs/the-n-dimensional-k-vector-and-its-application-to-orthogonal-range-searching-2004.023352020-04-07 https://scifaro.com/en/abs/random-sampling-using-k-vector-2004.023392020-04-07 https://scifaro.com/en/abs/nonlinear-function-inversion-using-k-vector-2004.023422020-04-07 https://scifaro.com/en/abs/the-bethe-and-sinkhorn-permanents-of-low-rank-matrices-and-implications-for-profile-maximum-likelihood-2004.024252020-04-07 https://scifaro.com/en/abs/a-historical-note-on-the-3-2-approximation-algorithm-for-the-metric-traveling-salesman-problem-2004.024372020-11-19 https://scifaro.com/en/abs/variable-shift-sdd-a-more-succinct-sentential-decision-diagram-2004.025022020-04-07 https://scifaro.com/en/abs/a-fast-algorithm-for-the-product-structure-of-planar-graphs-2004.025302020-12-15 https://scifaro.com/en/abs/indexing-highly-repetitive-string-collections-2004.027812022-11-28 https://scifaro.com/en/abs/sopang-2-online-searching-over-a-pan-genome-without-false-positives-2004.030332020-04-16 https://scifaro.com/en/abs/approximating-min-mean-cycle-for-low-diameter-graphs-in-near-optimal-time-and-memory-2004.031142023-10-03 https://scifaro.com/en/abs/zipping-segment-trees-2004.032062020-07-03 https://scifaro.com/en/abs/exact-single-source-simrank-computation-on-large-graphs-2004.034932020-06-19 https://scifaro.com/en/abs/graph-matching-with-partially-correct-seeds-2004.038162021-01-06 https://scifaro.com/en/abs/an-improved-cutting-plane-method-for-convex-optimization-convex-concave-games-and-its-applications-2004.042502020-04-10 https://scifaro.com/en/abs/revisiting-2-3-red-black-trees-with-a-pedagogically-sound-yet-efficient-deletion-algorithm-the-parity-seeking-delete-algorithm-2004.043442022-06-22 https://scifaro.com/en/abs/near-optimal-decremental-sssp-in-dense-weighted-digraphs-2004.044962020-09-08 https://scifaro.com/en/abs/storing-set-families-more-compactly-with-top-zdds-2004.045862020-04-10 https://scifaro.com/en/abs/exploration-with-limited-memory-streaming-algorithms-for-coin-tossing-noisy-comparisons-and-multi-armed-bandits-2004.046662022-12-29 https://scifaro.com/en/abs/composable-sketches-for-functions-of-frequencies-beyond-the-worst-case-2004.047722021-11-04 https://scifaro.com/en/abs/pattern-discovery-in-colored-strings-2004.048582024-04-16 https://scifaro.com/en/abs/bounding-the-mim-width-of-hereditary-graph-classes-2004.050182021-08-27 https://scifaro.com/en/abs/colouring-sp-1-p-5-free-graphs-a-mim-width-perspective-2004.050222020-04-27 https://scifaro.com/en/abs/grammar-compressed-self-index-with-lyndon-words-2004.053092020-04-28 https://scifaro.com/en/abs/construction-and-random-generation-of-hypergraphs-with-prescribed-degree-and-dimension-sequences-2004.054292020-04-14 https://scifaro.com/en/abs/multiparty-selection-2004.055482020-04-22 https://scifaro.com/en/abs/linear-time-algorithms-for-eliminating-claws-in-graphs-2004.056722023-10-06 https://scifaro.com/en/abs/a-fast-algorithm-for-source-wise-round-trip-spanners-2004.057212023-02-21 https://scifaro.com/en/abs/lower-bound-for-succinct-range-minimum-query-2004.057382021-11-05 https://scifaro.com/en/abs/learning-mixtures-of-spherical-gaussians-via-fourier-analysis-2004.058132025-09-10 https://scifaro.com/en/abs/optimizing-reachability-sets-in-temporal-graphs-by-delaying-2004.058752020-11-13 https://scifaro.com/en/abs/first-stretch-then-shrink-and-bulk-a-two-phase-approach-for-enumeration-of-maximal-delta-gamma-mbox-cliques-of-a-temporal-network-2004.059352020-04-14 https://scifaro.com/en/abs/a-general-framework-for-approximating-min-sum-ordering-problems-2004.059542021-06-28 https://scifaro.com/en/abs/non-clairvoyant-scheduling-of-coflows-2004.059612020-04-14 https://scifaro.com/en/abs/adversarially-robust-streaming-algorithms-via-differential-privacy-2004.059752020-04-14 https://scifaro.com/en/abs/exact-and-approximate-algorithms-for-computing-a-second-hamiltonian-cycle-2004.060362020-08-11 https://scifaro.com/en/abs/continuous-credit-networks-and-layer-2-blockchains-monotonicity-and-sampling-2004.061672020-06-30 https://scifaro.com/en/abs/squares-a-fast-counter-based-rng-2004.062782022-03-15 https://scifaro.com/en/abs/enumerating-chemical-graphs-with-mono-block-2-augmented-tree-structure-from-given-upper-and-lower-bounds-on-path-frequencies-2004.063672020-04-15 https://scifaro.com/en/abs/broadcast-congest-algorithms-against-adversarial-edges-2004.064362022-03-29 https://scifaro.com/en/abs/online-graph-exploration-on-trees-unicyclic-graphs-and-cactus-graphs-2004.066902023-10-30 https://scifaro.com/en/abs/improved-algorithms-for-population-recovery-from-the-deletion-channel-2004.068282020-11-05 https://scifaro.com/en/abs/an-algorithmic-framework-for-colouring-locally-sparse-graphs-2004.071512020-04-16 https://scifaro.com/en/abs/slightly-improved-upper-bound-on-the-integrality-ratio-for-the-s-t-path-tsp-2004.072172020-07-27 https://scifaro.com/en/abs/log-concave-polynomials-iv-approximate-exchange-tight-mixing-times-and-near-optimal-sampling-of-forests-2004.072202021-04-13 https://scifaro.com/en/abs/locality-sensitive-hashing-for-set-queries-motivated-by-group-recommendations-2004.072862020-04-23 https://scifaro.com/en/abs/online-multiserver-convex-chasing-and-optimization-2004.073462020-04-17 https://scifaro.com/en/abs/on-the-computability-of-continuous-maximum-entropy-distributions-with-applications-2004.074032020-04-17 https://scifaro.com/en/abs/faster-dynamic-matrix-inverse-for-faster-lps-2004.074702020-04-17 https://scifaro.com/en/abs/steiner-trees-for-hereditary-graph-classes-a-treewidth-perspective-2004.074922020-12-17 https://scifaro.com/en/abs/approximating-independent-set-and-dominating-set-on-vpg-graphs-2004.075662020-04-17 https://scifaro.com/en/abs/centralized-parallel-and-distributed-multi-source-shortest-paths-via-hopsets-and-rectangular-matrix-multiplication-2004.075722021-02-15 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-solving-the-closest-vector-problem-in-zonotopal-lattices-2004.075742021-10-12 https://scifaro.com/en/abs/four-pages-are-indeed-necessary-for-planar-graphs-2004.076302020-04-17 https://scifaro.com/en/abs/fully-dynamic-s-t-edge-connectivity-in-subpolynomial-time-2004.076502022-02-10 https://scifaro.com/en/abs/algorithmic-foundations-for-the-diffraction-limit-2004.076592020-12-16 https://scifaro.com/en/abs/isomorphism-testing-for-graphs-excluding-small-minors-2004.076712023-05-30 https://scifaro.com/en/abs/coresets-for-clustering-in-excluded-minor-graphs-and-beyond-2004.077182020-07-16 https://scifaro.com/en/abs/maximizing-determinants-under-matroid-constraints-2004.078862020-04-20 https://scifaro.com/en/abs/beyond-tree-embeddings-a-deterministic-framework-for-network-design-with-deadlines-or-delay-2004.079462020-04-20 https://scifaro.com/en/abs/average-case-column-subset-selection-for-entrywise-ell-1-norm-loss-2004.079862020-04-20 https://scifaro.com/en/abs/contention-resolution-without-collision-detection-2004.080392020-05-05 https://scifaro.com/en/abs/novel-binary-addition-tree-algorithm-bat-for-binary-state-network-reliability-problem-2004.082382020-04-20 https://scifaro.com/en/abs/a-survey-of-approximate-quantile-computation-on-large-scale-data-technical-report-2004.082552020-06-29 https://scifaro.com/en/abs/hitting-forbidden-induced-subgraphs-on-bounded-treewidth-graphs-2004.083242022-09-09 https://scifaro.com/en/abs/the-two-player-shortest-path-network-interdiction-problem-2004.083382020-08-25 https://scifaro.com/en/abs/faster-approximate-pattern-matching-a-unified-approach-2004.083502020-11-17 https://scifaro.com/en/abs/low-stretch-spanning-trees-of-graphs-with-bounded-width-2004.083752020-04-20 https://scifaro.com/en/abs/enumerating-chemical-graphs-with-two-disjoint-cycles-satisfying-given-path-frequency-specifications-2004.083812020-04-21 https://scifaro.com/en/abs/fully-dynamic-graph-sparsifiers-against-an-adaptive-adversary-2004.084322020-11-11 https://scifaro.com/en/abs/projection-cost-preserving-sketches-proof-strategies-and-constructions-2004.084342020-04-21 https://scifaro.com/en/abs/uddsketch-accurate-tracking-of-quantiles-in-data-streams-2004.086042020-04-21 https://scifaro.com/en/abs/an-accelerated-newton-dinkelbach-method-and-its-application-to-two-variables-per-inequality-systems-2004.086342021-05-24 https://scifaro.com/en/abs/stochastic-weighted-matching-1-epsilon-approximation-2004.087032020-04-21 https://scifaro.com/en/abs/faster-dynamic-range-mode-2004.087772020-04-21 https://scifaro.com/en/abs/preprocessing-vertex-deletion-problems-characterizing-graph-properties-by-low-rank-adjacencies-2004.088182020-04-21 https://scifaro.com/en/abs/faster-algorithms-for-quantitative-analysis-of-markov-chains-and-markov-decision-processes-with-small-treewidth-2004.088282020-04-21 https://scifaro.com/en/abs/black-white-array-a-new-data-structure-for-dynamic-data-sets-2004.090512020-04-21 https://scifaro.com/en/abs/isotropy-and-log-concave-polynomials-accelerated-sampling-and-high-precision-counting-of-matroid-bases-2004.090792020-04-21 https://scifaro.com/en/abs/rapid-mixing-of-glauber-dynamics-up-to-uniqueness-via-contraction-2004.090832021-07-20 https://scifaro.com/en/abs/dynamic-matching-algorithms-in-practice-2004.090992020-04-21 https://scifaro.com/en/abs/distributed-weighted-min-cut-in-nearly-optimal-time-2004.091292020-11-17 https://scifaro.com/en/abs/efficient-route-planning-with-temporary-driving-bans-road-closures-and-rated-parking-areas-2004.091632020-04-21 https://scifaro.com/en/abs/finding-large-h-colorable-subgraphs-in-hereditary-graph-classes-2004.094252020-04-22 https://scifaro.com/en/abs/collaborative-top-distribution-identifications-with-limited-interaction-2004.094542020-09-10 https://scifaro.com/en/abs/scheduling-with-communication-delays-via-lp-hierarchies-and-clustering-2004.096822020-04-22 https://scifaro.com/en/abs/enumerating-maximal-induced-subgraphs-2004.098852020-04-22 https://scifaro.com/en/abs/variable-decomposition-for-prophet-inequalities-and-optimal-ordering-2004.101632020-11-10 https://scifaro.com/en/abs/dynamic-maintenance-of-low-stretch-probabilistic-tree-embeddings-with-applications-2004.103192020-04-24 https://scifaro.com/en/abs/faster-and-more-accurate-measurement-through-additive-error-counters-2004.103322020-04-23 https://scifaro.com/en/abs/optimal-online-algorithms-for-one-way-trading-and-online-knapsack-problems-a-unified-competitive-analysis-2004.103582020-09-23 https://scifaro.com/en/abs/circuit-design-for-clique-problem-and-its-implementation-on-quantum-computer-2004.105962022-02-23 https://scifaro.com/en/abs/scheduling-precedence-constrained-jobs-on-related-machines-with-communication-delay-2004.107762020-04-24 https://scifaro.com/en/abs/hardness-of-identity-testing-for-restricted-boltzmann-machines-and-potts-models-2004.108052020-04-24 https://scifaro.com/en/abs/non-adaptive-adaptive-sampling-on-turnstile-streams-2004.109692020-04-24 https://scifaro.com/en/abs/on-the-computation-of-the-m-o-bius-transform-2004.111462020-04-24 https://scifaro.com/en/abs/dynamic-programming-approach-to-the-generalized-minimum-manhattan-network-problem-2004.111662020-04-28 https://scifaro.com/en/abs/engineering-data-reduction-for-nested-dissection-2004.113152024-04-25 https://scifaro.com/en/abs/conditionally-optimal-approximation-algorithms-for-the-girth-of-a-directed-graph-2004.114452020-04-28 https://scifaro.com/en/abs/efficient-algorithms-for-approximating-quantum-partition-functions-2004.115682021-02-02 https://scifaro.com/en/abs/computation-of-hadwiger-number-and-related-contraction-problems-tight-lower-bounds-2004.116212020-04-27 https://scifaro.com/en/abs/faster-parallel-multiterminal-cuts-2004.116662020-04-27 https://scifaro.com/en/abs/a-12-7-approximation-algorithm-for-the-discrete-bamboo-garden-trimming-problem-2004.117312020-04-27 https://scifaro.com/en/abs/incompressibility-of-h-free-edge-modification-problems-towards-a-dichotomy-2004.117612021-09-14 https://scifaro.com/en/abs/near-optimal-sparsity-constrained-group-testing-improved-bounds-and-algorithms-2004.118602021-12-24 https://scifaro.com/en/abs/a-linear-fixed-parameter-tractable-algorithm-for-connected-pathwidth-2004.119372022-09-13 https://scifaro.com/en/abs/a-general-framework-for-enumerating-equivalence-classes-of-solutions-2004.121432023-05-16 https://scifaro.com/en/abs/an-algorithmic-weakening-of-the-erd-h-o-s-hajnal-conjecture-2004.121662020-04-28 https://scifaro.com/en/abs/extending-partial-1-planar-drawings-2004.122222020-04-28 https://scifaro.com/en/abs/online-mincut-competitive-and-regret-analysis-2004.122232020-08-17 https://scifaro.com/en/abs/an-almost-optimal-approximation-algorithm-for-monotone-submodular-multiple-knapsack-2004.122242021-04-19 https://scifaro.com/en/abs/how-to-hide-a-clique-2004.122582020-04-29 https://scifaro.com/en/abs/succinct-filters-for-sets-of-unknown-sizes-2004.124652020-04-28 https://scifaro.com/en/abs/learning-and-testing-junta-distributions-with-subcube-conditioning-2004.124962020-04-28 https://scifaro.com/en/abs/in-place-parallel-partition-algorithms-using-exclusive-read-and-write-memory-2004.125322020-07-10 https://scifaro.com/en/abs/in-place-bijective-burrows-wheeler-transforms-2004.125902020-04-28 https://scifaro.com/en/abs/on-perturbation-resilience-of-non-uniform-k-center-2004.126332020-04-28 https://scifaro.com/en/abs/input-sparsity-low-rank-approximation-in-schatten-norm-2004.126462020-07-01 https://scifaro.com/en/abs/robust-algorithms-under-adversarial-injections-2004.126672020-04-28 https://scifaro.com/en/abs/approximate-turing-kernelization-for-problems-parameterized-by-treewidth-2004.126832020-04-28 https://scifaro.com/en/abs/k-apices-of-minor-closed-graph-classes-ii-parameterized-algorithms-2004.126922021-03-03 https://scifaro.com/en/abs/bridge-depth-characterizes-which-structural-parameterizations-of-vertex-cover-admit-a-polynomial-kernel-2004.128652023-07-25 https://scifaro.com/en/abs/the-streaming-k-mismatch-problem-tradeoffs-between-space-and-total-time-2004.128812020-04-28 https://scifaro.com/en/abs/new-extremal-bounds-for-reachability-and-strong-connectivity-preservers-under-failures-2004.128902020-04-28 https://scifaro.com/en/abs/testing-data-binnings-2004.128932020-04-28 https://scifaro.com/en/abs/a-verifiably-secure-and-proportional-committee-election-rule-2004.129902021-09-14 https://scifaro.com/en/abs/an-extension-of-pl-ucker-relations-with-applications-to-subdeterminant-maximization-2004.130182021-09-16 https://scifaro.com/en/abs/computing-the-boolean-product-of-two-n-times-n-boolean-matrices-using-o-n-2-mechanical-operation-2004.130862020-05-25 https://scifaro.com/en/abs/batched-predecessor-and-sorting-with-size-priced-information-in-external-memory-2004.131972020-04-29 https://scifaro.com/en/abs/learning-lines-with-ordinal-constraints-2004.132022020-05-27 https://scifaro.com/en/abs/certifying-certainty-and-uncertainty-in-approximate-membership-query-structures-extended-version-2004.133122020-04-29 https://scifaro.com/en/abs/approximating-longest-common-substring-with-k-mismatches-theory-and-practice-2004.133892020-04-29 https://scifaro.com/en/abs/fast-algorithms-for-general-spin-systems-on-bipartite-expanders-2004.134422021-04-15 https://scifaro.com/en/abs/as-time-goes-by-reflections-on-treewidth-for-temporal-graphs-2004.134912020-04-29 https://scifaro.com/en/abs/near-optimal-algorithm-for-the-directed-single-source-replacement-paths-problem-2004.136732020-04-29 https://scifaro.com/en/abs/learning-polynomials-of-few-relevant-dimensions-2004.137482020-04-30 https://scifaro.com/en/abs/hierarchy-based-algorithms-for-minimizing-makespan-under-precedence-and-communication-constraints-2004.138912020-04-30 https://scifaro.com/en/abs/on-the-complexity-of-winner-verification-and-candidate-winner-for-multiwinner-voting-rules-2004.139332020-04-30 https://scifaro.com/en/abs/planted-models-for-the-densest-k-subgraph-problem-2004.139782020-11-10 https://scifaro.com/en/abs/quantum-and-approximation-algorithms-for-maximum-witnesses-of-boolean-matrix-products-2004.140642021-06-01 https://scifaro.com/en/abs/dense-steiner-problems-approximation-algorithms-and-inapproximability-2004.141022020-04-30 https://scifaro.com/en/abs/bipartite-stochastic-matching-online-random-order-and-i-i-d-models-2004.143042021-01-07 https://scifaro.com/en/abs/arc-routing-with-time-dependent-travel-times-and-paths-2004.144732020-05-01 https://scifaro.com/en/abs/on-solving-cycle-problems-with-branch-and-cut-extending-shrinking-and-exact-subcycle-elimination-separation-algorithms-2004.145742021-09-07 https://scifaro.com/en/abs/weakly-submodular-function-maximization-using-local-submodularity-ratio-2004.146502020-09-24 https://scifaro.com/en/abs/sparse-hashing-for-scalable-approximate-model-counting-theory-and-practice-2004.146922020-05-01 https://scifaro.com/en/abs/randomized-two-valued-bounded-delay-online-buffer-management-2004.147152020-11-20 https://scifaro.com/en/abs/learning-bayesian-networks-under-sparsity-constraints-a-parameterized-complexity-analysis-2004.147242022-07-12 https://scifaro.com/en/abs/twin-width-i-tractable-fo-model-checking-2004.147892021-10-26 https://scifaro.com/en/abs/fully-dynamic-coresets-2004.148912020-09-29 https://scifaro.com/en/abs/a-parameterized-approximation-scheme-for-min-k-cut-2005.001342020-09-15 https://scifaro.com/en/abs/an-efficient-noisy-binary-search-in-graphs-via-median-approximation-2005.001442020-05-04 https://scifaro.com/en/abs/cutting-bamboo-down-to-size-2005.001682020-05-04 https://scifaro.com/en/abs/multi-dimensional-arrays-with-levels-2005.001982020-05-04 https://scifaro.com/en/abs/improved-bound-for-matching-in-random-order-streams-2005.004172020-05-04 https://scifaro.com/en/abs/the-hypervolume-indicator-problems-and-algorithms-2005.005152022-04-14 https://scifaro.com/en/abs/distributions-of-restricted-rotation-distances-2005.005182020-06-29 https://scifaro.com/en/abs/approximating-maximum-integral-multiflows-on-bounded-genus-graphs-2005.005752021-12-14 https://scifaro.com/en/abs/pointer-machine-algorithms-for-fully-online-construction-of-suffix-trees-and-dawgs-on-multiple-strings-2005.006812020-05-05 https://scifaro.com/en/abs/independent-set-on-p-k-free-graphs-in-quasi-polynomial-time-2005.006902020-06-09 https://scifaro.com/en/abs/deterministic-treasure-hunt-in-the-plane-with-angular-hints-2005.008752020-05-05 https://scifaro.com/en/abs/almost-universal-anonymous-rendezvous-in-the-plane-2005.008802020-05-05 https://scifaro.com/en/abs/online-learning-and-optimization-for-revenue-management-problems-with-add-on-discounts-2005.009472020-05-05 https://scifaro.com/en/abs/a-dynamic-space-efficient-filter-with-constant-time-operations-2005.010982020-06-23 https://scifaro.com/en/abs/a-study-of-performance-of-optimal-transport-2005.011822020-07-07 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-deletion-to-mathcal-h-free-strong-components-2005.013592020-08-25 https://scifaro.com/en/abs/reducing-graph-transversals-via-edge-contractions-2005.014602021-03-23 https://scifaro.com/en/abs/what-do-our-choices-say-about-our-preferences-2005.015862025-08-12 https://scifaro.com/en/abs/determining-the-multiplicative-complexity-of-boolean-functions-using-sat-2005.017782020-05-06 https://scifaro.com/en/abs/complexity-of-c-k-coloring-in-hereditary-classes-of-graphs-2005.018242023-03-06 https://scifaro.com/en/abs/sampling-arbitrary-subgraphs-exactly-uniformly-in-sublinear-time-2005.018612021-03-29 https://scifaro.com/en/abs/removable-online-knapsack-and-advice-2005.018672024-02-29 https://scifaro.com/en/abs/edge-weighted-online-bipartite-matching-2005.019292024-06-05 https://scifaro.com/en/abs/grid-drawings-of-graphs-with-constant-edge-vertex-resolution-2005.020822021-05-06 https://scifaro.com/en/abs/a-space-efficient-dynamic-dictionary-for-multisets-with-constant-time-operations-2005.021432020-05-06 https://scifaro.com/en/abs/many-visits-tsp-revisited-2005.023292020-05-06 https://scifaro.com/en/abs/fast-dynamic-cuts-distances-and-effective-resistances-via-vertex-sparsifiers-2005.023682020-05-06 https://scifaro.com/en/abs/the-expander-hierarchy-and-its-applications-to-dynamic-graph-algorithms-2005.023692020-07-22 https://scifaro.com/en/abs/approximation-algorithms-for-multi-robot-patrol-scheduling-with-min-max-latency-2005.025302020-07-15 https://scifaro.com/en/abs/conditional-cuckoo-filters-2005.025372020-05-07 https://scifaro.com/en/abs/differentiable-greedy-submodular-maximization-guarantees-gradient-estimators-and-applications-2005.025782020-06-15 https://scifaro.com/en/abs/incremental-multiple-longest-common-sub-sequences-2005.027252020-05-07 https://scifaro.com/en/abs/sparktope-linear-programs-from-algorithms-2005.028532020-09-29 https://scifaro.com/en/abs/outlier-robust-clustering-of-non-spherical-mixtures-2005.029702020-12-15 https://scifaro.com/en/abs/determinantal-point-processes-in-randomized-numerical-linear-algebra-2005.031852020-05-08 https://scifaro.com/en/abs/fast-multivariate-empirical-cumulative-distribution-function-with-connection-to-kernel-density-estimation-2005.032462021-09-21 https://scifaro.com/en/abs/scheduling-with-a-processing-time-oracle-2005.033942021-05-06 https://scifaro.com/en/abs/online-algorithms-to-schedule-a-proportionate-flexible-flow-shop-of-batching-machines-2005.035522024-07-18 https://scifaro.com/en/abs/simulating-population-protocols-in-sub-constant-time-per-interaction-2005.035842020-05-08 https://scifaro.com/en/abs/imbalance-parameterized-by-twin-cover-revisited-2005.038002020-05-11 https://scifaro.com/en/abs/efficient-reconstruction-of-stochastic-pedigrees-2005.038102020-05-11 https://scifaro.com/en/abs/improved-throughput-for-all-or-nothing-multicommodity-flows-with-arbitrary-demands-2005.045332022-07-27 https://scifaro.com/en/abs/structural-parameterizations-of-clique-coloring-2005.047332020-05-12 https://scifaro.com/en/abs/approaching-optimal-duplicate-detection-in-a-sliding-window-2005.047402020-05-12 https://scifaro.com/en/abs/improved-algorithms-for-solving-polynomial-systems-over-gf-2-by-multiple-parity-counting-2005.048002020-07-17 https://scifaro.com/en/abs/on-the-petri-nets-with-a-single-shared-place-and-beyond-2005.048182020-05-12 https://scifaro.com/en/abs/faster-exponential-time-algorithms-for-approximately-counting-independent-sets-2005.050702021-09-10 https://scifaro.com/en/abs/an-algorithmic-method-of-partial-derivatives-2005.051432020-05-12 https://scifaro.com/en/abs/a-relational-gradient-descent-algorithm-for-support-vector-machine-training-2005.053252020-05-13 https://scifaro.com/en/abs/counting-distinct-patterns-in-internal-dictionary-matching-2005.056812020-05-13 https://scifaro.com/en/abs/red-blue-point-separation-for-points-on-a-circle-2005.060462020-05-14 https://scifaro.com/en/abs/structure-and-algorithm-for-path-of-solutions-to-a-class-of-fused-lasso-problems-2005.061002020-05-14 https://scifaro.com/en/abs/super-resolution-and-robust-sparse-continuous-fourier-transform-in-any-constant-dimension-nearly-linear-time-and-sample-complexity-2005.061562022-10-13 https://scifaro.com/en/abs/an-improved-solution-approach-for-the-budget-constrained-fuel-treatment-scheduling-problem-2005.062252020-05-14 https://scifaro.com/en/abs/fully-online-matching-ii-beating-ranking-and-water-filling-2005.063112020-05-14 https://scifaro.com/en/abs/k-approximate-quasiperiodicity-under-hamming-and-edit-distance-2005.063292020-05-14 https://scifaro.com/en/abs/a-remark-on-approximating-permanents-of-positive-definite-matrices-2005.063442020-05-14 https://scifaro.com/en/abs/robustly-learning-any-clusterable-mixture-of-gaussians-2005.064172020-05-14 https://scifaro.com/en/abs/testing-positive-semi-definiteness-via-random-submatrices-2005.064412020-09-21 https://scifaro.com/en/abs/shortest-distances-as-enumeration-problem-2005.068272023-09-19 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-unconstrained-binary-quadratic-optimization-2005.070302021-02-02 https://scifaro.com/en/abs/distance-oracles-for-interval-graphs-via-breadth-first-rank-select-in-succinct-trees-2005.076442020-10-02 https://scifaro.com/en/abs/edit-distance-in-near-linear-time-it-s-a-constant-factor-2005.076782022-07-18 https://scifaro.com/en/abs/tight-analysis-of-asynchronous-rumor-spreading-in-dynamic-networks-2005.078592020-05-19 https://scifaro.com/en/abs/polynomial-time-approximation-algorithms-for-the-antiferromagnetic-ising-model-on-line-graphs-2005.079442021-03-17 https://scifaro.com/en/abs/robust-algorithms-for-tsp-and-steiner-tree-2005.081372020-05-19 https://scifaro.com/en/abs/towards-efficient-interactive-computation-of-dynamic-time-warping-distance-2005.081902020-07-30 https://scifaro.com/en/abs/weighted-adaptive-coding-2005.082322020-05-19 https://scifaro.com/en/abs/matching-in-stochastically-evolving-graphs-2005.082632020-05-19 https://scifaro.com/en/abs/optimal-bounds-for-the-k-cut-problem-2005.083012023-10-13 https://scifaro.com/en/abs/on-efficient-connectivity-preserving-transformations-in-a-grid-2005.083512020-05-19 https://scifaro.com/en/abs/the-online-multi-commodity-facility-location-problem-2005.083912020-05-20 https://scifaro.com/en/abs/semi-online-scheduling-a-survey-2005.086142020-05-19 https://scifaro.com/en/abs/approximation-algorithms-and-hardness-for-strong-unique-games-2005.089182020-05-19 https://scifaro.com/en/abs/potential-gain-as-a-centrality-measure-2005.089592020-05-20 https://scifaro.com/en/abs/a-faster-reduction-of-the-dynamic-time-warping-distance-to-the-longest-increasing-subsequence-length-2005.091692022-04-19 https://scifaro.com/en/abs/multiple-source-replacement-path-problem-2005.092622020-05-22 https://scifaro.com/en/abs/linear-time-construction-of-indexable-founder-block-graphs-2005.093422020-05-20 https://scifaro.com/en/abs/on-repetitiveness-measures-of-thue-morse-words-2005.095242020-08-13 https://scifaro.com/en/abs/faster-deterministic-all-pairs-shortest-paths-in-congest-model-2005.095882020-05-20 https://scifaro.com/en/abs/asymmetric-scale-functions-for-t-digests-2005.095992020-05-20 https://scifaro.com/en/abs/scheduling-flows-on-a-switch-to-optimize-response-times-2005.097242020-05-28 https://scifaro.com/en/abs/list-decodable-mean-estimation-in-nearly-linear-time-2005.097962021-01-22 https://scifaro.com/en/abs/when-is-approximate-counting-for-conjunctive-queries-tractable-2005.100292020-11-23 https://scifaro.com/en/abs/the-k-centre-problem-for-necklaces-2005.100952020-05-21 https://scifaro.com/en/abs/sparse-tensor-transpositions-2005.104272023-10-17 https://scifaro.com/en/abs/a-massively-parallel-algorithm-for-minimum-weight-vertex-cover-2005.105662020-05-22 https://scifaro.com/en/abs/combinatorial-two-stage-minmax-regret-problems-under-interval-uncertainty-2005.106102020-05-22 https://scifaro.com/en/abs/new-approximation-algorithms-for-maximum-asymmetric-traveling-salesman-and-shortest-superstring-2005.108002020-12-23 https://scifaro.com/en/abs/online-coloring-and-a-new-type-of-adversary-for-online-graph-problems-2005.108522020-05-25 https://scifaro.com/en/abs/succinct-trit-array-trie-for-scalable-trajectory-similarity-search-2005.109172020-09-23 https://scifaro.com/en/abs/target-location-problem-for-multi-commodity-flow-2005.110262020-05-25 https://scifaro.com/en/abs/optimal-lower-bounds-for-matching-and-vertex-cover-in-dynamic-graph-streams-2005.111162020-05-25 https://scifaro.com/en/abs/still-simpler-static-level-ancestors-2005.111882020-05-25 https://scifaro.com/en/abs/a-dynamic-tree-algorithm-for-on-demand-peer-to-peer-ride-sharing-matching-2005.111952020-05-25 https://scifaro.com/en/abs/dartminhash-fast-sketching-for-weighted-sets-2005.115472020-05-26 https://scifaro.com/en/abs/symmetric-linear-programming-formulations-for-minimum-cut-with-applications-to-tsp-2005.119122020-05-26 https://scifaro.com/en/abs/on-the-problem-of-p-1-1-in-locality-sensitive-hashing-2005.120652020-05-26 https://scifaro.com/en/abs/on-optimal-partitioning-for-sparse-matrices-in-variable-block-row-format-2005.124142023-10-13 https://scifaro.com/en/abs/distributed-algorithms-for-covering-packing-and-maximum-weighted-matching-2005.136282020-05-29 https://scifaro.com/en/abs/algorithmic-approaches-to-selecting-control-clones-in-dna-array-hybridization-experiments-2005.136452020-05-29 https://scifaro.com/en/abs/better-and-simpler-learning-augmented-online-caching-2005.137162020-05-29 https://scifaro.com/en/abs/computing-subset-transversals-in-h-free-graphs-2005.139382021-10-27 https://scifaro.com/en/abs/dimension-free-bounds-on-chasing-convex-functions-2005.140582020-05-29 https://scifaro.com/en/abs/exact-method-for-generating-strategy-solvable-sudoku-clues-2005.140982020-07-20 https://scifaro.com/en/abs/two-bar-charts-packing-problem-2005.141952021-01-05 https://scifaro.com/en/abs/classical-and-quantum-algorithms-for-constructing-text-from-dictionary-problem-2005.143352020-06-01 https://scifaro.com/en/abs/parameterized-complexity-of-min-power-asymmetric-connectivity-2005.146202020-06-01 https://scifaro.com/en/abs/longest-square-subsequence-problem-revisited-2006.002162020-07-30 https://scifaro.com/en/abs/bi-criteria-multiple-knapsack-problem-with-grouped-items-2006.003222020-06-02 https://scifaro.com/en/abs/lower-bounds-for-caching-with-delayed-hits-2006.003762020-06-02 https://scifaro.com/en/abs/scheduling-in-the-random-order-model-2006.003862021-10-28 https://scifaro.com/en/abs/efficient-fully-dynamic-elimination-forests-with-applications-to-detecting-long-paths-and-cycles-2006.005712020-07-21 https://scifaro.com/en/abs/a-fast-algorithm-for-online-k-servers-problem-on-trees-2006.006052022-05-02 https://scifaro.com/en/abs/provable-guarantees-for-decision-tree-induction-the-agnostic-setting-2006.007432020-06-02 https://scifaro.com/en/abs/note-to-an-efficient-data-structure-for-lattice-operation-2006.008082021-12-10 https://scifaro.com/en/abs/secretary-and-online-matching-problems-with-machine-learned-advice-2006.010262020-10-22 https://scifaro.com/en/abs/approximation-guarantees-of-local-search-algorithms-via-localizability-of-set-functions-2006.014002020-06-03 https://scifaro.com/en/abs/fast-algorithms-for-join-operations-on-tree-decompositions-2006.015882020-06-03 https://scifaro.com/en/abs/efficient-tree-structured-categorical-retrieval-2006.018252020-06-03 https://scifaro.com/en/abs/hierarchical-clustering-a-0-585-revenue-approximation-2006.019332020-06-04 https://scifaro.com/en/abs/sparsification-of-directed-graphs-via-cut-balance-2006.019752021-05-13 https://scifaro.com/en/abs/palindromic-trees-for-a-sliding-window-and-its-applications-2006.021342020-11-12 https://scifaro.com/en/abs/lcp-aware-parallel-string-sorting-2006.022192020-06-04 https://scifaro.com/en/abs/dynamic-longest-common-substring-in-polylogarithmic-time-2006.024082026-04-09 https://scifaro.com/en/abs/tensor-completion-made-practical-2006.031342023-07-14 https://scifaro.com/en/abs/partitioned-learned-bloom-filter-2006.031762020-10-06 https://scifaro.com/en/abs/the-baggage-belt-assignment-problem-2006.033652020-06-12 https://scifaro.com/en/abs/scaling-up-distance-generalized-core-decomposition-2006.033722021-10-25 https://scifaro.com/en/abs/single-machine-scheduling-with-an-external-resource-2006.033992020-09-14 https://scifaro.com/en/abs/spread-of-influence-in-graphs-2006.034402020-06-08 https://scifaro.com/en/abs/optimal-sensor-placement-in-power-grids-power-domination-set-covering-and-the-neighborhoods-of-zero-forcing-forts-2006.034602020-06-08 https://scifaro.com/en/abs/vector-tsp-a-traveling-salesperson-problem-with-racetrack-like-acceleration-constraints-2006.036662025-02-12 https://scifaro.com/en/abs/distributed-approximation-on-power-graphs-2006.037462020-06-09 https://scifaro.com/en/abs/on-the-maximum-cardinality-cut-problem-in-proper-interval-graphs-and-related-graph-classes-2006.038562020-06-09 https://scifaro.com/en/abs/average-sensitivity-of-spectral-clustering-2006.040942020-06-09 https://scifaro.com/en/abs/toward-scalable-algorithms-for-the-unsplittable-shortest-path-routing-problem-2006.043242020-06-09 https://scifaro.com/en/abs/near-perfect-recovery-in-the-one-dimensional-latent-space-model-2006.043512020-06-09 https://scifaro.com/en/abs/a-survey-on-approximation-in-parameterized-complexity-hardness-and-algorithms-2006.044112020-06-09 https://scifaro.com/en/abs/generalizing-the-sharp-threshold-phenomenon-for-the-distributed-complexity-of-the-lov-asz-local-lemma-2006.046252020-06-09 https://scifaro.com/en/abs/fully-dynamic-algorithm-for-constrained-submodular-optimization-2006.047042023-05-26 https://scifaro.com/en/abs/online-page-migration-with-ml-advice-2006.050282020-06-11 https://scifaro.com/en/abs/optimal-time-queries-on-bwt-runs-compressed-indexes-2006.051042021-04-19 https://scifaro.com/en/abs/sublinear-algorithms-and-lower-bounds-for-metric-tsp-cost-estimation-2006.054902020-06-11 https://scifaro.com/en/abs/the-nearest-colattice-algorithm-2006.056602020-06-12 https://scifaro.com/en/abs/an-asymptotically-optimal-algorithm-for-online-stacking-2006.057402020-06-11 https://scifaro.com/en/abs/sliding-window-algorithms-for-k-clustering-problems-2006.058502020-10-26 https://scifaro.com/en/abs/tailoring-r-index-for-metagenomics-2006.058712020-06-11 https://scifaro.com/en/abs/planar-rectilinear-drawings-of-outerplanar-graphs-in-linear-time-2006.069512020-08-24 https://scifaro.com/en/abs/robust-sub-gaussian-principal-component-analysis-and-width-independent-schatten-packing-2006.069802020-06-15 https://scifaro.com/en/abs/distance-based-phylogenetic-inference-from-typing-data-a-unifying-view-2006.070162020-06-16 https://scifaro.com/en/abs/sallow-a-heuristic-algorithm-for-treedepth-decompositions-2006.070502020-10-01 https://scifaro.com/en/abs/sms-in-pace-2020-2006.073022022-02-08 https://scifaro.com/en/abs/fourier-sparse-leverage-scores-and-approximate-kernel-learning-2006.073402021-07-09 https://scifaro.com/en/abs/on-packing-low-diameter-spanning-trees-2006.074862020-06-16 https://scifaro.com/en/abs/balanced-allocation-on-hypergraphs-2006.075882022-09-07 https://scifaro.com/en/abs/when-algorithms-for-maximal-independent-set-and-maximal-matching-run-in-sublinear-time-2006.076282020-06-16 https://scifaro.com/en/abs/group-fairness-for-knapsack-problems-2006.078322021-01-19 https://scifaro.com/en/abs/vehicle-redistribution-in-ride-sourcing-markets-using-convex-minimum-cost-flows-2006.079192021-06-29 https://scifaro.com/en/abs/hypergraph-clustering-based-on-pagerank-2006.083022021-10-27 https://scifaro.com/en/abs/nearly-linear-row-sampling-algorithm-for-quantile-regression-2006.083972020-06-16 https://scifaro.com/en/abs/improved-algorithm-for-permutation-testing-2006.084732024-01-05 https://scifaro.com/en/abs/algorithmic-aspects-of-temporal-betweenness-2006.086682024-05-15 https://scifaro.com/en/abs/utility-based-graph-summarization-new-and-improved-2006.089492020-06-17 https://scifaro.com/en/abs/algorithms-with-predictions-2006.091232020-06-17 https://scifaro.com/en/abs/submodular-maximization-in-clean-linear-time-2006.093272022-04-13 https://scifaro.com/en/abs/a-one-pass-private-sketch-for-most-machine-learning-tasks-2006.093522020-06-17 https://scifaro.com/en/abs/online-algorithms-for-weighted-paging-with-predictions-2006.095092020-06-18 https://scifaro.com/en/abs/caching-with-time-windows-and-delays-2006.096652020-06-18 https://scifaro.com/en/abs/scheduling-a-proportionate-flow-shop-of-batching-machines-2006.098722020-11-30 https://scifaro.com/en/abs/pace-solver-description-bute-plus-a-bottom-up-exact-solver-for-treedepth-2006.099122020-12-18 https://scifaro.com/en/abs/fair-hierarchical-clustering-2006.102212020-06-22 https://scifaro.com/en/abs/cyclic-space-filling-curves-and-their-clustering-property-2006.102862020-06-19 https://scifaro.com/en/abs/approximate-bi-criteria-search-by-efficient-representation-of-subsets-of-the-pareto-optimal-frontier-2006.103022021-03-08 https://scifaro.com/en/abs/a-3-2-approximation-for-big-two-bar-charts-packing-2006.103612020-06-19 https://scifaro.com/en/abs/on-the-parameterized-approximability-of-contraction-to-classes-of-chordal-graphs-2006.103642020-06-19 https://scifaro.com/en/abs/palette-sparsification-beyond-delta-1-vertex-coloring-2006.104562020-07-03 https://scifaro.com/en/abs/karp-s-patching-algorithm-on-dense-digraphs-2006.108042021-08-31 https://scifaro.com/en/abs/new-bounds-for-the-vertices-of-the-integer-hull-2006.108472020-06-22 https://scifaro.com/en/abs/lambda-regularized-a-optimal-design-and-its-approximation-by-lambda-regularized-proportional-volume-sampling-2006.111822020-06-22 https://scifaro.com/en/abs/multicritera-cuts-and-size-constrained-k-cuts-in-hypergraphs-2006.115892020-06-23 https://scifaro.com/en/abs/knapsack-secretary-with-bursty-adversary-2006.116072020-06-23 https://scifaro.com/en/abs/pfp-data-structures-2006.116872020-06-23 https://scifaro.com/en/abs/continuous-submodular-maximization-beyond-dr-submodularity-2006.117262020-06-23 https://scifaro.com/en/abs/personalized-pagerank-to-a-target-node-revisited-2006.118762020-06-25 https://scifaro.com/en/abs/how-to-count-triangles-without-seeing-the-whole-graph-2006.119472020-06-23 https://scifaro.com/en/abs/fast-preprocessing-for-optimal-orthogonal-range-reporting-and-range-successor-with-applications-to-text-indexing-2006.119782020-06-23 https://scifaro.com/en/abs/greedy-adversarial-equilibrium-an-efficient-alternative-to-nonconvex-nonconcave-min-max-optimization-2006.123632021-05-05 https://scifaro.com/en/abs/improved-bounds-for-metric-capacitated-covering-problems-2006.124542020-06-23 https://scifaro.com/en/abs/better-approximation-algorithms-for-maximum-weight-internal-spanning-trees-in-cubic-graphs-and-claw-free-graphs-2006.125612020-06-24 https://scifaro.com/en/abs/similarity-search-with-tensor-core-units-2006.126082020-06-24 https://scifaro.com/en/abs/an-efficient-ptas-for-stochastic-load-balancing-with-poisson-jobs-2006.126702020-06-24 https://scifaro.com/en/abs/approximation-algorithms-for-sparse-principal-component-analysis-2006.127482021-06-07 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-clustering-in-low-highway-dimension-graphs-2006.128972021-06-01 https://scifaro.com/en/abs/approximation-algorithms-for-general-cluster-routing-problem-2006.129292020-06-24 https://scifaro.com/en/abs/learning-based-distributed-tracking-2006.129432020-06-24 https://scifaro.com/en/abs/the-bike-sharing-problem-2006.132412020-06-25 https://scifaro.com/en/abs/robust-gaussian-covariance-estimation-in-nearly-matrix-multiplication-time-2006.133122020-06-25 https://scifaro.com/en/abs/lower-bounds-on-rate-of-convergence-of-matrix-products-in-all-pairs-shortest-path-of-social-network-2006.134122020-06-25 https://scifaro.com/en/abs/approximation-algorithms-for-the-maxspace-advertisement-problem-2006.134302023-05-10 https://scifaro.com/en/abs/improved-circular-k-mismatch-sketches-2006.136732020-06-25 https://scifaro.com/en/abs/approximation-of-the-diagonal-of-a-laplacian-s-pseudoinverse-for-complex-network-analysis-2006.136792021-02-09 https://scifaro.com/en/abs/kernelization-of-whitney-switches-2006.136842020-06-25 https://scifaro.com/en/abs/the-power-of-connection-leveraging-network-analysis-to-advance-receivable-financing-2006.137382020-06-25 https://scifaro.com/en/abs/a-parameterized-family-of-meta-submodular-functions-2006.137542020-06-25 https://scifaro.com/en/abs/acyclic-coloring-of-special-digraphs-2006.139112020-11-23 https://scifaro.com/en/abs/discrepancy-minimization-via-a-self-balancing-walk-2006.140092020-08-07 https://scifaro.com/en/abs/vector-matrix-vector-queries-for-solving-linear-algebra-statistics-and-graph-problems-2006.140152020-06-26 https://scifaro.com/en/abs/small-longest-tandem-scattered-subsequences-2006.140292020-06-26 https://scifaro.com/en/abs/a-linear-time-algorithm-for-discrete-radius-optimally-augmenting-paths-in-a-metric-space-2006.140932020-06-26 https://scifaro.com/en/abs/reconfiguration-of-spanning-trees-with-many-or-few-leaves-2006.143092020-06-26 https://scifaro.com/en/abs/new-approximations-and-hardness-results-for-submodular-partitioning-problems-2006.143122021-05-11 https://scifaro.com/en/abs/approximation-algorithms-for-clustering-with-dynamic-points-2006.144032022-07-26 https://scifaro.com/en/abs/augmenting-the-algebraic-connectivity-of-graphs-2006.144492020-06-26 https://scifaro.com/en/abs/practical-trade-offs-for-the-prefix-sum-problem-2006.145522022-02-08 https://scifaro.com/en/abs/constant-depth-and-subcubic-size-threshold-circuits-for-matrix-multiplication-2006.146522020-06-29 https://scifaro.com/en/abs/on-2-clubs-in-graph-based-data-clustering-theory-and-algorithm-engineering-2006.149722020-06-29 https://scifaro.com/en/abs/computing-all-s-t-bridges-and-articulation-points-simplified-2006.150242020-06-29 https://scifaro.com/en/abs/reconstructing-biological-and-digital-phylogenetic-trees-in-parallel-2006.152592020-09-10 https://scifaro.com/en/abs/the-generalized-independent-and-dominating-set-problems-on-unit-disk-graphs-2006.153812020-06-30 https://scifaro.com/en/abs/parallel-weighted-model-counting-with-tensor-networks-2006.155122021-06-16 https://scifaro.com/en/abs/random-access-in-persistent-strings-and-segment-selection-2006.155752021-02-12 https://scifaro.com/en/abs/a-polynomial-kernel-for-line-graph-deletion-2006.155842020-06-30 https://scifaro.com/en/abs/fast-and-private-submodular-and-k-submodular-functions-maximization-with-matroid-constraints-2006.157442020-06-30 https://scifaro.com/en/abs/the-number-of-repetitions-in-2d-strings-2006.159992020-06-30 https://scifaro.com/en/abs/pattern-masking-for-dictionary-matching-2006.161372024-03-11 https://scifaro.com/en/abs/efficient-enumerations-for-minimal-multicuts-and-multiway-cuts-2006.162222020-09-23 https://scifaro.com/en/abs/efficient-splitting-of-measures-and-necklaces-2006.166132020-07-01 https://scifaro.com/en/abs/online-multi-facility-location-2006.167622020-07-01 https://scifaro.com/en/abs/lower-bounds-for-dynamic-distributed-task-allocation-2006.168982020-07-01 https://scifaro.com/en/abs/constructing-basis-path-set-by-eliminating-path-dependency-2007.006572020-07-03 https://scifaro.com/en/abs/adapting-k-means-algorithms-for-outliers-2007.011182022-09-26 https://scifaro.com/en/abs/parallel-planar-subgraph-isomorphism-and-vertex-connectivity-2007.011992020-07-03 https://scifaro.com/en/abs/approximating-sparse-quadratic-programs-2007.012522020-12-16 https://scifaro.com/en/abs/multicommodity-flows-in-planar-graphs-with-demands-on-faces-2007.012802020-07-03 https://scifaro.com/en/abs/a-slightly-improved-approximation-algorithm-for-metric-tsp-2007.014092023-10-26 https://scifaro.com/en/abs/minimizing-convex-functions-with-rational-minimizers-2007.014452022-09-22 https://scifaro.com/en/abs/finding-densest-k-connected-subgraphs-2007.015332021-10-26 https://scifaro.com/en/abs/b-articulation-points-and-b-bridges-in-strongly-biconnected-directed-graphs-2007.018972020-07-07 https://scifaro.com/en/abs/new-hardness-results-for-planar-graph-problems-in-p-and-an-algorithm-for-sparsest-cut-2007.023772020-07-07 https://scifaro.com/en/abs/solving-packing-problems-with-few-small-items-using-rainbow-matchings-2007.026602020-07-07 https://scifaro.com/en/abs/streaming-verification-for-graph-problems-optimal-tradeoffs-and-nonlinear-sketches-2007.030392020-07-08 https://scifaro.com/en/abs/near-linear-time-edit-distance-for-indel-channels-2007.030402020-07-08 https://scifaro.com/en/abs/approximation-algorithms-for-car-sharing-problems-2007.030572020-07-08 https://scifaro.com/en/abs/quantum-lower-and-upper-bounds-for-2d-grid-and-dyck-language-2007.034022020-07-10 https://scifaro.com/en/abs/natural-family-free-genomic-distance-2007.035562020-07-16 https://scifaro.com/en/abs/streaming-complexity-of-svms-2007.036332020-07-08 https://scifaro.com/en/abs/an-improved-upper-bound-for-sat-2007.038292020-07-09 https://scifaro.com/en/abs/fixed-treewidth-efficient-algorithms-for-edge-deletion-to-intersection-graph-classes-2007.038592021-11-15 https://scifaro.com/en/abs/near-input-sparsity-time-kernel-embeddings-via-adaptive-sampling-2007.039272020-07-15 https://scifaro.com/en/abs/linear-time-algorithms-for-computing-twinless-strong-articulation-points-and-related-problems-2007.039332020-09-23 https://scifaro.com/en/abs/a-technique-for-obtaining-true-approximations-for-k-center-with-covering-constraints-2007.039462020-07-09 https://scifaro.com/en/abs/mining-dense-subgraphs-with-similar-edges-2007.039502020-07-09 https://scifaro.com/en/abs/waypoint-routing-on-bounded-treewidth-graphs-2007.040082021-09-27 https://scifaro.com/en/abs/fair-colorful-k-center-clustering-2007.040592020-07-09 https://scifaro.com/en/abs/string-indexing-for-top-k-close-consecutive-occurrences-2007.041282024-02-15 https://scifaro.com/en/abs/an-efficient-updation-approach-for-enumerating-maximal-delta-gamma-mbox-cliques-of-a-temporal-network-2007.044112020-07-10 https://scifaro.com/en/abs/fpt-and-kernelization-algorithms-for-the-k-in-a-tree-problem-2007.044682020-07-10 https://scifaro.com/en/abs/computing-the-largest-bond-and-the-maximum-connected-cut-of-a-graph-2007.045132020-07-10 https://scifaro.com/en/abs/safety-in-s-t-paths-trails-and-walks-2007.047262021-11-03 https://scifaro.com/en/abs/practical-budgeted-submodular-maximization-2007.049372021-02-10 https://scifaro.com/en/abs/fast-adaptive-non-monotone-submodular-maximization-subject-to-a-knapsack-constraint-2007.050142024-02-20 https://scifaro.com/en/abs/target-set-selection-with-maximum-activation-time-2007.052462020-07-13 https://scifaro.com/en/abs/local-access-to-sparse-connected-subgraphs-via-edge-sampling-2007.055232020-07-13 https://scifaro.com/en/abs/vector-balancing-in-lebesgue-spaces-2007.056342022-07-11 https://scifaro.com/en/abs/multilevel-digital-contact-tracing-2007.056372024-05-21 https://scifaro.com/en/abs/a-subquadratic-algorithm-for-the-simultaneous-conjugacy-problem-2007.058702020-07-14 https://scifaro.com/en/abs/robust-learning-of-mixtures-of-gaussians-2007.059122020-07-14 https://scifaro.com/en/abs/recognizing-k-clique-extendible-orderings-2007.060602020-07-14 https://scifaro.com/en/abs/graph-connectivity-and-single-element-recovery-via-linear-and-or-queries-2007.060982021-07-02 https://scifaro.com/en/abs/efficient-labeling-for-reachability-in-digraphs-2007.061052020-07-14 https://scifaro.com/en/abs/unknown-i-i-d-prophets-better-bounds-streaming-algorithms-and-a-new-impossibility-2007.061102020-11-24 https://scifaro.com/en/abs/local-editing-in-lz-end-compressed-data-2007.061672020-07-14 https://scifaro.com/en/abs/perfectly-sampling-k-geq-8-3-o-1-delta-colorings-in-graphs-2007.063602020-07-14 https://scifaro.com/en/abs/update-query-time-trade-off-for-dynamic-suffix-arrays-2007.066042020-07-15 https://scifaro.com/en/abs/the-invisible-hand-heuristic-for-origin-destination-integer-multicommodity-network-flows-2007.066932020-07-15 https://scifaro.com/en/abs/network-flow-methods-for-the-minimum-covariates-imbalance-problem-2007.068282020-07-15 https://scifaro.com/en/abs/component-order-connectivity-in-directed-graphs-2007.068962020-07-20 https://scifaro.com/en/abs/a-nearly-optimal-deterministic-online-algorithm-for-non-metric-facility-location-2007.070252021-01-12 https://scifaro.com/en/abs/graph-sparsification-by-universal-greedy-algorithms-2007.071612021-02-23 https://scifaro.com/en/abs/competitively-pricing-parking-in-a-tree-2007.072942020-10-05 https://scifaro.com/en/abs/on-the-hop-constrained-steiner-tree-problems-2007.074052021-11-16 https://scifaro.com/en/abs/downsampling-for-testing-and-learning-in-product-distributions-2007.074492021-11-17 https://scifaro.com/en/abs/an-algorithm-for-integrating-peer-to-peer-ridesharing-and-schedule-based-transit-system-for-first-mile-last-mile-access-2007.074882022-08-25 https://scifaro.com/en/abs/improved-algorithms-for-online-load-balancing-2007.075152020-07-22 https://scifaro.com/en/abs/a-faster-exact-algorithm-to-count-x3sat-solutions-2007.075532020-07-16 https://scifaro.com/en/abs/minimum-weight-pairwise-distance-preservers-2007.075542020-07-16 https://scifaro.com/en/abs/a-linear-time-parameterized-algorithm-for-computing-the-width-of-a-dag-2007.075752021-06-25 https://scifaro.com/en/abs/leafy-spanning-arborescences-in-dags-2007.076602020-07-16 https://scifaro.com/en/abs/on-indexing-and-compressing-finite-automata-2007.077182020-07-16 https://scifaro.com/en/abs/online-generalized-network-design-under-dis-economies-of-scale-2007.077212020-07-16 https://scifaro.com/en/abs/adapting-the-directed-grid-theorem-into-an-fpt-algorithm-2007.077382022-05-13 https://scifaro.com/en/abs/vertex-sparsification-for-edge-connectivity-2007.078622020-07-16 https://scifaro.com/en/abs/directed-shortest-paths-via-approximate-cost-balancing-2007.079752022-12-02 https://scifaro.com/en/abs/optimal-coreset-for-gaussian-kernel-density-estimation-2007.080312022-02-22 https://scifaro.com/en/abs/information-theoretic-limits-of-cardinality-estimation-fisher-meets-shannon-2007.080512026-02-17 https://scifaro.com/en/abs/rapid-mixing-for-colorings-via-spectral-independence-2007.080582020-07-17 https://scifaro.com/en/abs/augmented-sparsifiers-for-generalized-hypergraph-cuts-with-applications-to-decomposable-submodular-function-minimization-2007.080752021-07-05 https://scifaro.com/en/abs/rapid-mixing-from-spectral-independence-beyond-the-boolean-domain-2007.080912020-07-17 https://scifaro.com/en/abs/private-approximations-of-a-convex-hull-in-low-dimensions-2007.081102025-12-29 https://scifaro.com/en/abs/string-sanitization-under-edit-distance-improved-and-generalized-2007.081792024-03-12 https://scifaro.com/en/abs/a-faster-exponential-time-algorithm-for-bin-packing-with-a-constant-number-of-bins-via-additive-combinatorics-2007.082042023-09-11 https://scifaro.com/en/abs/improved-deterministic-network-decomposition-2007.082532020-07-17 https://scifaro.com/en/abs/quantum-algorithms-for-graph-problems-with-cut-queries-2007.082852020-08-05 https://scifaro.com/en/abs/substring-complexity-in-sublinear-space-2007.083572023-11-16 https://scifaro.com/en/abs/optimal-vertex-fault-tolerant-spanners-in-polynomial-time-2007.084012020-11-03 https://scifaro.com/en/abs/fully-dynamic-algorithms-for-knapsack-problems-with-polylogarithmic-update-time-2007.084152021-10-05 https://scifaro.com/en/abs/polyhedral-value-iteration-for-discounted-games-and-energy-games-2007.085752020-10-27 https://scifaro.com/en/abs/planar-distance-oracles-with-better-time-space-tradeoffs-2007.085852020-07-20 https://scifaro.com/en/abs/dynamic-geometric-independent-set-2007.086432020-07-20 https://scifaro.com/en/abs/memoryless-algorithms-for-the-generalized-k-server-problem-on-uniform-metrics-2007.086692020-07-20 https://scifaro.com/en/abs/adaptive-exact-learning-in-a-mixed-up-world-dealing-with-periodicity-errors-and-jumbled-index-queries-in-string-reconstruction-2007.087872020-11-26 https://scifaro.com/en/abs/parameterized-complexity-of-graph-burning-2007.088112020-09-29 https://scifaro.com/en/abs/efficient-exact-algorithms-for-maximum-balanced-biclique-search-in-bipartite-graphs-2007.088362020-07-20 https://scifaro.com/en/abs/all-pairs-lca-in-dags-breaking-through-the-o-n-2-5-barrier-2007.089142020-11-16 https://scifaro.com/en/abs/flow-augmentation-ii-undirected-graphs-2007.090182023-02-16 https://scifaro.com/en/abs/the-combinatorial-santa-claus-problem-or-how-to-find-good-matchings-in-non-uniform-hypergraphs-2007.091162020-11-17 https://scifaro.com/en/abs/improved-approximations-for-min-sum-vertex-cover-and-generalized-min-sum-set-cover-2007.091722020-07-21 https://scifaro.com/en/abs/the-edit-distance-to-k-subsequence-universality-2007.091922020-07-21 https://scifaro.com/en/abs/query-complexity-of-global-minimum-cut-2007.092022020-08-12 https://scifaro.com/en/abs/frequency-estimation-in-data-streams-learning-the-optimal-hashing-scheme-2007.092612022-07-19 https://scifaro.com/en/abs/an-apx-for-the-maximum-profit-routing-problem-with-variable-supply-2007.092822020-07-21 https://scifaro.com/en/abs/additive-approximation-schemes-for-load-balancing-problems-2007.093332020-07-21 https://scifaro.com/en/abs/a-2-n-2-time-algorithm-for-sqrt-n-svp-and-sqrt-n-hermite-svp-and-an-improved-time-approximation-tradeoff-for-h-svp-2007.095562020-07-21 https://scifaro.com/en/abs/grmr-generalized-regret-minimizing-representatives-2007.096342020-07-21 https://scifaro.com/en/abs/exploitation-of-multiple-replenishing-resources-with-uncertainty-2007.096402020-07-21 https://scifaro.com/en/abs/2-blocks-in-strongly-biconnected-directed-graphs-2007.097932020-07-21 https://scifaro.com/en/abs/the-energy-complexity-of-bfs-in-radio-networks-2007.098162020-07-21 https://scifaro.com/en/abs/a-polynomial-time-12-approximation-algorithm-for-restricted-santa-claus-problem-2007.098492020-08-10 https://scifaro.com/en/abs/on-distribution-testing-in-the-conditional-sampling-model-2007.098952020-11-05 https://scifaro.com/en/abs/on-coresets-for-fair-clustering-in-metric-and-euclidean-spaces-and-their-applications-2007.101372020-07-21 https://scifaro.com/en/abs/solving-sparse-linear-systems-faster-than-matrix-multiplication-2007.102542021-01-08 https://scifaro.com/en/abs/optimal-ell-1-column-subset-selection-and-a-fast-ptas-for-low-rank-approximation-2007.103072020-11-17 https://scifaro.com/en/abs/modular-and-submodular-optimization-with-multiple-knapsack-constraints-via-fractional-grouping-2007.104702021-06-29 https://scifaro.com/en/abs/maximum-weight-disjoint-paths-in-outerplanar-graphs-via-single-tree-cut-approximators-2007.105372021-01-05 https://scifaro.com/en/abs/online-carpooling-using-expander-decompositions-2007.105452020-10-06 https://scifaro.com/en/abs/online-discrepancy-minimization-for-stochastic-arrivals-2007.106222020-07-22 https://scifaro.com/en/abs/breaking-the-2-n-barrier-for-5-coloring-and-6-coloring-2007.107902021-02-15 https://scifaro.com/en/abs/parameter-estimation-for-gibbs-distributions-2007.108242025-04-04 https://scifaro.com/en/abs/interactive-inference-under-information-constraints-2007.109762021-10-26 https://scifaro.com/en/abs/improved-lower-and-upper-bounds-on-the-tile-complexity-of-uniquely-self-assembling-a-thin-rectangle-non-cooperatively-in-3d-2007.110932020-07-23 https://scifaro.com/en/abs/new-data-structures-for-orthogonal-range-reporting-and-range-minima-queries-2007.110942020-07-23 https://scifaro.com/en/abs/a-framework-for-consistency-algorithms-2007.113982020-07-24 https://scifaro.com/en/abs/finding-large-induced-sparse-subgraphs-in-c-t-free-graphs-in-quasipolynomial-time-2007.114022021-01-13 https://scifaro.com/en/abs/approximate-covering-with-lower-and-upper-bounds-via-lp-rounding-2007.114762020-09-22 https://scifaro.com/en/abs/improved-distance-sensitivity-oracles-with-subcubic-preprocessing-time-2007.114952021-09-03 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-matching-augmentation-problem-2007.115592020-12-14 https://scifaro.com/en/abs/space-efficient-graph-kernelizations-2007.116432024-02-21 https://scifaro.com/en/abs/fpt-approximation-for-constrained-metric-k-median-means-2007.117732020-07-24 https://scifaro.com/en/abs/total-domination-in-unit-disk-graphs-2007.119972020-07-24 https://scifaro.com/en/abs/detecting-and-enumerating-small-induced-subgraphs-in-c-closed-graphs-2007.120772020-07-24 https://scifaro.com/en/abs/efficient-and-near-optimal-algorithms-for-sampling-small-connected-subgraphs-2007.121022021-10-29 https://scifaro.com/en/abs/the-asymmetric-travelling-salesman-problem-in-sparse-digraphs-2007.121202020-10-02 https://scifaro.com/en/abs/computing-nearest-neighbour-interchange-distances-between-ranked-phylogenetic-trees-2007.123072020-07-27 https://scifaro.com/en/abs/tight-distributed-sketching-lower-bound-for-connectivity-2007.123232020-07-27 https://scifaro.com/en/abs/improved-approximation-schemes-for-early-work-scheduling-on-identical-parallel-machines-with-common-due-date-2007.123882020-07-27 https://scifaro.com/en/abs/tromino-tilings-with-pegs-via-flow-networks-2007.126512021-03-16 https://scifaro.com/en/abs/sublinear-time-algorithms-for-computing-embedding-gap-edit-distance-2007.127622020-11-17 https://scifaro.com/en/abs/improved-analysis-of-ranking-for-online-vertex-weighted-bipartite-matching-in-the-random-order-model-2007.128232022-11-09 https://scifaro.com/en/abs/efficient-approximation-schemes-for-stochastic-probing-and-selection-stopping-problems-2007.131212025-05-30 https://scifaro.com/en/abs/resource-augmentation-2007.132342020-07-28 https://scifaro.com/en/abs/distributional-analysis-2007.132402020-07-28 https://scifaro.com/en/abs/beyond-the-worst-case-analysis-of-algorithms-introduction-2007.132412020-07-28 https://scifaro.com/en/abs/optimal-construction-of-a-layer-ordered-heap-2007.133562020-08-18 https://scifaro.com/en/abs/improved-3-pass-algorithm-for-counting-4-cycles-in-arbitrary-order-streaming-2007.134662020-07-28 https://scifaro.com/en/abs/internal-quasiperiod-queries-2007.134712020-07-28 https://scifaro.com/en/abs/the-complexity-of-the-distributed-constraint-satisfaction-problem-2007.135942021-01-25 https://scifaro.com/en/abs/new-fpt-algorithms-for-finding-the-temporal-hybridization-number-for-sets-of-phylogenetic-trees-2007.136152022-11-09 https://scifaro.com/en/abs/symmetries-from-proofs-to-algorithms-and-back-2007.136942021-01-14 https://scifaro.com/en/abs/counting-short-vector-pairs-by-inner-product-and-relations-to-the-permanent-2007.140922020-07-29 https://scifaro.com/en/abs/dual-half-integrality-for-uncrossable-cut-cover-and-its-application-to-maximum-half-integral-flow-2007.141562020-07-29 https://scifaro.com/en/abs/twin-width-iii-max-independent-set-min-dominating-set-and-coloring-2007.141612021-02-15 https://scifaro.com/en/abs/close-relatives-of-feedback-vertex-set-without-single-exponential-algorithms-parameterized-by-treewidth-2007.141792020-07-29 https://scifaro.com/en/abs/graph-spanners-by-sketching-in-dynamic-streams-and-the-simultaneous-communication-model-2007.142042020-11-16 https://scifaro.com/en/abs/the-complexity-of-the-partition-coloring-problem-2007.142252020-07-29 https://scifaro.com/en/abs/the-satisfactory-partition-problem-2007.143392020-07-29 https://scifaro.com/en/abs/a-simple-sublinear-algorithm-for-gap-edit-distance-2007.143682020-07-29 https://scifaro.com/en/abs/computing-weighted-subset-transversals-in-h-free-graphs-2007.145142021-06-16 https://scifaro.com/en/abs/deterministic-distributed-expander-decomposition-and-routing-with-applications-in-distributed-derandomization-2007.148982020-07-30 https://scifaro.com/en/abs/approximate-ridesharing-of-personal-vehicles-problem-2007.151542021-06-01 https://scifaro.com/en/abs/local-conflict-coloring-revisited-linial-for-lists-2007.152512020-07-31 https://scifaro.com/en/abs/synchronized-planarity-with-applications-to-constrained-planarity-problems-2007.153622021-07-23 https://scifaro.com/en/abs/efficient-tensor-decomposition-2007.155892020-07-31 https://scifaro.com/en/abs/an-asymptotic-lower-bound-for-online-vector-bin-packing-2007.157092020-08-06 https://scifaro.com/en/abs/distribution-free-models-of-social-networks-2007.157432020-08-03 https://scifaro.com/en/abs/robust-and-heavy-tailed-mean-estimation-made-simple-via-regret-minimization-2007.158392021-01-20 https://scifaro.com/en/abs/mspp-a-highly-efficient-and-scalable-algorithm-for-mining-similar-pairs-of-points-2007.161112020-08-03 https://scifaro.com/en/abs/on-the-two-dimensional-knapsack-problem-for-convex-polygons-2007.161442020-08-03 https://scifaro.com/en/abs/contiguous-graph-partitioning-for-optimal-total-or-bottleneck-communication-2007.161922024-10-30 https://scifaro.com/en/abs/on-the-computational-complexity-of-linear-discrepancy-2008.000442020-08-04 https://scifaro.com/en/abs/fast-classical-and-quantum-algorithms-for-online-k-server-problem-on-trees-2008.002702021-07-29 https://scifaro.com/en/abs/relational-algorithms-for-k-means-clustering-2008.003582021-05-24 https://scifaro.com/en/abs/minimum-2-vertex-strongly-biconnected-spanning-directed-subgraph-problem-2008.004962022-05-10 https://scifaro.com/en/abs/approximating-pathwidth-for-graphs-of-small-treewidth-2008.007792023-03-13 https://scifaro.com/en/abs/truly-asymptotic-lower-bounds-for-online-vector-bin-packing-2008.008112020-08-04 https://scifaro.com/en/abs/erratum-fast-and-simple-horizontal-coordinate-assignment-2008.012522020-08-05 https://scifaro.com/en/abs/top-k-connected-overlapping-densest-subgraphs-in-dual-networks-2008.015732020-08-05 https://scifaro.com/en/abs/list-k-colouring-p-t-free-graphs-a-mim-width-perspective-2008.015902021-08-27 https://scifaro.com/en/abs/bucket-oblivious-sort-an-extremely-simple-oblivious-sort-2008.017652021-04-30 https://scifaro.com/en/abs/a-data-structure-for-approximate-longest-common-subsequence-of-a-set-of-strings-2008.017682021-01-13 https://scifaro.com/en/abs/an-algorithm-framework-for-the-exact-solution-and-improved-approximation-of-the-maximum-weighted-independent-set-problem-2008.019612020-08-18 https://scifaro.com/en/abs/a-note-on-a-recent-algorithm-for-minimum-cut-2008.020602020-08-07 https://scifaro.com/en/abs/reducing-isotropy-and-volume-to-kls-faster-rounding-and-volume-algorithms-2008.021462024-08-30 https://scifaro.com/en/abs/geotree-a-data-structure-for-constant-time-geospatial-search-enabling-a-real-time-mix-adjusted-median-property-price-index-2008.021672020-08-06 https://scifaro.com/en/abs/low-congestion-shortcuts-for-graphs-excluding-dense-minors-2008.030912020-08-10 https://scifaro.com/en/abs/a-2-o-k-n-algorithm-for-k-cycle-in-minor-closed-graph-families-2008.031312020-08-10 https://scifaro.com/en/abs/stochastic-optimization-and-learning-for-two-stage-supplier-problems-2008.033252024-04-09 https://scifaro.com/en/abs/a-4-3-approximation-algorithm-for-the-minimum-2-edge-connected-multisubgraph-problem-in-the-half-integral-case-2008.033272020-08-11 https://scifaro.com/en/abs/parameterized-complexity-of-a-ell-path-packing-2008.034482020-08-11 https://scifaro.com/en/abs/a-simpler-strong-refutation-of-random-k-xor-2008.035562020-08-11 https://scifaro.com/en/abs/adjustable-coins-2008.036762020-08-11 https://scifaro.com/en/abs/sparsifying-the-operators-of-fast-matrix-multiplication-algorithms-2008.037592020-08-11 https://scifaro.com/en/abs/rectilinear-planarity-testing-of-plane-series-parallel-graphs-in-linear-time-2008.037842021-03-01 https://scifaro.com/en/abs/an-improved-exact-sampling-algorithm-for-the-standard-normal-distribution-2008.038552020-08-11 https://scifaro.com/en/abs/expected-performance-and-worst-case-scenario-analysis-of-the-divide-and-conquer-method-for-the-0-1-knapsack-problem-2008.041242022-08-09 https://scifaro.com/en/abs/connected-components-in-undirected-set-based-graphs-applications-in-object-oriented-model-manipulation-2008.041832020-11-30 https://scifaro.com/en/abs/approximation-in-poly-logarithmic-space-2008.044162021-02-23 https://scifaro.com/en/abs/scheduling-activities-with-time-dependent-durations-and-resource-consumptions-2008.049492020-08-13 https://scifaro.com/en/abs/settling-seth-vs-approximate-sparse-directed-unweighted-diameter-up-to-nu-nseth-2008.051062021-04-05 https://scifaro.com/en/abs/further-unifying-the-landscape-of-cell-probe-lower-bounds-2008.051452020-11-03 https://scifaro.com/en/abs/boosting-data-reduction-for-the-maximum-weight-independent-set-problem-using-increasing-transformations-2008.051802020-08-14 https://scifaro.com/en/abs/tight-bounds-on-subexponential-time-approximation-of-set-cover-and-related-problems-2008.053742020-08-13 https://scifaro.com/en/abs/revisiting-modified-greedy-algorithm-for-monotone-submodular-maximization-with-a-knapsack-constraint-2008.053912021-01-14 https://scifaro.com/en/abs/soft-sequence-heaps-2008.053982020-08-13 https://scifaro.com/en/abs/deterministic-replacement-path-covering-2008.054212023-04-11 https://scifaro.com/en/abs/a-new-notion-of-commutativity-for-the-algorithmic-lov-a-sz-local-lemma-2008.055692025-09-09 https://scifaro.com/en/abs/graph-drawing-via-gradient-descent-gd-2-2008.055842020-08-14 https://scifaro.com/en/abs/cadences-in-grammar-compressed-strings-2008.055942020-08-14 https://scifaro.com/en/abs/cut-sparsification-of-the-clique-beyond-the-ramanujan-bound-a-separation-of-cut-versus-spectral-sparsification-2008.056482021-11-02 https://scifaro.com/en/abs/inset-edges-effect-and-average-distance-of-trees-2008.056742020-08-14 https://scifaro.com/en/abs/on-seat-allocation-problem-with-multiple-merit-lists-2008.058442020-08-14 https://scifaro.com/en/abs/consistent-k-median-simpler-better-and-robust-2008.061012020-08-17 https://scifaro.com/en/abs/on-the-hardness-of-massively-parallel-computation-2008.065542020-08-18 https://scifaro.com/en/abs/on-efficient-low-distortion-ultrametric-embedding-2008.067002020-08-18 https://scifaro.com/en/abs/finding-a-shortest-even-hole-in-polynomial-time-2008.067402022-01-06 https://scifaro.com/en/abs/selection-on-x-1-x-1-cdots-x-m-via-cartesian-product-tree-2008.070232020-08-18 https://scifaro.com/en/abs/approximate-hypergraph-vertex-cover-and-generalized-tuza-s-conjecture-2008.073442020-11-11 https://scifaro.com/en/abs/grundy-distinguishes-treewidth-from-pathwidth-2008.074252022-04-19 https://scifaro.com/en/abs/cardinality-estimation-using-gumbel-distribution-2008.075902020-08-19 https://scifaro.com/en/abs/sf-grass-solver-free-graph-spectral-sparsification-2008.076332020-08-19 https://scifaro.com/en/abs/new-quality-metrics-for-dynamic-graph-drawing-2008.077642020-08-25 https://scifaro.com/en/abs/minimum-eccentricity-shortest-path-problem-with-respect-to-structural-parameters-2008.078982022-07-25 https://scifaro.com/en/abs/four-short-stories-on-surprising-algorithmic-uses-of-treewidth-2008.079682020-08-19 https://scifaro.com/en/abs/sampling-multiple-edges-efficiently-2008.080322021-07-21 https://scifaro.com/en/abs/robust-mean-estimation-on-highly-incomplete-data-with-arbitrary-outliers-2008.080712021-05-04 https://scifaro.com/en/abs/disjoint-shortest-paths-with-congestion-on-dags-2008.083682021-07-08 https://scifaro.com/en/abs/efficient-graph-minors-theory-and-parameterized-algorithms-for-planar-disjoint-paths-2008.083732020-08-20 https://scifaro.com/en/abs/competitive-analysis-for-two-variants-of-online-metric-matching-problem-2008.084152020-10-01 https://scifaro.com/en/abs/modular-subset-sum-dynamic-strings-and-zero-sum-sets-2008.084172023-10-27 https://scifaro.com/en/abs/simple-counting-and-sampling-algorithms-for-graphs-with-bounded-pathwidth-2008.084792020-08-20 https://scifaro.com/en/abs/novel-results-on-the-number-of-runs-of-the-burrows-wheeler-transform-2008.085062024-04-16 https://scifaro.com/en/abs/a-simple-deterministic-algorithm-for-edge-connectivity-2008.085752020-08-20 https://scifaro.com/en/abs/the-power-of-hashing-with-mersenne-primes-2008.086542021-05-07 https://scifaro.com/en/abs/non-mergeable-sketching-for-cardinality-estimation-2008.087392021-02-17 https://scifaro.com/en/abs/faster-heuristics-for-graph-burning-2008.088112020-08-21 https://scifaro.com/en/abs/solving-problems-on-generalized-convex-graphs-via-mim-width-2008.090042024-02-06 https://scifaro.com/en/abs/greedy-approaches-to-online-stochastic-matching-2008.092602021-03-02 https://scifaro.com/en/abs/optimal-algorithm-for-computing-steiner-3-eccentricities-of-trees-2008.092992021-02-23 https://scifaro.com/en/abs/schematic-representation-of-large-biconnected-graphs-2008.094142020-10-28 https://scifaro.com/en/abs/optimal-metric-search-is-equivalent-to-the-minimum-dominating-set-problem-2008.096072020-11-03 https://scifaro.com/en/abs/metrics-and-ambits-and-sprawls-oh-my-2008.096542020-11-03 https://scifaro.com/en/abs/deletion-to-induced-matching-2008.096602020-11-30 https://scifaro.com/en/abs/structural-parameterizations-of-tracking-paths-problem-2008.098062020-08-25 https://scifaro.com/en/abs/on-the-size-of-minimal-separators-for-treedepth-decomposition-2008.098222020-12-15 https://scifaro.com/en/abs/improved-weighted-additive-spanners-2008.098772021-03-02 https://scifaro.com/en/abs/digraphs-homomorphism-problems-with-maltsev-condition-2008.099212020-11-13 https://scifaro.com/en/abs/node-connectivity-terminal-backup-separately-capacitated-multiflow-and-discrete-convexity-2008.100522020-08-25 https://scifaro.com/en/abs/streaming-submodular-matching-meets-the-primal-dual-method-2008.100622021-01-05 https://scifaro.com/en/abs/a-strategic-routing-framework-and-algorithms-for-computing-alternative-paths-2008.103162020-08-25 https://scifaro.com/en/abs/lazy-queue-layouts-of-posets-2008.103362020-08-26 https://scifaro.com/en/abs/fast-and-simple-modular-subset-sum-2008.105772020-11-02 https://scifaro.com/en/abs/a-unified-framework-for-light-spanners-2008.105822023-03-16 https://scifaro.com/en/abs/layered-drawing-of-undirected-graphs-with-generalized-port-constraints-2008.105832023-04-26 https://scifaro.com/en/abs/memoryless-worker-task-assignment-with-polylogarithmic-switching-cost-2008.107092022-05-02 https://scifaro.com/en/abs/efficient-hierarchical-clustering-for-classification-and-anomaly-detection-2008.108282020-08-26 https://scifaro.com/en/abs/o-reach-even-faster-reachability-in-large-graphs-2008.109322021-02-02 https://scifaro.com/en/abs/accelerating-force-directed-graph-drawing-with-rt-cores-2008.112352020-08-27 https://scifaro.com/en/abs/inapproximability-of-diameter-in-super-linear-time-beyond-the-5-3-ratio-2008.113152021-02-09 https://scifaro.com/en/abs/high-performance-parallel-graph-coloring-with-strong-guarantees-on-work-depth-and-quality-2008.113212020-11-12 https://scifaro.com/en/abs/a-cost-scaling-algorithm-for-computing-the-degree-of-determinants-2008.113882020-11-11 https://scifaro.com/en/abs/vertex-ordering-algorithms-for-graph-coloring-problem-2008.114542020-08-27 https://scifaro.com/en/abs/on-the-approximability-of-the-traveling-salesman-problem-with-line-neighborhoods-2008.120752024-04-23 https://scifaro.com/en/abs/the-k-interchange-constrained-diameter-of-a-transit-network-a-connectedness-indicator-that-accounts-for-travel-convenience-2008.122592020-08-28 https://scifaro.com/en/abs/polynomial-time-trace-reconstruction-in-the-smoothed-complexity-model-2008.123862020-08-31 https://scifaro.com/en/abs/differentially-private-clustering-via-maximum-coverage-2008.123882020-08-31 https://scifaro.com/en/abs/tight-bound-for-the-number-of-distinct-palindromes-in-a-tree-2008.132092020-11-30 https://scifaro.com/en/abs/low-depth-parallel-algorithms-for-the-binary-forking-model-without-atomics-2008.132922020-09-04 https://scifaro.com/en/abs/zoomless-maps-external-labeling-methods-for-the-interactive-exploration-of-dense-point-sets-at-a-fixed-map-scale-2008.135562020-09-01 https://scifaro.com/en/abs/sorting-by-prefix-block-interchanges-2008.136402022-08-29 https://scifaro.com/en/abs/online-search-with-a-hint-2008.137292020-09-15 https://scifaro.com/en/abs/estimating-rank-one-spikes-from-heavy-tailed-noise-via-self-avoiding-walks-2008.137352022-02-22 https://scifaro.com/en/abs/localized-topological-simplification-of-scalar-data-2009.000832020-09-02 https://scifaro.com/en/abs/sorting-an-array-using-the-topological-sort-of-a-corresponding-comparison-graph-2009.000982020-09-02 https://scifaro.com/en/abs/on-the-computational-tractability-of-a-geographic-clustering-problem-arising-in-redistricting-2009.001882020-09-02 https://scifaro.com/en/abs/obtuse-lattice-bases-2009.003842020-09-10 https://scifaro.com/en/abs/simpler-and-stronger-approaches-for-non-uniform-hypergraph-matching-and-the-f-uredi-kahn-and-seymour-conjecture-2009.006972020-11-03 https://scifaro.com/en/abs/fully-dynamic-submodular-cover-with-bounded-recourse-2009.008002025-10-13 https://scifaro.com/en/abs/structural-iterative-rounding-for-generalized-k-median-problems-2009.008082020-09-03 https://scifaro.com/en/abs/towards-constant-factor-approximation-for-chordal-distance-hereditary-vertex-deletion-2009.008092020-09-03 https://scifaro.com/en/abs/nearest-neighbor-search-for-hyperbolic-embeddings-2009.008362020-09-03 https://scifaro.com/en/abs/reconstructing-the-dynamic-sea-surface-from-tide-gauge-records-using-optimal-data-dependent-triangulations-2009.010122020-09-04 https://scifaro.com/en/abs/near-quadratic-lower-bounds-for-two-pass-graph-streaming-algorithms-2009.011612023-04-17 https://scifaro.com/en/abs/differentially-private-k-means-clustering-via-exponential-mechanism-and-max-cover-2009.012202020-09-03 https://scifaro.com/en/abs/circular-trace-reconstruction-2009.013462020-12-15 https://scifaro.com/en/abs/zuckerli-a-new-compressed-representation-for-graphs-2009.013532020-09-04 https://scifaro.com/en/abs/new-results-and-bounds-on-online-facility-assignment-problem-2009.014462020-09-04 https://scifaro.com/en/abs/physarum-inspired-multi-commodity-flow-dynamics-2009.014982022-08-31 https://scifaro.com/en/abs/optimal-load-balanced-demand-distribution-under-overload-penalties-2009.017652020-09-04 https://scifaro.com/en/abs/bipartite-matching-in-nearly-linear-time-on-moderately-dense-graphs-2009.018022021-10-15 https://scifaro.com/en/abs/efficient-algorithms-to-mine-maximal-span-trusses-from-temporal-graphs-2009.019282020-10-06 https://scifaro.com/en/abs/practical-and-parallelizable-algorithms-for-non-monotone-submodular-maximization-with-size-constraint-2009.019472024-02-21 https://scifaro.com/en/abs/smoothed-analysis-of-the-condition-number-under-low-rank-perturbations-2009.019862021-07-15 https://scifaro.com/en/abs/fair-and-useful-cohort-selection-2009.022072022-04-07 https://scifaro.com/en/abs/access-adaptive-priority-search-tree-2009.022332022-07-19 https://scifaro.com/en/abs/deterministic-decremental-reachability-scc-and-shortest-paths-via-directed-expanders-and-congestion-balancing-2009.025842021-01-19 https://scifaro.com/en/abs/source-coding-with-free-bits-and-the-multi-way-number-partitioning-problem-2009.027102026-01-30 https://scifaro.com/en/abs/multi-pass-graph-streaming-lower-bounds-for-cycle-counting-max-cut-matching-size-and-other-problems-2009.030382021-04-20 https://scifaro.com/en/abs/faster-motif-counting-via-succinct-color-coding-and-adaptive-sampling-2009.030522021-07-20 https://scifaro.com/en/abs/achieving-anonymity-via-weak-lower-bound-constraints-for-k-median-and-k-means-2009.030782021-08-18 https://scifaro.com/en/abs/efficient-network-reliability-computation-in-uncertain-graphs-2009.031582020-09-08 https://scifaro.com/en/abs/a-potential-reduction-inspired-algorithm-for-exact-max-flow-in-almost-widetilde-o-m-4-3-time-2009.032602020-09-08 https://scifaro.com/en/abs/a-fast-randomized-algorithm-for-finding-the-maximal-common-subsequences-2009.033522020-09-09 https://scifaro.com/en/abs/a-lightweight-algorithm-to-uncover-deep-relationships-in-data-tables-2009.033582020-09-09 https://scifaro.com/en/abs/probabilistic-analysis-of-algorithms-for-cost-constrained-minimum-weighted-combinatorial-objects-2009.034162021-06-01 https://scifaro.com/en/abs/space-efficient-merging-of-de-bruijn-graphs-and-wheeler-graphs-2009.036752021-07-13 https://scifaro.com/en/abs/finding-diverse-trees-paths-and-more-2009.036872020-12-15 https://scifaro.com/en/abs/adwords-in-a-panorama-2009.041142020-11-30 https://scifaro.com/en/abs/sensitivity-analysis-of-the-maximum-matching-problem-2009.045562020-09-11 https://scifaro.com/en/abs/diverse-pairs-of-matchings-2009.045672020-09-11 https://scifaro.com/en/abs/a-performance-study-of-some-approximation-algorithms-for-minimum-dominating-set-in-a-graph-2009.046362020-09-11 https://scifaro.com/en/abs/backtracking-algorithms-for-constructing-the-hamiltonian-decomposition-of-a-4-regular-multigraph-2009.047422022-05-27 https://scifaro.com/en/abs/a-normal-sequence-compressed-by-ppm-but-not-by-lempel-ziv-78-2009.048272021-01-21 https://scifaro.com/en/abs/quick-streaming-algorithms-for-maximization-of-monotone-submodular-functions-in-linear-time-2009.049792021-03-09 https://scifaro.com/en/abs/near-linear-size-hypergraph-cut-sparsifiers-2009.049922020-09-11 https://scifaro.com/en/abs/on-light-spanners-low-treewidth-embeddings-and-efficient-traversing-in-minor-free-graphs-2009.050392020-09-11 https://scifaro.com/en/abs/fault-tolerant-edge-disjoint-paths-beyond-uniform-faults-2009.053822020-09-14 https://scifaro.com/en/abs/robust-production-planning-with-budgeted-cumulative-demand-uncertainty-2009.057362020-09-15 https://scifaro.com/en/abs/simple-deterministic-constant-round-coloring-in-the-congested-clique-2009.060432020-09-15 https://scifaro.com/en/abs/on-fault-tolerant-feedback-vertex-set-2009.060632020-09-15 https://scifaro.com/en/abs/cut-equivalent-trees-are-optimal-for-min-cut-queries-2009.060902020-09-15 https://scifaro.com/en/abs/space-efficient-interior-point-method-with-applications-to-linear-programming-and-maximum-weight-bipartite-matching-2009.061062023-05-19 https://scifaro.com/en/abs/optimal-testing-of-discrete-distributions-with-high-probability-2009.065402020-09-15 https://scifaro.com/en/abs/spatio-temporal-top-k-similarity-search-for-trajectories-in-graphs-2009.067782020-10-20 https://scifaro.com/en/abs/approximation-algorithms-for-the-generalized-incremental-knapsack-problem-2009.072482020-09-16 https://scifaro.com/en/abs/an-improved-quantum-inspired-algorithm-for-linear-regression-2009.072682022-07-06 https://scifaro.com/en/abs/positivity-preserving-extensions-of-sum-of-squares-pseudomoments-over-the-hypercube-2009.072692020-09-16 https://scifaro.com/en/abs/on-symmetric-rectilinear-matrix-partitioning-2009.077352020-09-17 https://scifaro.com/en/abs/the-limits-of-pan-privacy-and-shuffle-privacy-for-learning-and-estimation-2009.080002020-12-07 https://scifaro.com/en/abs/p-edge-vertex-connected-vertex-cover-parameterized-and-approximation-algorithms-2009.081582022-08-23 https://scifaro.com/en/abs/algorithms-and-complexity-for-variants-of-covariates-fine-balance-2009.081722020-09-18 https://scifaro.com/en/abs/metrical-service-systems-with-transformations-2009.082662020-09-18 https://scifaro.com/en/abs/near-optimal-decremental-hopsets-with-applications-2009.084162022-08-05 https://scifaro.com/en/abs/coordinate-methods-for-matrix-games-2009.084472020-09-18 https://scifaro.com/en/abs/deterministic-algorithms-for-decremental-shortest-paths-via-layered-core-decomposition-2009.084792020-09-21 https://scifaro.com/en/abs/longest-common-subsequence-in-sublinear-space-2009.085882020-09-21 https://scifaro.com/en/abs/efficient-constant-factor-approximate-enumeration-of-minimal-subsets-for-monotone-properties-with-weight-constraints-2009.088302024-10-03 https://scifaro.com/en/abs/delay-optimization-of-combinational-logic-by-and-or-path-restructuring-2009.088442020-09-21 https://scifaro.com/en/abs/on-combinatorial-optimization-for-dominating-sets-literature-survey-new-models-2009.092882020-09-22 https://scifaro.com/en/abs/tadoc-text-analytics-directly-on-compression-2009.094422020-09-22 https://scifaro.com/en/abs/distributed-algorithms-for-matching-in-hypergraphs-2009.096052020-09-22 https://scifaro.com/en/abs/the-complexity-landscape-of-distributed-locally-checkable-problems-on-trees-2009.096452020-09-22 https://scifaro.com/en/abs/a-novel-method-for-inference-of-acyclic-chemical-compounds-with-bounded-branch-height-based-on-artificial-neural-networks-and-integer-programming-2009.096462020-09-22 https://scifaro.com/en/abs/efficiently-computing-maximum-flows-in-scale-free-networks-2009.096782020-09-22 https://scifaro.com/en/abs/length-bounded-paths-interdiction-in-continuous-domain-for-network-performance-assessment-2009.099552020-09-22 https://scifaro.com/en/abs/space-time-efficient-rdf-stores-based-on-circular-suffix-sorting-2009.100452024-10-30 https://scifaro.com/en/abs/on-rooted-k-connectivity-problems-in-quasi-bipartite-digraphs-2009.101602023-07-26 https://scifaro.com/en/abs/a-faster-interior-point-method-for-semidefinite-programming-2009.102172020-09-23 https://scifaro.com/en/abs/computing-l-p-1-labeling-with-combined-parameters-2009.105022020-10-20 https://scifaro.com/en/abs/on-the-locality-of-nash-williams-forest-decomposition-and-star-forest-decomposition-2009.107612023-10-13 https://scifaro.com/en/abs/timeliness-aware-on-site-planning-method-for-tour-navigation-2009.110402020-09-24 https://scifaro.com/en/abs/bounds-on-the-spectral-sparsification-of-symmetric-and-off-diagonal-nonnegative-real-matrices-2009.111332021-03-02 https://scifaro.com/en/abs/sampling-an-edge-uniformly-in-sublinear-time-2009.111782020-09-24 https://scifaro.com/en/abs/convergence-of-gibbs-sampling-coordinate-hit-and-run-mixes-fast-2009.113382022-03-03 https://scifaro.com/en/abs/dynamic-approximate-maximum-independent-set-on-massive-graphs-2009.114352022-04-19 https://scifaro.com/en/abs/dynamic-similarity-search-on-integer-sketches-2009.115592020-09-25 https://scifaro.com/en/abs/an-asymptotically-fast-polynomial-space-algorithm-for-hamiltonicity-detection-in-sparse-directed-graphs-2009.117802020-09-25 https://scifaro.com/en/abs/a-case-for-partitioned-bloom-filters-2009.117892022-11-10 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-textsc-maximum-degree-contraction-problem-2009.117932020-09-25 https://scifaro.com/en/abs/complexity-of-scheduling-few-types-of-jobs-on-related-and-unrelated-machines-2009.118402020-09-25 https://scifaro.com/en/abs/online-hypergraph-matching-with-delays-2009.120222020-09-28 https://scifaro.com/en/abs/finding-a-maximum-minimal-separator-graph-classes-and-fixed-parameter-tractability-2009.121842020-09-28 https://scifaro.com/en/abs/an-spqr-tree-like-embedding-representation-for-level-planarity-2009.123092020-09-28 https://scifaro.com/en/abs/hypergraph-k-cut-for-fixed-k-in-deterministic-polynomial-time-2009.124422020-09-29 https://scifaro.com/en/abs/a-block-based-triangle-counting-algorithm-on-heterogeneous-environments-2009.124572020-09-29 https://scifaro.com/en/abs/the-smoothed-complexity-of-frank-wolfe-methods-via-conditioning-of-random-matrices-and-polytopes-2009.126852020-11-26 https://scifaro.com/en/abs/rank-select-queries-over-mutable-bitmaps-2009.128092022-02-08 https://scifaro.com/en/abs/the-complexity-of-connectivity-problems-in-forbidden-transition-graphs-and-edge-colored-graphs-2009.128922020-09-29 https://scifaro.com/en/abs/discrimination-of-attractors-with-noisy-nodes-in-boolean-networks-2009.131982021-06-14 https://scifaro.com/en/abs/approximation-algorithms-for-connectivity-augmentation-problems-2009.132572020-11-17 https://scifaro.com/en/abs/explorable-uncertainty-in-scheduling-with-non-uniform-testing-times-2009.133162021-08-20 https://scifaro.com/en/abs/a-note-on-differentially-private-clustering-with-large-additive-error-2009.133172020-09-29 https://scifaro.com/en/abs/constructing-large-matchings-via-query-access-to-a-maximal-matching-oracle-2009.134092020-10-02 https://scifaro.com/en/abs/quasi-polynomial-time-algorithm-for-independent-set-in-p-t-free-graphs-via-shrinking-the-space-of-induced-paths-2009.134942020-11-18 https://scifaro.com/en/abs/improved-fpt-algorithms-for-deletion-to-forest-like-structures-2009.139492020-09-30 https://scifaro.com/en/abs/how-do-you-want-your-greedy-simultaneous-or-repeated-2009.139982021-07-15 https://scifaro.com/en/abs/on-the-mixing-time-of-coordinate-hit-and-run-2009.140042022-04-12 https://scifaro.com/en/abs/online-simple-knapsack-with-reservation-costs-2009.140432022-02-07 https://scifaro.com/en/abs/clustering-under-perturbation-stability-in-near-linear-time-2009.143582020-10-01 https://scifaro.com/en/abs/truly-subquadratic-exact-distance-oracles-with-constant-query-time-for-planar-graphs-2009.147162020-10-01 https://scifaro.com/en/abs/travelling-salesman-paths-on-demidenko-matrices-2009.147462020-10-01 https://scifaro.com/en/abs/efficient-time-and-space-representation-of-uncertain-event-data-2010.003342022-04-09 https://scifaro.com/en/abs/counting-4-patterns-in-permutations-is-equivalent-to-counting-4-cycles-in-graphs-2010.003482020-10-02 https://scifaro.com/en/abs/from-trees-to-continuous-embeddings-and-back-hyperbolic-hierarchical-clustering-2010.004022020-10-02 https://scifaro.com/en/abs/competitive-algorithms-for-the-online-multiple-knapsack-problem-with-application-to-electric-vehicle-charging-2010.004122020-10-20 https://scifaro.com/en/abs/splay-trees-on-trees-2010.009312020-10-29 https://scifaro.com/en/abs/decremental-apsp-in-directed-graphs-versus-an-adaptive-adversary-2010.009372020-10-05 https://scifaro.com/en/abs/efficient-estimation-of-graph-trussness-2010.009672020-10-05 https://scifaro.com/en/abs/tight-approximation-guarantees-for-concave-coverage-problems-2010.009702021-05-04 https://scifaro.com/en/abs/a-weight-scaling-algorithm-for-f-factors-of-multigraphs-2010.011022020-10-05 https://scifaro.com/en/abs/privately-answering-counting-queries-with-generalized-gaussian-mechanisms-2010.014572020-10-06 https://scifaro.com/en/abs/inapproximability-for-local-correlation-clustering-and-dissimilarity-hierarchical-clustering-2010.014592020-10-06 https://scifaro.com/en/abs/a-fully-polynomial-time-approximation-scheme-for-the-replenishment-storage-problem-2010.016312020-10-06 https://scifaro.com/en/abs/no-quantum-speedup-over-gradient-descent-for-non-smooth-convex-optimization-2010.018012020-10-06 https://scifaro.com/en/abs/generalized-cuckoo-hashing-with-a-stash-revisited-2010.018902023-01-03 https://scifaro.com/en/abs/improved-submodular-secretary-problem-with-shortlists-2010.019012021-02-22 https://scifaro.com/en/abs/optimal-bounds-for-approximate-counting-2010.021162022-04-01 https://scifaro.com/en/abs/a-query-efficient-quantum-algorithm-for-maximum-matching-on-general-graphs-2010.023242021-10-27 https://scifaro.com/en/abs/how-to-send-a-real-number-using-a-single-bit-and-some-shared-randomness-2010.023312021-05-21 https://scifaro.com/en/abs/a-parallel-batch-dynamic-data-structure-for-the-closest-pair-problem-2010.023792021-03-25 https://scifaro.com/en/abs/a-note-on-exponential-time-algorithms-for-linearwidth-2010.023882021-03-08 https://scifaro.com/en/abs/fast-decreasekey-heaps-with-worst-case-variants-2010.025072020-11-20 https://scifaro.com/en/abs/the-approximation-ratio-of-the-2-opt-heuristic-for-the-euclidean-traveling-salesman-problem-2010.025832021-01-26 https://scifaro.com/en/abs/a-faster-algorithm-for-finding-tarski-fixed-points-2010.026182021-03-23 https://scifaro.com/en/abs/efficiently-approximating-vertex-cover-on-scale-free-networks-with-underlying-hyperbolic-geometry-2010.027872023-12-14 https://scifaro.com/en/abs/learning-a-mixture-of-two-subspaces-over-finite-fields-2010.028412021-02-16 https://scifaro.com/en/abs/on-additive-approximate-submodularity-2010.029122020-10-08 https://scifaro.com/en/abs/greta-graph-based-real-time-event-trend-aggregation-2010.029882020-10-08 https://scifaro.com/en/abs/an-improvement-of-reed-s-treewidth-approximation-2010.031052022-06-24 https://scifaro.com/en/abs/structured-logconcave-sampling-with-a-restricted-gaussian-oracle-2010.031062021-10-25 https://scifaro.com/en/abs/new-verification-schemes-for-frequency-based-functions-on-data-streams-2010.032872020-10-08 https://scifaro.com/en/abs/recognizing-unit-interval-graphs-by-zigzag-graph-searches-2010.033542020-10-08 https://scifaro.com/en/abs/query-minimization-under-stochastic-uncertainty-2010.035172021-09-27 https://scifaro.com/en/abs/an-improved-exact-algorithm-for-the-exact-satisfiability-problem-2010.038502020-12-15 https://scifaro.com/en/abs/online-allocation-of-reusable-resources-via-algorithms-guided-by-fluid-approximations-2010.039832022-07-20 https://scifaro.com/en/abs/succinct-permutation-graphs-2010.041082022-09-27 https://scifaro.com/en/abs/sensitivity-analysis-of-submodular-function-maximization-2010.042812020-10-12 https://scifaro.com/en/abs/succinct-navigational-oracles-for-families-of-intersection-graphs-on-a-circle-2010.043332020-10-12 https://scifaro.com/en/abs/fair-and-representative-subset-selection-from-data-streams-2010.044122021-02-15 https://scifaro.com/en/abs/constant-time-connectivity-tests-2010.045272022-09-26 https://scifaro.com/en/abs/a-tale-of-two-trees-new-analysis-for-avl-tree-and-binary-heap-2010.047522020-10-13 https://scifaro.com/en/abs/the-complexity-of-mixed-connectivity-2010.047992020-10-13 https://scifaro.com/en/abs/generalizations-of-length-limited-huffman-coding-for-hierarchical-memory-settings-2010.050052021-10-22 https://scifaro.com/en/abs/approximation-algorithms-for-stochastic-minimum-norm-combinatorial-optimization-2010.051272020-11-04 https://scifaro.com/en/abs/on-structural-parameterizations-of-load-coloring-2010.051862020-10-13 https://scifaro.com/en/abs/growth-of-random-trees-by-leaf-attachment-2010.055892020-11-03 https://scifaro.com/en/abs/incomplete-directed-perfect-phylogeny-in-linear-time-2010.056442020-10-13 https://scifaro.com/en/abs/interval-query-problem-on-cube-free-median-graphs-2010.056522022-02-14 https://scifaro.com/en/abs/almost-linear-time-algorithms-for-minsum-k-sink-problems-on-dynamic-flow-path-networks-2010.057292020-10-13 https://scifaro.com/en/abs/graph-square-roots-of-small-distance-from-degree-one-graphs-2010.057332020-10-13 https://scifaro.com/en/abs/new-sublinear-algorithms-and-lower-bounds-for-lis-estimation-2010.058052021-02-12 https://scifaro.com/en/abs/a-refined-laser-method-and-faster-matrix-multiplication-2010.058462024-09-11 https://scifaro.com/en/abs/an-extension-of-the-birkhoff-von-neumann-theorem-to-non-bipartite-graphs-2010.059842020-10-16 https://scifaro.com/en/abs/unified-lower-bounds-for-interactive-high-dimensional-estimation-under-information-constraints-2010.065622022-11-17 https://scifaro.com/en/abs/lcm-from-fca-point-of-view-a-cbo-style-algorithm-with-speed-up-features-2010.069802021-01-25 https://scifaro.com/en/abs/contextual-pattern-matching-2010.070762020-10-15 https://scifaro.com/en/abs/more-on-ordered-open-end-bin-packing-2010.071192020-10-15 https://scifaro.com/en/abs/fast-generation-of-unlabelled-free-trees-using-weight-sequences-2010.072112021-02-24 https://scifaro.com/en/abs/an-approximate-dynamic-programming-approach-to-the-incremental-knapsack-problem-2010.076332020-10-16 https://scifaro.com/en/abs/large-very-dense-subgraphs-in-a-stream-of-edges-2010.077942023-06-22 https://scifaro.com/en/abs/near-linear-time-homomorphism-counting-in-bounded-degeneracy-graphs-the-barrier-of-long-induced-cycles-2010.080832020-11-20 https://scifaro.com/en/abs/improved-approximation-algorithms-for-stochastic-matching-problems-2010.081422020-10-19 https://scifaro.com/en/abs/restless-reachability-problems-in-temporal-graphs-2010.084232024-12-04 https://scifaro.com/en/abs/improving-schroeppel-and-shamir-s-algorithm-for-subset-sum-via-orthogonal-vectors-2010.085762021-04-13 https://scifaro.com/en/abs/lazy-search-trees-2010.088402020-10-20 https://scifaro.com/en/abs/solving-shisen-sho-boards-2010.090142020-10-20 https://scifaro.com/en/abs/on-near-linear-time-algorithms-for-dense-subset-sum-2010.090962020-10-20 https://scifaro.com/en/abs/diverse-data-selection-under-fairness-constraints-2010.091412020-10-20 https://scifaro.com/en/abs/eptas-for-k-means-clustering-of-affine-subspaces-2010.095802020-10-20 https://scifaro.com/en/abs/hutch-optimal-stochastic-trace-estimation-2010.096492021-06-14 https://scifaro.com/en/abs/constrained-order-prophet-inequalities-2010.097052020-10-20 https://scifaro.com/en/abs/sorting-short-keys-in-circuits-of-size-o-n-log-n-2010.098842020-10-28 https://scifaro.com/en/abs/new-techniques-and-fine-grained-hardness-for-dynamic-near-additive-spanners-2010.101342021-09-21 https://scifaro.com/en/abs/the-complexity-of-finding-and-enumerating-optimal-subgraphs-to-represent-spatial-correlation-2010.103142026-02-10 https://scifaro.com/en/abs/a-faster-parameterized-algorithm-for-temporal-matching-2010.104082021-04-26 https://scifaro.com/en/abs/smoothed-analysis-of-pareto-curves-in-multiobjective-optimization-2010.110642020-10-22 https://scifaro.com/en/abs/on-adaptive-distance-estimation-2010.112522020-12-17 https://scifaro.com/en/abs/query-strategies-for-priced-information-revisited-2010.113812020-10-23 https://scifaro.com/en/abs/deterministic-approximation-for-submodular-maximization-over-a-matroid-in-nearly-linear-time-2010.114202020-10-23 https://scifaro.com/en/abs/vertex-deletion-into-bipartite-permutation-graphs-2010.114402020-11-03 https://scifaro.com/en/abs/an-investigation-of-the-recoverable-robust-assignment-problem-2010.114562020-10-23 https://scifaro.com/en/abs/linear-delay-enumeration-for-minimal-steiner-problems-2010.114622022-05-13 https://scifaro.com/en/abs/the-polynomial-method-is-universal-for-distribution-free-correlational-sq-learning-2010.119252023-08-25 https://scifaro.com/en/abs/on-testing-of-samplers-2010.129182020-10-27 https://scifaro.com/en/abs/a-novel-move-to-front-or-logarithmic-position-mflp-online-list-update-algorithm-2010.130422020-10-27 https://scifaro.com/en/abs/even-the-easiest-graph-coloring-problem-is-not-easy-in-streaming-2010.131432020-10-27 https://scifaro.com/en/abs/an-improved-sketching-algorithm-for-edit-distance-2010.131702021-05-04 https://scifaro.com/en/abs/on-updating-and-querying-submatrices-2010.131802020-10-27 https://scifaro.com/en/abs/scheduling-with-complete-multipartite-incompatibility-graph-on-parallel-machines-2010.132072021-09-17 https://scifaro.com/en/abs/unifying-matrix-data-structures-simplifying-and-speeding-up-iterative-algorithms-2010.138882020-10-28 https://scifaro.com/en/abs/on-minimum-generalized-manhattan-connections-2010.143382020-10-28 https://scifaro.com/en/abs/simultaenous-sieves-a-deterministic-streaming-algorithm-for-non-monotone-submodular-maximization-2010.143672020-11-03 https://scifaro.com/en/abs/dynamic-boundary-time-warping-for-sub-sequence-matching-with-few-examples-2010.144642024-09-04 https://scifaro.com/en/abs/improved-algorithms-for-edge-colouring-in-the-w-streaming-model-2010.145602020-11-02 https://scifaro.com/en/abs/competitive-analysis-of-move-to-front-or-middle-mfm-online-list-update-algorithm-2010.147522020-10-29 https://scifaro.com/en/abs/almost-optimal-deterministic-treasure-hunt-in-arbitrary-graphs-2010.149162021-02-16 https://scifaro.com/en/abs/group-harmonic-and-group-closeness-maximization-approximation-and-engineering-2010.154352020-10-30 https://scifaro.com/en/abs/iteratively-reweighted-greedy-set-cover-2010.154762020-10-30 https://scifaro.com/en/abs/computing-crisp-bisimulations-for-fuzzy-structures-2010.156712023-06-02 https://scifaro.com/en/abs/a-more-pragmatic-implementation-of-the-lock-free-ordered-linked-list-2010.157552020-11-02 https://scifaro.com/en/abs/recursive-random-contraction-revisited-2010.157702020-10-30 https://scifaro.com/en/abs/eccentricity-queries-and-beyond-using-hub-labels-2010.157942020-10-30 https://scifaro.com/en/abs/isometric-embeddings-in-trees-and-their-use-in-the-diameter-problem-2010.158032020-10-30 https://scifaro.com/en/abs/a-local-search-framework-for-experimental-design-2010.158052020-12-21 https://scifaro.com/en/abs/around-the-diameter-of-at-free-graphs-2010.158142020-10-30 https://scifaro.com/en/abs/log-graph-a-near-optimal-high-performance-graph-representation-2010.158792020-11-02 https://scifaro.com/en/abs/active-sampling-count-sketch-ascs-for-online-sparse-estimation-of-a-trillion-scale-covariance-matrix-2010.159512021-06-14 https://scifaro.com/en/abs/near-optimal-distributed-implementations-of-dynamic-algorithms-for-symmetry-breaking-problems-2010.161772021-09-23 https://scifaro.com/en/abs/a-combinatorial-cut-toggling-algorithm-for-solving-laplacian-linear-systems-2010.163162023-03-20 https://scifaro.com/en/abs/online-edge-coloring-algorithms-via-the-nibble-method-2010.163762020-11-02 https://scifaro.com/en/abs/distance-problems-within-helly-graphs-and-k-helly-graphs-2011.000012020-11-03 https://scifaro.com/en/abs/monitoring-the-edges-of-a-graph-using-distances-2011.000292022-09-26 https://scifaro.com/en/abs/generalized-sorting-with-predictions-2011.001722020-11-03 https://scifaro.com/en/abs/a-lower-bound-for-dynamic-fractional-cascading-2011.005032020-11-05 https://scifaro.com/en/abs/best-match-graphs-with-binary-trees-2011.005112021-03-09 https://scifaro.com/en/abs/robust-sequence-submodular-maximization-2011.005422020-11-03 https://scifaro.com/en/abs/generalized-load-balancing-and-clustering-problems-with-norm-minimization-2011.008172021-02-23 https://scifaro.com/en/abs/optimal-transport-between-determinantal-point-processes-and-application-to-fast-simulation-2011.008222020-11-03 https://scifaro.com/en/abs/approximating-the-median-under-the-ulam-metric-2011.008682020-11-03 https://scifaro.com/en/abs/gourds-a-sliding-block-puzzle-with-turning-2011.009682020-11-03 https://scifaro.com/en/abs/constant-time-dynamic-weight-approximation-for-minimum-spanning-forest-2011.009772021-09-29 https://scifaro.com/en/abs/tight-bounds-for-online-graph-partitioning-2011.010172020-11-03 https://scifaro.com/en/abs/recent-advances-on-the-graph-isomorphism-problem-2011.013662021-01-15 https://scifaro.com/en/abs/robust-algorithms-for-online-convex-problems-via-primal-dual-2011.014352020-11-04 https://scifaro.com/en/abs/on-computing-stable-extensions-of-abstract-argumentation-frameworks-2011.014892021-09-15 https://scifaro.com/en/abs/secretary-matching-with-general-arrivals-2011.015592020-11-04 https://scifaro.com/en/abs/fast-computation-of-strong-control-dependencies-2011.015642021-09-21 https://scifaro.com/en/abs/search-problems-in-trees-with-symmetries-near-optimal-traversal-strategies-for-individualization-refinement-algorithms-2011.017262020-11-04 https://scifaro.com/en/abs/near-optimal-entrywise-sampling-of-numerically-sparse-matrices-2011.017772021-07-06 https://scifaro.com/en/abs/periodic-scheduling-and-packing-problems-2011.018982020-11-04 https://scifaro.com/en/abs/greedy-k-center-from-noisy-distance-samples-2011.019732022-04-05 https://scifaro.com/en/abs/the-min-cost-matching-with-concave-delays-problem-2011.020172020-11-05 https://scifaro.com/en/abs/beyond-worst-case-analysis-of-multicore-caching-strategies-2011.020462020-11-05 https://scifaro.com/en/abs/max-flow-vitality-in-undirected-unweighted-planar-graphs-2011.023752021-09-14 https://scifaro.com/en/abs/2-level-quasi-planarity-or-how-caterpillars-climb-spqr-trees-2011.024312020-11-05 https://scifaro.com/en/abs/approximating-the-discrete-time-cost-tradeoff-problem-with-bounded-depth-2011.024462021-04-22 https://scifaro.com/en/abs/algorithms-and-hardness-for-linear-algebra-on-geometric-graphs-2011.024662020-11-05 https://scifaro.com/en/abs/fast-exact-and-scalable-dynamic-ridesharing-2011.026012021-06-21 https://scifaro.com/en/abs/competitive-data-structure-dynamization-2011.026152024-07-25 https://scifaro.com/en/abs/instance-based-approximations-to-profile-maximum-likelihood-2011.027612020-11-06 https://scifaro.com/en/abs/a-smart-backtracking-algorithm-for-computing-set-partitions-with-parts-of-certain-sizes-2011.030042021-02-04 https://scifaro.com/en/abs/fast-approximation-algorithms-for-bounded-degree-and-crossing-spanning-tree-problems-2011.031942021-05-19 https://scifaro.com/en/abs/optimal-online-algorithms-for-file-bundle-caching-and-generalization-to-distributed-caching-2011.032122020-11-09 https://scifaro.com/en/abs/sensitivity-oracles-for-all-pairs-mincuts-2011.032912021-10-05 https://scifaro.com/en/abs/maximum-matchings-and-popularity-2011.034342020-11-09 https://scifaro.com/en/abs/fixed-parameter-approximation-scheme-for-min-max-k-cut-2011.034542020-11-09 https://scifaro.com/en/abs/semi-streaming-bipartite-matching-in-fewer-passes-and-optimal-space-2011.034952021-08-04 https://scifaro.com/en/abs/algorithmic-extensions-of-dirac-s-theorem-2011.036192024-04-15 https://scifaro.com/en/abs/settling-the-robust-learnability-of-mixtures-of-gaussians-2011.036222021-07-27 https://scifaro.com/en/abs/an-efficient-scheme-for-the-generation-of-ordered-trees-in-constant-amortized-time-2011.036362020-11-10 https://scifaro.com/en/abs/fast-low-space-algorithms-for-subset-sum-2011.038192020-11-10 https://scifaro.com/en/abs/combinatorial-bernoulli-factories-2011.038652024-02-21 https://scifaro.com/en/abs/tight-conditional-lower-bounds-for-approximating-diameter-in-directed-graphs-2011.038922020-11-12 https://scifaro.com/en/abs/sampling-constraint-satisfaction-solutions-in-the-local-lemma-regime-2011.039152021-04-13 https://scifaro.com/en/abs/the-hierarchical-chinese-postman-problem-the-slightest-disorder-makes-it-hard-yet-disconnectedness-is-manageable-2011.040222021-02-17 https://scifaro.com/en/abs/computing-lengths-of-non-crossing-shortest-paths-in-planar-graphs-2011.040472023-05-05 https://scifaro.com/en/abs/quantum-inspired-algorithms-from-randomized-numerical-linear-algebra-2011.041252022-06-30 https://scifaro.com/en/abs/near-optimal-learning-of-tree-structured-distributions-by-chow-liu-2011.041442021-07-23 https://scifaro.com/en/abs/an-aptas-for-bin-packing-with-clique-graph-conflicts-2011.042732021-06-08 https://scifaro.com/en/abs/ordered-k-median-with-outliers-and-fault-tolerance-2011.042892021-11-09 https://scifaro.com/en/abs/streaming-algorithms-for-geometric-steiner-forest-2011.043242024-05-14 https://scifaro.com/en/abs/deterministic-distributed-vertex-coloring-simpler-faster-and-without-network-decomposition-2011.045112021-09-07 https://scifaro.com/en/abs/balanced-crown-decomposition-for-connectivity-constraints-2011.045282021-06-25 https://scifaro.com/en/abs/reduced-rank-regression-with-operator-norm-error-2011.045642021-07-02 https://scifaro.com/en/abs/lincbo-fast-algorithm-for-computation-of-the-duquenne-guigues-basis-2011.049282021-01-25 https://scifaro.com/en/abs/speed-robust-scheduling-sand-bricks-and-rocks-2011.051812022-06-01 https://scifaro.com/en/abs/testability-of-relations-between-permutations-2011.052342024-07-11 https://scifaro.com/en/abs/improving-the-approximation-ratio-for-capacitated-vehicle-routing-2011.052352020-11-11 https://scifaro.com/en/abs/adaptive-community-search-in-dynamic-networks-2011.053532020-11-12 https://scifaro.com/en/abs/a-nearly-linear-time-algorithm-for-linear-programs-with-small-treewidth-a-multiscale-representation-of-robust-central-path-2011.053652023-09-14 https://scifaro.com/en/abs/sampling-matrices-from-harish-chandra-itzykson-zuber-densities-with-applications-to-quantum-inference-and-differential-privacy-2011.054172021-04-08 https://scifaro.com/en/abs/list-decoding-of-direct-sum-codes-2011.054672020-11-12 https://scifaro.com/en/abs/unique-decoding-of-explicit-epsilon-balanced-codes-near-the-gilbert-varshamov-bound-2011.055002020-11-12 https://scifaro.com/en/abs/an-instance-based-algorithm-for-deciding-the-bias-of-a-coin-2011.055022020-11-12 https://scifaro.com/en/abs/phoni-streamed-matching-statistics-with-multi-genome-references-2011.056102021-02-12 https://scifaro.com/en/abs/a-2-varepsilon-approximation-algorithm-for-preemptive-weighted-flow-time-on-a-single-machine-2011.056762020-11-12 https://scifaro.com/en/abs/counting-homomorphic-cycles-in-degenerate-graphs-2011.059572022-08-29 https://scifaro.com/en/abs/an-optimal-rounding-for-half-integral-weighted-minimum-strongly-connected-spanning-subgraph-2011.061082020-11-13 https://scifaro.com/en/abs/tree-embeddings-for-hop-constrained-network-design-2011.061122020-11-13 https://scifaro.com/en/abs/on-3-coloring-of-2p-4-c-5-free-graphs-2011.061732024-01-12 https://scifaro.com/en/abs/approximating-the-weighted-minimum-label-s-t-cut-problem-2011.062042020-11-13 https://scifaro.com/en/abs/online-virtual-machine-allocation-with-predictions-2011.062502020-11-13 https://scifaro.com/en/abs/fpt-algorithms-for-the-ell-matchoid-problem-with-a-coverage-objective-2011.062682022-12-14 https://scifaro.com/en/abs/communication-efficient-coresets-for-maximum-matching-2011.064812020-11-13 https://scifaro.com/en/abs/towards-tight-bounds-for-spectral-sparsification-of-hypergraphs-2011.065302021-04-13 https://scifaro.com/en/abs/towards-better-approximation-of-graph-crossing-number-2011.065452021-01-12 https://scifaro.com/en/abs/secretaries-with-advice-2011.067262020-11-16 https://scifaro.com/en/abs/matching-through-embedding-in-dense-graphs-2011.067672020-11-16 https://scifaro.com/en/abs/consistent-k-clustering-for-general-metrics-2011.068882020-11-16 https://scifaro.com/en/abs/the-submodular-santa-claus-problem-in-the-restricted-assignment-case-2011.069392020-11-16 https://scifaro.com/en/abs/kernel-density-estimation-through-density-constrained-near-neighbor-search-2011.069972020-11-16 https://scifaro.com/en/abs/parametric-graph-templates-properties-and-algorithms-2011.070012020-11-16 https://scifaro.com/en/abs/adaptive-learning-of-compressible-strings-2011.071432021-10-20 https://scifaro.com/en/abs/data-driven-algorithm-design-2011.071772020-11-17 https://scifaro.com/en/abs/entropy-conservation-for-comparison-based-algorithms-2011.072782020-11-17 https://scifaro.com/en/abs/learning-augmented-query-policies-2011.073852021-11-09 https://scifaro.com/en/abs/tight-bounds-for-adversarially-robust-streams-and-sliding-windows-via-difference-estimators-2011.074712022-10-24 https://scifaro.com/en/abs/combining-the-mersenne-twister-and-the-xorgens-designs-2011.079632020-11-17 https://scifaro.com/en/abs/a-grammar-compressor-for-collections-of-reads-with-applications-to-the-construction-of-the-bwt-2011.079992020-11-17 https://scifaro.com/en/abs/to-close-is-easier-than-to-open-dual-parameterization-to-k-median-2011.080832020-11-17 https://scifaro.com/en/abs/faster-connectivity-in-low-rank-hypergraphs-via-expander-decomposition-2011.080972021-11-16 https://scifaro.com/en/abs/the-longest-run-subsequence-problem-further-complexity-results-2011.081192021-06-23 https://scifaro.com/en/abs/exact-recovery-of-planted-cliques-in-semi-random-graphs-2011.084472025-12-09 https://scifaro.com/en/abs/optimal-diameter-computation-within-bounded-clique-width-graphs-2011.084482020-11-18 https://scifaro.com/en/abs/ultrasparse-ultrasparsifiers-and-faster-laplacian-system-solvers-2011.088062023-04-04 https://scifaro.com/en/abs/learning-augmented-weighted-paging-2011.090762021-11-10 https://scifaro.com/en/abs/engineering-a-fast-probabilistic-isomorphism-test-2011.093752020-11-19 https://scifaro.com/en/abs/non-adaptive-matroid-prophet-inequalities-2011.094062020-11-19 https://scifaro.com/en/abs/exact-nuclear-norm-completion-and-decomposition-for-random-overcomplete-tensors-via-degree-4-sos-2011.094162021-10-29 https://scifaro.com/en/abs/online-paging-with-a-vanishing-regret-2011.094392020-11-20 https://scifaro.com/en/abs/redistricting-algorithms-2011.095042020-11-20 https://scifaro.com/en/abs/algorithms-for-diameters-of-unicycle-graphs-and-diameter-optimally-augmenting-trees-2011.095912020-11-20 https://scifaro.com/en/abs/fully-dynamic-approximation-of-lis-in-polylogarithmic-time-2011.097612020-12-04 https://scifaro.com/en/abs/on-the-request-trip-vehicle-assignment-problem-2011.099522021-08-03 https://scifaro.com/en/abs/list-decodable-mean-estimation-in-nearly-pca-time-2011.099732020-11-20 https://scifaro.com/en/abs/illustrating-the-suitability-of-greedy-and-dynamic-algorithms-using-the-economics-concept-of-opportunity-cost-2011.100042020-11-20 https://scifaro.com/en/abs/subpath-queries-on-compressed-graphs-a-survey-2011.100082020-12-15 https://scifaro.com/en/abs/approximate-bipartite-vertex-cover-in-the-congest-model-2011.100142020-11-20 https://scifaro.com/en/abs/the-best-of-many-worlds-dual-mirror-descent-for-online-allocation-problems-2011.101242021-11-08 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-graph-constraint-logic-2011.103852020-11-23 https://scifaro.com/en/abs/modeling-and-engineering-constrained-shortest-path-algorithms-for-battery-electric-vehicles-2011.104002020-11-23 https://scifaro.com/en/abs/hop-constrained-oblivious-routing-2011.104462022-10-24 https://scifaro.com/en/abs/efficient-stream-based-max-min-diversification-with-minimal-failure-rate-2011.106592025-06-24 https://scifaro.com/en/abs/sparse-sketches-with-small-inversion-bias-2011.106952021-07-13 https://scifaro.com/en/abs/erd-o-s-szekeres-partitioning-problem-2011.108702020-11-24 https://scifaro.com/en/abs/improved-dynamic-algorithms-for-longest-increasing-subsequence-2011.108742021-03-11 https://scifaro.com/en/abs/online-maximum-k-interval-coverage-problem-2011.109382020-11-24 https://scifaro.com/en/abs/algorithmic-upper-bounds-for-graph-geodetic-number-2011.109892020-11-24 https://scifaro.com/en/abs/the-vlsat-1-benchmark-suite-2011.110492020-11-24 https://scifaro.com/en/abs/making-mean-estimation-more-efficient-using-an-mcmc-trace-variance-approach-dynamite-2011.111292021-08-06 https://scifaro.com/en/abs/searching-and-sorting-with-o-n-2-processors-in-o-1-time-2011.111442020-11-24 https://scifaro.com/en/abs/an-approximation-algorithm-for-covering-linear-programs-and-its-application-to-bin-packing-2011.112682020-12-18 https://scifaro.com/en/abs/speeding-up-decimal-multiplication-2011.115242020-12-11 https://scifaro.com/en/abs/analysis-of-the-harmonic-function-used-in-bin-packing-2011.116182020-12-18 https://scifaro.com/en/abs/an-estimator-for-matching-size-in-low-arboricity-graphs-with-two-applications-2011.117062020-11-26 https://scifaro.com/en/abs/selectable-heaps-and-optimal-lazy-search-trees-2011.117722022-01-11 https://scifaro.com/en/abs/algorithms-and-experiments-comparing-two-hierarchical-drawing-frameworks-2011.121552020-11-25 https://scifaro.com/en/abs/min-sum-clustering-with-outliers-2011.121692020-11-25 https://scifaro.com/en/abs/towards-the-sampling-lov-asz-local-lemma-2011.121962020-11-25 https://scifaro.com/en/abs/solving-the-r-pseudoforest-deletion-problem-in-time-independent-of-r-2011.125002020-11-26 https://scifaro.com/en/abs/left-lyndon-tree-construction-2011.127422020-11-26 https://scifaro.com/en/abs/grammar-compression-by-induced-suffix-sorting-2011.128982020-11-26 https://scifaro.com/en/abs/disjoint-stable-matchings-in-linear-time-2011.132482021-07-06 https://scifaro.com/en/abs/faster-projective-clustering-approximation-of-big-data-2011.134762020-11-30 https://scifaro.com/en/abs/near-linear-time-optimal-vertex-cut-sparsifiers-in-directed-acyclic-graphs-2011.134852021-07-06 https://scifaro.com/en/abs/minmax-regret-1-sink-location-problems-on-dynamic-flow-path-networks-with-parametric-weights-2011.135692020-11-30 https://scifaro.com/en/abs/near-optimal-algorithms-for-reachability-strongly-connected-components-and-shortest-paths-in-partially-dynamic-digraphs-2011.137022020-11-30 https://scifaro.com/en/abs/group-level-fairness-maximization-in-online-bipartite-matching-2011.139082021-05-24 https://scifaro.com/en/abs/online-search-with-maximum-clearance-2011.141442020-12-01 https://scifaro.com/en/abs/erasure-resilient-sublinear-time-graph-algorithms-2011.142912020-12-01 https://scifaro.com/en/abs/approximation-algorithms-for-hitting-subgraphs-2011.144502020-12-01 https://scifaro.com/en/abs/awlco-all-window-length-co-occurrence-2011.144602020-12-01 https://scifaro.com/en/abs/batch-optimization-for-dna-synthesis-2011.145322021-02-25 https://scifaro.com/en/abs/distributed-algorithms-from-arboreal-ants-for-the-shortest-path-problem-2011.147222023-07-04 https://scifaro.com/en/abs/isomorphism-testing-for-graphs-excluding-small-topological-subgraphs-2011.147302025-04-21 https://scifaro.com/en/abs/on-structural-parameterizations-of-the-selective-coloring-problem-2011.148012020-12-01 https://scifaro.com/en/abs/parameterized-algorithms-for-locating-dominating-sets-2011.148492023-10-10 https://scifaro.com/en/abs/windowed-prophet-inequalities-2011.149292020-12-01 https://scifaro.com/en/abs/burning-graphs-through-farthest-first-traversal-2011.150192022-03-21 https://scifaro.com/en/abs/vertex-sparsification-for-edge-connectivity-in-polynomial-time-2011.151012021-01-15 https://scifaro.com/en/abs/bridging-the-gap-between-tree-and-connectivity-augmentation-unified-and-stronger-approaches-2012.000862022-11-24 https://scifaro.com/en/abs/the-variable-processor-cup-game-2012.001272021-02-11 https://scifaro.com/en/abs/comb-inequalities-for-typical-euclidean-tsp-instances-2012.002922023-03-31 https://scifaro.com/en/abs/better-fewer-but-better-community-search-with-outliers-2012.003562020-12-07 https://scifaro.com/en/abs/new-results-for-the-k-secretary-problem-2012.004882020-12-02 https://scifaro.com/en/abs/improved-online-algorithms-for-knapsack-and-gap-in-the-random-order-model-2012.004972020-12-02 https://scifaro.com/en/abs/best-fit-bin-packing-with-random-order-revisited-2012.005112020-12-02 https://scifaro.com/en/abs/searching-sorting-and-cake-cutting-in-rounds-2012.007382023-11-21 https://scifaro.com/en/abs/huskysort-2012.008662020-12-03 https://scifaro.com/en/abs/electric-vehicle-charging-station-search-in-stochastic-environments-2012.008832020-12-03 https://scifaro.com/en/abs/average-case-algorithms-for-testing-isomorphism-of-polynomials-algebras-and-multilinear-forms-2012.010852023-06-22 https://scifaro.com/en/abs/computing-crisp-simulations-and-crisp-directed-simulations-for-fuzzy-graph-based-structures-2012.018452020-12-04 https://scifaro.com/en/abs/robustly-learning-mixtures-of-k-arbitrary-gaussians-2012.021192021-06-08 https://scifaro.com/en/abs/online-k-taxi-via-double-coverage-and-time-reverse-primal-dual-2012.022262020-12-07 https://scifaro.com/en/abs/average-case-integrality-gap-for-non-negative-principal-component-analysis-2012.022432020-12-07 https://scifaro.com/en/abs/an-o-n-time-algorithm-for-finding-hamilton-cycles-with-high-probability-2012.025512020-12-07 https://scifaro.com/en/abs/constant-round-distributed-domination-on-graph-classes-with-bounded-expansion-2012.027012021-06-29 https://scifaro.com/en/abs/polynomial-time-trace-reconstruction-in-the-low-deletion-rate-regime-2012.028442020-12-09 https://scifaro.com/en/abs/the-secretary-problem-with-distributions-2012.028882022-07-13 https://scifaro.com/en/abs/r-gathering-problems-on-spiders-hardness-fpt-algorithms-and-ptases-2012.029812020-12-08 https://scifaro.com/en/abs/majority-opinion-diffusion-in-social-networks-an-adversarial-approach-2012.031432020-12-08 https://scifaro.com/en/abs/fpras-approximation-of-the-matrix-permanent-in-practice-2012.033672020-12-08 https://scifaro.com/en/abs/a-proof-of-the-mv-matching-algorithm-2012.035822020-12-08 https://scifaro.com/en/abs/a-bounded-noise-mechanism-for-differential-privacy-2012.038172021-11-09 https://scifaro.com/en/abs/breaking-the-barrier-of-2-for-the-competitiveness-of-longest-queue-drop-2012.039062024-05-16 https://scifaro.com/en/abs/galloping-in-fast-growth-natural-merge-sorts-2012.039962023-12-04 https://scifaro.com/en/abs/almost-optimal-bounds-for-sublinear-time-sampling-of-k-cliques-sampling-cliques-is-harder-than-counting-2012.040902020-12-09 https://scifaro.com/en/abs/reading-articles-online-2012.043432020-12-09 https://scifaro.com/en/abs/algorithms-for-finding-k-in-k-means-2012.043882020-12-09 https://scifaro.com/en/abs/an-answer-to-the-bose-nelson-sorting-problem-for-11-and-12-channels-2012.044002022-07-26 https://scifaro.com/en/abs/maximum-coverage-with-cluster-constraints-an-lp-based-approximation-technique-2012.044202020-12-09 https://scifaro.com/en/abs/a-concentration-inequality-for-the-facility-location-problem-2012.044882022-07-26 https://scifaro.com/en/abs/an-improved-deterministic-parameterized-algorithm-for-cactus-vertex-deletion-2012.049102021-03-29 https://scifaro.com/en/abs/data-driven-competitive-algorithms-for-online-knapsack-and-set-cover-2012.053612020-12-11 https://scifaro.com/en/abs/matrix-multiplication-and-binary-space-partitioning-trees-an-exploration-2012.053652020-12-11 https://scifaro.com/en/abs/a-novel-algorithm-for-clearing-financial-obligations-between-companies-an-application-within-the-romanian-ministry-of-economy-2012.055642020-12-11 https://scifaro.com/en/abs/a-linear-time-algorithm-for-minimum-k-hop-dominating-set-of-a-cactus-graph-2012.058692020-12-11 https://scifaro.com/en/abs/four-algorithms-to-solve-symmetric-multi-type-non-negative-matrix-tri-factorization-problem-2012.059632020-12-14 https://scifaro.com/en/abs/faster-deterministic-modular-subset-sum-2012.060622021-09-21 https://scifaro.com/en/abs/online-coresets-for-clustering-with-bregman-divergences-2012.065222020-12-14 https://scifaro.com/en/abs/approximate-trace-reconstruction-2012.067132020-12-17 https://scifaro.com/en/abs/uniform-capacitated-facility-location-problems-with-penalties-outliers-2012.071352021-08-19 https://scifaro.com/en/abs/a-survey-of-sketches-in-traffic-measurement-design-optimization-application-and-implementation-2012.072142021-07-21 https://scifaro.com/en/abs/reflections-on-kernelizing-and-computing-unrooted-agreement-forests-2012.073542023-08-21 https://scifaro.com/en/abs/a-new-approach-to-regular-indeterminate-strings-2012.078922020-12-16 https://scifaro.com/en/abs/minimum-robust-multi-submodular-cover-for-fairness-2012.079362020-12-16 https://scifaro.com/en/abs/instance-optimal-join-size-estimation-2012.080832020-12-16 https://scifaro.com/en/abs/efficient-ptas-for-the-maximum-traveling-salesman-problem-in-a-metric-space-of-fixed-doubling-dimension-2012.083792021-08-24 https://scifaro.com/en/abs/simpler-and-unified-recognition-algorithm-for-path-graphs-and-directed-path-graphs-2012.084762025-05-07 https://scifaro.com/en/abs/sorting-lists-with-equal-keys-using-mergesort-in-linear-time-2012.085892020-12-17 https://scifaro.com/en/abs/reconstructing-decision-trees-2012.087352022-05-24 https://scifaro.com/en/abs/try-before-you-buy-a-practical-data-purchasing-algorithm-for-real-world-data-marketplaces-2012.088742020-12-17 https://scifaro.com/en/abs/greedy-reduction-from-shortest-linear-superstring-to-shortest-circular-superstring-2012.088782021-11-18 https://scifaro.com/en/abs/maximum-0-1-timed-matching-on-temporal-graphs-2012.089092022-02-02 https://scifaro.com/en/abs/on-avoiding-the-union-bound-when-answering-multiple-differentially-private-queries-2012.091162020-12-17 https://scifaro.com/en/abs/listing-small-minimal-separators-of-a-graph-2012.091532020-12-17 https://scifaro.com/en/abs/enhancing-balanced-graph-edge-partition-with-effective-local-search-2012.094512020-12-18 https://scifaro.com/en/abs/query-competitive-sorting-with-uncertainty-2012.094752021-04-16 https://scifaro.com/en/abs/sampling-arborescences-in-parallel-2012.095022020-12-18 https://scifaro.com/en/abs/induced-disjoint-paths-in-at-free-graphs-2012.098142021-10-28 https://scifaro.com/en/abs/fast-and-efficient-parallel-breadth-first-search-with-power-law-graph-transformation-2012.100262024-07-23 https://scifaro.com/en/abs/the-parameterized-suffix-tray-2012.100922021-02-05 https://scifaro.com/en/abs/subcubic-algorithms-for-gomory-hu-tree-in-unweighted-graphs-2012.102812021-04-16 https://scifaro.com/en/abs/results-on-competitiveness-of-online-shortest-remaining-processing-time-srpt-scheduling-with-special-classes-of-inputs-2012.103072020-12-21 https://scifaro.com/en/abs/outliers-detection-is-not-so-hard-approximation-algorithms-for-robust-clustering-problems-using-local-search-techniques-2012.108842021-01-01 https://scifaro.com/en/abs/pattern-matching-in-doubling-spaces-2012.109192020-12-22 https://scifaro.com/en/abs/sublinear-maximum-inner-product-search-using-concomitants-of-extreme-order-statistics-2012.110982021-08-19 https://scifaro.com/en/abs/efficient-sequential-and-parallel-algorithms-for-multistage-stochastic-integer-programming-using-proximity-2012.117422020-12-23 https://scifaro.com/en/abs/integer-division-by-constants-optimal-bounds-2012.123692021-11-16 https://scifaro.com/en/abs/recent-advances-in-practical-data-reduction-2012.125942021-01-01 https://scifaro.com/en/abs/library-of-efficient-algorithms-for-phylogenetic-analysis-2012.126972021-01-01 https://scifaro.com/en/abs/on-the-complexity-of-the-bilevel-minimum-spanning-tree-problem-2012.127702022-09-14 https://scifaro.com/en/abs/arithmetic-binary-search-trees-static-optimality-in-the-matching-model-2012.136982020-12-29 https://scifaro.com/en/abs/intervention-efficient-algorithms-for-approximate-learning-of-causal-graphs-2012.139762020-12-29 https://scifaro.com/en/abs/a-3-4-differential-approximation-algorithm-for-traveling-salesman-problem-2012.140792020-12-29 https://scifaro.com/en/abs/efficient-randomized-distributed-coloring-in-congest-2012.141692021-04-13 https://scifaro.com/en/abs/bounded-degree-cut-is-fixed-parameter-tractable-2012.141742020-12-29 https://scifaro.com/en/abs/approximation-algorithms-for-the-bottleneck-asymmetric-traveling-salesman-problem-2012.142332020-12-29 https://scifaro.com/en/abs/local-to-global-contraction-in-simplicial-complexes-2012.143172021-01-25 https://scifaro.com/en/abs/no-substitution-k-means-clustering-with-adversarial-order-2012.145122023-01-19 https://scifaro.com/en/abs/testing-product-distributions-a-closer-look-2012.146322021-05-27 https://scifaro.com/en/abs/new-partitioning-techniques-and-faster-algorithms-for-approximate-interval-scheduling-2012.150022023-02-27 https://scifaro.com/en/abs/improved-approximation-algorithms-for-weighted-edge-coloring-of-graphs-2012.150562021-01-01 https://scifaro.com/en/abs/test-score-algorithms-for-budgeted-stochastic-utility-maximization-2012.151942022-02-28 https://scifaro.com/en/abs/some-algorithms-on-exact-approximate-and-error-tolerant-graph-matching-2012.152792021-01-01 https://scifaro.com/en/abs/bundled-references-an-abstraction-for-highly-concurrent-linearizable-range-queries-2012.154382021-01-01 https://scifaro.com/en/abs/matching-on-the-line-admits-no-o-sqrt-log-n-competitive-algorithm-2012.155932021-01-01 https://scifaro.com/en/abs/minor-sparsifiers-and-the-distributed-laplacian-paradigm-2012.156752022-02-08 https://scifaro.com/en/abs/a-simple-combinatorial-algorithm-for-restricted-2-matchings-in-subcubic-graphs-via-half-edges-2012.157752021-01-01 https://scifaro.com/en/abs/the-query-complexity-of-local-search-and-brouwer-in-rounds-2101.000612025-12-15 https://scifaro.com/en/abs/climbing-lp-algorithms-2101.001012021-06-17 https://scifaro.com/en/abs/chunk-list-concurrent-data-structures-2101.001722022-02-21 https://scifaro.com/en/abs/setsketch-filling-the-gap-between-minhash-and-hyperloglog-2101.003142021-08-12 https://scifaro.com/en/abs/a-pessimist-s-approach-to-one-sided-matching-2101.005792023-06-26 https://scifaro.com/en/abs/solving-cut-problems-in-quadratic-time-for-graphs-with-bounded-treewidth-2101.006942022-10-14 https://scifaro.com/en/abs/text-searching-allowing-for-non-overlapping-adjacent-unbalanced-translocations-2101.007182021-01-05 https://scifaro.com/en/abs/binary-dynamic-time-warping-in-linear-time-2101.011082021-10-06 https://scifaro.com/en/abs/clan-embeddings-into-trees-and-low-treewidth-graphs-2101.011462021-04-16 https://scifaro.com/en/abs/sos-degree-reduction-with-applications-to-clustering-and-robust-moment-estimation-2101.015092021-01-06 https://scifaro.com/en/abs/on-the-approximation-relationship-between-optimizing-ratio-of-submodular-rs-and-difference-of-submodular-ds-functions-2101.016312022-09-12 https://scifaro.com/en/abs/split-block-bloom-filters-2101.017192023-01-24 https://scifaro.com/en/abs/fine-grained-complexity-of-regular-path-queries-2101.019452024-02-14 https://scifaro.com/en/abs/algorithms-and-hardness-for-multidimensional-range-updates-and-queries-2101.020032021-01-07 https://scifaro.com/en/abs/on-computing-pareto-optimal-paths-in-weighted-time-dependent-networks-2101.020862021-01-07 https://scifaro.com/en/abs/a-deterministic-parallel-apsp-algorithm-and-its-applications-2101.023112021-01-08 https://scifaro.com/en/abs/4-vs-7-sparse-undirected-unweighted-diameter-is-seth-hard-at-time-n-4-3-2101.023122023-12-15 https://scifaro.com/en/abs/planar-reachability-under-single-vertex-or-edge-failures-2101.025742021-01-08 https://scifaro.com/en/abs/almost-optimal-inapproximability-of-multidimensional-packing-problems-2101.028542021-06-04 https://scifaro.com/en/abs/cantor-mapping-technique-2101.031652021-01-11 https://scifaro.com/en/abs/shortest-non-separating-st-path-on-chordal-graphs-2101.035192021-02-10 https://scifaro.com/en/abs/unifying-the-global-and-local-approaches-an-efficient-power-iteration-with-forward-push-2101.036522021-04-27 https://scifaro.com/en/abs/refined-notions-of-parameterized-enumeration-kernels-with-applications-to-matching-cut-enumeration-2101.038002021-01-12 https://scifaro.com/en/abs/strictly-in-place-algorithms-for-permuting-and-inverting-permutations-2101.039782021-01-12 https://scifaro.com/en/abs/locality-sensitive-hashing-for-efficient-similar-polygon-retrieval-2101.043392021-02-22 https://scifaro.com/en/abs/envy-free-matchings-with-cost-controlled-quotas-2101.044252022-05-20 https://scifaro.com/en/abs/lattice-reduction-by-cubification-2101.045002022-05-10 https://scifaro.com/en/abs/diverse-collections-in-matroids-and-graphs-2101.046332021-01-13 https://scifaro.com/en/abs/improved-hierarchical-clustering-on-massive-datasets-with-broad-guarantees-2101.048182021-01-14 https://scifaro.com/en/abs/round-competitive-algorithms-for-uncertainty-problems-with-parallel-queries-2101.050322021-01-15 https://scifaro.com/en/abs/practical-fully-dynamic-minimum-cut-algorithms-2101.050332021-01-14 https://scifaro.com/en/abs/improving-run-length-encoding-by-preprocessing-2101.053292021-04-01 https://scifaro.com/en/abs/spectral-clustering-oracles-in-sublinear-time-2101.055492021-10-20 https://scifaro.com/en/abs/minimum-cost-flows-mdps-and-ell-1-regression-in-nearly-linear-time-for-dense-instances-2101.057192021-08-24 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-minimum-k-edge-connected-multi-subgraph-problem-2101.059212022-05-23 https://scifaro.com/en/abs/new-approximation-algorithms-for-forest-closeness-centrality-for-individual-vertices-and-vertex-groups-2101.061922021-01-18 https://scifaro.com/en/abs/the-complexity-of-bicriteria-tree-depth-2101.066452021-05-31 https://scifaro.com/en/abs/data-stream-fusion-for-accurate-quantile-tracking-and-analysis-2101.067582021-01-19 https://scifaro.com/en/abs/an-fpt-algorithm-for-matching-cut-and-d-cut-2101.069982024-06-03 https://scifaro.com/en/abs/deterministic-decremental-sssp-and-approximate-min-cost-flow-in-almost-linear-time-2101.071492021-01-20 https://scifaro.com/en/abs/revisiting-the-auction-algorithm-for-weighted-bipartite-perfect-matchings-2101.071552021-01-19 https://scifaro.com/en/abs/maximizing-approximately-k-submodular-functions-2101.071572021-01-19 https://scifaro.com/en/abs/fully-dynamic-electrical-flows-sparse-maxflow-faster-than-goldberg-rao-2101.072332021-06-11 https://scifaro.com/en/abs/dynamic-longest-increasing-subsequence-and-the-erd-o-s-szekeres-partitioning-problem-2101.073602021-01-20 https://scifaro.com/en/abs/locality-sensitive-orderings-and-applications-to-reliable-spanners-2101.074282022-03-01 https://scifaro.com/en/abs/subspace-exploration-bounds-on-projected-frequency-estimation-2101.075462021-01-20 https://scifaro.com/en/abs/upper-dominating-set-tight-algorithms-for-pathwidth-and-sub-exponential-approximation-2101.075502021-01-20 https://scifaro.com/en/abs/fast-distributed-algorithms-for-girth-cycles-and-small-subgraphs-2101.075902021-01-20 https://scifaro.com/en/abs/inference-under-information-constraints-iii-local-privacy-constraints-2101.079812021-01-21 https://scifaro.com/en/abs/a-fast-optimal-double-row-legalization-algorithm-2101.085612021-01-22 https://scifaro.com/en/abs/improved-algorithms-for-the-general-exact-satisfiability-problem-2101.086372021-08-02 https://scifaro.com/en/abs/exploring-the-gap-between-treedepth-and-vertex-cover-through-vertex-integrity-2101.094142023-04-03 https://scifaro.com/en/abs/parameterized-complexity-of-finding-subgraphs-with-hereditary-properties-on-hereditary-graph-classes-2101.099182021-01-26 https://scifaro.com/en/abs/constant-amortized-time-enumeration-of-eulerian-trails-2101.104732023-01-24 https://scifaro.com/en/abs/hierarchical-clustering-via-sketches-and-hierarchical-correlation-clustering-2101.106392021-01-27 https://scifaro.com/en/abs/a-tight-lower-bound-for-edge-disjoint-paths-on-planar-dags-2101.107422021-01-27 https://scifaro.com/en/abs/separating-adaptive-streaming-from-oblivious-streaming-2101.108362021-02-18 https://scifaro.com/en/abs/on-statistical-inference-when-fixed-points-of-belief-propagation-are-unstable-2101.108822021-07-20 https://scifaro.com/en/abs/spanner-evaluation-over-slp-compressed-documents-2101.108902021-01-27 https://scifaro.com/en/abs/online-network-utility-maximization-algorithm-competitive-analysis-and-applications-2101.108982021-01-27 https://scifaro.com/en/abs/sampling-a-near-neighbor-in-high-dimensions-who-is-the-fairest-of-them-all-2101.109052021-01-27 https://scifaro.com/en/abs/faster-algorithm-for-maximum-flow-in-directed-planar-graphs-with-vertex-capacities-2101.113002021-08-13 https://scifaro.com/en/abs/entropy-of-mersenne-twisters-2101.113502021-01-28 https://scifaro.com/en/abs/number-parsing-at-a-gigabyte-per-second-2101.114082022-11-07 https://scifaro.com/en/abs/polynomial-time-k-shortest-multi-criteria-prioritized-and-all-criteria-disjoint-paths-2101.115142021-04-07 https://scifaro.com/en/abs/a-neighborhood-preserving-graph-summarization-2101.115592021-01-28 https://scifaro.com/en/abs/random-graph-matching-with-improved-noise-robustness-2101.117832021-08-10 https://scifaro.com/en/abs/online-capacity-scaling-augmented-with-unreliable-machine-learning-predictions-2101.121602022-04-21 https://scifaro.com/en/abs/r-indexing-wheeler-graphs-2101.123412021-02-01 https://scifaro.com/en/abs/fragile-complexity-of-adaptive-algorithms-2102.003382021-02-02 https://scifaro.com/en/abs/bandgap-optimization-in-combinatorial-graphs-with-tailored-ground-states-application-in-quantum-annealing-2102.005512021-02-03 https://scifaro.com/en/abs/random-walks-and-forbidden-minors-iii-poly-d-epsilon-time-partition-oracles-for-minor-free-graph-classes-2102.005562021-05-04 https://scifaro.com/en/abs/jiffy-a-lock-free-skip-list-with-batch-updates-and-snapshots-2102.010442021-02-02 https://scifaro.com/en/abs/role-coloring-bipartite-graphs-2102.011242022-08-25 https://scifaro.com/en/abs/a-tight-bound-for-stochastic-submodular-cover-2102.011492021-08-03 https://scifaro.com/en/abs/multilevel-hypergraph-partitioning-with-vertex-weights-revisited-2102.013782021-02-03 https://scifaro.com/en/abs/targeted-branching-for-the-maximum-independent-set-problem-2102.015402021-03-30 https://scifaro.com/en/abs/tree-trace-reconstruction-using-subtraces-2102.015412021-02-03 https://scifaro.com/en/abs/on-greedy-approaches-to-hierarchical-aggregation-2102.017302021-02-09 https://scifaro.com/en/abs/countsketches-feature-hashing-and-the-median-of-three-2102.021932021-02-04 https://scifaro.com/en/abs/introducing-lop-kernels-a-framework-for-kernelization-lower-bounds-2102.024842021-12-20 https://scifaro.com/en/abs/gapped-indexing-for-consecutive-occurrences-2102.025052021-02-05 https://scifaro.com/en/abs/a-faster-algorithm-for-finding-closest-pairs-in-hamming-metric-2102.025972021-12-08 https://scifaro.com/en/abs/fractionally-log-concave-and-sector-stable-polynomials-counting-planar-matchings-and-more-2102.027082023-04-04 https://scifaro.com/en/abs/online-discrepancy-minimization-via-persistent-self-balancing-walks-2102.027652021-02-09 https://scifaro.com/en/abs/optimal-construction-of-hierarchical-overlap-graphs-2102.028732021-06-14 https://scifaro.com/en/abs/minimum-projective-linearizations-of-trees-in-linear-time-2102.032772025-11-05 https://scifaro.com/en/abs/a-2-approximation-algorithm-for-flexible-graph-connectivity-2102.033042021-02-08 https://scifaro.com/en/abs/online-bin-packing-with-predictions-2102.033112024-04-18 https://scifaro.com/en/abs/parameterized-complexity-of-computing-maximum-minimal-blocking-and-hitting-sets-2102.034042021-02-09 https://scifaro.com/en/abs/streaming-k-pca-efficient-guarantees-for-oja-s-algorithm-beyond-rank-one-updates-2102.036462021-02-09 https://scifaro.com/en/abs/multivariate-analysis-of-scheduling-fair-competitions-2102.038572021-02-09 https://scifaro.com/en/abs/a-dynamic-data-structure-for-temporal-reachability-with-unsorted-contact-insertions-2102.041872021-04-01 https://scifaro.com/en/abs/semi-streaming-algorithms-for-submodular-matroid-intersection-2102.043482021-02-09 https://scifaro.com/en/abs/k-equivalence-relations-and-associated-algorithms-2102.046332021-02-10 https://scifaro.com/en/abs/recursive-backdoors-for-sat-2102.047072021-02-10 https://scifaro.com/en/abs/approximately-counting-independent-sets-of-a-given-size-in-bounded-degree-graphs-2102.049842023-01-26 https://scifaro.com/en/abs/balanced-districting-on-grid-graphs-with-provable-compactness-and-contiguity-2102.050282021-02-10 https://scifaro.com/en/abs/the-multiplicative-version-of-azuma-s-inequality-with-an-application-to-contention-analysis-2102.050772025-01-07 https://scifaro.com/en/abs/deterministic-tree-embeddings-with-copies-for-algorithms-against-adaptive-adversaries-2102.051682021-02-11 https://scifaro.com/en/abs/parallel-minimum-cuts-in-o-m-log-2-n-work-and-low-depth-2102.053012021-12-30 https://scifaro.com/en/abs/breaking-the-quadratic-barrier-for-matroid-intersection-2102.055482021-02-12 https://scifaro.com/en/abs/all-instantiations-of-the-greedy-algorithm-for-the-shortest-superstring-problem-are-equivalent-2102.055792021-02-11 https://scifaro.com/en/abs/runtime-analysis-of-rls-and-the-1-1-ea-for-the-chance-constrained-knapsack-problem-with-correlated-uniform-weights-2102.057782021-02-12 https://scifaro.com/en/abs/budget-smoothed-analysis-for-submodular-maximization-2102.057822022-02-15 https://scifaro.com/en/abs/approximation-algorithms-for-generalized-multidimensional-knapsack-2102.058542021-02-12 https://scifaro.com/en/abs/exact-algorithms-for-scheduling-problems-on-parallel-identical-machines-with-conflict-jobs-2102.060432021-02-12 https://scifaro.com/en/abs/edge-deletion-to-restrict-the-size-of-an-epidemic-2102.060682021-02-12 https://scifaro.com/en/abs/algorithms-reductions-and-equivalences-for-small-weight-variants-of-all-pairs-shortest-paths-2102.061812021-02-12 https://scifaro.com/en/abs/a-subexponential-algorithm-for-arrival-2102.064272021-04-12 https://scifaro.com/en/abs/optimizing-safe-flow-decompositions-in-dags-2102.064802022-07-05 https://scifaro.com/en/abs/adaptive-sampling-for-fast-constrained-maximization-of-submodular-function-2102.064862021-02-15 https://scifaro.com/en/abs/computing-betweenness-centrality-in-link-streams-2102.065432023-11-27 https://scifaro.com/en/abs/work-optimal-parallel-minimum-cuts-for-non-sparse-graphs-2102.065652021-02-19 https://scifaro.com/en/abs/improved-lp-based-approximation-algorithms-for-facility-location-with-hard-capacities-2102.066132022-03-29 https://scifaro.com/en/abs/the-complexity-of-transitively-orienting-temporal-graphs-2102.067832025-01-29 https://scifaro.com/en/abs/the-structure-of-minimum-vertex-cuts-2102.068052021-02-16 https://scifaro.com/en/abs/traveling-repairperson-unrelated-machines-and-other-stories-about-average-completion-times-2102.069042021-05-18 https://scifaro.com/en/abs/optimal-streaming-algorithms-for-graph-matching-2102.069392021-02-26 https://scifaro.com/en/abs/euclidean-affine-functions-and-applications-to-calendar-algorithms-2102.069592025-01-08 https://scifaro.com/en/abs/almost-linear-time-weighted-ell-p-norm-solvers-in-slightly-dense-graphs-via-sparsification-2102.069772021-02-16 https://scifaro.com/en/abs/beating-two-thirds-for-random-order-streaming-matching-2102.070112021-03-02 https://scifaro.com/en/abs/simple-vertex-coloring-algorithms-2102.070892021-02-16 https://scifaro.com/en/abs/fault-tolerant-distance-labeling-for-planar-graphs-2102.071542021-02-16 https://scifaro.com/en/abs/testing-properties-of-signed-graphs-2102.075872021-02-16 https://scifaro.com/en/abs/fair-and-optimal-cohort-selection-for-linear-utilities-2102.076842022-10-07 https://scifaro.com/en/abs/polynomial-time-algorithms-in-invariant-theory-for-torus-actions-2102.077272021-10-22 https://scifaro.com/en/abs/local-access-to-random-walks-2102.077402021-02-16 https://scifaro.com/en/abs/deterministic-congest-algorithm-for-mds-on-bounded-arboricity-graphs-2102.080762021-02-23 https://scifaro.com/en/abs/about-weighted-random-sampling-in-preferential-attachment-models-2102.081732021-10-14 https://scifaro.com/en/abs/online-matching-in-lossless-expanders-2102.082432021-02-17 https://scifaro.com/en/abs/submodular-maximization-subject-to-a-knapsack-constraint-combinatorial-algorithms-with-near-optimal-adaptive-complexity-2102.083272024-02-20 https://scifaro.com/en/abs/faster-kernel-matrix-algebra-via-density-estimation-2102.083412021-06-21 https://scifaro.com/en/abs/on-the-sampling-lov-asz-local-lemma-for-atomic-constraint-satisfaction-problems-2102.083422021-02-17 https://scifaro.com/en/abs/fast-deterministic-algorithms-for-computing-all-eccentricities-in-hyperbolic-helly-graphs-2102.083492021-02-17 https://scifaro.com/en/abs/maximum-coverage-in-the-data-stream-model-parameterized-and-generalized-2102.084762021-02-18 https://scifaro.com/en/abs/efficient-maintenance-of-distance-labelling-for-incremental-updates-in-large-dynamic-graphs-2102.085292021-02-18 https://scifaro.com/en/abs/constructing-a-distance-sensitivity-oracle-in-o-n-2-5794-m-time-2102.085692021-08-04 https://scifaro.com/en/abs/linear-time-runs-over-general-ordered-alphabets-2102.086702021-02-18 https://scifaro.com/en/abs/large-scale-benchmarks-for-the-job-shop-scheduling-problem-2102.087782021-03-29 https://scifaro.com/en/abs/the-complexity-of-gerrymandering-over-graphs-paths-and-trees-2102.089052021-02-18 https://scifaro.com/en/abs/theory-meets-practice-at-the-median-a-worst-case-comparison-of-relative-error-quantile-algorithms-2102.092992021-06-11 https://scifaro.com/en/abs/buffered-streaming-graph-partitioning-2102.093842021-12-23 https://scifaro.com/en/abs/temporal-locality-in-online-algorithms-2102.094132022-10-14 https://scifaro.com/en/abs/a-stronger-impossibility-for-fully-online-matching-2102.094322021-09-07 https://scifaro.com/en/abs/range-minimum-queries-in-minimal-space-2102.094632021-02-19 https://scifaro.com/en/abs/two-sided-weak-submodularity-for-matroid-constrained-optimization-and-regression-2102.096442023-01-19 https://scifaro.com/en/abs/improved-multi-pass-streaming-algorithms-for-submodular-maximization-with-matroid-constraints-2102.096792021-02-22 https://scifaro.com/en/abs/hardness-of-metric-dimension-in-graphs-of-constant-treewidth-2102.097912021-02-22 https://scifaro.com/en/abs/strong-diameter-network-decomposition-2102.098202021-06-08 https://scifaro.com/en/abs/gerrymandering-on-graphs-computational-complexity-and-parameterized-algorithms-2102.098892021-05-26 https://scifaro.com/en/abs/algorithms-for-the-minimum-dominating-set-problem-in-bounded-arboricity-graphs-simpler-faster-and-combinatorial-2102.100772021-08-11 https://scifaro.com/en/abs/co-clustering-vertices-and-hyperedges-via-spectral-hypergraph-partitioning-2102.101692021-02-23 https://scifaro.com/en/abs/restorable-shortest-path-tiebreaking-for-edge-faulty-graphs-2102.101742023-06-06 https://scifaro.com/en/abs/quantifying-variational-approximation-for-the-log-partition-function-2102.101962021-08-23 https://scifaro.com/en/abs/online-stochastic-max-weight-bipartite-matching-beyond-prophet-inequalities-2102.102612021-08-19 https://scifaro.com/en/abs/towards-the-k-server-conjecture-a-unifying-potential-pushing-the-frontier-to-the-circle-2102.104742021-02-23 https://scifaro.com/en/abs/temporal-reachability-minimization-delaying-vs-deleting-2102.108142021-07-21 https://scifaro.com/en/abs/non-crossing-shortest-paths-in-undirected-unweighted-planar-graphs-in-linear-time-2102.108922023-05-05 https://scifaro.com/en/abs/a-high-dimensional-sparse-fourier-transform-in-the-continuous-setting-2102.109392022-05-03 https://scifaro.com/en/abs/the-randomized-competitive-ratio-of-weighted-k-server-is-at-least-exponential-2102.111192021-07-15 https://scifaro.com/en/abs/recent-advances-in-fully-dynamic-graph-algorithms-2102.111692022-11-21 https://scifaro.com/en/abs/near-optimal-two-pass-streaming-algorithm-for-sampling-random-walks-over-directed-graphs-2102.112512021-02-23 https://scifaro.com/en/abs/partially-optimal-edge-fault-tolerant-spanners-2102.113602021-02-24 https://scifaro.com/en/abs/robust-k-center-with-two-types-of-radii-2102.114352021-02-24 https://scifaro.com/en/abs/optimal-sorting-circuits-for-short-keys-2102.114892021-11-09 https://scifaro.com/en/abs/maximizing-agreements-for-ranking-clustering-and-hierarchical-clustering-via-max-cut-2102.115482021-02-24 https://scifaro.com/en/abs/testing-hamiltonicity-and-other-problems-in-minor-free-graphs-2102.117282021-05-12 https://scifaro.com/en/abs/conditional-lower-bounds-for-variants-of-dynamic-lis-2102.117972021-02-24 https://scifaro.com/en/abs/kronecker-products-low-depth-circuits-and-matrix-rigidity-2102.119922021-02-25 https://scifaro.com/en/abs/sok-a-taxonomy-for-critical-analysis-of-consensus-mechanisms-in-consortium-blockchain-2102.120582023-09-28 https://scifaro.com/en/abs/density-sketches-for-sampling-and-estimation-2102.123012021-02-25 https://scifaro.com/en/abs/salsa-self-adjusting-lean-streaming-analytics-2102.125312021-02-26 https://scifaro.com/en/abs/approximate-privacy-preserving-neighbourhood-estimations-2102.126102021-06-22 https://scifaro.com/en/abs/algorithms-and-complexity-on-indexing-founder-graphs-2102.128222022-06-14 https://scifaro.com/en/abs/a-linear-time-algorithm-for-constructing-hierarchical-overlap-graphs-2102.128242021-03-02 https://scifaro.com/en/abs/coalgebra-encoding-for-efficient-minimization-2102.128422022-11-10 https://scifaro.com/en/abs/a-refined-analysis-of-submodular-greedy-2102.128792021-03-16 https://scifaro.com/en/abs/generalized-parametric-path-problems-2102.128862021-06-08 https://scifaro.com/en/abs/the-power-of-d-hops-in-matching-power-law-graphs-2102.129752021-02-26 https://scifaro.com/en/abs/optimal-online-peak-minimization-using-energy-storage-2103.000052022-09-20 https://scifaro.com/en/abs/weighted-ancestors-in-suffix-trees-revisited-2103.004622021-04-13 https://scifaro.com/en/abs/an-introduction-to-johnson-lindenstrauss-transforms-2103.005642021-03-02 https://scifaro.com/en/abs/lower-bounds-and-improved-algorithms-for-asymmetric-streaming-edit-distance-and-longest-common-subsequence-2103.007132021-10-08 https://scifaro.com/en/abs/periodic-trajectories-in-p-time-event-graphs-and-the-non-positive-circuit-weight-problem-2103.010242026-02-10 https://scifaro.com/en/abs/on-the-cost-of-unsuccessful-searches-in-search-trees-with-two-way-comparisons-2103.010522022-02-14 https://scifaro.com/en/abs/a-simple-algorithm-for-optimal-search-trees-with-two-way-comparisons-2103.010842022-02-14 https://scifaro.com/en/abs/approximation-algorithms-for-orthogonal-non-negative-matrix-factorization-2103.013982021-03-09 https://scifaro.com/en/abs/approximation-algorithms-for-socially-fair-clustering-2103.025122021-07-16 https://scifaro.com/en/abs/ribbon-filter-practically-smaller-than-bloom-and-xor-2103.025152021-03-09 https://scifaro.com/en/abs/on-fast-computation-of-a-circulant-matrix-vector-product-2103.026052021-03-05 https://scifaro.com/en/abs/the-bounded-acceleration-shortest-path-problem-complexity-and-solution-algorithms-2103.029142024-04-10 https://scifaro.com/en/abs/a-simple-algorithm-for-the-constrained-sequence-problems-2103.029192021-03-05 https://scifaro.com/en/abs/on-subgraph-complementation-to-h-free-graphs-2103.029362021-03-05 https://scifaro.com/en/abs/weisfeiler-leman-and-graph-spectra-2103.029722023-06-21 https://scifaro.com/en/abs/computing-subset-feedback-vertex-set-via-leafage-2103.030352021-08-05 https://scifaro.com/en/abs/an-almost-optimal-edit-distance-oracle-2103.032942021-03-08 https://scifaro.com/en/abs/revisiting-priority-k-center-fairness-and-outliers-2103.033372022-12-21 https://scifaro.com/en/abs/maximising-the-total-weight-of-on-time-jobs-on-parallel-machines-subject-to-a-conflict-graph-2103.033462021-06-15 https://scifaro.com/en/abs/compressed-communication-complexity-of-hamming-distance-2103.034682021-04-02 https://scifaro.com/en/abs/decomposable-submodular-function-minimization-via-maximum-flow-2103.038682021-03-08 https://scifaro.com/en/abs/essentially-tight-kernels-for-weakly-closed-graphs-2103.039142021-03-09 https://scifaro.com/en/abs/fine-grained-complexity-and-algorithms-for-the-schulze-voting-method-2103.039592021-06-25 https://scifaro.com/en/abs/matroid-secretary-is-equivalent-to-contention-resolution-2103.042052022-01-04 https://scifaro.com/en/abs/online-directed-spanners-and-steiner-forests-2103.045432023-07-06 https://scifaro.com/en/abs/t-sci-a-two-stage-conformal-inference-algorithm-with-guaranteed-coverage-for-cox-mlp-2103.045562021-04-15 https://scifaro.com/en/abs/a-fully-polynomial-parameterized-algorithm-for-counting-the-number-of-reachable-vertices-in-a-digraph-2103.045952022-02-28 https://scifaro.com/en/abs/streaming-hypergraph-partitioning-algorithms-on-limited-memory-environments-2103.053942021-03-10 https://scifaro.com/en/abs/dynamic-range-mode-enumeration-2103.054602021-03-10 https://scifaro.com/en/abs/flow-time-scheduling-with-uncertain-processing-time-2103.056042021-03-10 https://scifaro.com/en/abs/improved-upper-bounds-for-the-rigidity-of-kronecker-products-2103.056312021-10-13 https://scifaro.com/en/abs/pebble-guided-near-optimal-treasure-hunt-in-anonymous-graphs-2103.059332021-03-11 https://scifaro.com/en/abs/hitting-minors-on-bounded-treewidth-graphs-ii-single-exponential-algorithms-2103.065362021-03-12 https://scifaro.com/en/abs/hitting-minors-on-bounded-treewidth-graphs-iii-lower-bounds-2103.066142021-03-12 https://scifaro.com/en/abs/arc-completion-of-2-colored-best-match-graphs-to-binary-explainable-best-match-graphs-2103.066652021-03-12 https://scifaro.com/en/abs/hardness-of-token-swapping-on-trees-2103.067072022-08-12 https://scifaro.com/en/abs/imagined-trailing-whitespace-agnostic-levenshtein-distance-for-plaintext-table-detection-2103.069422021-03-15 https://scifaro.com/en/abs/robust-lower-bounds-for-graph-problems-in-the-blackboard-model-of-communication-2103.070272021-03-15 https://scifaro.com/en/abs/tight-competitive-analyses-of-online-car-sharing-problems-2103.073672021-07-07 https://scifaro.com/en/abs/smoothness-of-schatten-norms-and-sliding-window-matrix-streams-2103.082112021-11-24 https://scifaro.com/en/abs/counting-and-sampling-perfect-matchings-in-regular-expanding-non-bipartite-graphs-2103.086832021-03-17 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-special-cases-of-the-unbounded-subset-sum-problem-2103.090802021-03-17 https://scifaro.com/en/abs/on-linear-solution-of-cherry-pickup-ii-max-weight-of-two-disjoint-paths-in-node-weighted-gridlike-dag-2103.093622021-03-31 https://scifaro.com/en/abs/vertex-deletion-parameterized-by-elimination-distance-and-even-less-2103.097152022-07-19 https://scifaro.com/en/abs/on-guillotine-separable-packings-for-the-two-dimensional-geometric-knapsack-problem-2103.097352021-03-18 https://scifaro.com/en/abs/compact-enumeration-for-scheduling-one-machine-2103.099002025-07-08 https://scifaro.com/en/abs/regularized-non-monotone-submodular-maximization-2103.100082021-03-19 https://scifaro.com/en/abs/comparative-design-choice-analysis-of-color-refinement-algorithms-beyond-the-worst-case-2103.102442021-03-19 https://scifaro.com/en/abs/nearest-neighbor-queries-in-customizable-contraction-hierarchies-and-applications-2103.103592021-03-19 https://scifaro.com/en/abs/local-computation-algorithms-for-coloring-of-uniform-hypergraphs-2103.109902021-03-23 https://scifaro.com/en/abs/space-lower-bounds-for-approximating-maximum-matching-in-the-edge-arrival-model-2103.116692021-03-23 https://scifaro.com/en/abs/isolating-cuts-bi-submodularity-and-faster-algorithms-for-global-connectivity-problems-2103.129082021-03-25 https://scifaro.com/en/abs/online-stochastic-matching-poisson-arrivals-and-the-natural-linear-program-2103.130242021-03-26 https://scifaro.com/en/abs/the-complexity-of-dependency-detection-and-discovery-in-relational-databases-2103.133312021-03-25 https://scifaro.com/en/abs/euler-meets-gpu-practical-graph-algorithms-with-theoretical-guarantees-2103.152172021-03-30 https://scifaro.com/en/abs/family-column-generation-a-principled-stabilized-column-generation-approach-2103.152342021-03-30 https://scifaro.com/en/abs/a-fast-and-small-subsampled-r-index-2103.153292021-03-30 https://scifaro.com/en/abs/engineering-nearly-linear-time-algorithms-for-small-vertex-connectivity-2103.157032021-03-30 https://scifaro.com/en/abs/a-note-on-isolating-cut-lemma-for-submodular-function-minimization-2103.157242021-03-30 https://scifaro.com/en/abs/the-randomized-local-computation-complexity-of-the-lov-asz-local-lemma-2103.162512021-12-06 https://scifaro.com/en/abs/scheduling-in-the-secretary-model-2103.163402021-10-28 https://scifaro.com/en/abs/differentially-private-histograms-under-continual-observation-streaming-selection-into-the-unknown-2103.167872022-01-06 https://scifaro.com/en/abs/ising-formulations-for-two-dimensional-cutting-stock-problem-with-setup-cost-2103.167962021-04-01 https://scifaro.com/en/abs/an-exponential-time-parameterized-algorithm-for-planar-disjoint-paths-2103.170412021-04-01 https://scifaro.com/en/abs/approximation-schemes-for-multiperiod-binary-knapsack-problems-2104.000342021-04-02 https://scifaro.com/en/abs/vertex-connectivity-in-poly-logarithmic-max-flows-2104.001042021-04-12 https://scifaro.com/en/abs/o-1-steiner-point-removal-in-series-parallel-graphs-2104.007502021-04-05 https://scifaro.com/en/abs/independent-sets-in-semi-random-hypergraphs-2104.009272021-04-05 https://scifaro.com/en/abs/fast-parallel-algorithms-for-euclidean-minimum-spanning-tree-and-hierarchical-spatial-clustering-2104.011262021-04-05 https://scifaro.com/en/abs/branch-and-cut-algorithms-for-the-covering-salesman-problem-2104.011732021-04-05 https://scifaro.com/en/abs/prophet-inequalities-for-matching-with-a-single-sample-2104.020502021-08-03 https://scifaro.com/en/abs/exact-algorithms-for-no-rainbow-coloring-and-phylogenetic-decisiveness-2104.021032021-04-07 https://scifaro.com/en/abs/sorted-range-reporting-and-range-minima-queries-2104.024612025-04-22 https://scifaro.com/en/abs/the-power-of-subsampling-in-submodular-maximization-2104.027722021-04-08 https://scifaro.com/en/abs/destroying-multicolored-paths-and-cycles-in-edge-colored-graphs-2104.031382023-06-22 https://scifaro.com/en/abs/the-value-of-excess-supply-in-spatial-matching-markets-2104.032192021-04-08 https://scifaro.com/en/abs/graph-reordering-for-cache-efficient-near-neighbor-search-2104.032212021-04-08 https://scifaro.com/en/abs/sublinear-time-spectral-density-estimation-2104.034612022-04-18 https://scifaro.com/en/abs/advances-in-metric-ramsey-theory-and-its-applications-2104.034842021-04-09 https://scifaro.com/en/abs/universally-optimal-distributed-algorithms-for-known-topologies-2104.039322023-12-29 https://scifaro.com/en/abs/beyond-pointwise-submodularity-non-monotone-adaptive-submodular-maximization-subject-to-knapsack-and-k-system-constraints-2104.048532021-09-29 https://scifaro.com/en/abs/graph-streaming-lower-bounds-for-parameter-estimation-and-property-testing-via-a-streaming-xor-lemma-2104.049082021-04-13 https://scifaro.com/en/abs/simple-optimal-algorithms-for-random-sampling-without-replacement-2104.050912021-04-13 https://scifaro.com/en/abs/load-balancing-with-dynamic-set-of-balls-and-bins-2104.050932021-04-13 https://scifaro.com/en/abs/how-asymmetry-helps-buffer-management-achieving-optimal-tail-size-in-cup-games-2104.051722021-04-13 https://scifaro.com/en/abs/a-note-on-the-performance-of-algorithms-for-solving-linear-diophantine-equations-in-the-naturals-2104.052002021-04-13 https://scifaro.com/en/abs/algorithms-and-complexity-for-the-almost-equal-maximum-flow-problem-2104.052882021-04-13 https://scifaro.com/en/abs/online-weighted-matching-with-a-sample-2104.057712021-12-28 https://scifaro.com/en/abs/a-new-coreset-framework-for-clustering-2104.061332022-08-01 https://scifaro.com/en/abs/a-simple-proof-of-the-moore-hodgson-algorithm-for-minimizing-the-number-of-late-jobs-2104.062102021-04-14 https://scifaro.com/en/abs/dimension-preserving-reductions-between-svp-and-cvp-in-different-p-norms-2104.065762021-04-15 https://scifaro.com/en/abs/computing-the-union-join-and-subset-graph-of-acyclic-hypergraphs-in-subquadratic-time-2104.066362021-04-15 https://scifaro.com/en/abs/cost-constrained-minimal-steiner-tree-enumeration-by-binary-decision-diagram-2104.066962021-04-20 https://scifaro.com/en/abs/engineering-predecessor-data-structures-for-dynamic-integer-sets-2104.067402021-04-15 https://scifaro.com/en/abs/approximation-algorithms-for-size-constrained-non-monotone-submodular-maximization-in-deterministic-linear-time-2104.068732023-08-08 https://scifaro.com/en/abs/twin-subsequence-search-in-time-series-2104.068742021-04-15 https://scifaro.com/en/abs/fast-approximations-for-rooted-connectivity-in-weighted-directed-graphs-2104.069332021-04-15 https://scifaro.com/en/abs/a-gaussian-fixed-point-random-walk-2104.070092021-04-15 https://scifaro.com/en/abs/a-better-than-2-approximation-for-weighted-tree-augmentation-2104.071142021-04-16 https://scifaro.com/en/abs/faster-algorithms-for-rooted-connectivity-in-directed-graphs-2104.072052021-04-16 https://scifaro.com/en/abs/a-single-exponential-time-2-approximation-algorithm-for-treewidth-2104.074632023-08-24 https://scifaro.com/en/abs/lipschitz-selectors-may-not-yield-competitive-algorithms-for-convex-body-chasing-2104.074872022-02-09 https://scifaro.com/en/abs/minimum-cuts-in-directed-graphs-via-sqrt-n-max-flows-2104.078982021-04-19 https://scifaro.com/en/abs/parameterized-complexity-of-categorical-clustering-with-size-constraints-2104.079742021-04-19 https://scifaro.com/en/abs/complexity-and-algorithms-for-injective-edge-coloring-in-graphs-2104.080032021-04-19 https://scifaro.com/en/abs/shared-memory-n-level-hypergraph-partitioning-2104.081072021-04-19 https://scifaro.com/en/abs/approximate-triangle-counting-via-sampling-and-fast-matrix-multiplication-2104.085012021-05-18 https://scifaro.com/en/abs/load-balancing-succinct-b-trees-2104.087512021-04-20 https://scifaro.com/en/abs/halftimehash-modern-hashing-without-64-bit-multipliers-or-finite-fields-2104.088652021-04-22 https://scifaro.com/en/abs/online-list-access-with-precedence-constraints-2104.089492021-04-20 https://scifaro.com/en/abs/wake-up-and-join-me-an-energy-efficient-algorithm-for-maximal-matching-in-radio-networks-2104.090962022-04-19 https://scifaro.com/en/abs/joint-replenishment-meets-scheduling-2104.091782022-03-03 https://scifaro.com/en/abs/minimizing-the-total-weighted-pairwise-connection-time-in-network-construction-problems-2104.093122021-04-20 https://scifaro.com/en/abs/local-pair-and-bundle-discovery-over-co-evolving-time-series-2104.094172021-04-20 https://scifaro.com/en/abs/locally-private-k-means-in-one-round-2104.097342021-05-18 https://scifaro.com/en/abs/robust-online-algorithms-for-dynamic-choosing-problems-2104.098032021-04-21 https://scifaro.com/en/abs/deleting-eliminating-and-decomposing-to-hereditary-classes-are-all-fpt-equivalent-2104.099502022-01-10 https://scifaro.com/en/abs/finding-small-multi-demand-set-covers-with-ubiquitous-elements-and-large-sets-is-fixed-parameter-tractable-2104.101242021-04-21 https://scifaro.com/en/abs/pthash-revisiting-fch-minimal-perfect-hashing-2104.104022022-02-08 https://scifaro.com/en/abs/acyclic-star-and-injective-colouring-bounding-the-diameter-2104.105932021-09-09 https://scifaro.com/en/abs/the-metric-relaxation-for-0-extension-admits-an-omega-log-2-3-k-gap-2104.116702021-04-26 https://scifaro.com/en/abs/efficient-binary-decision-diagram-manipulation-in-external-memory-2104.121012026-03-25 https://scifaro.com/en/abs/efficiently-partitioning-the-edges-of-a-1-planar-graph-into-a-planar-graph-and-a-forest-2104.122862021-05-03 https://scifaro.com/en/abs/how-to-catch-marathon-cheaters-new-approximation-algorithms-for-tracking-paths-2104.123372021-04-27 https://scifaro.com/en/abs/enumeration-of-far-apart-pairs-by-decreasing-distance-for-faster-hyperbolicity-computation-2104.125232021-04-27 https://scifaro.com/en/abs/exponentially-improved-dimensionality-reduction-for-ell-1-subspace-embeddings-and-independence-testing-2104.129462021-08-09 https://scifaro.com/en/abs/fully-dynamic-weighted-matching-approximation-in-practice-2104.130982021-04-28 https://scifaro.com/en/abs/there-is-no-aptas-for-2-dimensional-vector-bin-packing-revisited-2104.133622023-08-02 https://scifaro.com/en/abs/hypersuccinct-trees-new-universal-tree-source-codes-for-optimal-compressed-tree-data-structures-and-range-minima-2104.134572021-09-06 https://scifaro.com/en/abs/faster-3-coloring-of-small-diameter-graphs-2104.138602021-04-29 https://scifaro.com/en/abs/a-0-502-cdot-maxcut-approximation-using-quadratic-programming-2104.144042021-04-30 https://scifaro.com/en/abs/deterministic-algorithms-for-the-hidden-subgroup-problem-2104.144362022-08-02 https://scifaro.com/en/abs/improved-kernels-for-edge-modification-problems-2104.145102021-04-30 https://scifaro.com/en/abs/triangle-centrality-2105.001102024-10-16 https://scifaro.com/en/abs/on-the-hardness-of-scheduling-with-non-uniform-communication-delays-2105.001112021-05-04 https://scifaro.com/en/abs/online-domination-the-value-of-getting-to-know-all-your-neighbors-2105.002992021-05-04 https://scifaro.com/en/abs/fast-mixing-via-polymers-for-random-graphs-with-unbounded-degree-2105.005242022-03-29 https://scifaro.com/en/abs/model-counting-meets-f0-estimation-2105.006392021-05-04 https://scifaro.com/en/abs/testing-dynamic-environments-back-to-basics-2105.007592021-05-05 https://scifaro.com/en/abs/a-constant-factor-approximation-for-weighted-bond-cover-2105.008572025-01-09 https://scifaro.com/en/abs/general-knapsack-problems-in-a-dynamic-setting-2105.008822021-08-03 https://scifaro.com/en/abs/fault-tolerant-max-cut-2105.011382021-05-05 https://scifaro.com/en/abs/near-optimal-cayley-expanders-for-abelian-groups-2105.011492021-05-05 https://scifaro.com/en/abs/spectral-independence-coupling-with-the-stationary-distribution-and-the-spectral-gap-of-the-glauber-dynamics-2105.012012021-05-05 https://scifaro.com/en/abs/finding-triangles-or-independent-sets-and-other-dual-pair-approximations-2105.012652024-02-13 https://scifaro.com/en/abs/fpt-algorithms-for-packing-k-safe-spanning-rooted-sub-di-graphs-2105.015822021-05-05 https://scifaro.com/en/abs/deterministic-rounding-of-dynamic-fractional-matchings-2105.016152021-05-05 https://scifaro.com/en/abs/determining-4-edge-connected-components-in-linear-time-2105.016992021-05-06 https://scifaro.com/en/abs/priority-promotion-with-parysian-flair-2105.017382021-09-01 https://scifaro.com/en/abs/approximation-schemes-for-bounded-distance-problems-on-fractionally-treewidth-fragile-graphs-2105.017802021-05-06 https://scifaro.com/en/abs/streaming-approximation-resistance-of-every-ordering-csp-2105.017822024-08-05 https://scifaro.com/en/abs/sampling-colorings-and-independent-sets-of-random-regular-bipartite-graphs-in-the-non-uniqueness-region-2105.017842021-05-06 https://scifaro.com/en/abs/an-optimal-algorithm-for-triangle-counting-in-the-stream-2105.017852021-07-16 https://scifaro.com/en/abs/dynamic-enumeration-of-similarity-joins-2105.018182021-05-06 https://scifaro.com/en/abs/tree-path-minimum-query-oracle-via-boruvka-trees-2105.018642021-05-06 https://scifaro.com/en/abs/deep-multilevel-graph-partitioning-2105.020222021-05-06 https://scifaro.com/en/abs/scheduling-with-testing-on-multiple-identical-parallel-machines-2105.020522021-08-20 https://scifaro.com/en/abs/local-algorithms-for-bounded-degree-sparsifiers-in-sparse-graphs-2105.020842021-05-06 https://scifaro.com/en/abs/universal-algorithms-for-clustering-problems-2105.023632021-07-16 https://scifaro.com/en/abs/faster-algorithms-for-bounded-tree-edit-distance-2105.024282021-06-11 https://scifaro.com/en/abs/feedback-vertex-set-and-even-cycle-transversal-for-h-free-graphs-finding-large-block-graphs-2105.027362022-01-12 https://scifaro.com/en/abs/faster-monotone-min-plus-product-range-mode-and-single-source-replacement-paths-2105.028062021-05-07 https://scifaro.com/en/abs/computing-the-4-edge-connected-components-of-a-graph-in-linear-time-2105.029102021-05-10 https://scifaro.com/en/abs/improved-approximation-for-longest-common-subsequence-over-small-alphabets-2105.030282021-05-10 https://scifaro.com/en/abs/faster-algorithms-for-longest-common-substring-2105.031062025-11-18 https://scifaro.com/en/abs/parameterized-complexity-of-feature-selection-for-categorical-data-clustering-2105.037532021-08-20 https://scifaro.com/en/abs/separations-for-estimating-large-frequency-moments-on-data-streams-2105.037732022-07-08 https://scifaro.com/en/abs/construction-of-sparse-suffix-trees-and-lce-indexes-in-optimal-time-and-space-2105.037822024-04-23 https://scifaro.com/en/abs/fast-n-fold-boolean-convolution-via-additive-combinatorics-2105.039682021-05-11 https://scifaro.com/en/abs/knapsack-and-subset-sum-with-small-items-2105.040352021-05-11 https://scifaro.com/en/abs/polynomial-delay-enumeration-of-large-maximal-matchings-2105.041462022-09-07 https://scifaro.com/en/abs/exact-asymptotic-characterisation-of-running-time-for-approximate-gradient-descent-on-random-graphs-2105.042282021-05-11 https://scifaro.com/en/abs/partitioning-h-free-graphs-of-bounded-diameter-2105.045882022-04-19 https://scifaro.com/en/abs/deletion-to-scattered-graph-classes-i-case-of-finite-number-of-graph-classes-2105.046602021-12-24 https://scifaro.com/en/abs/ppsim-a-software-package-for-efficiently-simulating-and-visualizing-population-protocols-2105.047022021-07-05 https://scifaro.com/en/abs/near-neighbor-search-via-efficient-average-distortion-embeddings-2105.047122021-05-12 https://scifaro.com/en/abs/a-3-approximation-list-scheduling-algorithm-for-a-single-machine-scheduling-problem-with-a-non-renewable-resource-and-total-weighted-completion-time-criterion-2105.047352021-05-12 https://scifaro.com/en/abs/tree-edit-distance-with-variables-measuring-the-similarity-between-mathematical-formulas-2105.048022021-05-12 https://scifaro.com/en/abs/testing-triangle-freeness-in-the-general-model-in-graphs-with-arboricity-o-sqrt-n-2105.048092021-05-12 https://scifaro.com/en/abs/improved-local-computation-algorithms-for-constructing-spanners-2105.048472023-07-10 https://scifaro.com/en/abs/parameterized-algorithms-for-diverse-multistage-problems-2105.048562021-05-12 https://scifaro.com/en/abs/succinct-euler-tour-trees-2105.049652021-06-30 https://scifaro.com/en/abs/constrained-consensus-sequence-algorithm-for-dna-archiving-2105.049932021-05-12 https://scifaro.com/en/abs/current-algorithms-for-detecting-subgraphs-of-bounded-treewidth-are-probably-optimal-2105.050622021-05-12 https://scifaro.com/en/abs/locally-checkable-labelings-with-small-messages-2105.055742021-05-18 https://scifaro.com/en/abs/distributed-graph-coloring-made-easy-2105.055752023-02-28 https://scifaro.com/en/abs/a-mathematical-definition-of-particle-methods-2105.056372021-05-13 https://scifaro.com/en/abs/breaking-o-nr-for-matroid-intersection-2105.056732021-05-13 https://scifaro.com/en/abs/from-average-embeddings-to-nearest-neighbor-search-2105.057612021-05-13 https://scifaro.com/en/abs/how-to-design-robust-algorithms-using-noisy-comparison-oracle-2105.057822021-05-13 https://scifaro.com/en/abs/open-end-bin-packing-new-and-old-analysis-approaches-2105.059232021-05-14 https://scifaro.com/en/abs/sparse-nonnegative-convolution-is-equivalent-to-dense-nonnegative-convolution-2105.059842021-05-17 https://scifaro.com/en/abs/further-improvements-for-sat-in-terms-of-formula-length-2105.061312022-08-18 https://scifaro.com/en/abs/efficient-stepping-algorithms-and-implementations-for-parallel-shortest-paths-2105.061452021-12-16 https://scifaro.com/en/abs/the-dynamic-k-mismatch-problem-2105.061662022-03-30 https://scifaro.com/en/abs/analysis-of-busy-time-scheduling-on-heterogeneous-machines-2105.062872021-05-14 https://scifaro.com/en/abs/analysis-of-stochastic-lanczos-quadrature-for-spectrum-approximation-2105.065952021-06-14 https://scifaro.com/en/abs/fast-stencil-computations-using-fast-fourier-transforms-2105.066762021-05-17 https://scifaro.com/en/abs/fully-dynamic-set-cover-via-hypergraph-maximal-matching-an-optimal-approximation-through-a-local-approach-2105.068892021-05-17 https://scifaro.com/en/abs/the-greedy-algorithm-is-emph-not-optimal-for-on-line-edge-coloring-2105.069442021-05-17 https://scifaro.com/en/abs/optimal-virtual-network-embeddings-for-tree-topologies-2105.070062021-05-18 https://scifaro.com/en/abs/peak-demand-minimization-via-sliced-strip-packing-2105.072192021-05-18 https://scifaro.com/en/abs/near-optimal-time-energy-trade-offs-for-deterministic-leader-election-2105.075182021-11-15 https://scifaro.com/en/abs/hamiltonian-cycle-problem-is-in-p-2105.076082022-07-12 https://scifaro.com/en/abs/a-new-vertex-connectivity-metric-2105.079682021-05-24 https://scifaro.com/en/abs/a-scalable-concurrent-algorithm-for-dynamic-connectivity-2105.080982021-05-19 https://scifaro.com/en/abs/a-neat-linked-queue-with-the-rear-blank-node-2105.081162021-10-05 https://scifaro.com/en/abs/vertex-ordering-problems-in-directed-graph-streams-2105.082152021-05-19 https://scifaro.com/en/abs/sublinear-least-squares-value-iteration-via-locality-sensitive-hashing-2105.082852021-06-09 https://scifaro.com/en/abs/interference-free-walks-in-time-temporally-disjoint-paths-2105.083352021-05-25 https://scifaro.com/en/abs/a-cubic-vertex-kernel-for-trivially-perfect-editing-2105.085492021-05-19 https://scifaro.com/en/abs/approximation-algorithms-for-demand-strip-packing-2105.085772021-05-20 https://scifaro.com/en/abs/online-bin-packing-of-squares-and-cubes-2105.087632021-05-20 https://scifaro.com/en/abs/speed-scaling-on-parallel-servers-with-mapreduce-type-precedence-constraints-2105.089672021-05-20 https://scifaro.com/en/abs/pseudo-hadamard-matrices-of-the-first-generation-and-an-algorithm-for-producing-them-2105.089742021-05-20 https://scifaro.com/en/abs/the-simultaneous-assignment-problem-2105.094392023-01-24 https://scifaro.com/en/abs/matchings-with-group-fairness-constraints-online-and-offline-algorithms-2105.095222021-05-21 https://scifaro.com/en/abs/sub-linear-kernels-for-edge-modification-problems-towards-structured-graph-classes-2105.095662021-09-17 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-polytree-learning-2105.096752021-05-21 https://scifaro.com/en/abs/online-risk-averse-submodular-maximization-2105.098382021-05-21 https://scifaro.com/en/abs/a-slightly-improved-bound-on-the-integrality-gap-of-the-subtour-lp-for-tsp-2105.100432023-10-26 https://scifaro.com/en/abs/finding-all-bounded-length-simple-cycles-in-a-directed-graph-2105.100942021-05-27 https://scifaro.com/en/abs/balancing-the-spread-of-two-opinions-in-sparse-social-networks-2105.101842025-06-23 https://scifaro.com/en/abs/finding-all-minimum-cost-flows-and-a-faster-algorithm-for-the-k-best-flow-problem-2105.102252022-01-28 https://scifaro.com/en/abs/weighted-burrows-wheeler-compression-2105.103272021-05-24 https://scifaro.com/en/abs/verification-of-multi-layered-assignment-problems-2105.104342021-05-25 https://scifaro.com/en/abs/deterministic-size-discovery-and-topology-recognition-in-radio-networks-with-short-labels-2105.105952021-05-25 https://scifaro.com/en/abs/support-optimality-and-adaptive-cuckoo-filters-2105.106222021-05-25 https://scifaro.com/en/abs/an-algorithm-for-reordering-buffer-management-problem-and-experimental-evaluations-on-discrete-distributions-2105.106892021-05-25 https://scifaro.com/en/abs/estimating-leverage-scores-via-rank-revealing-methods-and-randomization-2105.110042022-03-08 https://scifaro.com/en/abs/fast-and-space-efficient-construction-of-avl-grammars-from-the-lz77-parsing-2105.110522022-01-06 https://scifaro.com/en/abs/efficient-reporting-of-top-k-subset-sums-2105.112502021-08-27 https://scifaro.com/en/abs/a-simple-proof-of-a-new-set-disjointness-with-applications-to-data-streams-2105.113382021-05-25 https://scifaro.com/en/abs/minimal-unique-palindromic-substrings-after-single-character-substitution-2105.116932021-10-05 https://scifaro.com/en/abs/minmax-optimal-list-searching-with-o-log-2-log-2-n-average-cost-2105.119192021-05-26 https://scifaro.com/en/abs/a-simple-optimal-contention-resolution-scheme-for-uniform-matroids-2105.119922023-01-31 https://scifaro.com/en/abs/an-omega-log-n-lower-bound-for-online-matching-on-the-line-2105.120862021-08-23 https://scifaro.com/en/abs/on-dasgupta-s-hierarchical-clustering-objective-and-its-relation-to-other-graph-parameters-2105.120932021-05-26 https://scifaro.com/en/abs/diameter-radius-and-all-eccentricities-in-linear-time-for-constant-dimension-median-graphs-2105.121502021-05-27 https://scifaro.com/en/abs/recognition-of-linear-and-star-variants-of-leaf-powers-is-in-p-2105.124072022-03-10 https://scifaro.com/en/abs/new-instances-for-maximum-weight-independent-set-from-a-vehicle-routing-application-2105.126232021-05-31 https://scifaro.com/en/abs/towards-classifying-the-polynomial-time-solvability-of-temporal-betweenness-centrality-2105.130552021-05-28 https://scifaro.com/en/abs/a-dynamic-tree-algorithm-for-peer-to-peer-ride-sharing-matching-2105.130782021-05-28 https://scifaro.com/en/abs/differentially-private-densest-subgraph-detection-2105.132872024-06-05 https://scifaro.com/en/abs/on-stricter-reachable-repetitiveness-measures-2105.135952021-05-31 https://scifaro.com/en/abs/grammar-index-by-induced-suffix-sorting-2105.137442021-05-31 https://scifaro.com/en/abs/ell-2-norm-flow-diffusion-in-near-linear-time-2105.146292021-06-07 https://scifaro.com/en/abs/halt-properties-and-complexity-evaluations-for-optimal-deeplll-algorithm-families-2105.146952021-06-02 https://scifaro.com/en/abs/rapid-mixing-of-glauber-dynamics-via-spectral-independence-for-all-degrees-2105.150052021-11-22 https://scifaro.com/en/abs/locally-private-k-means-clustering-with-constant-multiplicative-approximation-and-near-optimal-additive-error-2105.150072021-06-01 https://scifaro.com/en/abs/sequenceable-event-recorders-2105.150392021-12-07 https://scifaro.com/en/abs/on-maximizing-a-monotone-k-submodular-function-under-a-knapsack-constraint-2105.151592023-08-04 https://scifaro.com/en/abs/a-quasipolynomial-2-varepsilon-approximation-for-planar-sparsest-cut-2105.151872021-06-01 https://scifaro.com/en/abs/multidimensional-included-and-excluded-sums-2106.001242021-06-02 https://scifaro.com/en/abs/multimodal-transportation-with-ridesharing-of-personal-vehicles-2106.002322021-09-15 https://scifaro.com/en/abs/l-0-isotonic-regression-with-secondary-objectives-2106.002792022-06-14 https://scifaro.com/en/abs/junta-distance-approximation-with-sub-exponential-queries-2106.002872021-06-02 https://scifaro.com/en/abs/boosting-the-search-performance-of-b-tree-for-non-volatile-memory-with-sentinels-2106.003232021-06-02 https://scifaro.com/en/abs/fault-tolerant-labeling-and-compact-routing-schemes-2106.003742021-06-02 https://scifaro.com/en/abs/parameterized-algorithms-for-identifying-gene-co-expression-modules-via-weighted-clique-decomposition-2106.006572021-09-08 https://scifaro.com/en/abs/the-generalized-mean-densest-subgraph-problem-2106.009092021-06-07 https://scifaro.com/en/abs/ultra-sparse-near-additive-emulators-2106.010362021-06-03 https://scifaro.com/en/abs/using-predicted-weights-for-ad-delivery-2106.010792021-06-03 https://scifaro.com/en/abs/on-the-approximation-ratio-of-lz-end-to-lz77-2106.011732021-08-17 https://scifaro.com/en/abs/deterministic-weighted-expander-decomposition-in-almost-linear-time-2106.015672021-06-04 https://scifaro.com/en/abs/position-heaps-for-cartesian-tree-matching-on-strings-and-tries-2106.015952021-08-17 https://scifaro.com/en/abs/internal-shortest-absent-word-queries-in-constant-time-and-linear-space-2106.017632021-06-04 https://scifaro.com/en/abs/component-stability-in-low-space-massively-parallel-computation-2106.018802021-06-04 https://scifaro.com/en/abs/low-congestion-shortcuts-in-constant-diameter-graphs-2106.018942021-06-08 https://scifaro.com/en/abs/breaking-the-cubic-barrier-for-unweighted-tree-edit-distance-2106.020262021-11-12 https://scifaro.com/en/abs/oblivious-stacking-and-max-k-cut-for-circle-graphs-2106.021132021-06-07 https://scifaro.com/en/abs/approximation-algorithms-for-min-distance-problems-in-dags-2106.021202022-10-05 https://scifaro.com/en/abs/a-nearly-optimal-all-pairs-min-cuts-algorithm-in-simple-graphs-2106.022332021-11-04 https://scifaro.com/en/abs/parallel-and-external-memory-construction-of-minimal-perfect-hash-functions-with-pthash-2106.023502023-08-08 https://scifaro.com/en/abs/spectral-hypergraph-sparsifiers-of-nearly-linear-size-2106.023532021-06-07 https://scifaro.com/en/abs/algorithms-from-invariants-smoothed-analysis-of-orbit-recovery-over-so-3-2106.026802022-05-03 https://scifaro.com/en/abs/massively-parallel-and-dynamic-algorithms-for-minimum-size-clustering-2106.026852021-06-08 https://scifaro.com/en/abs/robust-model-selection-and-nearly-proper-learning-for-gmms-2106.027742023-04-25 https://scifaro.com/en/abs/numerical-composition-of-differential-privacy-2106.028482021-10-27 https://scifaro.com/en/abs/time-optimal-sublinear-algorithms-for-matching-and-vertex-cover-2106.029422022-03-03 https://scifaro.com/en/abs/apmf-apsp-gomory-hu-tree-for-unweighted-graphs-in-almost-quadratic-time-2106.029812021-06-08 https://scifaro.com/en/abs/approximate-graph-propagation-2106.030582021-11-29 https://scifaro.com/en/abs/faster-cut-equivalent-trees-in-simple-graphs-2106.033052022-07-05 https://scifaro.com/en/abs/spectral-independence-via-stability-and-applications-to-holant-type-problems-2106.033662024-08-07 https://scifaro.com/en/abs/an-algorithmic-meta-theorem-for-graph-modification-to-planarity-and-fol-2106.034252022-11-07 https://scifaro.com/en/abs/silvan-estimating-betweenness-centralities-with-progressive-sampling-and-non-uniform-rademacher-bounds-2106.034622022-06-02 https://scifaro.com/en/abs/local-algorithms-for-estimating-effective-resistance-2106.034762021-06-08 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-maximum-weight-independent-set-problem-in-d-claw-free-graphs-2106.035452021-06-08 https://scifaro.com/en/abs/the-limits-of-local-search-for-the-maximum-weight-independent-set-problem-in-d-claw-free-graphs-2106.035552021-06-08 https://scifaro.com/en/abs/parallel-batch-dynamic-algorithms-for-k-core-decomposition-and-related-graph-problems-2106.038242023-09-28 https://scifaro.com/en/abs/a-matrix-trickle-down-theorem-on-simplicial-complexes-and-applications-to-sampling-colorings-2106.038452021-11-17 https://scifaro.com/en/abs/online-algorithms-for-network-robustness-under-connectivity-constraints-2106.040372022-11-09 https://scifaro.com/en/abs/entropic-independence-i-modified-log-sobolev-inequalities-for-fractionally-log-concave-distributions-and-high-temperature-ising-models-2106.041052021-11-08 https://scifaro.com/en/abs/deterministic-1-varepsilon-approximate-maximum-matching-with-mathsf-poly-1-varepsilon-passes-in-the-semi-streaming-model-and-beyond-2106.041792024-04-03 https://scifaro.com/en/abs/fpt-algorithms-to-compute-the-elimination-distance-to-bipartite-graphs-and-more-2106.041912021-06-09 https://scifaro.com/en/abs/improved-online-correlated-selection-2106.042242021-12-17 https://scifaro.com/en/abs/countbf-a-general-purpose-high-accuracy-and-space-efficient-counting-bloom-filter-2106.043642021-06-09 https://scifaro.com/en/abs/robustbf-a-high-accuracy-and-memory-efficient-2d-bloom-filter-2106.043652021-09-09 https://scifaro.com/en/abs/sketch-based-anomaly-detection-in-streaming-graphs-2106.044862023-07-18 https://scifaro.com/en/abs/new-competitive-semi-online-scheduling-algorithms-for-small-number-of-identical-machines-2106.046292021-06-10 https://scifaro.com/en/abs/boolean-matrix-factorization-via-nonnegative-auxiliary-optimization-2106.047082021-08-27 https://scifaro.com/en/abs/parchain-a-framework-for-parallel-hierarchical-agglomerative-clustering-using-nearest-neighbor-chain-2106.047272022-02-15 https://scifaro.com/en/abs/strongly-sublinear-algorithms-for-testing-pattern-freeness-2106.048562024-08-07 https://scifaro.com/en/abs/lossless-online-rounding-for-online-bipartite-matching-despite-its-impossibility-2106.048632022-11-08 https://scifaro.com/en/abs/pattern-defeating-quicksort-2106.051232021-06-10 https://scifaro.com/en/abs/prior-aware-distribution-estimation-for-differential-privacy-2106.051312021-06-10 https://scifaro.com/en/abs/local-algorithms-for-finding-densely-connected-clusters-2106.052452021-06-10 https://scifaro.com/en/abs/fair-disaster-containment-via-graph-cut-problems-2106.054242022-02-17 https://scifaro.com/en/abs/lower-bounds-on-metropolized-sampling-methods-for-well-conditioned-distributions-2106.054802021-10-28 https://scifaro.com/en/abs/deterministic-mincut-in-almost-linear-time-2106.055132026-05-07 https://scifaro.com/en/abs/multiway-online-correlated-selection-2106.055792021-09-22 https://scifaro.com/en/abs/hierarchical-agglomerative-graph-clustering-in-nearly-linear-time-2106.056102021-06-11 https://scifaro.com/en/abs/valued-authorization-policy-existence-problem-theory-and-experiments-2106.057612021-07-15 https://scifaro.com/en/abs/incremental-space-filling-design-based-on-coverings-and-spacings-improving-upon-low-discrepancy-sequences-2106.058332021-06-11 https://scifaro.com/en/abs/graph-balancing-with-orientation-costs-2106.059392021-06-11 https://scifaro.com/en/abs/an-optimal-algorithm-for-strict-circular-seriation-2106.059442021-06-11 https://scifaro.com/en/abs/small-space-and-streaming-pattern-matching-with-k-edits-2106.060372021-06-14 https://scifaro.com/en/abs/matching-patterns-with-variables-under-hamming-distance-2106.062492021-06-14 https://scifaro.com/en/abs/extendedhyperloglog-analysis-of-a-new-cardinality-estimator-2106.065252021-06-18 https://scifaro.com/en/abs/tight-fpt-approximation-for-socially-fair-clustering-2106.067552021-09-14 https://scifaro.com/en/abs/improved-guarantees-for-offline-stochastic-matching-via-new-ordered-contention-resolution-schemes-2106.068922026-04-21 https://scifaro.com/en/abs/an-efficient-way-to-manage-ranges-of-data-with-wise-red-black-trees-2106.069502021-10-18 https://scifaro.com/en/abs/the-k-mappability-problem-revisited-2106.070172021-06-15 https://scifaro.com/en/abs/the-power-of-randomization-efficient-and-effective-algorithms-for-constrained-submodular-maximization-2106.071162021-06-16 https://scifaro.com/en/abs/fast-construction-of-4-additive-spanners-2106.071522021-09-21 https://scifaro.com/en/abs/coresets-for-constrained-k-median-and-k-means-clustering-in-low-dimensional-euclidean-space-2106.073192021-06-15 https://scifaro.com/en/abs/exact-counting-and-sampling-of-optima-for-the-knapsack-problem-2106.074122021-06-15 https://scifaro.com/en/abs/fundamentals-of-partial-rejection-sampling-2106.077442024-09-18 https://scifaro.com/en/abs/asymptotically-optimal-locally-private-heavy-hitters-via-parameterized-sketches-2106.078152022-02-18 https://scifaro.com/en/abs/on-the-queue-number-of-planar-graphs-2106.080032021-08-06 https://scifaro.com/en/abs/a-linear-time-n-0-4-approximation-for-longest-common-subsequence-2106.081952021-06-16 https://scifaro.com/en/abs/correlation-clustering-in-constant-many-parallel-rounds-2106.084482021-06-17 https://scifaro.com/en/abs/clustering-mixture-models-in-almost-linear-time-via-list-decodable-mean-estimation-2106.085372021-11-15 https://scifaro.com/en/abs/high-quality-hypergraph-partitioning-2106.086962021-06-17 https://scifaro.com/en/abs/identifiability-of-amp-chain-graph-models-2106.093502021-06-18 https://scifaro.com/en/abs/statistical-query-lower-bounds-for-list-decodable-linear-regression-2106.096892021-06-18 https://scifaro.com/en/abs/faster-sparse-matrix-inversion-and-rank-computation-in-finite-fields-2106.098302022-12-13 https://scifaro.com/en/abs/envy-freeness-and-relaxed-stability-for-lower-quotas-a-parameterized-perspective-2106.099172022-05-20 https://scifaro.com/en/abs/beating-the-folklore-algorithm-for-dynamic-matching-2106.103212021-11-30 https://scifaro.com/en/abs/sublinear-time-hypergraph-sparsification-via-cut-and-edge-sampling-queries-2106.103862021-06-22 https://scifaro.com/en/abs/checking-whether-a-word-is-hamming-isometric-in-linear-time-2106.105412022-08-09 https://scifaro.com/en/abs/a-ptas-for-k-hop-mst-on-the-euclidean-plane-improving-dependency-on-k-2106.110922021-06-22 https://scifaro.com/en/abs/computing-the-original-ebwt-faster-simpler-and-with-less-memory-2106.111912021-06-22 https://scifaro.com/en/abs/first-approximation-for-uniform-lower-and-upper-bounded-facility-location-problem-avoiding-violation-in-lower-bounds-2106.113722021-06-28 https://scifaro.com/en/abs/practical-near-neighbor-search-via-group-testing-2106.115652021-06-23 https://scifaro.com/en/abs/preprocessing-to-reduce-the-search-space-antler-structures-for-feedback-vertex-set-2106.116752024-04-12 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-connected-flow-and-many-visits-tsp-problem-2106.116892021-07-21 https://scifaro.com/en/abs/diversity-aware-k-median-clustering-with-fair-center-representation-2106.116962022-10-25 https://scifaro.com/en/abs/fully-dynamic-algorithms-for-minimum-weight-cycle-and-related-problems-2106.117442021-06-23 https://scifaro.com/en/abs/robust-regression-revisited-acceleration-and-improved-estimation-rates-2106.119382021-06-23 https://scifaro.com/en/abs/better-algorithms-for-individually-fair-k-clustering-2106.121502021-06-24 https://scifaro.com/en/abs/a-bloom-filter-survey-variants-for-different-domain-applications-2106.121892021-06-24 https://scifaro.com/en/abs/weighted-random-sampling-on-gpus-2106.122702022-05-24 https://scifaro.com/en/abs/finding-single-source-shortest-p-disjoint-paths-fast-computation-and-sparse-preservers-2106.122932021-06-24 https://scifaro.com/en/abs/certifying-solution-geometry-in-random-csps-counts-clusters-and-balance-2106.127102021-06-25 https://scifaro.com/en/abs/breaking-the-o-n-barrier-in-the-construction-of-compressed-suffix-arrays-and-suffix-trees-2106.127252023-04-20 https://scifaro.com/en/abs/optimal-fine-grained-hardness-of-approximation-of-linear-equations-2106.132102021-06-25 https://scifaro.com/en/abs/johnson-lindenstrauss-embeddings-with-kronecker-structure-2106.133492021-06-28 https://scifaro.com/en/abs/the-price-of-tolerance-in-distribution-testing-2106.134142021-11-10 https://scifaro.com/en/abs/geometry-meets-vectors-approximation-algorithms-for-multidimensional-packing-2106.139512021-06-29 https://scifaro.com/en/abs/improved-approximation-algorithms-for-individually-fair-clustering-2106.140432022-03-02 https://scifaro.com/en/abs/generalized-max-flows-and-min-cuts-in-simplicial-complexes-2106.141162021-06-29 https://scifaro.com/en/abs/alpha-approximate-reductions-a-novel-source-of-heuristics-for-better-approximation-algorithms-2106.141692021-06-29 https://scifaro.com/en/abs/scheduling-on-uniform-and-unrelated-machines-with-bipartite-incompatibility-graphs-2106.143542021-06-29 https://scifaro.com/en/abs/fractionally-subadditive-maximization-under-an-incremental-knapsack-constraint-2106.144542023-05-25 https://scifaro.com/en/abs/differentially-private-algorithms-for-graphs-under-continual-observation-2106.147562025-09-24 https://scifaro.com/en/abs/additive-sparsification-of-csps-2106.147572024-01-04 https://scifaro.com/en/abs/experimental-comparison-of-pc-trees-and-pq-trees-2106.148052021-06-29 https://scifaro.com/en/abs/ell-p-norm-multiway-cut-2106.148402021-06-29 https://scifaro.com/en/abs/isomorphism-testing-parameterized-by-genus-and-beyond-2106.148692024-03-08 https://scifaro.com/en/abs/hop-constrained-metric-embeddings-and-their-applications-2106.149692024-03-01 https://scifaro.com/en/abs/approximation-schemes-for-capacitated-vehicle-routing-on-graphs-of-bounded-treewidth-bounded-doubling-or-highway-dimension-2106.150342021-06-30 https://scifaro.com/en/abs/fully-dynamic-four-vertex-subgraph-counting-2106.155242022-03-18 https://scifaro.com/en/abs/near-optimal-deterministic-single-source-distance-sensitivity-oracles-2106.157312021-07-01 https://scifaro.com/en/abs/optimally-rescheduling-jobs-with-a-lifo-buffer-2106.159012021-07-01 https://scifaro.com/en/abs/perfect-sampling-in-infinite-spin-systems-via-strong-spatial-mixing-2106.159922021-07-01 https://scifaro.com/en/abs/coresets-for-clustering-with-missing-values-2106.161122021-11-12 https://scifaro.com/en/abs/the-power-of-adaptivity-for-stochastic-submodular-cover-2106.161152021-07-01 https://scifaro.com/en/abs/nearly-tight-and-oblivious-algorithms-for-explainable-clustering-2106.161472021-10-26 https://scifaro.com/en/abs/grid-recognition-classical-and-parameterized-computational-perspectives-2106.161802021-07-01 https://scifaro.com/en/abs/a-simple-linear-time-algorithm-for-the-common-refinement-of-rooted-phylogenetic-trees-on-a-common-leaf-set-2107.000722021-09-27 https://scifaro.com/en/abs/improved-analysis-of-online-balanced-clustering-2107.001452021-08-26 https://scifaro.com/en/abs/l-p-isotonic-regression-algorithms-using-an-l-0-approach-2107.002512023-07-03 https://scifaro.com/en/abs/backtracking-the-algorithms-on-the-hamiltonian-cycle-problem-2107.003142023-06-30 https://scifaro.com/en/abs/evidence-for-long-tails-in-sls-algorithms-2107.003782021-07-02 https://scifaro.com/en/abs/on-variants-of-facility-location-problem-with-outliers-2107.004032021-07-02 https://scifaro.com/en/abs/compression-by-contracting-straight-line-programs-2107.004462021-07-02 https://scifaro.com/en/abs/orienting-hyper-graphs-under-explorable-stochastic-uncertainty-2107.005722021-07-02 https://scifaro.com/en/abs/on-the-bike-spreading-problem-2107.007612021-08-20 https://scifaro.com/en/abs/near-optimal-algorithms-for-explainable-k-medians-and-k-means-2107.007982021-08-04 https://scifaro.com/en/abs/online-matching-in-sparse-random-graphs-non-asymptotic-performances-of-greedy-algorithm-2107.009952021-07-05 https://scifaro.com/en/abs/an-improved-fixed-parameter-algorithm-for-2-club-cluster-edge-deletion-2107.011332021-07-05 https://scifaro.com/en/abs/linear-probing-revisited-tombstones-mark-the-death-of-primary-clustering-2107.012502021-07-06 https://scifaro.com/en/abs/engineering-multiqueues-fast-relaxed-concurrent-priority-queues-2107.013502021-07-23 https://scifaro.com/en/abs/recombinant-sort-n-dimensional-cartesian-spaced-algorithm-designed-from-synergetic-combination-of-hashing-bucket-counting-and-radix-sort-2107.013912021-07-06 https://scifaro.com/en/abs/algorithms-for-normalized-multiple-sequence-alignments-2107.016072021-12-06 https://scifaro.com/en/abs/closing-the-gap-for-single-resource-constraint-scheduling-2107.016132021-07-06 https://scifaro.com/en/abs/sublinear-space-approximation-algorithms-for-max-r-sat-2107.016732021-07-06 https://scifaro.com/en/abs/fine-grained-completeness-for-optimization-in-p-2107.017212021-07-06 https://scifaro.com/en/abs/dynamic-programming-by-polymorphic-semiring-algebraic-shortcut-fusion-2107.017522024-05-17 https://scifaro.com/en/abs/randomized-dimensionality-reduction-for-facility-location-and-single-linkage-clustering-2107.018042021-07-06 https://scifaro.com/en/abs/spanner-approximations-in-practice-2107.020182021-07-06 https://scifaro.com/en/abs/incremental-edge-orientation-in-forests-2107.023182021-07-07 https://scifaro.com/en/abs/on-the-hardness-of-compressing-weights-2107.025542021-07-07 https://scifaro.com/en/abs/noisy-boolean-hidden-matching-with-applications-2107.025782022-01-31 https://scifaro.com/en/abs/a-general-approach-to-approximate-multistage-subgraph-problems-2107.025812023-06-16 https://scifaro.com/en/abs/making-three-out-of-two-three-way-online-correlated-selection-2107.026052021-07-07 https://scifaro.com/en/abs/distance-estimation-between-unknown-matrices-using-sublinear-projections-on-hamming-cube-2107.026662021-07-07 https://scifaro.com/en/abs/deann-speeding-up-kernel-density-estimation-using-approximate-nearest-neighbor-search-2107.027362022-03-02 https://scifaro.com/en/abs/telescoping-filter-a-practical-adaptive-filter-2107.028662021-07-08 https://scifaro.com/en/abs/twin-width-and-polynomial-kernels-2107.028822021-09-15 https://scifaro.com/en/abs/on-the-fault-tolerant-online-bin-packing-problem-2107.029222021-07-08 https://scifaro.com/en/abs/fractional-homomorphism-weisfeiler-leman-invariance-and-the-sherali-adams-hierarchy-for-the-constraint-satisfaction-problem-2107.029562021-07-08 https://scifaro.com/en/abs/budgeted-dominating-sets-in-uncertain-graphs-2107.030202021-07-08 https://scifaro.com/en/abs/an-approximation-algorithm-for-maximum-stable-matching-with-ties-and-constraints-2107.030762021-10-06 https://scifaro.com/en/abs/reconfiguring-non-spanning-arborescences-2107.030922023-03-16 https://scifaro.com/en/abs/refined-computational-complexities-of-hospitals-residents-problem-with-regional-caps-2107.031232021-07-08 https://scifaro.com/en/abs/a-heuristic-for-direct-product-graph-decomposition-2107.031332025-11-06 https://scifaro.com/en/abs/defeating-duplicates-a-re-design-of-the-learnedsort-algorithm-2107.032902021-07-08 https://scifaro.com/en/abs/burrows-wheeler-transform-on-a-large-scale-algorithms-implemented-in-apache-spark-2107.033412021-07-08 https://scifaro.com/en/abs/space-efficient-fault-tolerant-diameter-oracles-2107.034852021-07-09 https://scifaro.com/en/abs/on-submodular-prophet-inequalities-and-correlation-gap-2107.036622021-07-09 https://scifaro.com/en/abs/an-efficient-reduction-of-a-gammoid-to-a-partition-matroid-2107.037952021-07-09 https://scifaro.com/en/abs/edge-sampling-and-graph-parameter-estimation-via-vertex-neighborhood-accesses-2107.038212022-04-13 https://scifaro.com/en/abs/perfect-sampling-for-atomic-lov-asz-local-lemma-2107.039322021-07-09 https://scifaro.com/en/abs/a-tight-max-flow-min-cut-duality-theorem-for-non-linear-multicommodity-flows-2107.042522024-03-05 https://scifaro.com/en/abs/preventing-small-mathbf-s-t-cuts-by-protecting-edges-2107.044822021-07-12 https://scifaro.com/en/abs/optimal-space-and-time-for-streaming-pattern-matching-2107.046602021-07-13 https://scifaro.com/en/abs/approximation-algorithms-for-the-directed-path-partition-problems-2107.046992021-07-13 https://scifaro.com/en/abs/hitting-weighted-even-cycles-in-planar-graphs-2107.047632021-08-03 https://scifaro.com/en/abs/analysis-of-smooth-heaps-and-slim-heaps-2107.049192021-07-13 https://scifaro.com/en/abs/the-mixed-page-number-of-graphs-2107.049932021-07-13 https://scifaro.com/en/abs/efficient-and-effective-algorithms-for-revenue-maximization-in-social-advertising-2107.049972021-07-27 https://scifaro.com/en/abs/polynomial-time-algorithm-for-maximum-independent-set-in-bounded-degree-graphs-with-no-long-induced-claws-2107.054342022-02-09 https://scifaro.com/en/abs/strongly-hyperbolic-unit-disk-graphs-2107.055182022-12-16 https://scifaro.com/en/abs/strong-recovery-of-geometric-planted-matchings-2107.055672021-07-13 https://scifaro.com/en/abs/in-database-regression-in-input-sparsity-time-2107.056722021-07-14 https://scifaro.com/en/abs/sparsifying-shrinking-and-splicing-for-minimum-path-cover-in-parameterized-linear-time-2107.057172021-07-14 https://scifaro.com/en/abs/noisy-binary-searching-simple-fast-and-correct-2107.057532025-02-27 https://scifaro.com/en/abs/a-parallel-approximation-algorithm-for-maximizing-submodular-b-matching-2107.057932021-07-14 https://scifaro.com/en/abs/multi-token-markov-game-with-switching-costs-2107.058222021-11-02 https://scifaro.com/en/abs/polynomial-delay-algorithm-for-minimal-chordal-completions-2107.059722021-07-14 https://scifaro.com/en/abs/bag-of-tasks-scheduling-on-related-machines-2107.062162021-07-14 https://scifaro.com/en/abs/maintaining-mathsf-cmso-2-properties-on-dynamic-structures-with-bounded-feedback-vertex-number-2107.062322025-01-28 https://scifaro.com/en/abs/towards-a-decomposition-optimal-algorithm-for-counting-and-sampling-arbitrary-motifs-in-sublinear-time-2107.065822021-07-20 https://scifaro.com/en/abs/oblivious-sketching-for-logistic-regression-2107.066152021-07-15 https://scifaro.com/en/abs/optimality-of-the-johnson-lindenstrauss-dimensionality-reduction-for-practical-measures-2107.066262022-03-17 https://scifaro.com/en/abs/eth-tight-algorithms-for-geometric-intersection-graphs-now-in-polynomial-space-2107.067152021-07-15 https://scifaro.com/en/abs/efficient-approximate-search-for-sets-of-vectors-2107.068172021-08-31 https://scifaro.com/en/abs/levenshtein-graphs-resolvability-automorphisms-determining-sets-2107.069512021-07-16 https://scifaro.com/en/abs/on-optimal-approximations-for-k-submodular-maximization-via-multilinear-extension-2107.071032023-09-13 https://scifaro.com/en/abs/an-efficient-semi-streaming-ptas-for-tournament-feedback-arcset-with-few-passes-2107.071412021-09-15 https://scifaro.com/en/abs/streaming-submodular-maximization-under-matroid-constraints-2107.071832022-02-17 https://scifaro.com/en/abs/traversing-the-fft-computation-tree-for-dimension-independent-sparse-fourier-transforms-2107.073472023-01-24 https://scifaro.com/en/abs/a-refined-approximation-for-euclidean-k-means-2107.073582021-09-21 https://scifaro.com/en/abs/lossy-kernelization-of-same-size-clustering-2107.073832021-07-16 https://scifaro.com/en/abs/local-search-for-weighted-tree-augmentation-and-steiner-tree-2107.074032021-07-16 https://scifaro.com/en/abs/optimal-stopping-methodology-for-the-secretary-problem-with-random-queries-2107.075132024-05-08 https://scifaro.com/en/abs/correlation-detection-in-trees-for-planted-graph-alignment-2107.076232024-09-06 https://scifaro.com/en/abs/deterministic-and-las-vegas-algorithms-for-sparse-nonnegative-convolution-2107.076252021-07-19 https://scifaro.com/en/abs/streaming-and-distributed-algorithms-for-robust-column-subset-selection-2107.076572021-07-19 https://scifaro.com/en/abs/estimation-from-partially-sampled-distributed-traces-2107.077032021-07-19 https://scifaro.com/en/abs/skeletons-and-minimum-energy-scheduling-2107.078002021-07-19 https://scifaro.com/en/abs/on-the-extended-tsp-problem-2107.078152021-07-19 https://scifaro.com/en/abs/on-two-pass-streaming-algorithms-for-maximum-bipartite-matching-2107.078412021-09-20 https://scifaro.com/en/abs/single-pass-entrywise-transformed-low-rank-approximation-2107.078892021-07-19 https://scifaro.com/en/abs/dxhash-a-scalable-consistent-hash-based-on-the-pseudo-random-sequence-2107.079302023-11-21 https://scifaro.com/en/abs/near-optimal-algorithms-for-linear-algebra-in-the-current-matrix-multiplication-time-2107.080902021-11-04 https://scifaro.com/en/abs/improved-bounds-for-online-facility-location-with-predictions-2107.082772024-08-20 https://scifaro.com/en/abs/anti-tai-mapping-for-unordered-labeled-trees-2107.082922021-07-20 https://scifaro.com/en/abs/elliptic-curve-fast-fourier-transform-ecfft-part-i-fast-polynomial-algorithms-over-all-finite-fields-2107.084732021-10-13 https://scifaro.com/en/abs/efficient-algorithms-for-maximum-induced-matching-problem-in-permutation-and-trapezoid-graphs-2107.084802023-06-22 https://scifaro.com/en/abs/computing-the-fuzzy-partition-corresponding-to-the-greatest-fuzzy-auto-bisimulation-of-a-fuzzy-graph-based-structure-2107.085422021-07-20 https://scifaro.com/en/abs/sensitivity-of-string-compressors-and-repetitiveness-measures-2107.086152023-02-10 https://scifaro.com/en/abs/several-methods-of-analysis-for-cardinality-constrained-bin-packing-2107.087252021-07-20 https://scifaro.com/en/abs/algorithms-for-hard-constraint-point-processes-via-discretization-2107.088482022-02-17 https://scifaro.com/en/abs/hardness-of-detecting-abelian-and-additive-square-factors-in-strings-2107.092062021-07-21 https://scifaro.com/en/abs/investigating-the-recoverable-robust-single-machine-scheduling-problem-under-interval-uncertainty-2107.093102022-03-08 https://scifaro.com/en/abs/approximate-trace-reconstruction-via-median-string-in-average-case-2107.094972021-07-21 https://scifaro.com/en/abs/optimizing-the-order-of-actions-in-contact-tracing-2107.098032021-07-22 https://scifaro.com/en/abs/on-reconfigurability-of-target-sets-2107.098852022-12-07 https://scifaro.com/en/abs/learning-sparse-fixed-structure-gaussian-bayesian-networks-2107.104502022-10-19 https://scifaro.com/en/abs/the-traveling-firefighter-problem-2107.104542021-07-23 https://scifaro.com/en/abs/the-stationary-prophet-inequality-problem-2107.105162021-07-23 https://scifaro.com/en/abs/fast-low-rank-tensor-decomposition-by-ridge-leverage-score-sampling-2107.106542021-07-23 https://scifaro.com/en/abs/theory-and-practice-of-algorithm-engineering-2107.106752021-07-23 https://scifaro.com/en/abs/testing-isomorphism-of-chordal-graphs-of-bounded-leafage-is-fixed-parameter-tractable-2107.106892022-02-16 https://scifaro.com/en/abs/towards-a-practical-budget-oblivious-algorithm-for-the-adwords-problem-under-small-bids-2107.107772023-07-25 https://scifaro.com/en/abs/robust-adaptive-submodular-maximization-2107.113332022-09-13 https://scifaro.com/en/abs/near-optimal-average-case-approximate-trace-reconstruction-from-few-traces-2107.115302021-08-26 https://scifaro.com/en/abs/efficient-inference-of-interventional-distributions-2107.117122021-07-28 https://scifaro.com/en/abs/power-of-human-algorithm-collaboration-in-solving-combinatorial-optimization-problems-2107.117842021-07-27 https://scifaro.com/en/abs/on-kernels-for-d-path-vertex-cover-2107.122452022-07-26 https://scifaro.com/en/abs/approximating-sumset-size-2107.123672021-07-27 https://scifaro.com/en/abs/the-space-complexity-of-sum-labelling-2107.129732022-01-06 https://scifaro.com/en/abs/semi-streaming-algorithms-for-submodular-function-maximization-under-b-matching-matroid-and-matchoid-constraints-2107.130712022-01-11 https://scifaro.com/en/abs/top-k-convolution-and-the-quest-for-near-linear-output-sensitive-subset-sum-2107.132062023-04-25 https://scifaro.com/en/abs/1-epsilon-approximate-shortest-paths-in-dynamic-streams-2107.133092022-07-12 https://scifaro.com/en/abs/on-the-approximability-of-multistage-min-sum-set-cover-2107.133442021-07-29 https://scifaro.com/en/abs/broute-a-benchmark-suite-for-the-implementation-of-standard-vehicle-routing-algorithms-2107.134922021-12-03 https://scifaro.com/en/abs/load-balancing-the-long-road-from-theory-to-practice-2107.136382021-07-30 https://scifaro.com/en/abs/a-new-lossless-data-compression-algorithm-exploiting-positional-redundancy-2107.138012021-07-30 https://scifaro.com/en/abs/the-complexity-of-growing-a-graph-2107.141262022-12-20 https://scifaro.com/en/abs/can-t-see-the-forest-for-the-trees-navigating-metric-spaces-by-bounded-hop-diameter-spanners-2107.142212022-06-03 https://scifaro.com/en/abs/a-framework-for-adversarial-streaming-via-differential-privacy-and-difference-estimators-2107.145272022-09-27 https://scifaro.com/en/abs/assistance-and-interdiction-problems-on-interval-graphs-2107.145502021-08-02 https://scifaro.com/en/abs/cache-replacement-algorithm-2107.146462021-08-02 https://scifaro.com/en/abs/algorithms-for-energy-conservation-in-heterogeneous-data-centers-2107.146722021-08-02 https://scifaro.com/en/abs/algorithms-for-right-sizing-heterogeneous-data-centers-2107.146922021-08-02 https://scifaro.com/en/abs/near-optimal-spanners-for-general-graphs-in-nearly-linear-time-2108.001022021-08-03 https://scifaro.com/en/abs/recognizing-and-embedding-simple-optimal-2-planar-graphs-2108.006652021-08-04 https://scifaro.com/en/abs/biobjective-optimization-problems-on-matroids-with-binary-costs-2108.007092022-03-15 https://scifaro.com/en/abs/hardness-and-approximation-of-submodular-minimum-linear-ordering-problems-2108.009142023-10-30 https://scifaro.com/en/abs/the-sdp-value-of-random-2csps-2108.010382021-08-03 https://scifaro.com/en/abs/approximate-counting-and-sampling-via-local-central-limit-theorems-2108.011612021-08-04 https://scifaro.com/en/abs/constant-factor-approximation-for-tracking-paths-and-fault-tolerant-feedback-vertex-set-2108.014302022-02-25 https://scifaro.com/en/abs/node-connectivity-augmentation-via-iterative-randomized-rounding-2108.020412021-08-05 https://scifaro.com/en/abs/server-cloud-scheduling-2108.021092023-02-20 https://scifaro.com/en/abs/scheduling-with-communication-delay-in-near-linear-time-2108.027702022-02-01 https://scifaro.com/en/abs/an-output-sensitive-algorithm-for-all-pairs-shortest-paths-in-directed-acyclic-graphs-2108.034552021-08-10 https://scifaro.com/en/abs/upfront-commitment-in-online-resource-allocation-with-patient-customers-2108.035172023-10-24 https://scifaro.com/en/abs/speuler-semantics-preserving-euler-diagrams-2108.035292021-08-10 https://scifaro.com/en/abs/fairest-neighbors-tradeoffs-between-metric-queries-2108.036212021-08-10 https://scifaro.com/en/abs/a-polynomial-time-deterministic-algorithm-for-an-np-complete-problem-2108.038772025-08-15 https://scifaro.com/en/abs/eptas-for-load-balancing-problem-on-parallel-machines-with-a-non-renewable-resource-2108.040712021-08-10 https://scifaro.com/en/abs/deterministic-massively-parallel-connectivity-2108.041022021-08-10 https://scifaro.com/en/abs/small-parsimony-for-natural-genomes-in-the-dcj-indel-model-2108.042972021-08-11 https://scifaro.com/en/abs/improved-parallel-algorithm-for-minimum-cost-submodular-cover-problem-2108.044162022-06-16 https://scifaro.com/en/abs/a-d-competitive-algorithm-for-the-multilevel-aggregation-problem-with-deadlines-2108.044222021-08-11 https://scifaro.com/en/abs/a-tight-analysis-of-slim-heaps-and-smooth-heaps-2108.044582021-11-08 https://scifaro.com/en/abs/random-rank-based-hierarchical-or-trivial-which-dynamic-graph-algorithm-performs-best-in-practice-2108.045642021-08-11 https://scifaro.com/en/abs/algorithm-engineering-for-cut-problems-2108.045662021-08-11 https://scifaro.com/en/abs/on-learning-and-testing-decision-tree-2108.045872021-08-11 https://scifaro.com/en/abs/parallel-computation-of-combinatorial-symmetries-2108.045902021-08-11 https://scifaro.com/en/abs/spectral-robustness-for-correlation-clustering-reconstruction-in-semi-adversarial-models-2108.047292022-02-09 https://scifaro.com/en/abs/tutorial-on-the-robust-interior-point-method-2108.047342021-08-11 https://scifaro.com/en/abs/practical-evaluation-of-lyndon-factors-via-alphabet-reordering-2108.049882021-08-12 https://scifaro.com/en/abs/statistical-inference-in-the-differential-privacy-model-2108.050002021-08-21 https://scifaro.com/en/abs/learning-to-hash-robustly-guaranteed-2108.054332022-07-08 https://scifaro.com/en/abs/space-efficient-huffman-codes-revisited-2108.054952021-08-19 https://scifaro.com/en/abs/on-the-fine-grained-complexity-of-the-unbounded-subsetsum-and-the-frobenius-problem-2108.055812021-08-13 https://scifaro.com/en/abs/correlation-clustering-with-asymmetric-classification-errors-2108.056962021-08-13 https://scifaro.com/en/abs/local-correlation-clustering-with-asymmetric-classification-errors-2108.056972021-08-13 https://scifaro.com/en/abs/cnf-satisfiability-in-a-subspace-and-related-problems-2108.059142021-08-16 https://scifaro.com/en/abs/derandomization-of-cell-sampling-2108.059702022-10-18 https://scifaro.com/en/abs/a-faster-algorithm-for-quickest-transshipments-via-an-extended-discrete-newton-method-2108.062392021-08-16 https://scifaro.com/en/abs/efficient-network-analysis-under-single-link-deletion-2108.068912022-02-17 https://scifaro.com/en/abs/speed-scaling-with-multiple-servers-under-a-sum-power-constraint-2108.069352021-08-19 https://scifaro.com/en/abs/computing-and-listing-avoidable-vertices-and-paths-2108.071602022-05-04 https://scifaro.com/en/abs/a-two-pass-lower-bound-for-semi-streaming-maximum-matching-2108.071872021-08-17 https://scifaro.com/en/abs/better-gpu-hash-tables-2108.072322022-12-20 https://scifaro.com/en/abs/approximating-the-permanent-with-deep-rejection-sampling-2108.073592021-08-18 https://scifaro.com/en/abs/anomalymaxq-anomaly-structured-maximization-to-query-in-attributed-network-2108.074052021-08-18 https://scifaro.com/en/abs/a-heuristic-for-listing-almost-clique-minimal-separators-of-a-graph-2108.075512021-08-18 https://scifaro.com/en/abs/a-tighter-relation-between-hereditary-discrepancy-and-determinant-lower-bound-2108.079452021-11-03 https://scifaro.com/en/abs/non-uniform-quantization-with-linear-average-case-computation-time-2108.082282021-08-19 https://scifaro.com/en/abs/a-1-o-1-n-approximation-algorithm-for-ttp-2-2108.084442021-08-20 https://scifaro.com/en/abs/improved-linear-time-algorithm-for-computing-the-4-edge-connected-components-of-a-graph-2108.085582021-08-20 https://scifaro.com/en/abs/the-fine-grained-complexity-of-episode-matching-2108.086132024-02-15 https://scifaro.com/en/abs/maintaining-an-edcs-in-general-graphs-simpler-density-sensitive-and-with-worst-case-time-bounds-2108.088252021-08-20 https://scifaro.com/en/abs/partitioned-k-nearest-neighbor-local-depth-for-scalable-comparison-based-learning-2108.088642021-12-06 https://scifaro.com/en/abs/distributed-transformations-of-hamiltonian-shapes-based-on-line-moves-2108.089532021-08-25 https://scifaro.com/en/abs/uniformity-testing-in-the-shuffle-model-simpler-better-faster-2108.089872021-10-19 https://scifaro.com/en/abs/does-preprocessing-help-in-fast-sequence-comparisons-2108.091152021-08-23 https://scifaro.com/en/abs/wave-function-collapse-coloring-a-new-heuristic-for-fast-vertex-coloring-2108.093292021-08-24 https://scifaro.com/en/abs/a-pivot-gray-code-listing-for-the-spanning-trees-of-the-fan-graph-2108.093632021-08-24 https://scifaro.com/en/abs/fast-sketching-of-polynomial-kernels-of-polynomial-degree-2108.094202021-08-24 https://scifaro.com/en/abs/implementation-of-algorithms-for-right-sizing-data-centers-2108.094892021-08-24 https://scifaro.com/en/abs/online-ride-hitching-in-uav-travelling-2108.096062021-08-24 https://scifaro.com/en/abs/a-unified-framework-for-hopsets-and-spanners-2108.096732025-01-10 https://scifaro.com/en/abs/a-framework-for-computing-greedy-clique-cover-2108.098512022-09-07 https://scifaro.com/en/abs/the-complexity-of-high-dimensional-cuts-2108.101952021-08-24 https://scifaro.com/en/abs/approximation-and-parameterized-algorithms-to-find-balanced-connected-partitions-of-graphs-2108.103982021-08-25 https://scifaro.com/en/abs/deterministic-dynamic-matching-in-worst-case-update-time-2108.104612021-11-22 https://scifaro.com/en/abs/the-complexity-of-testing-all-properties-of-planar-graphs-and-the-role-of-isomorphism-2108.105472024-05-10 https://scifaro.com/en/abs/succinct-data-structures-for-series-parallel-block-cactus-and-3-leaf-power-graphs-2108.107762021-08-27 https://scifaro.com/en/abs/randomized-c-c-dynamic-memory-allocator-2108.107792021-08-25 https://scifaro.com/en/abs/faster-exponential-algorithm-for-permutation-pattern-matching-2108.114752021-08-27 https://scifaro.com/en/abs/dynamic-structural-clustering-on-graphs-2108.115492021-08-27 https://scifaro.com/en/abs/approximation-algorithms-for-the-random-field-ising-model-2108.118892021-08-27 https://scifaro.com/en/abs/truly-perfect-samplers-for-data-streams-and-sliding-windows-2108.120172021-08-30 https://scifaro.com/en/abs/an-introduction-to-hamiltonian-monte-carlo-method-for-sampling-2108.121072021-08-30 https://scifaro.com/en/abs/the-stochastic-bilevel-continuous-knapsack-problem-with-uncertain-follower-s-objective-2108.123032022-07-19 https://scifaro.com/en/abs/renting-servers-in-the-cloud-the-case-of-equal-duration-jobs-2108.124862024-10-11 https://scifaro.com/en/abs/planar-straight-line-realizations-of-2-trees-with-prescribed-edge-lengths-2108.126282021-10-08 https://scifaro.com/en/abs/exact-algorithms-for-maximum-weighted-independent-set-on-sparse-graphs-2108.128402021-08-31 https://scifaro.com/en/abs/approximating-pandora-s-box-with-correlations-2108.129762023-07-25 https://scifaro.com/en/abs/a-further-improvement-on-approximating-ttp-2-2108.130602021-08-31 https://scifaro.com/en/abs/a-new-test-for-hamming-weight-dependencies-2108.130612022-03-29 https://scifaro.com/en/abs/extending-partial-representations-of-circular-arc-graphs-2108.130762021-08-31 https://scifaro.com/en/abs/bdd-based-algorithm-for-scc-decomposition-of-edge-coloured-graphs-2108.131132023-06-22 https://scifaro.com/en/abs/beyond-value-iteration-for-parity-games-strategy-iteration-with-universal-trees-2108.133382025-06-25 https://scifaro.com/en/abs/approximation-algorithms-for-priority-steiner-tree-problems-2108.135442021-09-01 https://scifaro.com/en/abs/the-approximation-ratio-of-the-k-opt-heuristic-for-the-euclidean-traveling-salesman-problem-2109.000692023-05-17 https://scifaro.com/en/abs/approximations-for-allocating-indivisible-items-with-concave-additive-valuations-2109.000812022-03-15 https://scifaro.com/en/abs/optimization-problems-in-graphs-with-locational-uncertainty-2109.003892022-09-27 https://scifaro.com/en/abs/properly-learning-decision-trees-in-almost-polynomial-time-2109.006372021-11-02 https://scifaro.com/en/abs/cut-toggling-and-cycle-toggling-for-electrical-flow-and-other-p-norm-flows-2109.006532021-09-06 https://scifaro.com/en/abs/multi-queues-can-be-state-of-the-art-priority-schedulers-2109.006572021-09-03 https://scifaro.com/en/abs/some-inapproximability-results-of-map-inference-and-exponentiated-determinantal-point-processes-2109.007272022-02-28 https://scifaro.com/en/abs/optimization-and-sampling-under-continuous-symmetry-examples-and-lie-theory-2109.010802021-09-03 https://scifaro.com/en/abs/retraction-improved-approximation-schemes-for-dominating-set-problems-in-unit-disk-graphs-2109.012832021-09-20 https://scifaro.com/en/abs/finding-colorful-paths-in-temporal-graphs-2109.013922021-09-06 https://scifaro.com/en/abs/symmetric-norm-estimation-and-regression-on-sliding-windows-2109.016352021-09-06 https://scifaro.com/en/abs/improving-the-floyd-warshall-all-pairs-shortest-paths-algorithm-2109.018722021-09-07 https://scifaro.com/en/abs/fast-succinct-retrieval-and-approximate-membership-using-ribbon-2109.018922022-02-08 https://scifaro.com/en/abs/stretching-your-data-with-taffy-filters-2109.019472022-01-17 https://scifaro.com/en/abs/on-the-query-complexity-of-connectivity-with-global-queries-2109.021152021-09-07 https://scifaro.com/en/abs/efficient-diagonalization-of-symmetric-matrices-associated-with-graphs-of-small-treewidth-2109.025152021-10-28 https://scifaro.com/en/abs/impatient-ppsz-a-faster-algorithm-for-csp-2109.027952021-09-08 https://scifaro.com/en/abs/worst-case-optimal-adaptive-alphabetic-prefix-free-coding-2109.029972026-01-08 https://scifaro.com/en/abs/approximately-counting-independent-sets-in-bipartite-graphs-via-graph-containers-2109.037442021-09-09 https://scifaro.com/en/abs/adversarially-robust-streaming-via-dense-sparse-trade-offs-2109.037852021-09-09 https://scifaro.com/en/abs/multi-constraint-shortest-path-using-forest-hop-labeling-2109.042212021-09-10 https://scifaro.com/en/abs/improved-online-algorithm-for-fractional-knapsack-in-the-random-order-model-2109.044282022-01-31 https://scifaro.com/en/abs/iceberg-hashing-optimizing-many-hash-table-criteria-at-once-2109.045482023-10-24 https://scifaro.com/en/abs/c-minhash-practically-reducing-two-permutations-to-just-one-2109.045952021-09-13 https://scifaro.com/en/abs/efficient-locally-optimal-number-set-partitioning-for-scheduling-allocation-and-fair-selection-2109.048092021-09-13 https://scifaro.com/en/abs/a-note-on-projection-based-recovery-of-clusters-in-markov-chains-2109.051652021-09-14 https://scifaro.com/en/abs/the-labeled-direct-product-optimally-solves-string-problems-on-graphs-2109.052902022-08-31 https://scifaro.com/en/abs/maximum-profit-routing-problem-with-multiple-vehicles-per-site-2109.054042021-09-14 https://scifaro.com/en/abs/decremental-all-pairs-shortest-paths-in-deterministic-near-linear-time-2109.056212021-09-14 https://scifaro.com/en/abs/maximum-matching-sans-maximal-matching-a-new-approach-for-finding-maximum-matchings-in-the-data-stream-model-2109.059462021-09-14 https://scifaro.com/en/abs/predictable-universally-unique-identification-of-sequential-events-on-complex-objects-2109.060282021-09-14 https://scifaro.com/en/abs/serial-and-parallel-kernelization-of-multiple-hitting-set-parameterized-by-the-dilworth-number-implemented-on-the-gpu-2109.060422023-10-12 https://scifaro.com/en/abs/a-dyadic-simulation-approach-to-efficient-range-summability-2109.063662023-01-25 https://scifaro.com/en/abs/domain-sparsification-of-discrete-distributions-using-entropic-independence-2109.064422021-09-16 https://scifaro.com/en/abs/the-complexity-of-vector-partition-2109.065692021-09-15 https://scifaro.com/en/abs/locality-in-online-dynamic-sequential-and-distributed-graph-algorithms-2109.065932022-11-15 https://scifaro.com/en/abs/distributed-vertex-cover-reconfiguration-2109.066012021-09-15 https://scifaro.com/en/abs/optimizing-the-ecological-connectivity-of-landscapes-with-generalized-flow-models-and-preprocessing-2109.066222022-04-14 https://scifaro.com/en/abs/online-k-way-matching-with-delays-and-the-h-metric-2109.066402021-09-15 https://scifaro.com/en/abs/minimum-path-star-topology-algorithms-for-weighted-regions-and-obstacles-2109.069442021-09-16 https://scifaro.com/en/abs/probabilistic-analysis-of-euclidean-capacitated-vehicle-routing-2109.069582021-12-14 https://scifaro.com/en/abs/a-characterization-of-individualization-refinement-trees-2109.073022021-09-16 https://scifaro.com/en/abs/sublinear-time-eigenvalue-approximation-via-random-sampling-2109.076472022-07-25 https://scifaro.com/en/abs/a-quadratic-time-locally-optimal-algorithm-for-np-hard-equal-cardinality-partition-optimization-2109.078822021-09-17 https://scifaro.com/en/abs/vertex-fault-tolerant-emulators-2109.080422021-11-22 https://scifaro.com/en/abs/distortion-oblivious-algorithms-for-minimizing-flow-time-2109.084242021-09-20 https://scifaro.com/en/abs/micro-architectural-analysis-of-a-learned-index-2109.084952021-09-20 https://scifaro.com/en/abs/sublinear-time-computation-in-the-presence-of-online-erasures-2109.087452025-01-03 https://scifaro.com/en/abs/streaming-algorithms-for-budgeted-k-submodular-maximization-problem-2109.088632021-10-25 https://scifaro.com/en/abs/an-improved-scheduling-algorithm-for-traveling-tournament-problem-with-maximum-trip-length-two-2109.090652021-09-21 https://scifaro.com/en/abs/solving-systems-of-inequalities-in-two-variables-with-floating-point-arithmetic-2109.095232021-09-21 https://scifaro.com/en/abs/resilient-level-ancestor-bottleneck-and-lowest-common-ancestor-queries-in-dynamic-trees-2109.095882021-09-21 https://scifaro.com/en/abs/parallel-algorithms-for-finding-large-cliques-in-sparse-graphs-2109.096632021-09-21 https://scifaro.com/en/abs/general-space-time-tradeoffs-via-relational-queries-2109.108892023-08-15 https://scifaro.com/en/abs/adversarially-robust-coloring-for-graph-streams-2109.111302021-09-24 https://scifaro.com/en/abs/an-algorithm-for-reconstructing-level-2-phylogenetic-networks-from-trinets-2109.112442021-09-24 https://scifaro.com/en/abs/faster-p-norm-regression-using-sparsity-2109.115372021-11-22 https://scifaro.com/en/abs/the-mirror-langevin-algorithm-converges-with-vanishing-bias-2109.120772021-10-12 https://scifaro.com/en/abs/group-evacuation-on-a-line-by-agents-with-different-communication-abilities-2109.126762021-09-28 https://scifaro.com/en/abs/hardness-of-graph-structured-algebraic-and-symbolic-problems-2109.127362022-11-09 https://scifaro.com/en/abs/accelerating-lsm-tree-with-the-dentry-management-of-file-system-2109.131422021-09-29 https://scifaro.com/en/abs/algorithms-for-matrix-multiplication-via-sampling-and-opportunistic-matrix-multiplication-2109.133352024-09-05 https://scifaro.com/en/abs/on-the-geometry-of-stable-steiner-tree-instances-2109.134572021-09-29 https://scifaro.com/en/abs/preemptive-two-stage-goal-programming-formulation-of-a-strict-version-of-the-unbounded-knapsack-problem-with-bounded-weights-2109.136862021-09-29 https://scifaro.com/en/abs/bit-complexity-of-jordan-normal-form-and-spectral-factorization-2109.139562022-11-29 https://scifaro.com/en/abs/extending-the-time-horizon-efficient-public-transit-routing-on-arbitrary-length-timetables-2109.141432021-09-30 https://scifaro.com/en/abs/ruler-wrapping-2109.144972022-01-11 https://scifaro.com/en/abs/sublinear-time-and-space-algorithms-for-correlation-clustering-via-sparse-dense-decompositions-2109.145282021-09-30 https://scifaro.com/en/abs/a-unifying-framework-for-characterizing-and-computing-width-measures-2109.146102021-10-01 https://scifaro.com/en/abs/breaking-the-hegemony-of-the-triangle-method-in-clique-detection-2109.148762021-10-01 https://scifaro.com/en/abs/deterministic-graph-coloring-in-the-streaming-model-2109.148912021-10-01 https://scifaro.com/en/abs/self-adjusting-packet-classification-2109.150902021-10-01 https://scifaro.com/en/abs/submodular-optimization-beyond-nonnegativity-adaptive-seed-selection-in-incentivized-social-advertising-2109.151802021-10-01 https://scifaro.com/en/abs/blazing-a-trail-via-matrix-multiplications-a-faster-algorithm-for-non-shortest-induced-paths-2109.152682024-10-02 https://scifaro.com/en/abs/near-optimal-distance-oracles-for-vertex-labeled-planar-graphs-2110.000742021-10-04 https://scifaro.com/en/abs/an-exact-linear-time-barab-asi-albert-algorithm-2110.002872022-03-31 https://scifaro.com/en/abs/online-primal-dual-algorithms-with-predictions-for-packing-problems-2110.003912021-10-04 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-longest-heapable-subsequence-and-maximum-binary-tree-2110.004952021-10-07 https://scifaro.com/en/abs/adwords-with-unknown-budgets-and-beyond-2110.005042024-03-29 https://scifaro.com/en/abs/spirality-and-rectilinear-planarity-testing-of-independent-parallel-sp-graphs-2110.005482021-10-04 https://scifaro.com/en/abs/random-subgraph-detection-using-queries-2110.007442024-05-06 https://scifaro.com/en/abs/deterministic-algorithms-for-the-hidden-subgroup-problem-2110.008272022-11-22 https://scifaro.com/en/abs/a-recursive-algorithm-for-solving-simple-stochastic-games-2110.010302021-10-05 https://scifaro.com/en/abs/is-this-the-simplest-and-most-surprising-sorting-algorithm-ever-2110.011112021-10-05 https://scifaro.com/en/abs/fm-indexing-grammars-induced-by-suffix-sorting-for-long-patterns-2110.011812021-10-05 https://scifaro.com/en/abs/clique-percolation-method-memory-efficient-almost-exact-communities-2110.012132023-08-22 https://scifaro.com/en/abs/preprocessing-for-outerplanar-vertex-deletion-an-elementary-kernel-of-quartic-size-2110.018682021-10-06 https://scifaro.com/en/abs/inferring-hidden-structures-in-random-graphs-2110.019012022-01-25 https://scifaro.com/en/abs/approximate-mathrm-cvp-in-time-2-0-802-n-now-in-any-norm-2110.023872021-10-07 https://scifaro.com/en/abs/periodic-reranking-for-online-matching-of-reusable-resources-2110.024002022-07-19 https://scifaro.com/en/abs/more-on-change-making-and-related-problems-2110.025032021-10-07 https://scifaro.com/en/abs/profile-based-optimal-stable-matchings-in-the-roommates-problem-2110.025552021-10-07 https://scifaro.com/en/abs/towards-non-uniform-k-center-with-constant-types-of-radii-2110.026882021-10-07 https://scifaro.com/en/abs/subquadratic-time-algorithm-for-the-diameter-and-all-eccentricities-on-median-graphs-2110.027092023-01-24 https://scifaro.com/en/abs/tight-bounds-for-counting-colorings-and-connected-edge-sets-parameterized-by-cutwidth-2110.027302023-08-01 https://scifaro.com/en/abs/extensions-of-karger-s-algorithm-why-they-fail-in-theory-and-how-they-are-useful-in-practice-2110.027502021-12-17 https://scifaro.com/en/abs/fitting-distances-by-tree-metrics-minimizing-the-total-error-within-a-constant-factor-2110.028072022-03-14 https://scifaro.com/en/abs/parameterized-algorithms-for-the-steiner-arborescence-problem-on-a-hypercube-2110.028302024-05-15 https://scifaro.com/en/abs/coresets-for-kernel-clustering-2110.028982024-04-09 https://scifaro.com/en/abs/faster-algorithm-for-unique-k-2-csp-2110.031222022-06-30 https://scifaro.com/en/abs/on-the-complexity-of-triangle-counting-using-emptiness-queries-2110.038362023-05-08 https://scifaro.com/en/abs/on-explicit-constructions-of-extremely-depth-robust-graphs-2110.041902022-03-24 https://scifaro.com/en/abs/a-faster-algorithm-for-max-cut-in-dense-graphs-2110.045742021-12-21 https://scifaro.com/en/abs/linear-time-algorithm-for-vertex-2-coloring-without-monochromatic-triangles-on-planar-graphs-2110.046062021-10-12 https://scifaro.com/en/abs/competitive-perimeter-defense-of-conical-environments-2110.046672022-03-31 https://scifaro.com/en/abs/a-faster-algorithm-for-maximum-independent-set-on-interval-filament-graphs-2110.049332021-10-19 https://scifaro.com/en/abs/on-solving-the-minimum-common-string-partition-problem-by-decision-diagrams-2110.051682021-10-12 https://scifaro.com/en/abs/improved-analysis-of-edcs-via-gallai-edmonds-decomposition-2110.057462021-10-13 https://scifaro.com/en/abs/popular-matchings-with-weighted-voters-2110.059012023-12-14 https://scifaro.com/en/abs/a-sat-approach-to-twin-width-2110.061462021-10-13 https://scifaro.com/en/abs/finding-relevant-points-for-nearest-neighbor-classification-2110.061632021-10-13 https://scifaro.com/en/abs/the-vlsat-2-benchmark-suite-2110.063362021-10-14 https://scifaro.com/en/abs/parameterized-complexity-of-minimum-membership-dominating-set-2110.066562021-10-14 https://scifaro.com/en/abs/online-bipartite-matching-with-reusable-resources-2110.070842022-10-25 https://scifaro.com/en/abs/on-efficient-range-summability-of-ideally-iid-random-variables-in-two-or-higher-dimensions-2110.077532023-01-25 https://scifaro.com/en/abs/compact-representation-for-matrices-of-bounded-twin-width-2110.081062021-10-18 https://scifaro.com/en/abs/terminal-embeddings-in-sublinear-time-2110.086912024-08-07 https://scifaro.com/en/abs/faster-algorithms-for-bounded-difference-min-plus-product-2110.087822022-02-03 https://scifaro.com/en/abs/online-facility-location-with-predictions-2110.088402022-08-08 https://scifaro.com/en/abs/on-monotonicity-of-number-partitioning-algorithms-2110.088862021-10-19 https://scifaro.com/en/abs/algorithms-using-local-graph-features-to-predict-epidemics-2110.089612021-10-19 https://scifaro.com/en/abs/dimensionality-reduction-for-wasserstein-barycenter-2110.089912021-10-20 https://scifaro.com/en/abs/diameter-constrained-steiner-tree-and-related-problems-2110.090692021-10-20 https://scifaro.com/en/abs/data-structure-for-node-connectivity-and-cut-queries-2110.091022023-06-27 https://scifaro.com/en/abs/machine-covering-in-the-random-order-model-2110.091612021-10-28 https://scifaro.com/en/abs/near-optimal-quantum-algorithms-for-string-problems-2110.096962021-10-22 https://scifaro.com/en/abs/exploring-the-gap-between-tolerant-and-non-tolerant-distribution-testing-2110.099722022-09-22 https://scifaro.com/en/abs/factorial-lower-bounds-for-almost-random-order-streams-2110.100912022-09-21 https://scifaro.com/en/abs/matrix-discrepancy-from-quantum-communication-2110.100992021-10-22 https://scifaro.com/en/abs/fast-bitmap-fit-a-cpu-cache-line-friendly-memory-allocator-for-single-object-allocations-2110.103572021-10-22 https://scifaro.com/en/abs/dynamic-bipartite-matching-market-with-arrivals-and-departures-2110.108242021-10-22 https://scifaro.com/en/abs/the-popular-assignment-problem-when-cardinality-is-more-important-than-popularity-2110.109842023-10-05 https://scifaro.com/en/abs/optimal-online-bipartite-matching-with-degree-information-2110.114392022-11-16 https://scifaro.com/en/abs/an-o-1-algorithm-for-implementing-the-lfu-cache-eviction-scheme-2110.116022021-10-25 https://scifaro.com/en/abs/pairwise-reachability-oracles-and-preservers-under-failures-2110.116132021-10-25 https://scifaro.com/en/abs/an-efficient-branch-and-bound-solver-for-hitting-set-2110.116972023-09-28 https://scifaro.com/en/abs/incremental-sssp-for-sparse-digraphs-beyond-the-hopset-barrier-2110.117122021-10-25 https://scifaro.com/en/abs/a-simple-boosting-framework-for-transshipment-2110.117232023-07-06 https://scifaro.com/en/abs/the-geometry-of-tree-based-sorting-2110.118362023-05-08 https://scifaro.com/en/abs/voting-algorithms-for-unique-games-on-complete-graphs-2110.118512022-11-09 https://scifaro.com/en/abs/polynomial-time-sum-of-squares-can-robustly-estimate-mean-and-covariance-of-gaussians-optimally-2110.118532021-10-25 https://scifaro.com/en/abs/tight-and-robust-private-mean-estimation-with-few-users-2110.118762022-06-14 https://scifaro.com/en/abs/approximating-lcs-and-alignment-distance-over-multiple-sequences-2110.124022021-10-26 https://scifaro.com/en/abs/dynamic-influence-maximization-2110.126022021-12-30 https://scifaro.com/en/abs/collapsing-the-tower-on-the-complexity-of-multistage-stochastic-ips-2110.127432021-10-27 https://scifaro.com/en/abs/fast-multimodal-journey-planning-for-three-criteria-2110.129542021-10-26 https://scifaro.com/en/abs/parameterized-convexity-testing-2110.130122021-10-26 https://scifaro.com/en/abs/learning-augmented-dynamic-power-management-with-multiple-states-via-new-ski-rental-bounds-2110.131162021-10-26 https://scifaro.com/en/abs/polynomial-integrality-gap-of-flow-lp-for-directed-steiner-tree-2110.133502022-11-14 https://scifaro.com/en/abs/dynamic-trace-estimation-2110.137522021-10-27 https://scifaro.com/en/abs/linear-approximate-pattern-matching-algorithm-2110.138022022-07-01 https://scifaro.com/en/abs/tight-fpt-approximation-for-constrained-k-center-and-k-supplier-2110.142422021-10-28 https://scifaro.com/en/abs/structural-parameterizations-of-budgeted-graph-coloring-2110.144982021-10-28 https://scifaro.com/en/abs/active-clustering-for-labeling-training-data-2110.145212021-10-28 https://scifaro.com/en/abs/on-competitive-permutations-for-set-cover-by-intervals-2110.145282021-10-28 https://scifaro.com/en/abs/fairer-lp-based-online-allocation-via-analytic-center-2110.146212022-05-03 https://scifaro.com/en/abs/an-efficient-reversible-algorithm-for-linear-regression-2110.147172021-12-01 https://scifaro.com/en/abs/deterministic-enumeration-of-all-minimum-cut-sets-and-k-cut-sets-in-hypergraphs-for-fixed-k-2110.148152021-11-01 https://scifaro.com/en/abs/better-sum-estimation-via-weighted-sampling-2110.149482021-10-29 https://scifaro.com/en/abs/engineering-uniform-sampling-of-graphs-with-a-prescribed-power-law-degree-sequence-2110.150152021-10-29 https://scifaro.com/en/abs/improved-strongly-polynomial-algorithms-for-deterministic-mdps-2vpi-feasibility-and-discounted-all-pairs-shortest-paths-2110.150702021-10-29 https://scifaro.com/en/abs/a-framework-for-parameterized-subexponential-algorithms-for-generalized-cycle-hitting-problems-on-planar-graphs-2110.150982021-10-29 https://scifaro.com/en/abs/an-efficient-bundle-based-approach-for-the-share-a-ride-problem-2110.151522023-02-22 https://scifaro.com/en/abs/online-facility-location-with-linear-delay-2110.151552022-09-30 https://scifaro.com/en/abs/rustworkx-a-high-performance-graph-library-for-python-2110.152212022-11-03 https://scifaro.com/en/abs/approximating-the-arboricity-in-sublinear-time-2110.152602021-10-29 https://scifaro.com/en/abs/the-optimal-error-resilience-of-interactive-communication-over-binary-channels-2110.153952021-11-09 https://scifaro.com/en/abs/eptas-and-subexponential-algorithm-for-maximum-clique-on-disk-and-unit-ball-graphs-2110.154192021-11-01 https://scifaro.com/en/abs/recognizing-k-leaf-powers-in-polynomial-time-for-constant-k-2110.154212021-11-01 https://scifaro.com/en/abs/improved-sliding-window-algorithms-for-clustering-and-coverage-via-bucketing-based-sketches-2110.155332021-11-01 https://scifaro.com/en/abs/an-o-k-log-n-algorithm-for-prefix-based-ranked-autocomplete-2110.155352021-11-01 https://scifaro.com/en/abs/computing-lewis-weights-to-high-precision-2110.155632021-11-01 https://scifaro.com/en/abs/assyrian-merchants-meet-nuclear-physicists-history-of-the-early-contributions-from-social-sciences-to-computer-science-the-case-of-automatic-pattern-detection-in-graphs-1950s-1970s-2110.155672021-11-01 https://scifaro.com/en/abs/shortest-beer-path-queries-in-outerplanar-graphs-2110.156932021-11-01 https://scifaro.com/en/abs/online-food-delivery-to-minimize-maximum-flow-time-2110.157722021-11-04 https://scifaro.com/en/abs/better-lower-bounds-for-shortcut-sets-and-additive-spanners-via-an-improved-alternation-product-2110.158092023-09-27 https://scifaro.com/en/abs/friendly-cut-sparsifiers-and-faster-gomory-hu-trees-2110.158912021-11-01 https://scifaro.com/en/abs/universally-optimal-distributed-shortest-paths-and-transshipment-via-graph-based-l1-oblivious-routing-2110.159442021-11-01 https://scifaro.com/en/abs/on-small-depth-tree-augmentations-2111.001482021-11-02 https://scifaro.com/en/abs/counting-and-verifying-abelian-border-arrays-of-binary-words-2111.002592021-11-02 https://scifaro.com/en/abs/twin-width-vi-the-lens-of-contraction-sequences-2111.002822022-06-02 https://scifaro.com/en/abs/computing-matching-statistics-on-repetitive-texts-2111.003762022-01-14 https://scifaro.com/en/abs/on-the-optimal-time-space-tradeoff-for-hash-tables-2111.006022021-11-05 https://scifaro.com/en/abs/optimal-sketching-for-trace-estimation-2111.006642021-11-02 https://scifaro.com/en/abs/improved-algorithms-for-low-rank-approximation-from-sparsity-2111.006682021-11-02 https://scifaro.com/en/abs/online-edge-coloring-via-tree-recurrences-and-correlation-decay-2111.007212021-11-02 https://scifaro.com/en/abs/dynamic-distances-in-hyperbolic-graphs-2111.010192021-11-02 https://scifaro.com/en/abs/finding-the-kt-partition-of-a-weighted-graph-in-near-linear-time-2111.013782021-11-03 https://scifaro.com/en/abs/maximum-length-constrained-flows-and-disjoint-paths-distributed-deterministic-and-fast-2111.014222023-08-21 https://scifaro.com/en/abs/competitive-algorithms-for-online-weighted-bipartite-matching-and-its-variants-2111.017182021-11-03 https://scifaro.com/en/abs/truly-low-space-element-distinctness-and-subset-sum-via-pseudorandom-hash-functions-2111.017592021-11-03 https://scifaro.com/en/abs/towards-the-5-6-density-conjecture-of-pinwheel-scheduling-2111.017842021-11-03 https://scifaro.com/en/abs/improved-iteration-complexities-for-overconstrained-p-norm-regression-2111.018482021-11-11 https://scifaro.com/en/abs/adaptive-massively-parallel-constant-round-tree-contraction-2111.019042021-11-04 https://scifaro.com/en/abs/probing-to-minimize-2111.019552021-11-04 https://scifaro.com/en/abs/deterministic-min-cut-in-poly-logarithmic-max-flows-2111.020082022-05-31 https://scifaro.com/en/abs/approximate-gomory-hu-tree-is-faster-than-n-1-max-flows-2111.020222021-11-04 https://scifaro.com/en/abs/the-algorithmic-complexity-of-tree-clique-width-2111.022002021-11-04 https://scifaro.com/en/abs/approximation-algorithms-for-vertex-connectivity-augmentation-on-the-cycle-2111.022342021-11-04 https://scifaro.com/en/abs/physarum-inspired-dynamics-to-solve-semi-definite-programs-2111.022912022-07-19 https://scifaro.com/en/abs/the-parameterized-complexity-of-the-survivable-network-design-problem-2111.022952022-11-09 https://scifaro.com/en/abs/nearly-tight-lower-bounds-for-succinct-range-minimum-query-2111.023182022-02-10 https://scifaro.com/en/abs/an-improved-algorithm-for-the-k-dyck-edit-distance-problem-2111.023362022-08-23 https://scifaro.com/en/abs/augmenting-edge-connectivity-via-isolating-cuts-2111.023612021-11-04 https://scifaro.com/en/abs/holz-high-order-entropy-encoding-of-lempel-ziv-factor-distances-2111.024782021-11-05 https://scifaro.com/en/abs/linear-time-minimization-of-wheeler-dfas-2111.024802021-11-05 https://scifaro.com/en/abs/a-constant-factor-approximation-for-quasi-bipartite-directed-steiner-tree-on-minor-free-graphs-2111.025722022-11-08 https://scifaro.com/en/abs/reallocation-problems-with-minimum-completion-time-2111.025792021-11-05 https://scifaro.com/en/abs/finding-all-leftmost-separators-of-size-leq-k-2111.026142021-11-05 https://scifaro.com/en/abs/average-sensitivity-of-dynamic-programming-2111.026572021-11-08 https://scifaro.com/en/abs/compound-logics-for-modification-problems-2111.027552022-11-07 https://scifaro.com/en/abs/the-shortest-even-cycle-problem-is-tractable-2111.029922021-11-05 https://scifaro.com/en/abs/parallel-global-edge-switching-for-the-uniform-sampling-of-simple-graphs-with-prescribed-degrees-2111.030052023-02-16 https://scifaro.com/en/abs/computational-thresholds-for-the-fixed-magnetization-ising-model-2111.030332021-11-05 https://scifaro.com/en/abs/a-new-framework-for-matrix-discrepancy-partial-coloring-bounds-via-mirror-descent-2111.031712021-11-08 https://scifaro.com/en/abs/single-sample-prophet-inequalities-via-greedy-ordered-selection-2111.031742024-03-19 https://scifaro.com/en/abs/on-the-complexity-of-dynamic-submodular-maximization-2111.031982022-04-19 https://scifaro.com/en/abs/breaking-the-n-k-barrier-for-minimum-k-cut-on-simple-graphs-2111.032212021-12-02 https://scifaro.com/en/abs/entropic-independence-ii-optimal-sampling-and-concentration-via-restricted-modified-log-sobolev-inequalities-2111.032472021-11-08 https://scifaro.com/en/abs/tight-bounds-for-differentially-private-anonymized-histograms-2111.032572021-11-08 https://scifaro.com/en/abs/maintaining-exact-distances-under-multiple-edge-failures-2111.033602021-11-08 https://scifaro.com/en/abs/fast-deterministic-fully-dynamic-distance-approximation-2111.033612022-09-09 https://scifaro.com/en/abs/flow-augmentation-i-directed-graphs-2111.034502023-02-16 https://scifaro.com/en/abs/fast-fpt-approximation-of-branchwidth-2111.034922021-11-08 https://scifaro.com/en/abs/new-streaming-algorithms-for-high-dimensional-emd-and-mst-2111.035282021-11-08 https://scifaro.com/en/abs/optimal-approximate-distance-oracle-for-planar-graphs-2111.035602021-11-08 https://scifaro.com/en/abs/randomized-communication-and-implicit-graph-representations-2111.036392025-10-08 https://scifaro.com/en/abs/algorithms-and-data-structures-for-first-order-logic-with-connectivity-under-vertex-failures-2111.037252021-11-09 https://scifaro.com/en/abs/a-ptas-for-capacitated-vehicle-routing-on-trees-2111.037352022-04-12 https://scifaro.com/en/abs/rapid-mixing-for-the-hardcore-glauber-dynamics-and-other-markov-chains-in-bounded-treewidth-graphs-2111.038982023-10-03 https://scifaro.com/en/abs/frequency-estimation-with-one-sided-error-2111.039532021-11-09 https://scifaro.com/en/abs/improved-approximation-guarantees-for-shortest-superstrings-using-cycle-classification-by-overlap-to-length-ratios-2111.039682021-11-09 https://scifaro.com/en/abs/dynamic-algorithms-against-an-adaptive-adversary-generic-constructions-and-lower-bounds-2111.039802021-11-09 https://scifaro.com/en/abs/k-disjoint-st-paths-activation-in-polynomial-time-2111.040112022-08-02 https://scifaro.com/en/abs/parallelize-single-site-dynamics-up-to-dobrushin-criterion-2111.040442024-12-23 https://scifaro.com/en/abs/fast-sampling-via-spectral-independence-beyond-bounded-degree-graphs-2111.040662023-10-16 https://scifaro.com/en/abs/sampling-from-log-concave-distributions-with-infinity-distance-guarantees-2111.040892022-11-14 https://scifaro.com/en/abs/formal-barriers-to-simple-algorithms-for-the-matroid-secretary-problem-2111.041142021-11-09 https://scifaro.com/en/abs/interactive-error-correcting-codes-over-binary-erasure-channels-resilient-to-frac12-adversarial-corruption-2111.041812021-11-09 https://scifaro.com/en/abs/parallel-nearest-neighbors-in-low-dimensions-with-batch-updates-2111.041822021-11-09 https://scifaro.com/en/abs/succinct-data-structure-for-path-graphs-2111.043322023-03-03 https://scifaro.com/en/abs/an-improved-local-search-algorithm-for-k-median-2111.045892021-11-09 https://scifaro.com/en/abs/graphs-can-be-succinctly-indexed-for-pattern-matching-in-o-e-2-v-5-2-time-2111.045952021-11-09 https://scifaro.com/en/abs/approximating-fair-clustering-with-cascaded-norm-objectives-2111.048042021-11-10 https://scifaro.com/en/abs/nearly-linear-time-lp-solvers-and-rounding-algorithms-for-scheduling-problems-2111.048972023-06-06 https://scifaro.com/en/abs/breaking-the-cubic-barrier-for-all-pairs-max-flow-gomory-hu-tree-in-nearly-quadratic-time-2111.049582022-08-05 https://scifaro.com/en/abs/analysis-of-work-stealing-and-parallel-cache-complexity-2111.049942021-11-10 https://scifaro.com/en/abs/pattern-matching-on-grammar-compressed-strings-in-linear-time-2111.050162021-11-10 https://scifaro.com/en/abs/competitive-sequencing-with-noisy-advice-2111.052812021-11-10 https://scifaro.com/en/abs/robust-estimation-for-random-graphs-2111.053202022-02-16 https://scifaro.com/en/abs/non-adaptive-stochastic-score-classification-and-explainable-halfspace-evaluation-2111.056872023-08-22 https://scifaro.com/en/abs/generating-faster-algorithms-for-d-path-vertex-cover-2111.058962023-07-04 https://scifaro.com/en/abs/a-2-dimensional-binary-search-for-integer-pareto-frontiers-2111.061012022-01-25 https://scifaro.com/en/abs/a-2-approximation-for-the-bounded-treewidth-sparsest-cut-problem-in-fpt-time-2111.061632021-11-12 https://scifaro.com/en/abs/faster-goal-oriented-shortest-path-search-for-bulk-and-incremental-detailed-routing-2111.061692026-02-19 https://scifaro.com/en/abs/approximating-sparsest-cut-in-low-treewidth-graphs-via-combinatorial-diameter-2111.062992024-04-23 https://scifaro.com/en/abs/online-discrepancy-with-recourse-for-vectors-and-graphs-2111.063082021-11-12 https://scifaro.com/en/abs/non-uniform-k-center-and-greedy-clustering-2111.063622021-11-16 https://scifaro.com/en/abs/moser-tardos-algorithm-beyond-shearer-s-bound-2111.065272021-11-15 https://scifaro.com/en/abs/a-competitive-algorithm-for-throughput-maximization-on-identical-machines-2111.065642024-08-26 https://scifaro.com/en/abs/scalable-algorithms-for-bicriterion-trip-based-transit-routing-2111.066542022-03-01 https://scifaro.com/en/abs/eptas-for-parallel-identical-machine-scheduling-with-time-restrictions-2111.066922021-11-15 https://scifaro.com/en/abs/faster-primal-dual-convergence-for-min-max-resource-sharing-and-stronger-bounds-via-local-weak-duality-2111.068202021-11-15 https://scifaro.com/en/abs/random-order-set-cover-is-as-easy-as-offline-2111.068422024-07-09 https://scifaro.com/en/abs/approximate-membership-query-filters-with-a-false-positive-free-set-2111.068562021-11-15 https://scifaro.com/en/abs/hierarchical-clustering-new-bounds-and-objective-2111.068632021-11-15 https://scifaro.com/en/abs/prefix-discrepancy-smoothed-analysis-and-combinatorial-vector-balancing-2111.070492021-11-16 https://scifaro.com/en/abs/cardinality-constrained-submodular-maximization-for-random-streams-2111.072172021-11-16 https://scifaro.com/en/abs/stochastic-and-worst-case-generalized-sorting-revisited-2111.072222021-11-16 https://scifaro.com/en/abs/a-simple-approximation-algorithm-for-vector-scheduling-and-applications-to-stochastic-min-norm-load-balancing-2111.072442021-11-16 https://scifaro.com/en/abs/a-simple-algorithm-for-multiple-source-shortest-paths-in-planar-digraphs-2111.073602023-07-31 https://scifaro.com/en/abs/combinatorial-algorithms-for-rooted-prize-collecting-walks-and-applications-to-orienteering-and-minimum-latency-problems-2111.074142021-11-16 https://scifaro.com/en/abs/a-polynomial-lower-bound-on-the-number-of-rounds-for-parallel-submodular-function-minimization-and-matroid-intersection-2111.074742021-11-16 https://scifaro.com/en/abs/on-a-partition-lp-relaxation-for-min-cost-2-node-connected-spanning-subgraphs-2111.074812021-11-16 https://scifaro.com/en/abs/enumerating-minimal-separators-in-ranked-order-2111.076472021-12-03 https://scifaro.com/en/abs/best-of-both-worlds-practical-and-theoretically-optimal-submodular-maximization-in-parallel-2111.079172024-08-20 https://scifaro.com/en/abs/embeddings-of-planar-quasimetrics-into-directed-ell-1-and-polylogarithmic-approximation-for-directed-sparsest-cut-2111.079742021-11-16 https://scifaro.com/en/abs/improved-approximations-for-cvrp-with-unsplittable-demands-2111.081382021-11-17 https://scifaro.com/en/abs/improved-bounds-for-scheduling-flows-under-endpoint-capacity-constraints-2111.081482021-11-17 https://scifaro.com/en/abs/optimal-oblivious-reconfigurable-networks-2111.087802021-11-18 https://scifaro.com/en/abs/the-stochastic-boolean-function-evaluation-problem-for-symmetric-boolean-functions-2111.087932022-01-05 https://scifaro.com/en/abs/minimum-cuts-in-directed-graphs-via-partial-sparsification-2111.089592021-11-18 https://scifaro.com/en/abs/an-improved-random-shift-algorithm-for-spanners-and-low-diameter-decompositions-2111.089752021-11-18 https://scifaro.com/en/abs/a-hitting-set-relaxation-for-k-server-and-an-extension-to-time-windows-2111.092552021-11-18 https://scifaro.com/en/abs/matroid-based-tsp-rounding-for-half-integral-solutions-2111.092902025-07-17 https://scifaro.com/en/abs/stream-sampling-with-immediate-decision-2111.093092021-11-19 https://scifaro.com/en/abs/optimal-decremental-connectivity-in-non-sparse-graphs-2111.093762021-11-22 https://scifaro.com/en/abs/on-clustering-with-discounts-2111.095052021-11-19 https://scifaro.com/en/abs/on-the-recoverable-traveling-salesman-problem-2111.096912021-11-19 https://scifaro.com/en/abs/uniform-brackets-containers-and-combinatorial-macbeath-regions-2111.100482021-11-22 https://scifaro.com/en/abs/an-improved-analysis-of-greedy-for-online-steiner-forest-2111.100862021-11-22 https://scifaro.com/en/abs/randomized-algorithms-for-monotone-submodular-function-maximization-on-the-integer-lattice-2111.101752021-11-22 https://scifaro.com/en/abs/streaming-deletion-problems-parameterized-by-vertex-cover-2111.101842021-11-22 https://scifaro.com/en/abs/sparsified-block-elimination-for-directed-laplacians-2111.102572023-05-09 https://scifaro.com/en/abs/faster-sparse-minimum-cost-flow-by-electrical-flow-localization-2111.103682021-11-22 https://scifaro.com/en/abs/approximation-algorithms-for-lcs-and-lis-with-truly-improved-running-times-2111.105382021-11-23 https://scifaro.com/en/abs/distributed-congest-approximation-of-weighted-vertex-covers-and-matchings-2111.105772023-08-09 https://scifaro.com/en/abs/oblivious-online-contention-resolution-schemes-2111.106072021-11-23 https://scifaro.com/en/abs/correlation-clustering-via-strong-triadic-closure-labeling-fast-approximation-algorithms-and-practical-lower-bounds-2111.106992022-06-27 https://scifaro.com/en/abs/multiscale-entropic-regularization-for-mts-on-general-metric-spaces-2111.109082021-11-23 https://scifaro.com/en/abs/a-dynamic-programming-algorithm-to-compute-joint-distribution-of-order-statistics-on-graphs-2111.109392021-11-23 https://scifaro.com/en/abs/an-efficient-branch-and-cut-algorithm-for-the-parallel-drone-scheduling-traveling-salesman-problem-2111.113072021-11-23 https://scifaro.com/en/abs/on-the-local-communication-complexity-of-counting-and-modular-arithmetic-2111.114602021-11-24 https://scifaro.com/en/abs/harmless-sets-in-sparse-classes-2111.118342022-01-05 https://scifaro.com/en/abs/scale-invariant-strength-assortativity-of-streaming-butterflies-2111.122172021-11-25 https://scifaro.com/en/abs/dcsr-a-memory-efficient-sparse-matrix-representation-for-parallel-neural-network-inference-2111.123452021-11-25 https://scifaro.com/en/abs/matroid-partition-property-and-the-secretary-problem-2111.124362021-11-25 https://scifaro.com/en/abs/time-and-memory-efficient-parallel-algorithm-for-structural-graph-summaries-and-two-extensions-to-incremental-summarization-and-k-bisimulation-for-long-k-chaining-2111.124932022-11-07 https://scifaro.com/en/abs/gap-edit-distance-via-non-adaptive-queries-simple-and-optimal-2111.127062022-10-04 https://scifaro.com/en/abs/tiny-pointers-2111.128002021-11-29 https://scifaro.com/en/abs/efficient-mean-estimation-with-pure-differential-privacy-via-a-sum-of-squares-exponential-mechanism-2111.129812022-06-06 https://scifaro.com/en/abs/online-sampling-and-decision-making-with-low-entropy-2111.132032024-05-13 https://scifaro.com/en/abs/quasi-isometric-graph-simplifications-2111.132382022-08-22 https://scifaro.com/en/abs/new-diameter-reducing-shortcuts-and-directed-hopsets-breaking-the-sqrt-n-barrier-2111.132402021-11-29 https://scifaro.com/en/abs/simple-and-optimal-greedy-online-contention-resolution-schemes-2111.132532022-09-23 https://scifaro.com/en/abs/how-heavy-independent-sets-help-to-find-arborescences-with-many-leaves-in-dags-2111.134642021-11-29 https://scifaro.com/en/abs/reconfiguration-of-regular-induced-subgraphs-2111.134762021-11-30 https://scifaro.com/en/abs/a-unified-framework-of-light-spanners-ii-fine-grained-optimality-2111.137482021-11-30 https://scifaro.com/en/abs/a-note-on-sanitizing-streams-with-differential-privacy-2111.137622021-11-30 https://scifaro.com/en/abs/scheduling-appointments-online-the-power-of-deferred-decision-making-2111.139862021-11-30 https://scifaro.com/en/abs/a-polynomial-kernel-for-vertex-deletion-into-bipartite-permutation-graphs-2111.140052024-01-03 https://scifaro.com/en/abs/reconfiguration-problems-on-submodular-functions-2111.140302021-11-30 https://scifaro.com/en/abs/subexponential-parameterized-algorithms-for-cut-and-cycle-hitting-problems-on-h-minor-free-graphs-2111.141962022-07-05 https://scifaro.com/en/abs/online-metric-allocation-2111.151692021-12-01 https://scifaro.com/en/abs/servicing-timed-requests-on-a-line-2111.154342021-12-01 https://scifaro.com/en/abs/connected-components-for-infinite-graph-streams-theory-and-practice-2112.000982021-12-02 https://scifaro.com/en/abs/multistage-online-maxmin-allocation-of-indivisible-entities-2112.003202021-12-02 https://scifaro.com/en/abs/clustering-mixtures-with-almost-optimal-separation-in-polynomial-time-2112.007062021-12-02 https://scifaro.com/en/abs/faster-maxflow-via-improved-dynamic-spectral-vertex-sparsifiers-2112.007222021-12-02 https://scifaro.com/en/abs/the-price-of-differential-privacy-under-continual-observation-2112.008282022-01-12 https://scifaro.com/en/abs/gomory-hu-trees-in-quadratic-time-2112.010422021-12-03 https://scifaro.com/en/abs/generalized-framework-for-group-testing-queries-feedbacks-and-adversaries-2112.013402021-12-03 https://scifaro.com/en/abs/online-search-with-best-price-and-query-based-predictions-2112.015922021-12-06 https://scifaro.com/en/abs/explicit-abelian-lifts-and-quantum-ldpc-codes-2112.016472021-12-06 https://scifaro.com/en/abs/on-some-variants-of-euclidean-k-supplier-2112.017002021-12-06 https://scifaro.com/en/abs/projective-clustering-product-quantization-2112.021792021-12-07 https://scifaro.com/en/abs/revisiting-k-nearest-neighbor-graph-construction-on-high-dimensional-data-experiments-and-analyses-2112.022342021-12-07 https://scifaro.com/en/abs/algorithms-for-maximum-internal-spanning-tree-problem-for-some-graph-classes-2112.022482021-12-24 https://scifaro.com/en/abs/efficient-deterministic-quantitative-group-testing-for-precise-information-retrieval-2112.024272022-04-22 https://scifaro.com/en/abs/fixed-parameter-sensitivity-oracles-2112.030592021-12-07 https://scifaro.com/en/abs/a-novel-prediction-setup-for-online-speed-scaling-2112.030822021-12-07 https://scifaro.com/en/abs/faster-cut-sparsification-of-weighted-graphs-2112.031202022-04-29 https://scifaro.com/en/abs/modification-fair-cluster-editing-2112.031832024-01-29 https://scifaro.com/en/abs/online-bin-packing-with-known-t-2112.032002021-12-07 https://scifaro.com/en/abs/the-vlsat-3-benchmark-suite-2112.036752021-12-10 https://scifaro.com/en/abs/enhancing-the-svd-compression-2112.037152021-12-08 https://scifaro.com/en/abs/a-more-efficient-algorithm-to-compute-the-rand-index-for-change-point-problems-2112.037382025-06-23 https://scifaro.com/en/abs/fastball-a-fast-algorithm-to-sample-bipartite-graphs-with-fixed-degree-sequences-2112.040172022-11-01 https://scifaro.com/en/abs/blocking-trails-for-f-factors-of-multigraphs-2112.040962021-12-09 https://scifaro.com/en/abs/faster-algorithms-for-k-subset-sum-and-variations-2112.042442022-01-04 https://scifaro.com/en/abs/rlbwt-tricks-2112.042712022-07-15 https://scifaro.com/en/abs/a-ptas-for-the-min-max-euclidean-multiple-tsp-2112.043252021-12-15 https://scifaro.com/en/abs/a-simple-algorithm-for-graph-reconstruction-2112.045492021-12-14 https://scifaro.com/en/abs/greedy-algorithm-for-multiway-matching-with-bounded-regret-2112.046222022-07-26 https://scifaro.com/en/abs/efficient-checking-of-temporal-compliance-rules-over-business-process-event-logs-2112.046232021-12-13 https://scifaro.com/en/abs/testing-probabilistic-circuits-2112.049412021-12-10 https://scifaro.com/en/abs/improved-approximation-algorithms-for-two-euclidean-k-center-variants-2112.050832021-12-10 https://scifaro.com/en/abs/estimating-the-longest-increasing-subsequence-in-nearly-optimal-time-2112.051062022-11-02 https://scifaro.com/en/abs/online-minimum-matching-with-uniform-metric-and-random-arrivals-2112.052472021-12-13 https://scifaro.com/en/abs/computing-diverse-shortest-paths-efficiently-a-theoretical-and-experimental-study-2112.054032021-12-16 https://scifaro.com/en/abs/stochastic-vertex-cover-with-few-queries-2112.054152021-12-13 https://scifaro.com/en/abs/beyond-the-longest-letter-duplicated-subsequence-problem-2112.057252022-01-05 https://scifaro.com/en/abs/improved-deterministic-delta-1-coloring-in-low-space-mpc-2112.058312021-12-14 https://scifaro.com/en/abs/how-compression-and-approximation-affect-efficiency-in-string-distance-measures-2112.058362021-12-14 https://scifaro.com/en/abs/improved-approximation-algorithms-for-dyck-edit-distance-and-rna-folding-2112.058662021-12-14 https://scifaro.com/en/abs/a-tight-bound-for-the-clique-query-problem-in-two-rounds-2112.060722021-12-14 https://scifaro.com/en/abs/fast-computation-of-distance-generalized-cores-using-sampling-2112.061542023-01-31 https://scifaro.com/en/abs/temporal-interval-cliques-and-independent-sets-2112.061722022-10-14 https://scifaro.com/en/abs/parallel-batch-dynamic-k-d-trees-2112.061882021-12-14 https://scifaro.com/en/abs/on-sketching-approximations-for-symmetric-boolean-csps-2112.063192023-04-14 https://scifaro.com/en/abs/faster-than-native-alternatives-for-x86-vp2intersect-instructions-2112.063422022-04-19 https://scifaro.com/en/abs/robust-voting-rules-from-algorithmic-robust-statistics-2112.063802022-07-19 https://scifaro.com/en/abs/how-to-find-a-good-explanation-for-clustering-2112.065802021-12-17 https://scifaro.com/en/abs/viquf-de-novo-viral-quasispecies-reconstruction-using-unitig-based-flow-networks-2112.065902024-10-28 https://scifaro.com/en/abs/locally-fair-partitioning-2112.068992021-12-16 https://scifaro.com/en/abs/flow-metrics-on-graphs-2112.069162021-12-15 https://scifaro.com/en/abs/factorization-and-pseudofactorization-of-weighted-graphs-2112.069902021-12-15 https://scifaro.com/en/abs/on-approximate-sequencing-policies-for-linear-storage-devices-2112.070182022-05-11 https://scifaro.com/en/abs/clustering-with-fair-center-representation-parameterized-approximation-algorithms-and-heuristics-2112.070302022-10-25 https://scifaro.com/en/abs/optimal-fully-dynamic-k-centers-clustering-2112.070502021-12-15 https://scifaro.com/en/abs/swarm-consensus-2112.070652021-12-28 https://scifaro.com/en/abs/secretary-matching-with-vertex-arrivals-and-no-rejections-2112.071402021-12-15 https://scifaro.com/en/abs/novel-algorithms-for-efficient-mining-of-connected-induced-subgraphs-of-a-given-cardinality-2112.071972023-03-17 https://scifaro.com/en/abs/algorithms-with-improved-delay-for-enumerating-connected-induced-subgraphs-of-a-large-cardinality-2112.072042023-03-16 https://scifaro.com/en/abs/on-fully-dynamic-constant-factor-approximation-algorithms-for-clustering-problems-2112.072172021-12-15 https://scifaro.com/en/abs/online-matching-with-high-probability-2112.072282021-12-15 https://scifaro.com/en/abs/a-faster-algorithm-for-cops-and-robbers-2112.074492022-06-16 https://scifaro.com/en/abs/reconfiguring-shortest-paths-in-graphs-2112.074992021-12-15 https://scifaro.com/en/abs/simulating-random-walks-in-random-streams-2112.075322021-12-15 https://scifaro.com/en/abs/approximating-the-longest-common-subsequence-problem-within-a-sub-polynomial-factor-in-linear-time-2112.084542021-12-17 https://scifaro.com/en/abs/minimizing-reachability-times-on-temporal-graphs-via-shifting-labels-2112.087972025-10-09 https://scifaro.com/en/abs/hierarchical-clustering-o-1-approximation-for-well-clustered-graphs-2112.090552021-12-17 https://scifaro.com/en/abs/non-gaussian-component-analysis-via-lattice-basis-reduction-2112.091042021-12-17 https://scifaro.com/en/abs/sparse-euclidean-spanners-with-tiny-diameter-a-tight-lower-bound-2112.091242022-01-03 https://scifaro.com/en/abs/scalable-bicriteria-algorithms-for-non-monotone-submodular-cover-2112.099852022-11-10 https://scifaro.com/en/abs/parameterized-approximation-algorithms-for-k-center-clustering-and-variants-2112.101952021-12-21 https://scifaro.com/en/abs/string-sampling-with-bidirectional-string-anchors-2112.103762021-12-21 https://scifaro.com/en/abs/improving-ranking-quality-and-fairness-in-swiss-system-chess-tournaments-2112.105222023-12-14 https://scifaro.com/en/abs/the-cascading-metric-tree-2112.109002021-12-22 https://scifaro.com/en/abs/accelerating-clique-counting-in-sparse-real-world-graphs-via-communication-reducing-optimizations-2112.109132021-12-30 https://scifaro.com/en/abs/minimizing-congestion-for-balanced-dominators-2112.109732023-01-24 https://scifaro.com/en/abs/lower-bounds-for-sparse-oblivious-subspace-embeddings-2112.109872021-12-22 https://scifaro.com/en/abs/counting-simplices-in-hypergraph-streams-2112.110162021-12-22 https://scifaro.com/en/abs/efficient-reductions-and-algorithms-for-variants-of-subset-sum-2112.110202022-06-02 https://scifaro.com/en/abs/empirically-improved-tokuda-gap-sequence-in-shellsort-2112.111122021-12-22 https://scifaro.com/en/abs/on-the-parallel-complexity-of-group-isomorphism-via-weisfeiler-leman-2112.114872025-09-09 https://scifaro.com/en/abs/breaching-the-2-approximation-barrier-for-the-forest-augmentation-problem-2112.117992022-04-21 https://scifaro.com/en/abs/online-graph-algorithms-with-predictions-2112.118312021-12-23 https://scifaro.com/en/abs/dijkstras-algorithm-with-predictions-to-solve-the-single-source-many-targets-shortest-path-problem-2112.119272023-03-07 https://scifaro.com/en/abs/dynamic-suffix-array-with-sub-linear-update-time-and-poly-logarithmic-lookup-time-2112.126782021-12-24 https://scifaro.com/en/abs/deterministic-parallel-hypergraph-partitioning-2112.127042021-12-24 https://scifaro.com/en/abs/robust-secretary-and-prophet-algorithms-for-packing-integer-programs-2112.129202021-12-28 https://scifaro.com/en/abs/fully-decentralized-and-federated-low-rank-compressive-sensing-2112.134122021-12-28 https://scifaro.com/en/abs/fairness-in-repetitive-scheduling-2112.138242024-01-09 https://scifaro.com/en/abs/faster-algorithms-and-constant-lower-bounds-for-the-worst-case-expected-error-2112.138322021-12-28 https://scifaro.com/en/abs/minimizing-ell-2-norm-of-flow-time-by-starvation-mitigation-2112.144032025-05-02 https://scifaro.com/en/abs/private-rank-aggregation-in-central-and-local-models-2112.146522021-12-30 https://scifaro.com/en/abs/set-membership-with-two-classical-and-quantum-bit-probes-2112.149542022-01-03 https://scifaro.com/en/abs/space-efficient-fpt-algorithms-2112.152332022-01-03 https://scifaro.com/en/abs/complex-contraction-on-trees-without-proof-of-correlation-decay-2112.153472022-01-03 https://scifaro.com/en/abs/preference-swaps-for-the-stable-matching-problem-2112.153612022-11-16 https://scifaro.com/en/abs/multi-relation-graph-summarization-2112.154882022-01-03 https://scifaro.com/en/abs/the-complexity-of-dynamic-least-squares-regression-2201.002282023-04-07 https://scifaro.com/en/abs/asymptotic-experiments-with-data-structures-bipartite-graph-matchings-and-covers-2201.002342022-01-04 https://scifaro.com/en/abs/space-complexity-of-vertex-connectivity-oracles-2201.004082025-11-27 https://scifaro.com/en/abs/classifying-subset-feedback-vertex-set-for-h-free-graphs-2201.004302022-07-19 https://scifaro.com/en/abs/submodular-maximization-with-limited-function-access-2201.007242022-02-09 https://scifaro.com/en/abs/technical-report-bundling-linked-data-structures-for-linearizable-range-queries-2201.008742022-06-30 https://scifaro.com/en/abs/binary-fuse-filters-fast-and-smaller-than-xor-filters-2201.011742022-03-15 https://scifaro.com/en/abs/dynamic-suffix-array-with-polylogarithmic-queries-and-updates-2201.012852022-06-17 https://scifaro.com/en/abs/an-additive-approximation-scheme-for-the-nash-social-welfare-maximization-with-identical-additive-valuations-2201.014192022-01-06 https://scifaro.com/en/abs/deterministic-metric-1-median-selection-with-very-few-queries-2201.014362022-01-06 https://scifaro.com/en/abs/standard-vs-uniform-binary-search-and-their-variants-in-learned-static-indexing-the-case-of-the-searching-on-sorted-data-benchmarking-software-platform-2201.015542022-09-20 https://scifaro.com/en/abs/parallel-flow-based-hypergraph-partitioning-2201.015562022-01-06 https://scifaro.com/en/abs/what-does-dynamic-optimality-mean-in-external-memory-2201.017422022-04-22 https://scifaro.com/en/abs/squad-combining-sketching-and-sampling-is-better-than-either-for-per-item-quantile-estimation-2201.019582022-01-07 https://scifaro.com/en/abs/fixation-maximization-in-the-positional-moran-process-2201.022482022-04-26 https://scifaro.com/en/abs/automatically-layout-and-visualize-the-biological-pathway-map-with-spectral-graph-theory-2201.027282022-01-11 https://scifaro.com/en/abs/new-trade-offs-for-fully-dynamic-matching-via-hierarchical-edcs-2201.029052022-01-11 https://scifaro.com/en/abs/a-knapsack-intersection-hierarchy-applied-to-all-or-nothing-flow-in-trees-2201.029142022-01-12 https://scifaro.com/en/abs/quantum-distributed-algorithms-for-detection-of-cliques-2201.030002022-01-11 https://scifaro.com/en/abs/locality-preserving-hashing-for-shifts-with-connections-to-cryptography-2201.030412022-01-11 https://scifaro.com/en/abs/voronoi-diagrams-for-the-distributed-sensor-network-system-data-processing-2201.031062022-01-11 https://scifaro.com/en/abs/deletion-to-scattered-graph-classes-ii-improved-fpt-algorithms-for-deletion-to-pairs-of-graph-classes-2201.031422023-04-14 https://scifaro.com/en/abs/an-exact-algorithm-for-finding-maximum-induced-matching-in-subcubic-graphs-2201.032202022-01-11 https://scifaro.com/en/abs/detours-in-directed-graphs-2201.033182022-01-11 https://scifaro.com/en/abs/bounded-space-differentially-private-quantiles-2201.033802022-01-11 https://scifaro.com/en/abs/asymptotic-optimality-of-the-greedy-patching-heuristic-for-max-tsp-in-doubling-metrics-2201.038132022-01-12 https://scifaro.com/en/abs/eternal-vertex-cover-on-bipartite-and-co-bipartite-graphs-2201.038202024-01-19 https://scifaro.com/en/abs/partial-vertex-cover-on-graphs-of-bounded-degeneracy-2201.038762022-01-12 https://scifaro.com/en/abs/the-slotted-online-one-sided-crossing-minimization-problem-on-2-regular-graphs-2201.040612022-01-12 https://scifaro.com/en/abs/approximating-subset-sum-ratio-via-partition-computations-2201.041652022-12-08 https://scifaro.com/en/abs/a-polynomial-time-approximation-scheme-for-parallel-two-stage-flowshops-under-makespan-constraint-2201.041962022-05-20 https://scifaro.com/en/abs/reconfiguration-of-spanning-trees-with-degree-constraint-or-diameter-constraint-2201.043542022-01-13 https://scifaro.com/en/abs/a-characterization-of-approximability-for-biased-csps-2201.046172022-01-13 https://scifaro.com/en/abs/polynomial-turing-compressions-for-some-graph-problems-parameterized-by-modular-width-2201.046782023-12-15 https://scifaro.com/en/abs/approximate-the-individually-fair-k-center-with-outliers-2201.048492022-01-14 https://scifaro.com/en/abs/faster-counting-and-sampling-algorithms-using-colorful-decision-oracle-2201.049752022-01-26 https://scifaro.com/en/abs/temporal-connectivity-coping-with-foreseen-and-unforeseen-delays-2201.050112022-01-14 https://scifaro.com/en/abs/cardinality-constrained-scheduling-in-online-models-2201.051132022-01-14 https://scifaro.com/en/abs/delay-robust-routes-in-temporal-graphs-2201.053902022-01-17 https://scifaro.com/en/abs/covering-many-or-few-edges-with-k-vertices-in-sparse-graphs-2201.054652022-10-20 https://scifaro.com/en/abs/the-parameterized-complexity-of-s-club-with-triangle-and-seed-constraints-2201.056542022-06-22 https://scifaro.com/en/abs/cut-query-algorithms-with-star-contraction-2201.056742022-01-19 https://scifaro.com/en/abs/lower-bounds-on-the-performance-of-online-algorithms-for-relaxed-packing-problems-2201.059992022-01-19 https://scifaro.com/en/abs/hypergraph-cuts-with-edge-dependent-vertex-weights-2201.060842022-08-08 https://scifaro.com/en/abs/a-strengthened-branch-and-bound-algorithm-for-the-maximum-common-connected-subgraph-problem-2201.062522022-01-19 https://scifaro.com/en/abs/linear-time-construction-of-indexable-elastic-founder-graphs-2201.064922023-07-04 https://scifaro.com/en/abs/fast-and-heavy-disjoint-weighted-matchings-for-demand-aware-datacenter-topologies-2201.066212023-01-18 https://scifaro.com/en/abs/improved-approximation-and-scalability-for-fair-max-min-diversification-2201.066782022-01-19 https://scifaro.com/en/abs/computing-longest-common-lyndon-subsequences-2201.067732022-01-19 https://scifaro.com/en/abs/the-parameterized-complexity-of-welfare-guarantees-in-schelling-segregation-2201.069042022-01-19 https://scifaro.com/en/abs/finding-strong-components-using-depth-first-search-2201.071972022-04-12 https://scifaro.com/en/abs/sparsification-of-decomposable-submodular-functions-2201.072892022-01-20 https://scifaro.com/en/abs/bamboo-trimming-revisited-simple-algorithms-can-do-well-too-2201.073502022-09-07 https://scifaro.com/en/abs/the-query-complexity-of-certification-2201.077362022-04-08 https://scifaro.com/en/abs/fresco-mining-frequent-patterns-in-simplicial-complexes-2201.080052022-01-27 https://scifaro.com/en/abs/interval-memoized-backtracking-on-zdds-for-fast-enumeration-of-all-lower-cost-solutions-2201.081182022-04-29 https://scifaro.com/en/abs/scalable-k-d-trees-for-distributed-data-2201.082882022-01-21 https://scifaro.com/en/abs/dealing-with-elementary-paths-in-the-kidney-exchange-problem-2201.084462022-01-24 https://scifaro.com/en/abs/an-approximation-algorithm-for-k-best-enumeration-of-minimal-connected-edge-dominating-sets-with-cardinality-constraints-2201.086472024-05-14 https://scifaro.com/en/abs/fixed-point-cycles-and-efx-allocations-2201.087532022-01-24 https://scifaro.com/en/abs/a-note-on-hardness-of-multiprocessor-scheduling-with-scheduling-solution-space-tree-2201.087882022-01-24 https://scifaro.com/en/abs/a-framework-to-design-approximation-algorithms-for-finding-diverse-solutions-in-combinatorial-problems-2201.089402022-01-25 https://scifaro.com/en/abs/cuckoo-trie-exploiting-memory-level-parallelism-for-efficient-dram-indexing-2201.093312022-01-25 https://scifaro.com/en/abs/an-efficient-algorithm-for-the-partitioning-min-max-weighted-matching-problem-2201.100492022-01-26 https://scifaro.com/en/abs/on-the-feasible-region-of-efficient-algorithms-for-attributed-graph-alignment-2201.101062024-03-13 https://scifaro.com/en/abs/computing-weak-dominance-drawings-with-minimum-number-of-fips-2201.102012022-01-26 https://scifaro.com/en/abs/safety-and-completeness-in-flow-decompositions-for-rna-assembly-2201.103722022-01-26 https://scifaro.com/en/abs/stochastic-diagonal-estimation-probabilistic-bounds-and-an-improved-algorithm-2201.106842022-01-27 https://scifaro.com/en/abs/generation-matrix-an-embeddable-matrix-representation-for-hierarchical-trees-2201.112972022-08-25 https://scifaro.com/en/abs/predecessor-on-the-ultra-wide-word-ram-2201.115502022-08-01 https://scifaro.com/en/abs/an-algorithmic-framework-for-locally-constrained-homomorphisms-2201.117312022-01-28 https://scifaro.com/en/abs/positive-rate-binary-interactive-error-correcting-codes-resilient-to-frac12-adversarial-erasures-2201.119292022-01-31 https://scifaro.com/en/abs/placing-green-bridges-optimally-with-habitats-inducing-cycles-2201.122732022-01-31 https://scifaro.com/en/abs/statistical-anonymity-quantifying-reidentification-risks-without-reidentifying-users-2201.123062022-01-31 https://scifaro.com/en/abs/better-algorithms-for-online-bin-stretching-via-computer-search-2201.123932022-02-01 https://scifaro.com/en/abs/the-complexity-of-approximate-pattern-matching-on-de-bruijn-graphs-2201.124542022-02-01 https://scifaro.com/en/abs/fast-one-to-many-multicriteria-shortest-path-search-2201.126842022-02-01 https://scifaro.com/en/abs/an-asymptotically-optimal-algorithm-for-maximum-matching-in-dynamic-streams-2201.127102022-02-01 https://scifaro.com/en/abs/polynomial-time-approximation-of-zero-free-partition-functions-2201.127722022-02-01 https://scifaro.com/en/abs/solving-routing-problems-via-important-cuts-2201.127902022-06-09 https://scifaro.com/en/abs/a-dfs-algorithm-for-maximum-matchings-in-general-graphs-2201.128112022-04-20 https://scifaro.com/en/abs/asynchronous-opinion-dynamics-in-social-networks-2201.129232024-04-16 https://scifaro.com/en/abs/how-vulnerable-is-an-undirected-planar-graph-with-respect-to-max-flow-2201.130992023-05-05 https://scifaro.com/en/abs/deletion-robust-submodular-maximization-over-matroids-2201.131282024-02-20 https://scifaro.com/en/abs/polynomial-kernels-for-edge-modification-problems-towards-block-and-strictly-chordal-graphs-2201.131402025-05-07 https://scifaro.com/en/abs/recursive-multi-section-on-the-fly-shared-memory-streaming-algorithms-for-hierarchical-graph-partitioning-and-process-mapping-2202.003942022-02-02 https://scifaro.com/en/abs/testability-and-local-certification-of-monotone-properties-in-minor-closed-classes-2202.005432022-05-04 https://scifaro.com/en/abs/modification-problems-toward-proper-helly-circular-arc-graphs-2202.008542022-02-03 https://scifaro.com/en/abs/improved-integrality-gap-in-max-min-allocation-or-topology-at-the-north-pole-2202.011432025-01-28 https://scifaro.com/en/abs/passing-the-limits-of-pure-local-search-for-weighted-k-set-packing-2202.012482022-08-19 https://scifaro.com/en/abs/fair-representation-clustering-with-several-protected-classes-2202.013912022-02-04 https://scifaro.com/en/abs/perpetual-maintenance-of-machines-with-different-urgency-requirements-2202.015672024-10-22 https://scifaro.com/en/abs/pivot-gray-codes-for-the-spanning-trees-of-a-graph-ft-the-fan-2202.017462022-02-04 https://scifaro.com/en/abs/even-simpler-deterministic-matrix-sketching-2202.017802022-02-07 https://scifaro.com/en/abs/lossy-planarization-a-constant-factor-approximate-kernelization-for-planar-vertex-deletion-2202.021742022-02-07 https://scifaro.com/en/abs/flow-time-scheduling-and-prefix-beck-fiala-2202.022172022-02-07 https://scifaro.com/en/abs/improved-bounds-for-fractional-online-matching-problems-2202.029482022-02-09 https://scifaro.com/en/abs/longest-cycle-above-erd-h-o-s-gallai-bound-2202.030612022-02-08 https://scifaro.com/en/abs/effective-variable-depth-local-search-for-the-budgeted-maximum-coverage-problem-2202.030932022-06-17 https://scifaro.com/en/abs/reducing-the-vertex-cover-number-via-edge-contractions-2202.033222022-02-08 https://scifaro.com/en/abs/approximation-algorithms-for-round-ufp-and-round-sap-2202.034922022-02-09 https://scifaro.com/en/abs/a-parallel-algorithm-for-minimum-weight-set-cover-with-small-neighborhood-property-2202.038722022-02-09 https://scifaro.com/en/abs/parsimonious-learning-augmented-caching-2202.042622022-02-10 https://scifaro.com/en/abs/cartesian-tree-subsequence-matching-2202.043492022-04-18 https://scifaro.com/en/abs/constant-approximating-parameterized-k-setcover-is-w-2-hard-2202.043772022-10-25 https://scifaro.com/en/abs/shortest-paths-without-a-map-but-with-an-entropic-regularizer-2202.045512024-12-17 https://scifaro.com/en/abs/the-landscape-of-distributed-complexities-on-trees-and-beyond-2202.047242022-09-26 https://scifaro.com/en/abs/moni-can-find-k-mems-2202.050852022-12-22 https://scifaro.com/en/abs/low-rank-approximation-with-1-epsilon-1-3-matrix-vector-products-2202.051202022-06-20 https://scifaro.com/en/abs/improved-compression-of-the-okamura-seymour-metric-2202.051272022-02-11 https://scifaro.com/en/abs/insertion-time-of-random-walk-cuckoo-hashing-below-the-peeling-threshold-2202.055462022-04-26 https://scifaro.com/en/abs/improved-bounds-for-randomly-colouring-simple-hypergraphs-2202.055542022-02-14 https://scifaro.com/en/abs/a-tight-1-5-epsilon-approximation-for-unsplittable-capacitated-vehicle-routing-on-trees-2202.056912022-11-09 https://scifaro.com/en/abs/collaborative-dispersion-by-silent-robots-2202.057102022-02-14 https://scifaro.com/en/abs/privately-estimating-graph-parameters-in-sublinear-time-2202.057762022-03-15 https://scifaro.com/en/abs/the-complexity-of-computing-optimum-labelings-for-temporal-connectivity-2202.058802022-05-03 https://scifaro.com/en/abs/fast-and-perfect-sampling-of-subgraphs-and-polymer-systems-2202.059072023-11-17 https://scifaro.com/en/abs/tight-approximation-algorithms-for-two-dimensional-guillotine-strip-packing-2202.059892022-05-09 https://scifaro.com/en/abs/new-approximation-algorithms-for-fair-k-median-problem-2202.062592022-02-15 https://scifaro.com/en/abs/locating-charging-stations-connected-capacitated-and-prize-collecting-2202.062622022-02-15 https://scifaro.com/en/abs/generalized-unrelated-machine-scheduling-problem-2202.062922022-02-15 https://scifaro.com/en/abs/on-triangle-counting-parameterized-by-twin-width-2202.067082022-02-15 https://scifaro.com/en/abs/a-subpolynomial-approximation-algorithm-for-graph-crossing-number-in-low-degree-graphs-2202.068272022-02-15 https://scifaro.com/en/abs/problems-hard-for-treewidth-but-easy-for-stable-gonality-2202.068382022-02-15 https://scifaro.com/en/abs/minimizing-the-weighted-number-of-tardy-jobs-via-max-convolutions-2202.068412022-09-12 https://scifaro.com/en/abs/longest-sub-periodic-subsequence-2202.071892022-02-16 https://scifaro.com/en/abs/a-simple-lp-based-approximation-algorithm-for-the-matching-augmentation-problem-2202.072832022-08-25 https://scifaro.com/en/abs/heuristic-computation-of-exact-treewidth-2202.077932022-02-17 https://scifaro.com/en/abs/an-optimal-time-rlbwt-construction-in-bwt-runs-bounded-space-2202.078852022-02-17 https://scifaro.com/en/abs/on-the-complexity-of-scheduling-problems-with-a-fixed-number-of-parallel-identical-machines-2202.079322023-02-09 https://scifaro.com/en/abs/almost-optimal-sublinear-time-edit-distance-in-the-low-distance-regime-2202.080662023-03-17 https://scifaro.com/en/abs/controlling-epidemic-spread-using-probabilistic-diffusion-models-on-networks-2202.082962022-02-18 https://scifaro.com/en/abs/sat-backdoors-depth-beats-size-2202.083262022-02-18 https://scifaro.com/en/abs/extended-mso-model-checking-via-small-vertex-integrity-2202.084452023-10-17 https://scifaro.com/en/abs/online-scheduling-of-time-critical-tasks-to-minimize-the-number-of-calibrations-2202.084822022-02-18 https://scifaro.com/en/abs/a-bi-criteria-fptas-for-scheduling-with-memory-constraints-on-graph-with-bounded-tree-width-2202.087042022-02-18 https://scifaro.com/en/abs/listing-maximal-k-plexes-in-large-real-world-graphs-2202.087372022-02-22 https://scifaro.com/en/abs/an-optimal-algorithm-for-product-structure-in-planar-graphs-2202.088702022-02-21 https://scifaro.com/en/abs/computing-list-homomorphisms-in-geometric-intersection-graphs-2202.088962022-02-21 https://scifaro.com/en/abs/sampling-approximately-low-rank-ising-models-mcmc-meets-variational-methods-2202.089072022-02-21 https://scifaro.com/en/abs/worst-case-to-average-case-reductions-via-additive-combinatorics-2202.089962022-02-21 https://scifaro.com/en/abs/sketching-distances-in-monotone-graph-classes-2202.092532023-12-18 https://scifaro.com/en/abs/finding-shortest-non-separating-and-non-disconnecting-paths-2202.097182022-02-22 https://scifaro.com/en/abs/tight-bounds-for-sketching-the-operator-norm-schatten-norms-and-subspace-embeddings-2202.097972022-02-22 https://scifaro.com/en/abs/cyclic-generators-and-an-improved-linear-kernel-for-the-rooted-subtree-prune-and-regraft-distance-2202.099042023-08-21 https://scifaro.com/en/abs/learning-low-degree-hypergraphs-2202.099892024-12-23 https://scifaro.com/en/abs/obtaining-approximately-optimal-and-diverse-solutions-via-dispersion-2202.100282022-02-22 https://scifaro.com/en/abs/efficient-computation-of-oriented-vertex-and-arc-colorings-of-special-digraphs-2202.101952022-02-22 https://scifaro.com/en/abs/permutation-predictions-for-non-clairvoyant-scheduling-2202.101992022-05-23 https://scifaro.com/en/abs/priority-algorithms-with-advice-for-disjoint-path-allocation-problems-2202.102542022-04-29 https://scifaro.com/en/abs/time-complexity-of-the-analyst-s-traveling-salesman-algorithm-2202.103142024-04-09 https://scifaro.com/en/abs/a-probabilistic-approach-to-the-perfect-sum-problem-2202.105252022-11-29 https://scifaro.com/en/abs/loop-unrolling-of-uca-models-distance-labeling-2202.105272026-04-02 https://scifaro.com/en/abs/the-near-exact-bin-covering-problem-2202.109042022-02-23 https://scifaro.com/en/abs/constant-matters-fine-grained-complexity-of-differentially-private-continual-observation-2202.112052024-02-06 https://scifaro.com/en/abs/a-qubo-formulation-for-the-tree-containment-problem-2202.112342023-08-21 https://scifaro.com/en/abs/a-partition-and-merge-algorithm-for-solving-the-steiner-tree-problem-in-large-graphs-2202.118852024-08-23 https://scifaro.com/en/abs/a-ptas-for-packing-hypercubes-into-a-knapsack-2202.119022022-04-27 https://scifaro.com/en/abs/polynomial-kernels-for-tracking-shortest-paths-2202.119272022-02-25 https://scifaro.com/en/abs/exact-matching-in-graphs-of-bounded-independence-number-2202.119882022-07-14 https://scifaro.com/en/abs/parameterized-complexity-of-graph-partitioning-into-connected-clusters-2202.120422022-02-25 https://scifaro.com/en/abs/counting-temporal-paths-2202.120552023-02-23 https://scifaro.com/en/abs/a-dynamic-low-rank-fast-gaussian-transform-2202.123292024-02-07 https://scifaro.com/en/abs/list-locally-surjective-homomorphisms-in-hereditary-graph-classes-2202.124382024-01-11 https://scifaro.com/en/abs/making-life-more-confusing-for-firefighters-2202.125992022-04-07 https://scifaro.com/en/abs/towards-optimal-lower-bounds-for-k-median-and-k-means-coresets-2202.127932022-02-28 https://scifaro.com/en/abs/compressed-matrix-computations-2202.130072022-03-01 https://scifaro.com/en/abs/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth-2202.130142022-03-01 https://scifaro.com/en/abs/almost-tight-approximation-hardness-for-single-source-directed-k-edge-connectivity-2202.130882024-08-21 https://scifaro.com/en/abs/a-survey-of-bwt-variants-for-string-collections-2202.132352025-05-28 https://scifaro.com/en/abs/parallel-algorithm-for-pattern-matching-problems-under-substring-consistent-equivalence-relations-2202.132842022-07-28 https://scifaro.com/en/abs/approximation-algorithms-for-flexible-graph-connectivity-2202.132982022-03-01 https://scifaro.com/en/abs/a-logic-based-algorithmic-meta-theorem-for-mim-width-2202.133352022-12-09 https://scifaro.com/en/abs/on-problems-related-to-unbounded-subsetsum-a-unified-combinatorial-approach-2202.134842022-03-01 https://scifaro.com/en/abs/minimal-absent-words-on-run-length-encoded-strings-2202.135912022-04-18 https://scifaro.com/en/abs/cutting-a-tree-with-subgraph-complementation-is-hard-except-for-some-small-trees-2202.136202022-08-23 https://scifaro.com/en/abs/edge-cut-width-an-algorithmically-driven-analogue-of-treewidth-based-on-edge-cuts-2202.136612022-03-01 https://scifaro.com/en/abs/improved-combinatorial-approximation-algorithms-for-max-cut-in-sparse-graphs-2202.137272022-03-01 https://scifaro.com/en/abs/on-the-robustness-of-countsketch-to-adaptive-inputs-2202.137362022-03-01 https://scifaro.com/en/abs/quantum-jumbled-pattern-matching-2203.001642022-03-02 https://scifaro.com/en/abs/ordered-submodularity-and-its-applications-to-diversifying-recommendations-2203.002332022-03-02 https://scifaro.com/en/abs/private-convex-optimization-via-exponential-mechanism-2203.002632022-07-29 https://scifaro.com/en/abs/online-unit-profit-knapsack-with-untrusted-predictions-2203.002852022-03-02 https://scifaro.com/en/abs/maximum-flow-and-minimum-cost-flow-in-almost-linear-time-2203.006712022-04-26 https://scifaro.com/en/abs/near-linear-time-approximations-for-cut-problems-via-fair-cuts-2203.007512023-01-13 https://scifaro.com/en/abs/coresets-remembered-and-items-forgotten-submodular-maximization-with-deletions-2203.012412022-09-15 https://scifaro.com/en/abs/private-high-dimensional-hypothesis-testing-2203.015372022-07-26 https://scifaro.com/en/abs/a-formalisation-of-algorithms-for-sorting-network-2203.015792022-03-04 https://scifaro.com/en/abs/structural-results-for-high-multiplicity-scheduling-on-uniform-machines-2203.017412024-09-24 https://scifaro.com/en/abs/improved-approximation-algorithms-and-lower-bounds-for-search-diversification-problems-2203.018572022-03-04 https://scifaro.com/en/abs/beyond-time-complexity-data-movement-complexity-analysis-for-matrix-multiplication-2203.025362022-03-08 https://scifaro.com/en/abs/online-list-labeling-breaking-the-log-2n-barrier-2203.027632022-09-13 https://scifaro.com/en/abs/pylspack-parallel-algorithms-and-data-structures-for-sketching-column-subset-selection-regression-and-leverage-scores-2203.027982022-11-16 https://scifaro.com/en/abs/distributional-hardness-against-preconditioned-lasso-via-erasure-robust-designs-2203.028242022-03-08 https://scifaro.com/en/abs/the-power-of-multiple-choices-in-online-stochastic-matching-2203.028832022-03-08 https://scifaro.com/en/abs/distributed-distance-domination-in-graphs-with-no-k-2-t-minor-2203.032292022-03-08 https://scifaro.com/en/abs/online-matching-with-convex-delay-costs-2203.033352022-03-08 https://scifaro.com/en/abs/turbocharging-heuristics-for-weak-coloring-numbers-2203.033582022-09-27 https://scifaro.com/en/abs/negative-weight-single-source-shortest-paths-in-near-linear-time-2203.034562025-05-21 https://scifaro.com/en/abs/exponentially-faster-fixed-parameter-algorithms-for-high-multiplicity-scheduling-2203.036002024-07-11 https://scifaro.com/en/abs/unit-perturbations-in-budgeted-spanning-tree-problems-2203.036972022-03-09 https://scifaro.com/en/abs/semi-random-sparse-recovery-in-nearly-linear-time-2203.040022022-03-09 https://scifaro.com/en/abs/oriented-diameter-of-planar-triangulations-2203.042532022-03-09 https://scifaro.com/en/abs/tailored-vertex-ordering-for-faster-triangle-listing-in-large-graphs-2203.047742022-11-03 https://scifaro.com/en/abs/max-weight-independent-set-in-graphs-with-no-long-claws-an-analog-of-the-gy-arf-as-path-argument-2203.048362026-02-19 https://scifaro.com/en/abs/algorithms-for-the-maximum-eulerian-cycle-decomposition-problem-2203.054462022-03-11 https://scifaro.com/en/abs/a-linearithmic-time-locally-optimal-algorithm-for-the-multiway-number-partition-optimization-2203.056182022-03-14 https://scifaro.com/en/abs/vertex-cover-and-feedback-vertex-set-above-and-below-structural-guarantees-2203.058872022-08-22 https://scifaro.com/en/abs/fully-dynamic-alpha-2-arboricity-decomposition-and-implicit-colouring-2203.060392022-03-14 https://scifaro.com/en/abs/cheeger-inequalities-for-vertex-expansion-and-reweighted-eigenvalues-2203.061682022-09-20 https://scifaro.com/en/abs/in-approximability-results-for-interval-resource-restricted-and-low-rank-scheduling-2203.061712022-03-14 https://scifaro.com/en/abs/distributed-subgraph-finding-progress-and-challenges-2203.065972025-08-28 https://scifaro.com/en/abs/the-role-of-interactivity-in-structured-estimation-2203.068702022-03-15 https://scifaro.com/en/abs/fast-regression-for-structured-inputs-2203.075572022-03-16 https://scifaro.com/en/abs/online-task-assignment-problems-with-reusable-resources-2203.076052022-03-16 https://scifaro.com/en/abs/maximizing-modular-plus-non-monotone-submodular-functions-2203.077112022-04-13 https://scifaro.com/en/abs/edge-based-local-push-for-personalized-pagerank-2203.079372022-05-10 https://scifaro.com/en/abs/natural-hierarchical-cluster-analysis-by-nearest-neighbors-with-near-linear-time-complexity-2203.080272022-03-16 https://scifaro.com/en/abs/qubos-for-sorting-lists-and-building-trees-2203.088152022-03-18 https://scifaro.com/en/abs/fused-pagerank-loop-fusion-based-approximate-pagerank-2203.092842022-03-18 https://scifaro.com/en/abs/stronger-3sum-indexing-lower-bounds-2203.093342023-03-28 https://scifaro.com/en/abs/extremal-event-graphs-a-stable-tool-for-analyzing-noisy-time-series-data-2203.095522022-08-25 https://scifaro.com/en/abs/triangle-and-four-cycle-counting-with-predictions-in-graph-streams-2203.095722022-03-21 https://scifaro.com/en/abs/exact-approaches-for-the-connected-vertex-cover-problem-2203.098682023-02-20 https://scifaro.com/en/abs/kernelization-for-treewidth-2-vertex-deletion-2203.100702022-03-21 https://scifaro.com/en/abs/tight-vector-bin-packing-with-few-small-items-via-fast-exact-matching-in-multigraphs-2203.100772022-07-19 https://scifaro.com/en/abs/red-domination-in-perfect-elimination-bipartite-graphs-2203.106302022-03-22 https://scifaro.com/en/abs/scaling-up-maximal-k-plex-enumeration-2203.107602022-05-03 https://scifaro.com/en/abs/coresets-for-weight-constrained-anisotropic-assignment-and-clustering-2203.108642022-03-22 https://scifaro.com/en/abs/brooks-theorem-in-graph-streams-a-single-pass-semi-streaming-algorithm-for-delta-coloring-2203.109842024-02-14 https://scifaro.com/en/abs/quadratic-speedups-in-parallel-sampling-from-determinantal-distributions-2203.111902023-05-01 https://scifaro.com/en/abs/improved-differentially-private-euclidean-distance-approximation-2203.115612022-03-23 https://scifaro.com/en/abs/ts-reconfiguration-of-k-path-vertex-covers-in-caterpillars-for-k-geq-4-2203.116672023-04-28 https://scifaro.com/en/abs/spectral-algorithms-optimally-recover-planted-sub-structures-2203.118472022-10-13 https://scifaro.com/en/abs/efficient-pairing-in-unknown-environments-minimal-observations-and-tsp-based-optimization-2203.122142022-05-10 https://scifaro.com/en/abs/batch-dynamic-algorithm-to-find-k-cores-and-hierarchies-2203.130952022-03-25 https://scifaro.com/en/abs/approximate-parametric-computation-of-minimum-cost-flows-with-convex-costs-2203.131462022-03-25 https://scifaro.com/en/abs/independent-set-reconfiguration-on-directed-graphs-2203.134352022-03-28 https://scifaro.com/en/abs/p-generalized-probit-regression-and-scalable-maximum-likelihood-estimation-via-sketching-and-coresets-2203.135682022-03-28 https://scifaro.com/en/abs/exact-matching-algorithms-and-related-problems-2203.138992022-12-29 https://scifaro.com/en/abs/constant-factor-approximations-for-lower-and-upper-bounded-clusterings-2203.140582022-03-29 https://scifaro.com/en/abs/exact-and-heuristic-algorithms-for-energy-efficient-scheduling-2203.140702023-05-30 https://scifaro.com/en/abs/approximately-counting-subgraphs-in-data-streams-2203.142252022-03-29 https://scifaro.com/en/abs/sublinear-dynamic-interval-scheduling-on-one-or-multiple-machines-2203.143102022-10-04 https://scifaro.com/en/abs/improving-matrix-vector-multiplication-via-lossless-grammar-compressed-matrices-2203.145402022-03-31 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-maximizing-a-dr-submodular-function-over-a-convex-set-2203.147402022-03-29 https://scifaro.com/en/abs/sublinear-algorithms-and-lower-bounds-for-estimating-mst-and-tsp-cost-in-general-metrics-2203.147982023-05-04 https://scifaro.com/en/abs/chess-is-hard-even-for-a-single-player-2203.148642022-04-01 https://scifaro.com/en/abs/graphzeppelin-storage-friendly-sketching-for-connected-components-on-dynamic-graph-streams-2203.149272022-03-29 https://scifaro.com/en/abs/efficient-algorithm-for-deterministic-search-of-hot-elements-2203.150432022-03-30 https://scifaro.com/en/abs/a-quantum-inspired-tensor-network-method-for-constrained-combinatorial-optimization-problems-2203.152462022-09-07 https://scifaro.com/en/abs/order-invariant-cardinality-estimators-are-differentially-private-2203.154002023-02-06 https://scifaro.com/en/abs/heterogeneous-differential-privacy-via-graphs-2203.154292022-03-30 https://scifaro.com/en/abs/phase-transition-in-count-approximation-by-count-min-sketch-with-conservative-updates-2203.154962023-09-08 https://scifaro.com/en/abs/firefighter-problem-with-minimum-budget-hardness-and-approximation-algorithm-for-unit-disk-graphs-2203.155092022-03-30 https://scifaro.com/en/abs/low-treewidth-embeddings-of-planar-and-minor-free-metrics-2203.156272022-03-30 https://scifaro.com/en/abs/scheduling-uet-uct-dags-of-depth-two-on-two-processors-2203.157262022-03-30 https://scifaro.com/en/abs/restless-temporal-path-parameterized-above-lower-bounds-2203.158622022-03-31 https://scifaro.com/en/abs/optimally-tracking-labels-on-an-evolving-tree-2203.162642022-08-24 https://scifaro.com/en/abs/differentially-private-all-pairs-shortest-path-distances-improved-algorithms-and-lower-bounds-2203.164762022-03-31 https://scifaro.com/en/abs/snapshot-visualization-of-complex-graphs-with-force-directed-algorithms-2203.168672022-04-01 https://scifaro.com/en/abs/suffix-tree-based-linear-algorithms-for-multiple-prefixes-single-suffix-counting-and-listing-problems-2203.169082022-04-19 https://scifaro.com/en/abs/subquadratic-dynamic-path-reporting-in-directed-graphs-against-an-adaptive-adversary-2203.169922022-04-01 https://scifaro.com/en/abs/fair-short-paths-in-vertex-colored-graphs-2203.171322023-02-28 https://scifaro.com/en/abs/prefix-filter-practically-and-theoretically-better-than-bloom-2203.171392022-10-26 https://scifaro.com/en/abs/instability-of-backoff-protocols-with-arbitrary-arrival-rates-2203.171442025-02-28 https://scifaro.com/en/abs/balanced-clique-computation-in-signed-networks-concepts-and-algorithms-2204.005152022-04-04 https://scifaro.com/en/abs/double-hashing-algorithm-for-frequency-estimation-in-data-streams-2204.006502022-04-05 https://scifaro.com/en/abs/twin-width-viii-delineation-and-win-wins-2204.007222022-04-05 https://scifaro.com/en/abs/improved-approximation-algorithm-for-graph-burning-on-trees-2204.007722022-09-16 https://scifaro.com/en/abs/an-optimal-algorithm-for-certifying-monotone-functions-2204.012242022-04-05 https://scifaro.com/en/abs/online-ordinal-problems-optimality-of-comparison-based-algorithms-and-their-cardinal-complexity-2204.014182023-10-13 https://scifaro.com/en/abs/order-selection-prophet-inequality-from-threshold-optimization-to-arrival-time-design-2204.014252022-04-05 https://scifaro.com/en/abs/optimal-workplace-occupancy-strategies-during-the-covid-19-pandemic-2204.014442022-04-05 https://scifaro.com/en/abs/sampling-lov-asz-local-lemma-for-general-constraint-satisfaction-solutions-in-near-linear-time-2204.015202023-03-10 https://scifaro.com/en/abs/using-random-graphs-to-sample-repulsive-gibbs-point-processes-with-arbitrary-range-potentials-2204.017932023-12-15 https://scifaro.com/en/abs/the-fast-johnson-lindenstrauss-transform-is-even-faster-2204.018002022-04-06 https://scifaro.com/en/abs/multitasking-scheduling-with-shared-processing-2204.018592022-04-06 https://scifaro.com/en/abs/almost-linear-planted-cliques-elude-the-metropolis-process-2204.019112022-04-06 https://scifaro.com/en/abs/algorithms-for-the-ferromagnetic-potts-model-on-expanders-2204.019232024-11-20 https://scifaro.com/en/abs/online-matching-games-in-bipartite-expanders-and-applications-2204.019362024-07-09 https://scifaro.com/en/abs/streaming-algorithms-for-multitasking-scheduling-with-shared-processing-2204.019702022-04-06 https://scifaro.com/en/abs/streaming-approximation-scheme-for-minimizing-total-completion-time-on-parallel-machines-subject-to-varying-processing-capacity-2204.019762022-04-06 https://scifaro.com/en/abs/streaming-facility-location-in-high-dimension-via-geometric-hashing-2204.020952023-01-31 https://scifaro.com/en/abs/all-pairs-shortest-path-distances-with-differential-privacy-improved-algorithms-for-bounded-and-unbounded-weights-2204.023352022-04-06 https://scifaro.com/en/abs/maintaining-expander-decompositions-via-sparse-cuts-2204.025192023-01-24 https://scifaro.com/en/abs/nearly-tight-spectral-sparsification-of-directed-hypergraphs-by-a-simple-iterative-sampling-algorithm-2204.025372023-05-12 https://scifaro.com/en/abs/optimal-sublinear-sampling-of-spanning-trees-and-determinantal-point-processes-via-average-case-entropic-independence-2204.025702022-09-20 https://scifaro.com/en/abs/scheduling-coflows-for-minimizing-the-total-weighted-completion-time-in-identical-parallel-networks-2204.026512022-07-15 https://scifaro.com/en/abs/disentangling-the-computational-complexity-of-network-untangling-2204.026682022-04-07 https://scifaro.com/en/abs/efficient-bayesian-network-structure-learning-via-parameterized-local-search-on-topological-orderings-2204.029022022-04-07 https://scifaro.com/en/abs/approximation-algorithms-and-hardness-for-n-pairs-shortest-paths-and-all-nodes-shortest-cycles-2204.030762022-09-21 https://scifaro.com/en/abs/faster-pattern-matching-under-edit-distance-2204.030872022-04-08 https://scifaro.com/en/abs/speeding-up-sparsification-using-inner-product-search-data-structures-2204.032092022-04-08 https://scifaro.com/en/abs/lower-bounds-for-restricted-schemes-in-the-two-adaptive-bitprobe-model-2204.032662022-04-11 https://scifaro.com/en/abs/maximizing-sums-of-non-monotone-submodular-and-linear-functions-understanding-the-unconstrained-case-2204.034122022-04-08 https://scifaro.com/en/abs/accelerating-erm-for-data-driven-algorithm-design-using-output-sensitive-techniques-2204.035692024-10-25 https://scifaro.com/en/abs/testing-positive-semidefiniteness-using-linear-measurements-2204.037822023-10-26 https://scifaro.com/en/abs/high-dimensional-geometric-streaming-in-polynomial-space-2204.037902022-09-28 https://scifaro.com/en/abs/deterministic-near-linear-varepsilon-approximation-algorithm-for-geometric-bipartite-matching-2204.038752022-04-11 https://scifaro.com/en/abs/ranking-with-submodular-functions-on-a-budget-2204.041682022-05-02 https://scifaro.com/en/abs/an-improved-integer-modular-multiplicative-inverse-modulo-2-w-2204.043422022-04-26 https://scifaro.com/en/abs/reduction-ratio-of-the-is-algorithm-worst-and-random-cases-2204.044222022-04-12 https://scifaro.com/en/abs/faster-min-plus-product-for-monotone-instances-2204.045002022-06-20 https://scifaro.com/en/abs/eptas-for-the-dual-of-splittable-bin-packing-with-cardinality-constraint-2204.046852022-04-12 https://scifaro.com/en/abs/improved-weighted-matching-in-the-sliding-window-model-2204.047172023-01-11 https://scifaro.com/en/abs/minimal-roman-dominating-functions-extensions-and-enumeration-2204.047652022-04-12 https://scifaro.com/en/abs/improved-approximations-for-euclidean-k-means-and-k-median-via-nested-quasi-independent-sets-2204.048282022-04-13 https://scifaro.com/en/abs/the-complexity-of-temporal-vertex-cover-in-small-degree-graphs-2204.048322024-03-22 https://scifaro.com/en/abs/constrained-shortest-path-and-hierarchical-structures-2204.049602022-04-12 https://scifaro.com/en/abs/submodular-maximization-subject-to-matroid-intersection-on-the-fly-2204.051542022-04-12 https://scifaro.com/en/abs/on-top-k-selection-from-m-wise-partial-rankings-via-borda-counting-2204.057422022-05-25 https://scifaro.com/en/abs/computing-k-bisimulations-for-large-graphs-a-comparison-and-efficiency-analysis-2204.058212023-05-16 https://scifaro.com/en/abs/undirected-1-varepsilon-shortest-paths-via-minor-aggregates-near-optimal-deterministic-parallel-distributed-algorithms-2204.058742022-09-26 https://scifaro.com/en/abs/efficient-construction-of-the-bwt-for-repetitive-text-using-string-compression-2204.059692023-08-15 https://scifaro.com/en/abs/pac-trees-supporting-parallel-and-compressed-purely-functional-collections-2204.060772022-04-14 https://scifaro.com/en/abs/distributed-coalgebraic-partition-refinement-2204.062482022-04-14 https://scifaro.com/en/abs/linear-programs-with-polynomial-coefficients-and-applications-to-1d-cellular-automata-2204.063572023-05-11 https://scifaro.com/en/abs/sketching-algorithms-and-lower-bounds-for-ridge-regression-2204.066532022-06-20 https://scifaro.com/en/abs/a-fixed-parameter-algorithm-for-the-kneser-problem-2204.067612024-11-27 https://scifaro.com/en/abs/fractional-online-stochastic-matching-via-fine-grained-offline-statistics-2204.068512022-04-15 https://scifaro.com/en/abs/better-than-frac-4-3-approximations-for-leaf-to-leaf-tree-and-connectivity-augmentation-2204.069442022-04-15 https://scifaro.com/en/abs/data-structures-for-computing-unique-palindromes-in-static-and-non-static-strings-2204.073272023-08-30 https://scifaro.com/en/abs/finding-hall-blockers-by-matrix-scaling-2204.074252023-06-19 https://scifaro.com/en/abs/scheduling-coflows-for-minimizing-the-total-weighted-completion-time-in-heterogeneous-parallel-networks-2204.077992023-08-31 https://scifaro.com/en/abs/local-treewidth-of-random-and-noisy-graphs-with-applications-to-stopping-contagion-in-networks-2204.078272022-07-18 https://scifaro.com/en/abs/on-representing-the-degree-sequences-of-sublogarithmic-degree-wheeler-graphs-2204.079162022-08-23 https://scifaro.com/en/abs/a-new-dynamic-algorithm-for-densest-subhypergraphs-2204.081062022-04-19 https://scifaro.com/en/abs/deterministic-low-diameter-decompositions-for-weighted-graphs-and-distributed-and-parallel-applications-2204.082542022-09-07 https://scifaro.com/en/abs/practical-kmp-bm-style-pattern-matching-on-indeterminate-strings-2204.083312024-02-19 https://scifaro.com/en/abs/low-degree-testing-over-the-reals-2204.084042022-04-19 https://scifaro.com/en/abs/independence-testing-for-bounded-degree-bayesian-network-2204.086902023-01-04 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-the-kneser-and-schrijver-problems-2204.090092024-02-14 https://scifaro.com/en/abs/massively-parallel-computation-on-embedded-planar-graphs-2204.090352022-11-22 https://scifaro.com/en/abs/representation-of-short-distances-in-structurally-sparse-graphs-2204.091132022-10-18 https://scifaro.com/en/abs/the-white-box-adversarial-data-stream-model-2204.091362022-07-26 https://scifaro.com/en/abs/counting-and-enumerating-optimum-cut-sets-for-hypergraph-k-partitioning-problems-for-fixed-k-2204.091782023-03-09 https://scifaro.com/en/abs/theoretical-analysis-of-edit-distance-algorithms-an-applied-perspective-2204.095352023-01-31 https://scifaro.com/en/abs/fast-circular-pattern-matching-2204.095622022-04-21 https://scifaro.com/en/abs/memory-bounds-for-the-experts-problem-2204.098372022-04-22 https://scifaro.com/en/abs/motif-cut-sparsifiers-2204.099512022-09-13 https://scifaro.com/en/abs/a-computational-study-of-gomory-hu-construction-tree-algorithms-2204.101692026-02-25 https://scifaro.com/en/abs/online-two-dimensional-vector-packing-with-advice-2204.103222022-04-22 https://scifaro.com/en/abs/hardness-of-approximation-in-p-via-short-cycle-removal-cycle-detection-distance-oracles-and-beyond-2204.104652022-10-18 https://scifaro.com/en/abs/some-optimization-solutions-for-relief-distribution-2204.104912022-04-25 https://scifaro.com/en/abs/a-linear-time-algorithm-for-computing-max-flow-vitality-in-undirected-unweighted-planar-graphs-2204.105682022-04-25 https://scifaro.com/en/abs/deterministic-sensitivity-oracles-for-diameter-eccentricities-and-all-pairs-distances-2204.106792022-04-25 https://scifaro.com/en/abs/deterministic-self-adjusting-tree-networks-using-rotor-walks-2204.107542022-04-25 https://scifaro.com/en/abs/parameterized-sensitivity-oracles-and-dynamic-algorithms-using-exterior-algebras-2204.108192022-06-22 https://scifaro.com/en/abs/listing-verifying-and-counting-lowest-common-ancestors-in-dags-algorithms-and-fine-grained-lower-bounds-2204.109322022-04-26 https://scifaro.com/en/abs/approximation-algorithms-for-interdiction-problem-with-packing-constraints-2204.111062022-04-26 https://scifaro.com/en/abs/maximizing-non-monotone-submodular-functions-over-small-subsets-beyond-1-2-approximation-2204.111492022-04-26 https://scifaro.com/en/abs/hierarchical-locality-sensitive-hashing-for-structured-data-a-survey-2204.112092025-03-12 https://scifaro.com/en/abs/string-rearrangement-inequalities-and-a-total-order-between-primitive-words-2204.112132022-04-26 https://scifaro.com/en/abs/graph-product-structure-for-h-framed-graphs-2204.114952022-04-26 https://scifaro.com/en/abs/a-structural-investigation-of-the-approximability-of-polynomial-time-problems-2204.116812022-04-26 https://scifaro.com/en/abs/efficient-recognition-of-subgraphs-of-planar-cubic-bridgeless-graphs-2204.117502022-07-18 https://scifaro.com/en/abs/asymmetric-number-partitioning-with-splitting-and-interval-targets-2204.117532025-04-04 https://scifaro.com/en/abs/properly-learning-monotone-functions-via-local-reconstruction-2204.118942023-03-29 https://scifaro.com/en/abs/faster-fundamental-graph-algorithms-via-learned-predictions-2204.120552022-04-27 https://scifaro.com/en/abs/budgeted-out-tree-maximization-with-submodular-prizes-2204.121622022-10-04 https://scifaro.com/en/abs/lattices-without-a-big-constant-and-with-noise-2204.123402022-04-27 https://scifaro.com/en/abs/polylogarithmic-sketches-for-clustering-2204.123582022-04-27 https://scifaro.com/en/abs/tolerant-bipartiteness-testing-in-dense-graphs-2204.123972022-04-27 https://scifaro.com/en/abs/streaming-algorithms-for-high-dimensional-robust-statistics-2204.123992023-05-04 https://scifaro.com/en/abs/a-review-of-in-memory-space-efficient-data-structures-for-temporal-graphs-2204.124682022-04-27 https://scifaro.com/en/abs/distances-release-with-differential-privacy-in-tree-and-grid-graph-2204.124882022-04-27 https://scifaro.com/en/abs/a-3-approximation-algorithm-for-a-particular-case-of-the-hamiltonian-p-median-problem-2204.126092022-04-28 https://scifaro.com/en/abs/optimal-closeness-testing-of-discrete-distributions-made-complex-simple-2204.126402022-04-28 https://scifaro.com/en/abs/regularized-box-simplex-games-and-dynamic-decremental-bipartite-matching-2204.127212022-06-15 https://scifaro.com/en/abs/a-branch-and-price-approach-to-a-variant-of-the-cognitive-radio-resource-allocation-problem-2204.127802022-04-28 https://scifaro.com/en/abs/speeding-hirschberg-algorithm-for-sequence-alignment-2204.128012022-04-28 https://scifaro.com/en/abs/weighted-packet-selection-for-rechargeable-links-complexity-and-approximation-2204.134592022-05-10 https://scifaro.com/en/abs/algorithmic-qubo-formulations-for-k-sat-and-hamiltonian-cycles-2204.135392022-04-29 https://scifaro.com/en/abs/survivable-network-design-revisited-group-connectivity-2204.136482022-04-29 https://scifaro.com/en/abs/efficient-algorithms-for-monotone-non-submodular-maximization-with-partition-matroid-constraint-2204.138322022-05-02 https://scifaro.com/en/abs/convex-grid-drawings-of-planar-graphs-with-constant-edge-vertex-resolution-2204.140402022-05-10 https://scifaro.com/en/abs/deterministic-distributed-sparse-and-ultra-sparse-spanners-and-connectivity-certificates-2204.140862022-09-26 https://scifaro.com/en/abs/improved-sublinear-time-edit-distance-for-preprocessed-strings-2204.141372022-10-13 https://scifaro.com/en/abs/breaking-the-linear-error-barrier-in-differentially-private-graph-distance-release-2204.142472022-05-02 https://scifaro.com/en/abs/fast-multivariate-multipoint-evaluation-over-all-finite-fields-2205.003422022-05-03 https://scifaro.com/en/abs/the-johnson-lindenstrauss-lemma-for-clustering-and-subspace-approximation-from-coresets-to-dimension-reduction-2205.003712023-07-11 https://scifaro.com/en/abs/dynamic-data-structures-for-parameterized-string-problems-2205.004412022-05-03 https://scifaro.com/en/abs/scheduling-for-multi-phase-parallelizable-jobs-2205.005182022-05-03 https://scifaro.com/en/abs/improved-reconstruction-for-fourier-sparse-signals-2205.006582023-11-21 https://scifaro.com/en/abs/smaller-progress-measures-and-separating-automata-for-parity-games-2205.007442022-11-18 https://scifaro.com/en/abs/vehicle-routing-with-time-dependent-travel-times-theory-practice-and-benchmarks-2205.008892024-03-26 https://scifaro.com/en/abs/a-unified-approach-to-discrepancy-minimization-2205.010232022-05-03 https://scifaro.com/en/abs/leximax-approximations-and-representative-cohort-selection-2205.011572022-05-19 https://scifaro.com/en/abs/scheduling-with-speed-predictions-2205.012472022-12-08 https://scifaro.com/en/abs/the-price-of-hierarchical-clustering-2205.014172022-05-04 https://scifaro.com/en/abs/approximate-selection-with-unreliable-comparisons-in-optimal-expected-time-2205.014482022-05-04 https://scifaro.com/en/abs/understanding-the-moments-of-tabulation-hashing-via-chaoses-2205.014532022-05-04 https://scifaro.com/en/abs/nested-dissection-meets-ipms-planar-min-cost-flow-in-nearly-linear-time-2205.015622022-05-04 https://scifaro.com/en/abs/computing-maximal-unique-matches-with-the-r-index-2205.015762022-05-04 https://scifaro.com/en/abs/optimal-time-backlog-tradeoffs-for-the-variable-processor-cup-game-2205.017222022-07-26 https://scifaro.com/en/abs/the-theoretical-analysis-of-sequencing-bioinformatics-algorithms-and-beyond-2205.017852022-11-15 https://scifaro.com/en/abs/swendsen-wang-dynamics-for-the-ferromagnetic-ising-model-with-external-fields-2205.019852022-07-19 https://scifaro.com/en/abs/a-perfect-sampler-for-hypergraph-independent-sets-2205.020502022-09-14 https://scifaro.com/en/abs/on-preemptive-scheduling-of-unrelated-machines-using-linear-programming-2205.023512022-05-06 https://scifaro.com/en/abs/scheduling-coflows-with-precedence-constraints-for-minimizing-the-total-weighted-completion-time-in-identical-parallel-networks-2205.024742022-07-15 https://scifaro.com/en/abs/computing-treedepth-in-polynomial-space-and-linear-fpt-time-2205.026562022-05-06 https://scifaro.com/en/abs/finding-bipartite-components-in-hypergraphs-2205.027712022-05-06 https://scifaro.com/en/abs/cut-down-de-bruijn-sequences-2205.028152023-08-30 https://scifaro.com/en/abs/near-optimal-algorithms-for-stochastic-online-bin-packing-2205.036222025-03-05 https://scifaro.com/en/abs/almost-3-approximate-correlation-clustering-in-constant-rounds-2205.037102022-05-10 https://scifaro.com/en/abs/exact-recovery-algorithm-for-planted-bipartite-graph-in-semi-random-graphs-2205.037272022-05-16 https://scifaro.com/en/abs/near-optimal-deterministic-vertex-failure-connectivity-oracles-2205.039302022-05-10 https://scifaro.com/en/abs/reusing-comparator-networks-in-pseudo-boolean-encodings-2205.041292023-05-09 https://scifaro.com/en/abs/edge-connectivity-augmentation-in-near-linear-time-2205.046362022-05-11 https://scifaro.com/en/abs/constant-approximation-for-fault-tolerant-median-problems-via-iterative-rounding-2205.047442022-05-11 https://scifaro.com/en/abs/pachash-packed-and-compressed-hash-tables-2205.047452022-11-09 https://scifaro.com/en/abs/weisfeiler-leman-invariant-promise-valued-csps-2205.048052022-05-11 https://scifaro.com/en/abs/programming-data-structures-for-large-scale-desktop-simulations-of-complex-systems-2205.048372022-08-01 https://scifaro.com/en/abs/the-spatial-computer-a-model-for-energy-efficient-parallel-computation-2205.049342023-01-18 https://scifaro.com/en/abs/parallel-batch-dynamic-minimum-spanning-forest-and-the-efficiency-of-dynamic-agglomerative-graph-clustering-2205.049562022-07-13 https://scifaro.com/en/abs/treepir-efficient-private-retrieval-of-merkle-proofs-via-tree-colorings-with-fast-indexing-and-zero-storage-overhead-2205.052112024-06-05 https://scifaro.com/en/abs/prophet-inequality-on-i-i-d-distributions-beating-1-1-e-with-a-single-query-2205.055192023-08-23 https://scifaro.com/en/abs/on-upward-planar-l-drawings-of-graphs-2205.056272022-08-04 https://scifaro.com/en/abs/a-new-class-of-string-transformations-for-compressed-text-indexing-2205.056432023-05-09 https://scifaro.com/en/abs/sequential-algorithms-for-testing-identity-and-closeness-of-distributions-2205.060692022-05-13 https://scifaro.com/en/abs/space-efficient-graph-coarsening-with-applications-to-succinct-planar-encodings-2205.061282024-06-19 https://scifaro.com/en/abs/balanced-allocations-the-heavily-loaded-case-with-deletions-2205.065582022-05-16 https://scifaro.com/en/abs/bypassing-the-xor-trick-stronger-certificates-for-hypergraph-clique-number-2205.067392022-05-16 https://scifaro.com/en/abs/parameterized-complexity-of-gerrymandering-2205.068572023-12-08 https://scifaro.com/en/abs/a-3-varepsilon-approximate-correlation-clustering-algorithm-in-dynamic-streams-2205.075932025-03-05 https://scifaro.com/en/abs/hyperdimensional-hashing-a-robust-and-efficient-dynamic-hash-table-2205.078502022-05-17 https://scifaro.com/en/abs/a-faster-algorithm-for-vertex-cover-parameterized-by-solution-size-2205.080222025-11-12 https://scifaro.com/en/abs/narrowing-the-local-unicode-x2013-congest-gaps-in-sparse-networks-via-expander-decompositions-2205.080932025-10-24 https://scifaro.com/en/abs/deterministic-3-server-on-a-circle-and-the-limitation-of-canonical-potentials-2205.081032022-05-18 https://scifaro.com/en/abs/improved-utility-analysis-of-private-countsketch-2205.083972022-10-13 https://scifaro.com/en/abs/faster-knapsack-algorithms-via-bounded-monotone-min-plus-convolution-2205.084932022-05-18 https://scifaro.com/en/abs/new-lower-bounds-for-private-estimation-and-a-generalized-fingerprinting-lemma-2205.085322023-03-29 https://scifaro.com/en/abs/the-energy-complexity-of-las-vegas-leader-election-2205.086422022-05-19 https://scifaro.com/en/abs/improved-online-contention-resolution-for-matchings-and-applications-to-the-gig-economy-2205.086672022-05-19 https://scifaro.com/en/abs/on-data-reduction-for-dynamic-vector-bin-packing-2205.087692023-07-20 https://scifaro.com/en/abs/estimation-of-entropy-in-constant-space-with-improved-sample-complexity-2205.098042022-05-23 https://scifaro.com/en/abs/differentially-private-linear-sketches-efficient-implementations-and-applications-2205.098732022-10-18 https://scifaro.com/en/abs/parameterized-complexity-of-weighted-multicut-in-trees-2205.101052022-05-23 https://scifaro.com/en/abs/expander-decomposition-with-fewer-inter-cluster-edges-using-a-spectral-cut-player-2205.103012025-02-04 https://scifaro.com/en/abs/individual-fairness-in-prophet-inequalities-2205.103022022-05-23 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-the-s-club-cluster-edge-deletion-problem-2205.108342022-05-24 https://scifaro.com/en/abs/from-width-based-model-checking-to-width-based-automated-theorem-proving-2205.109952026-05-21 https://scifaro.com/en/abs/the-k-server-with-preferences-problem-2205.111022022-10-21 https://scifaro.com/en/abs/hyperlogloglog-cardinality-estimation-with-one-log-more-2205.113272022-05-24 https://scifaro.com/en/abs/approximating-csps-with-outliers-2205.113282022-05-24 https://scifaro.com/en/abs/holonomic-equations-and-efficient-random-generation-of-binary-trees-2205.119822024-01-24 https://scifaro.com/en/abs/the-laplacian-paradigm-in-the-broadcast-congested-clique-2205.120592022-05-25 https://scifaro.com/en/abs/competitive-algorithms-for-block-aware-caching-2205.122492022-05-25 https://scifaro.com/en/abs/approximate-euclidean-lengths-and-distances-beyond-johnson-lindenstrauss-2205.123072023-06-02 https://scifaro.com/en/abs/substring-complexities-on-run-length-compressed-strings-2205.124212022-05-26 https://scifaro.com/en/abs/deterministic-massively-parallel-algorithms-for-ruling-sets-2205.126862022-05-26 https://scifaro.com/en/abs/improved-approximations-for-vector-bin-packing-via-iterative-randomized-rounding-2205.128282023-05-01 https://scifaro.com/en/abs/a-universal-error-measure-for-input-predictions-applied-to-online-graph-problems-2205.128502022-10-11 https://scifaro.com/en/abs/a-parameterized-approximation-algorithm-for-the-multiple-allocation-k-hub-center-2205.130302022-05-27 https://scifaro.com/en/abs/many-sequential-iterative-algorithms-can-be-parallel-and-nearly-work-efficient-2205.130772022-05-27 https://scifaro.com/en/abs/more-recent-advances-in-hyper-graph-partitioning-2205.132022022-07-01 https://scifaro.com/en/abs/adaptive-massively-parallel-algorithms-for-cut-problems-2205.141012022-05-30 https://scifaro.com/en/abs/travelling-salesman-problem-parallel-implementations-analysis-2205.143522022-05-31 https://scifaro.com/en/abs/an-efficient-polynomial-time-approximation-scheme-for-parallel-multi-stage-open-shops-2205.144072022-05-31 https://scifaro.com/en/abs/spatial-locality-and-granularity-change-in-caching-2205.145432022-05-31 https://scifaro.com/en/abs/generalized-stochastic-matching-2205.147172022-05-31 https://scifaro.com/en/abs/near-optimal-bounds-for-replacement-paths-and-related-problems-in-the-congest-model-2205.147972024-05-22 https://scifaro.com/en/abs/fast-distance-oracles-for-any-symmetric-norm-2205.148162022-05-31 https://scifaro.com/en/abs/daisy-bloom-filters-2205.148942024-06-18 https://scifaro.com/en/abs/qb-ii-for-evaluating-the-reliability-of-binary-state-networks-2205.149502022-05-31 https://scifaro.com/en/abs/universally-optimal-distributed-exact-min-cut-2205.149672022-06-01 https://scifaro.com/en/abs/approximating-k-edge-connected-spanning-subgraphs-via-a-near-linear-time-lp-solver-2205.149782022-05-31 https://scifaro.com/en/abs/combining-e-graphs-with-abstract-interpretation-2205.149892023-08-16 https://scifaro.com/en/abs/on-the-external-validity-of-average-case-analyses-of-graph-algorithms-2205.150662024-02-08 https://scifaro.com/en/abs/on-algorithmic-applications-of-sim-width-and-mim-width-of-h-1-h-2-free-graphs-2205.151602025-04-23 https://scifaro.com/en/abs/on-maximizing-sums-of-non-monotone-submodular-and-linear-functions-2205.158742022-06-01 https://scifaro.com/en/abs/efficient-algorithms-for-sorting-in-trees-2205.159122022-06-03 https://scifaro.com/en/abs/learning-augmented-algorithms-for-online-tsp-on-the-line-2206.006552022-06-02 https://scifaro.com/en/abs/algorithmic-applications-of-tree-cut-width-2206.007522022-06-03 https://scifaro.com/en/abs/near-optimal-search-time-in-delta-optimal-space-and-vice-versa-2206.007812023-11-10 https://scifaro.com/en/abs/the-power-of-amortized-recourse-for-online-graph-problems-2206.010772022-07-28 https://scifaro.com/en/abs/engineering-compact-data-structures-for-rank-and-select-queries-on-bit-vectors-2206.011492022-11-08 https://scifaro.com/en/abs/max-weight-online-stochastic-matching-improved-approximations-against-the-online-benchmark-2206.012702022-06-06 https://scifaro.com/en/abs/balancing-flow-time-and-energy-consumption-2206.013602022-06-06 https://scifaro.com/en/abs/falconn-a-locality-sensitive-filtering-approach-for-approximate-nearest-neighbor-search-2206.013822022-10-25 https://scifaro.com/en/abs/improved-deterministic-connectivity-in-massively-parallel-computation-2206.015682022-08-17 https://scifaro.com/en/abs/l-systems-for-measuring-repetitiveness-2206.016882022-06-06 https://scifaro.com/en/abs/weighted-model-counting-with-twin-width-2206.017062022-06-06 https://scifaro.com/en/abs/optimal-adjacency-labels-for-subgraphs-of-cartesian-products-2206.028722024-09-13 https://scifaro.com/en/abs/locality-sensitive-bucketing-functions-for-the-edit-distance-2206.030972022-06-27 https://scifaro.com/en/abs/fast-exact-string-to-d-texts-alignments-2206.032422022-06-08 https://scifaro.com/en/abs/a-differentially-private-linear-time-fptas-for-the-minimum-enclosing-ball-problem-2206.033192022-12-26 https://scifaro.com/en/abs/robust-sparse-mean-estimation-via-sum-of-squares-2206.034412024-07-08 https://scifaro.com/en/abs/kernelization-for-feedback-vertex-set-via-elimination-distance-to-a-forest-2206.043872022-06-10 https://scifaro.com/en/abs/deep-kernelization-for-the-tree-bisection-and-reconnnect-tbr-distance-in-phylogenetics-2206.044512022-09-21 https://scifaro.com/en/abs/spencer-s-theorem-in-nearly-input-sparsity-time-2206.045492022-06-10 https://scifaro.com/en/abs/optimal-sq-lower-bounds-for-robustly-learning-discrete-product-distributions-and-ising-models-2206.045892022-06-10 https://scifaro.com/en/abs/on-the-complexity-of-sampling-redistricting-plans-2206.048832023-10-26 https://scifaro.com/en/abs/near-optimal-distributed-dominating-set-in-bounded-arboricity-graphs-2206.051742022-06-13 https://scifaro.com/en/abs/list-decodable-sparse-mean-estimation-via-difference-of-pairs-filtering-2206.052452024-07-08 https://scifaro.com/en/abs/online-paging-with-heterogeneous-cache-slots-2206.055792024-10-22 https://scifaro.com/en/abs/lower-bounds-for-sorting-16-17-and-18-elements-2206.055972022-11-21 https://scifaro.com/en/abs/lazy-and-fast-greedy-map-inference-for-determinantal-point-process-2206.059472022-06-14 https://scifaro.com/en/abs/katka-a-kraken-like-tool-with-k-given-at-query-time-2206.060532022-08-23 https://scifaro.com/en/abs/bin-stretching-with-migration-on-two-hierarchical-machines-2206.061022022-06-14 https://scifaro.com/en/abs/pursuing-more-effective-graph-spectral-sparsifiers-via-approximate-trace-reduction-2206.062232022-06-14 https://scifaro.com/en/abs/an-adversarially-robust-data-market-for-spatial-crowd-sourced-data-2206.062992025-04-21 https://scifaro.com/en/abs/counting-markov-equivalent-directed-acyclic-graphs-consistent-with-background-knowledge-2206.067442023-06-14 https://scifaro.com/en/abs/the-maximum-linear-arrangement-problem-for-trees-under-projectivity-and-planarity-2206.069242023-10-13 https://scifaro.com/en/abs/the-complexity-of-finding-fair-many-to-one-matchings-2206.069882022-07-12 https://scifaro.com/en/abs/sequential-optimization-numbers-and-conjecture-about-edge-symmetry-and-weight-symmetry-shortest-weight-constrained-path-2206.070522022-06-16 https://scifaro.com/en/abs/on-approximating-total-variation-distance-2206.072092023-08-21 https://scifaro.com/en/abs/streaming-algorithms-for-ellipsoidal-approximation-of-convex-polytopes-2206.072502022-06-16 https://scifaro.com/en/abs/faster-decomposition-of-weighted-graphs-into-cliques-using-fisher-s-inequality-2206.072862022-06-17 https://scifaro.com/en/abs/hierarchical-clustering-in-graph-streams-single-pass-algorithms-and-space-lower-bounds-2206.075542022-06-16 https://scifaro.com/en/abs/sublinear-algorithms-for-hierarchical-clustering-2206.076332022-06-16 https://scifaro.com/en/abs/reconstructing-ultrametric-trees-from-noisy-experiments-2206.076722022-06-16 https://scifaro.com/en/abs/approximating-optimization-problems-in-graphs-with-locational-uncertainty-2206.081872024-12-25 https://scifaro.com/en/abs/yankee-swap-a-fast-and-simple-fair-allocation-mechanism-for-matroid-rank-valuations-2206.084952023-07-31 https://scifaro.com/en/abs/scalable-differentially-private-clustering-via-hierarchically-separated-trees-2206.086462022-06-20 https://scifaro.com/en/abs/approximating-max-cut-on-bounded-degree-graphs-tighter-analysis-of-the-fkl-algorithm-2206.092042022-06-23 https://scifaro.com/en/abs/sampling-from-log-concave-distributions-over-polytopes-via-a-soft-threshold-dikin-walk-2206.093842022-11-16 https://scifaro.com/en/abs/scalable-distributed-algorithms-for-size-constrained-submodular-maximization-in-the-mapreduce-and-adaptive-complexity-models-2206.095632024-09-17 https://scifaro.com/en/abs/finding-k-secluded-trees-faster-2206.098842022-06-27 https://scifaro.com/en/abs/superiority-of-instantaneous-decisions-in-thin-dynamic-matching-markets-2206.102872025-11-27 https://scifaro.com/en/abs/the-complexity-of-the-co-occurrence-problem-2206.103832022-11-11 https://scifaro.com/en/abs/near-linear-varepsilon-emulators-for-planar-graphs-2206.106812022-06-23 https://scifaro.com/en/abs/list-decodable-covariance-estimation-2206.109422022-06-23 https://scifaro.com/en/abs/sparse-temporal-spanners-with-low-stretch-2206.111132022-06-23 https://scifaro.com/en/abs/constant-factor-approximation-algorithms-for-socially-fair-k-clustering-2206.112102022-06-23 https://scifaro.com/en/abs/dispersing-obnoxious-facilities-on-graphs-by-rounding-distances-2206.113372022-06-24 https://scifaro.com/en/abs/online-bipartite-matching-with-advice-tight-robustness-consistency-tradeoffs-for-the-two-stage-model-2206.113972024-11-06 https://scifaro.com/en/abs/hierarchical-agglomerative-graph-clustering-in-poly-logarithmic-depth-2206.116542022-06-24 https://scifaro.com/en/abs/longest-common-subsequence-tabular-vs-closed-form-equation-computation-of-subsequence-probability-2206.117262022-06-24 https://scifaro.com/en/abs/algorithms-for-2-connected-network-design-and-flexible-steiner-trees-with-a-constant-number-of-terminals-2206.118072022-08-03 https://scifaro.com/en/abs/learning-augmented-binary-search-trees-2206.121102022-06-27 https://scifaro.com/en/abs/on-the-optimisation-of-the-gsaca-suffix-array-construction-algorithm-2206.122222022-08-31 https://scifaro.com/en/abs/relative-survivable-network-design-2206.122452022-06-27 https://scifaro.com/en/abs/popular-critical-matchings-in-the-many-to-many-setting-2206.123942023-03-21 https://scifaro.com/en/abs/maximum-independent-set-stable-set-problem-computational-testing-with-binary-search-and-convex-programming-using-a-bin-packing-approach-2206.125312023-12-21 https://scifaro.com/en/abs/palfm-index-fm-index-for-palindrome-pattern-matching-2206.126002023-04-17 https://scifaro.com/en/abs/applications-of-recursively-defined-data-structures-2206.127952022-06-28 https://scifaro.com/en/abs/k-median-clustering-via-metric-embedding-towards-better-initialization-with-differential-privacy-2206.128952022-07-11 https://scifaro.com/en/abs/on-the-impossibility-of-decomposing-binary-matroids-2206.128962022-06-30 https://scifaro.com/en/abs/balancing-run-length-straight-line-programs-2206.130272022-06-28 https://scifaro.com/en/abs/beating-greedy-matching-in-sublinear-time-2206.130572022-06-28 https://scifaro.com/en/abs/recognition-and-isomorphism-of-proper-boldsymbol-u-graphs-in-fpt-time-2206.133722022-06-28 https://scifaro.com/en/abs/faster-exponential-time-approximation-algorithms-using-approximate-monotone-local-search-2206.134812026-01-13 https://scifaro.com/en/abs/online-resource-allocation-under-horizon-uncertainty-2206.136062023-06-26 https://scifaro.com/en/abs/on-relaxation-of-dominant-sets-2206.137732024-09-27 https://scifaro.com/en/abs/sublinear-time-clustering-oracle-for-signed-graphs-2206.138132022-06-29 https://scifaro.com/en/abs/open-problem-properly-learning-decision-trees-in-polynomial-time-2206.144312022-06-30 https://scifaro.com/en/abs/there-and-back-again-on-applying-data-reduction-rules-by-undoing-others-2206.146982022-06-30 https://scifaro.com/en/abs/recognizing-map-graphs-of-bounded-treewidth-2206.148982022-07-01 https://scifaro.com/en/abs/near-optimal-algorithm-for-fault-tolerant-distance-oracle-and-single-source-replacement-path-problem-2206.150162022-07-01 https://scifaro.com/en/abs/prefix-free-parsing-for-building-large-tunnelled-wheeler-graphs-2206.150972023-08-28 https://scifaro.com/en/abs/computing-the-parameterized-burrows-wheeler-transform-online-2206.151002022-09-01 https://scifaro.com/en/abs/approximation-algorithms-for-continuous-clustering-and-facility-location-problems-2206.151052022-09-05 https://scifaro.com/en/abs/learning-augmented-query-policies-for-minimum-spanning-tree-with-uncertainty-2206.152012022-07-01 https://scifaro.com/en/abs/fast-sampling-of-satisfying-assignments-from-random-k-sat-with-applications-to-connectivity-2206.153082024-08-06 https://scifaro.com/en/abs/tight-bounds-for-online-matching-in-bounded-degree-graphs-with-vertex-capacities-2206.153362022-07-01 https://scifaro.com/en/abs/online-tsp-with-predictions-2206.153642022-07-01 https://scifaro.com/en/abs/combining-predicted-and-live-traffic-with-time-dependent-a-potentials-2207.003812022-09-21 https://scifaro.com/en/abs/search-space-reduction-via-essential-vertices-2207.003862022-07-04 https://scifaro.com/en/abs/exponential-convergence-of-sinkhorn-under-regularization-scheduling-2207.007362023-04-06 https://scifaro.com/en/abs/efficient-and-effective-local-search-for-the-set-union-knapsack-problem-and-budgeted-maximum-coverage-problem-2207.007492022-07-05 https://scifaro.com/en/abs/sum-of-max-partition-under-a-knapsack-constraint-2207.007682022-10-12 https://scifaro.com/en/abs/tableless-calculation-of-circular-functions-on-dyadic-rationals-2207.008492022-07-05 https://scifaro.com/en/abs/approximating-dynamic-time-warping-distance-between-run-length-encoded-strings-2207.009152022-07-05 https://scifaro.com/en/abs/decremental-matching-in-general-graphs-2207.009272022-07-07 https://scifaro.com/en/abs/tricking-the-hashing-trick-a-tight-lower-bound-on-the-robustness-of-countsketch-to-adaptive-inputs-2207.009562022-08-30 https://scifaro.com/en/abs/an-empirical-evaluation-of-k-means-coresets-2207.009662022-07-05 https://scifaro.com/en/abs/suffix-sorting-via-matching-statistics-2207.009722024-04-16 https://scifaro.com/en/abs/algorithmic-meta-theorems-for-combinatorial-reconfiguration-revisited-2207.010242022-12-29 https://scifaro.com/en/abs/on-polynomial-kernels-for-traveling-salesperson-problem-and-its-generalizations-2207.011092022-07-05 https://scifaro.com/en/abs/efficient-interactive-coding-achieving-optimal-error-resilience-over-the-binary-channel-2207.011442022-07-05 https://scifaro.com/en/abs/optimal-vertex-cut-sparsification-of-quasi-bipartite-graphs-2207.014592022-07-05 https://scifaro.com/en/abs/correlated-stochastic-knapsack-with-a-submodular-objective-2207.015512022-08-04 https://scifaro.com/en/abs/an-almost-linear-time-complexity-algorithm-for-the-tool-loading-problem-2207.020042022-07-06 https://scifaro.com/en/abs/online-2-stage-stable-matching-2207.020572023-05-03 https://scifaro.com/en/abs/width-helps-and-hinders-splitting-flows-2207.021362023-05-11 https://scifaro.com/en/abs/finding-a-hidden-edge-2207.023442022-07-07 https://scifaro.com/en/abs/improving-order-with-queues-2207.024762025-09-17 https://scifaro.com/en/abs/computing-np-hard-repetitiveness-measures-via-max-sat-2207.025712022-07-13 https://scifaro.com/en/abs/approximating-dasgupta-cost-in-sublinear-time-from-a-few-random-seeds-2207.025812025-08-12 https://scifaro.com/en/abs/techniques-for-generalized-colorful-k-center-problems-2207.026092022-07-07 https://scifaro.com/en/abs/private-matrix-approximation-and-geometry-of-unitary-orbits-2207.027942022-07-08 https://scifaro.com/en/abs/non-adaptive-edge-counting-and-sampling-via-bipartite-independent-set-queries-2207.028172022-07-07 https://scifaro.com/en/abs/from-algorithms-to-connectivity-and-back-finding-a-giant-component-in-random-k-sat-2207.028412022-07-18 https://scifaro.com/en/abs/centralised-connectivity-preserving-transformations-by-rotation-3-musketeers-for-all-orthogonal-convex-shapes-2207.030622022-07-08 https://scifaro.com/en/abs/fast-discrepancy-minimization-with-hereditary-guarantees-2207.032682022-11-28 https://scifaro.com/en/abs/on-geometric-shape-construction-via-growth-operations-2207.032752022-07-08 https://scifaro.com/en/abs/barriers-for-faster-dimensionality-reduction-2207.033042022-07-08 https://scifaro.com/en/abs/minimum-2-edge-strongly-biconnected-spanning-directed-subgraph-problem-2207.034012022-07-21 https://scifaro.com/en/abs/maximum-weight-b-matchings-in-random-order-streams-2207.038632023-08-15 https://scifaro.com/en/abs/vertex-sparsifiers-for-hyperedge-connectivity-2207.041152022-07-13 https://scifaro.com/en/abs/online-algorithms-for-finding-distinct-substrings-with-length-and-multiple-prefix-and-suffix-conditions-2207.041942022-11-01 https://scifaro.com/en/abs/determinant-maximization-via-matroid-intersection-algorithms-2207.043182022-07-12 https://scifaro.com/en/abs/minimum-strongly-biconnected-spanning-directed-subgraph-problem-2207.043212022-07-12 https://scifaro.com/en/abs/improved-lower-bounds-for-submodular-function-minimization-2207.043422022-07-12 https://scifaro.com/en/abs/connect-the-dots-tighter-discrete-approximations-of-privacy-loss-distributions-2207.043802022-07-12 https://scifaro.com/en/abs/faster-privacy-accounting-via-evolving-discretization-2207.043812022-07-12 https://scifaro.com/en/abs/closing-the-gap-between-directed-hopsets-and-shortcut-sets-2207.045072024-03-20 https://scifaro.com/en/abs/order-optimal-correlated-rounding-for-fulfilling-multi-item-e-commerce-orders-2207.047742023-05-22 https://scifaro.com/en/abs/parameterized-complexity-of-streaming-diameter-and-connectivity-problems-2207.048722024-07-19 https://scifaro.com/en/abs/simple-dynamic-spanners-with-near-optimal-recourse-against-an-adaptive-adversary-2207.049542022-07-12 https://scifaro.com/en/abs/submodular-dominance-and-applications-2207.049572022-07-13 https://scifaro.com/en/abs/breaching-the-2-lmp-approximation-barrier-for-facility-location-with-applications-to-k-median-2207.051502026-01-29 https://scifaro.com/en/abs/capacity-insensitive-algorithms-for-online-facility-assignment-problems-on-a-line-2207.053082022-08-11 https://scifaro.com/en/abs/popular-matchings-with-one-sided-bias-2207.054882022-07-13 https://scifaro.com/en/abs/approximate-distance-oracles-for-planar-graphs-with-subpolynomial-error-dependency-2207.056592022-07-13 https://scifaro.com/en/abs/caching-with-reserves-2207.059752022-07-14 https://scifaro.com/en/abs/realizability-makes-a-difference-a-complexity-gap-for-sink-finding-in-usos-2207.059852022-07-14 https://scifaro.com/en/abs/near-optimal-bounds-for-testing-histogram-distributions-2207.065962022-07-15 https://scifaro.com/en/abs/improved-parameterized-complexity-of-happy-set-problems-2207.066232023-01-24 https://scifaro.com/en/abs/unified-almost-linear-kernels-for-generalized-covering-and-packing-problems-on-nowhere-dense-classes-2207.066602022-07-15 https://scifaro.com/en/abs/kernelization-for-graph-packing-problems-via-rainbow-matching-2207.068742023-05-22 https://scifaro.com/en/abs/dynamic-spanning-trees-for-connectivity-queries-on-fully-dynamic-undirected-graphs-extended-version-2207.068872022-07-19 https://scifaro.com/en/abs/a-query-optimal-algorithm-for-finding-counterfactuals-2207.070722022-07-15 https://scifaro.com/en/abs/streaming-complexity-of-csps-with-randomly-ordered-constraints-2207.071582023-04-14 https://scifaro.com/en/abs/exact-flow-sparsification-requires-unbounded-size-2207.073632022-08-04 https://scifaro.com/en/abs/near-linear-time-and-fixed-parameter-tractable-algorithms-for-tensor-decompositions-2207.074172023-11-28 https://scifaro.com/en/abs/fixed-parameter-tractability-of-directed-multicut-with-three-terminal-pairs-parameterized-by-the-size-of-the-cutset-twin-width-meets-flow-augmentation-2207.074252024-01-11 https://scifaro.com/en/abs/a-tight-quasi-polynomial-bound-for-global-label-min-cut-2207.074262026-03-16 https://scifaro.com/en/abs/dynamic-matching-with-better-than-2-approximation-in-polylogarithmic-update-time-2207.074382023-04-28 https://scifaro.com/en/abs/fixed-parameter-tractability-of-maximum-colored-path-and-beyond-2207.074492022-07-18 https://scifaro.com/en/abs/matching-patterns-with-variables-under-edit-distance-2207.074772022-07-18 https://scifaro.com/en/abs/dynamic-algorithms-for-packing-covering-lps-via-multiplicative-weight-updates-2207.075192022-07-18 https://scifaro.com/en/abs/generalized-wake-up-amortized-shared-memory-lower-bounds-for-linearizable-data-structures-2207.075612022-07-18 https://scifaro.com/en/abs/dynamic-algorithms-for-maximum-matching-size-2207.076072022-11-15 https://scifaro.com/en/abs/improved-algorithms-for-recognizing-perfect-graphs-and-finding-shortest-odd-and-even-holes-2207.076132022-07-18 https://scifaro.com/en/abs/approximating-highly-inapproximable-problems-on-graphs-of-bounded-twin-width-2207.077082022-09-27 https://scifaro.com/en/abs/a-nearly-tight-analysis-of-greedy-k-means-2207.079492022-07-19 https://scifaro.com/en/abs/online-prediction-in-sub-linear-space-2207.079742022-11-09 https://scifaro.com/en/abs/approximation-algorithms-for-steiner-tree-augmentation-problems-2207.079832022-11-15 https://scifaro.com/en/abs/streaming-algorithms-with-large-approximation-factors-2207.080752022-07-19 https://scifaro.com/en/abs/on-the-practical-power-of-automata-in-pattern-matching-2207.081202022-07-19 https://scifaro.com/en/abs/online-lewis-weight-sampling-2207.082682022-12-20 https://scifaro.com/en/abs/shrunk-subspaces-via-operator-sinkhorn-iteration-2207.083112022-07-19 https://scifaro.com/en/abs/concurrent-composition-theorems-for-differential-privacy-2207.083352023-03-31 https://scifaro.com/en/abs/extracting-densest-sub-hypergraph-with-convex-edge-weight-functions-2207.083402022-07-19 https://scifaro.com/en/abs/online-total-completion-time-scheduling-on-parallel-identical-machines-2207.085502022-07-19 https://scifaro.com/en/abs/a-quadratic-order-problem-kernel-for-the-traveling-salesman-problem-parameterized-by-the-vertex-cover-number-2207.086782023-10-12 https://scifaro.com/en/abs/streaming-algorithms-for-support-aware-histograms-2207.086862022-07-19 https://scifaro.com/en/abs/almost-tight-bounds-for-online-facility-location-in-the-random-order-model-2207.087832022-11-11 https://scifaro.com/en/abs/bernoulli-factories-for-flow-based-polytopes-2207.089652022-07-20 https://scifaro.com/en/abs/accelerating-frank-wolfe-algorithm-using-low-dimensional-and-adaptive-data-structures-2207.090022022-07-20 https://scifaro.com/en/abs/packcache-an-online-cost-driven-data-caching-algorithm-in-the-cloud-2207.090352022-08-08 https://scifaro.com/en/abs/complexity-of-high-dimensional-identity-testing-with-coordinate-conditional-sampling-2207.091022024-09-02 https://scifaro.com/en/abs/solving-the-unit-load-pre-marshalling-problem-in-block-stacking-storage-systems-with-multiple-access-directions-2207.091182024-07-01 https://scifaro.com/en/abs/efficient-constructions-for-the-gy-h-o-ri-lov-a-sz-theorem-on-almost-chordal-graphs-2207.092622023-03-31 https://scifaro.com/en/abs/on-regularity-lemma-and-barriers-in-streaming-and-dynamic-matching-2207.093542022-07-20 https://scifaro.com/en/abs/regret-minimization-with-noisy-observations-2207.094352022-07-20 https://scifaro.com/en/abs/pandora-box-problem-with-nonobligatory-inspection-hardness-and-approximation-scheme-2207.095452022-12-06 https://scifaro.com/en/abs/exact-matching-correct-parity-and-fpt-parameterized-by-independence-number-2207.097972023-10-02 https://scifaro.com/en/abs/computing-densest-k-subgraph-with-structural-parameters-2207.098032022-07-21 https://scifaro.com/en/abs/computing-tree-decompositions-with-small-independence-number-2207.099932025-09-11 https://scifaro.com/en/abs/differentially-private-partial-set-cover-with-applications-to-facility-location-2207.102402023-08-22 https://scifaro.com/en/abs/tight-bounds-for-monotone-minimal-perfect-hashing-2207.105562022-07-26 https://scifaro.com/en/abs/optimal-algorithms-for-free-order-multiple-choice-secretary-2207.107032024-05-13 https://scifaro.com/en/abs/correlation-clustering-with-sherali-adams-2207.108892023-05-04 https://scifaro.com/en/abs/ppsz-is-better-than-you-think-2207.110712024-08-07 https://scifaro.com/en/abs/fair-range-k-center-2207.113372022-07-26 https://scifaro.com/en/abs/towards-an-optimal-solution-to-place-bistatic-radars-for-belt-barrier-coverage-with-minimum-cost-2207.118182022-07-26 https://scifaro.com/en/abs/contention-resolution-for-coded-radio-networks-2207.118242022-07-26 https://scifaro.com/en/abs/new-additive-spanner-lower-bounds-by-an-unlayered-obstacle-product-2207.118322022-10-07 https://scifaro.com/en/abs/improved-bounds-for-sampling-solutions-of-random-cnf-formulas-2207.118922023-06-12 https://scifaro.com/en/abs/minimax-rates-for-robust-community-detection-2207.119032022-07-26 https://scifaro.com/en/abs/simpler-o-1-query-algorithm-for-level-ancestors-2207.119542024-07-30 https://scifaro.com/en/abs/a-survey-on-graph-problems-parameterized-above-and-below-guaranteed-values-2207.122782024-03-21 https://scifaro.com/en/abs/nested-active-time-scheduling-2207.125072022-07-27 https://scifaro.com/en/abs/testing-of-index-invariant-properties-in-the-huge-object-model-2207.125142022-11-17 https://scifaro.com/en/abs/learning-augmented-maximum-flow-2207.129112022-07-27 https://scifaro.com/en/abs/scheduling-under-non-uniform-job-and-machine-delays-2207.131212022-11-23 https://scifaro.com/en/abs/cubic-goldreich-levin-2207.132812022-11-21 https://scifaro.com/en/abs/a-simple-and-elegant-mathematical-formulation-for-the-acyclic-dag-partitioning-problem-2207.136382022-07-28 https://scifaro.com/en/abs/engineering-faster-double-array-aho-corasick-automata-2207.138702024-06-25 https://scifaro.com/en/abs/zdd-based-algorithmic-framework-for-solving-shortest-reconfiguration-problems-2207.139592022-12-19 https://scifaro.com/en/abs/implementing-the-diverting-fast-radix-algorithm-2207.143342022-08-02 https://scifaro.com/en/abs/modular-multiplication-without-carry-propagation-algorithm-description-2207.144012022-08-01 https://scifaro.com/en/abs/locally-iterative-delta-1-coloring-in-sublinear-in-delta-rounds-2207.144582023-01-31 https://scifaro.com/en/abs/capacitated-vehicle-routing-problem-using-conventional-and-approximation-method-2208.000462022-08-02 https://scifaro.com/en/abs/polynomial-time-power-sum-decomposition-of-polynomials-2208.001222022-08-02 https://scifaro.com/en/abs/streaming-algorithms-for-diversity-maximization-with-fairness-constraints-2208.001942023-04-27 https://scifaro.com/en/abs/an-improved-a-search-algorithm-for-road-networks-using-new-heuristic-estimation-2208.003122022-08-02 https://scifaro.com/en/abs/the-search-and-rescue-game-on-a-cycle-2208.004822023-04-10 https://scifaro.com/en/abs/a-simple-polynomial-time-approximation-algorithm-for-the-total-variation-distance-between-two-product-distributions-2208.007402024-02-14 https://scifaro.com/en/abs/reduction-rules-and-ilp-are-all-you-need-minimal-directed-feedback-vertex-set-2208.011192022-08-03 https://scifaro.com/en/abs/bias-reduction-for-sum-estimation-2208.011972022-08-03 https://scifaro.com/en/abs/lattice-linear-predicate-algorithms-for-the-constrained-stable-marriage-problem-with-ties-2208.013702022-08-03 https://scifaro.com/en/abs/a-tighter-analysis-of-spectral-clustering-and-beyond-2208.017242022-08-04 https://scifaro.com/en/abs/maximum-minimal-feedback-vertex-set-a-parameterized-perspective-2208.019532022-08-04 https://scifaro.com/en/abs/orderedcuts-a-new-approach-for-computing-gomory-hu-tree-2208.020002026-02-25 https://scifaro.com/en/abs/a-nonparametric-framework-for-online-stochastic-matching-with-correlated-arrivals-2208.022292026-05-15 https://scifaro.com/en/abs/exploring-computational-complexity-of-ride-pooling-problems-2208.025042022-08-05 https://scifaro.com/en/abs/parameterized-complexity-of-upper-edge-domination-2208.025222022-08-05 https://scifaro.com/en/abs/nearly-optimal-communication-and-query-complexity-of-bipartite-matching-2208.025262022-08-05 https://scifaro.com/en/abs/efficiently-computing-directed-minimum-spanning-trees-2208.025902022-08-05 https://scifaro.com/en/abs/makespan-scheduling-of-unit-jobs-with-precedence-constraints-in-o-1-995-n-time-2208.026642022-08-05 https://scifaro.com/en/abs/almost-consistent-systems-of-linear-equations-2208.027322022-08-05 https://scifaro.com/en/abs/an-online-joint-replenishment-problem-combined-with-single-machine-scheduling-2208.027482024-05-03 https://scifaro.com/en/abs/domination-and-cut-problems-on-chordal-graphs-with-bounded-leafage-2208.028502022-08-08 https://scifaro.com/en/abs/improved-bounds-for-rectangular-monotone-min-plus-product-and-applications-2208.028622026-02-17 https://scifaro.com/en/abs/towards-fast-theta-join-a-prefiltering-and-amalgamated-partitioning-approach-2208.029812022-08-08 https://scifaro.com/en/abs/offensive-alliances-in-graphs-2208.029922022-08-08 https://scifaro.com/en/abs/a-ptas-for-minimizing-weighted-flow-time-on-a-single-machine-2208.031272022-08-08 https://scifaro.com/en/abs/a-tight-analysis-of-hutchinson-s-diagonal-estimator-2208.032682022-11-08 https://scifaro.com/en/abs/approximation-algorithms-for-covering-vertices-by-long-paths-2208.032942022-08-08 https://scifaro.com/en/abs/sublinear-time-algorithm-for-online-weighted-bipartite-matching-2208.033672024-02-13 https://scifaro.com/en/abs/fast-detection-of-specific-fragments-against-a-set-of-sequences-2208.034512023-04-07 https://scifaro.com/en/abs/parameterized-algorithms-for-locally-minimal-defensive-alliance-2208.034912023-03-05 https://scifaro.com/en/abs/adaptivity-gaps-for-the-stochastic-boolean-function-evaluation-problem-2208.038102022-08-09 https://scifaro.com/en/abs/exact-learning-of-multitrees-and-almost-trees-using-path-queries-2208.042162022-08-09 https://scifaro.com/en/abs/almost-optimal-searching-of-maximal-subrepetitions-in-a-word-2208.043802022-08-10 https://scifaro.com/en/abs/multi-purpose-routing-new-perspectives-and-approximation-algorithms-2208.044102022-08-10 https://scifaro.com/en/abs/local-differentially-private-fuzzy-counting-in-stream-data-using-probabilistic-data-structure-2208.052642022-12-01 https://scifaro.com/en/abs/knapsack-secretary-through-boosting-2208.053962022-08-11 https://scifaro.com/en/abs/learning-computation-bounds-for-branch-and-bound-algorithms-to-k-plex-extraction-2208.057632022-08-12 https://scifaro.com/en/abs/subexponential-parameterized-directed-steiner-network-problems-on-planar-graphs-a-complete-classification-2208.060152022-08-15 https://scifaro.com/en/abs/optimal-lp-rounding-and-linear-time-approximation-algorithms-for-clustering-edge-colored-hypergraphs-2208.065062023-05-16 https://scifaro.com/en/abs/an-improved-greedy-algorithm-for-stochastic-online-scheduling-on-unrelated-machines-2208.068152022-12-20 https://scifaro.com/en/abs/exact-exponential-algorithms-for-clustering-problems-2208.068472022-08-16 https://scifaro.com/en/abs/towards-parallel-learned-sorting-2208.069022022-08-26 https://scifaro.com/en/abs/on-the-complexity-of-distance-d-independent-set-reconfiguration-2208.071992024-06-19 https://scifaro.com/en/abs/fair-assortment-planning-2208.073412025-02-24 https://scifaro.com/en/abs/private-query-release-via-the-johnson-lindenstrauss-transform-2208.074102022-08-17 https://scifaro.com/en/abs/fine-grained-complexity-lower-bounds-for-families-of-dynamic-graphs-2208.075722023-01-30 https://scifaro.com/en/abs/deletion-robust-non-monotone-submodular-maximization-over-matroids-2208.075822025-05-26 https://scifaro.com/en/abs/simple-deterministic-o-n-log-n-algorithm-finding-a-solution-of-erd-h-o-s-ginzburg-ziv-theorem-2208.077282022-08-18 https://scifaro.com/en/abs/polynomial-kernel-for-immersion-hitting-in-tournaments-2208.077892022-08-17 https://scifaro.com/en/abs/new-concurrent-order-maintenance-data-structure-2208.078002024-10-15 https://scifaro.com/en/abs/fast-distributed-vertex-splitting-with-applications-2208.081192022-08-18 https://scifaro.com/en/abs/minimum-cost-adaptive-submodular-cover-2208.083512024-05-24 https://scifaro.com/en/abs/simplicity-in-eulerian-circuits-uniqueness-and-safety-2208.085222023-05-26 https://scifaro.com/en/abs/customizable-hub-labeling-properties-and-algorithms-2208.087092022-08-19 https://scifaro.com/en/abs/algorithm-to-derive-shortest-edit-script-using-levenshtein-distance-algorithm-2208.088232022-08-19 https://scifaro.com/en/abs/approximate-circular-pattern-matching-2208.089152025-06-13 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-symmetric-directed-multicut-2208.090172022-08-22 https://scifaro.com/en/abs/secretary-problems-the-power-of-a-single-sample-2208.091592022-08-22 https://scifaro.com/en/abs/revisiting-maximum-satisfiability-and-related-problems-in-data-streams-2208.091602022-08-22 https://scifaro.com/en/abs/computing-a-feedback-arc-set-using-pagerank-2208.092342022-09-07 https://scifaro.com/en/abs/quancurrent-a-concurrent-quantiles-sketch-2208.092652022-08-22 https://scifaro.com/en/abs/a-ptolemaic-partitioning-mechanism-2208.093242022-11-11 https://scifaro.com/en/abs/merging-sorted-lists-of-similar-strings-2208.093512022-08-22 https://scifaro.com/en/abs/a-simple-differentially-private-algorithm-for-global-minimum-cut-2208.093652022-08-24 https://scifaro.com/en/abs/an-2-sqrt-k-approximation-algorithm-for-minimum-power-k-edge-disjoint-st-paths-2208.093732024-03-13 https://scifaro.com/en/abs/near-optimal-fitting-of-ellipsoids-to-random-points-2208.094932023-06-02 https://scifaro.com/en/abs/on-computing-discretized-ricci-curvatures-of-graphs-local-algorithms-and-localized-fine-grained-reductions-2208.095352023-08-14 https://scifaro.com/en/abs/an-o-k-log-n-time-fourier-set-query-algorithm-2208.096342022-08-23 https://scifaro.com/en/abs/solving-systems-of-linear-equations-through-zero-forcing-set-and-application-to-lights-out-2208.097312022-08-23 https://scifaro.com/en/abs/parallel-longest-increasing-subsequence-and-van-emde-boas-trees-2208.098092023-04-19 https://scifaro.com/en/abs/teaching-the-burrows-wheeler-transform-via-the-positional-burrows-wheeler-transform-2208.098402022-08-23 https://scifaro.com/en/abs/counting-cycles-on-planar-graphs-in-subexponential-time-2208.099482022-08-23 https://scifaro.com/en/abs/locally-defined-independence-systems-on-graphs-2208.100032022-08-23 https://scifaro.com/en/abs/o-ptimal-dual-vertex-failure-connectivity-labels-2208.101682022-08-23 https://scifaro.com/en/abs/approximate-sorting-and-its-application-in-i-o-model-2208.102982023-03-29 https://scifaro.com/en/abs/graph-connectivity-with-noisy-queries-2208.104232022-09-13 https://scifaro.com/en/abs/simpler-and-better-cardinality-estimators-for-hyperloglog-and-pcsa-2208.105782022-08-24 https://scifaro.com/en/abs/derandomizing-directed-random-walks-in-almost-linear-time-2208.109592022-08-24 https://scifaro.com/en/abs/resolving-matrix-spencer-conjecture-up-to-poly-logarithmic-rank-2208.112862022-08-30 https://scifaro.com/en/abs/improved-scheduling-of-morphing-edge-drawing-2208.113052022-09-01 https://scifaro.com/en/abs/fast-primal-dual-update-against-local-weight-update-in-linear-assignment-problem-and-its-application-2208.113252023-08-01 https://scifaro.com/en/abs/hierarchical-relative-lempel-ziv-compression-2208.113712022-08-25 https://scifaro.com/en/abs/online-algorithms-for-matchings-with-proportional-fairness-constraints-and-diversity-constraints-2208.113782023-08-04 https://scifaro.com/en/abs/st-orientations-with-few-transitive-edges-2208.114142022-08-25 https://scifaro.com/en/abs/towards-a-lower-bound-for-the-average-case-runtime-of-simulated-annealing-on-tsp-2208.114442022-08-25 https://scifaro.com/en/abs/deterministic-fault-tolerant-connectivity-labeling-scheme-2208.114592023-11-17 https://scifaro.com/en/abs/a-generalization-of-the-shortest-path-problem-to-graphs-with-multiple-edge-cost-estimates-2208.114892024-02-20 https://scifaro.com/en/abs/a-simpler-proof-that-pairing-heaps-take-o-1-amortized-time-per-insertion-2208.117912022-08-26 https://scifaro.com/en/abs/learning-to-prune-instances-of-steiner-tree-problem-in-graphs-2208.119852025-04-24 https://scifaro.com/en/abs/computing-clique-cover-with-structural-parameterization-2208.124382022-08-29 https://scifaro.com/en/abs/testing-upward-planarity-of-partial-2-trees-2208.125482022-08-29 https://scifaro.com/en/abs/rectilinear-planarity-of-partial-2-trees-2208.125582023-06-23 https://scifaro.com/en/abs/a-polynomial-decision-for-3-sat-2208.125982024-06-11 https://scifaro.com/en/abs/four-algorithms-for-correlation-clustering-a-survey-2208.126362022-08-29 https://scifaro.com/en/abs/scalable-multilevel-and-memetic-signed-graph-clustering-2208.136182024-07-10 https://scifaro.com/en/abs/finding-near-optimal-weight-independent-sets-at-scale-2208.136452023-04-24 https://scifaro.com/en/abs/minimizing-completion-times-for-stochastic-jobs-via-batched-free-times-2208.136962022-08-30 https://scifaro.com/en/abs/graph-exploration-with-embedding-guided-layouts-2208.136992023-01-20 https://scifaro.com/en/abs/configuration-balancing-for-stochastic-requests-2208.137022022-08-30 https://scifaro.com/en/abs/randomized-approximation-schemes-for-the-tutte-polynomial-and-random-clustering-in-subdense-and-superdense-graphs-2208.138092022-08-31 https://scifaro.com/en/abs/minimum-coverage-instrumentation-2208.139072022-08-31 https://scifaro.com/en/abs/fitting-metrics-and-ultrametrics-with-minimum-disagreements-2208.139202022-08-31 https://scifaro.com/en/abs/shape-faithful-graph-drawings-2208.140952022-08-31 https://scifaro.com/en/abs/small-point-sets-supporting-graph-stories-2208.141262022-08-31 https://scifaro.com/en/abs/on-the-fixed-parameter-tractability-of-capacitated-clustering-2208.141292022-08-31 https://scifaro.com/en/abs/on-sparse-hitting-sets-from-fair-vertex-cover-to-highway-dimension-2208.141322022-09-29 https://scifaro.com/en/abs/approximation-algorithms-for-drone-delivery-packing-problem-2208.143042022-08-31 https://scifaro.com/en/abs/sorting-genomes-by-prefix-double-cut-and-joins-2208.143152022-08-31 https://scifaro.com/en/abs/improved-deterministic-algorithms-for-non-monotone-submodular-maximization-2208.143882023-04-03 https://scifaro.com/en/abs/unbalancing-binary-trees-2208.144812022-09-01 https://scifaro.com/en/abs/pattern-matching-under-dtw-distance-2208.146692022-09-01 https://scifaro.com/en/abs/computing-all-vs-all-mems-in-run-length-encoded-collections-of-hifi-reads-2208.147872022-09-01 https://scifaro.com/en/abs/on-weighted-graph-separation-problems-and-flow-augmentation-2208.148412024-01-11 https://scifaro.com/en/abs/a-heuristic-algorithm-using-tree-decompositions-for-the-maximum-happy-vertices-problem-2208.149212023-10-26 https://scifaro.com/en/abs/minimum-flow-decomposition-in-graphs-with-cycles-using-integer-linear-programming-2209.000422023-01-18 https://scifaro.com/en/abs/complexity-of-diameter-on-at-free-graphs-is-linear-2209.001102023-03-24 https://scifaro.com/en/abs/space-efficient-data-structure-for-next-previous-larger-smaller-value-queries-2209.001582025-06-05 https://scifaro.com/en/abs/maximal-closed-substrings-2209.002712024-05-15 https://scifaro.com/en/abs/diameter-minimization-by-shortcutting-with-degree-constraints-2209.003702023-02-14 https://scifaro.com/en/abs/the-rique-number-of-graphs-2209.004242022-09-02 https://scifaro.com/en/abs/online-load-balancing-on-uniform-machines-with-limited-migration-2209.005652022-09-05 https://scifaro.com/en/abs/generalized-k-center-distinguishing-doubling-and-highway-dimension-2209.006752025-12-24 https://scifaro.com/en/abs/online-demand-scheduling-with-failovers-2209.007102022-09-05 https://scifaro.com/en/abs/optimal-general-factor-problem-and-jump-system-intersection-2209.007792022-10-13 https://scifaro.com/en/abs/johnson-lindenstrauss-embeddings-for-noisy-vectors-taking-advantage-of-the-noise-2209.010062022-09-05 https://scifaro.com/en/abs/elastic-degenerate-string-matching-with-1-error-2209.010952022-09-05 https://scifaro.com/en/abs/algorithms-for-discrepancy-matchings-and-approximations-fast-simple-and-practical-2209.011472022-09-05 https://scifaro.com/en/abs/computing-generalized-convolutions-faster-than-brute-force-2209.016232023-01-31 https://scifaro.com/en/abs/the-power-of-uniform-sampling-for-coresets-2209.019012022-09-20 https://scifaro.com/en/abs/deciding-a-graph-property-by-a-single-mobile-agent-one-bit-memory-suffices-2209.019062022-09-07 https://scifaro.com/en/abs/resolving-infeasibility-of-linear-systems-a-parameterized-approach-2209.020172022-09-07 https://scifaro.com/en/abs/o-ptimal-vertex-fault-tolerant-spanners-in-o-ptimal-time-sequential-distributed-and-parallel-2209.029902022-09-08 https://scifaro.com/en/abs/a-local-search-algorithm-for-the-min-sum-submodular-cover-problem-2209.030542023-12-05 https://scifaro.com/en/abs/computing-the-hit-rate-of-similarity-caching-2209.031742022-09-08 https://scifaro.com/en/abs/epic-fail-emulators-can-tolerate-polynomially-many-edge-faults-for-free-2209.036752022-11-16 https://scifaro.com/en/abs/packing-k-r-s-in-bounded-degree-graphs-2209.036842024-04-09 https://scifaro.com/en/abs/opponent-indifference-in-rating-systems-a-theoretical-case-for-sonas-2209.039502024-07-17 https://scifaro.com/en/abs/an-eptas-for-budgeted-matroid-independent-set-2209.046542022-09-13 https://scifaro.com/en/abs/growing-a-random-maximal-independent-set-produces-a-2-approximate-vertex-cover-2209.046732022-09-13 https://scifaro.com/en/abs/an-improved-algorithm-for-online-min-sum-set-cover-2209.048702023-03-28 https://scifaro.com/en/abs/subquadratic-kronecker-regression-with-applications-to-tensor-decomposition-2209.048762023-05-15 https://scifaro.com/en/abs/dynamic-subset-sum-with-truly-sublinear-processing-time-2209.049362022-09-13 https://scifaro.com/en/abs/qubo-formulations-for-np-hard-spanning-tree-problems-2209.050242022-09-13 https://scifaro.com/en/abs/unsplittable-euclidean-capacitated-vehicle-routing-a-2-epsilon-approximation-algorithm-2209.055202022-09-14 https://scifaro.com/en/abs/space-optimal-vertex-cover-in-dynamic-streams-2209.056232022-09-14 https://scifaro.com/en/abs/recovery-from-non-decomposable-distance-oracles-2209.056762023-08-15 https://scifaro.com/en/abs/a-hash-table-without-hash-functions-and-how-to-get-the-most-out-of-your-random-bits-2209.060382022-09-19 https://scifaro.com/en/abs/algorithmic-semi-conjugacy-via-koopman-operator-theory-2209.063742022-09-15 https://scifaro.com/en/abs/parameterized-algorithms-for-node-connectivity-augmentation-problems-2209.066952022-09-15 https://scifaro.com/en/abs/multiway-powersort-2209.069092023-01-18 https://scifaro.com/en/abs/algorithms-and-lower-bounds-for-replacement-paths-under-multiple-edge-failures-2209.070162022-09-16 https://scifaro.com/en/abs/almost-ramanujan-expanders-from-arbitrary-expanders-via-operator-amplification-2209.070242024-10-23 https://scifaro.com/en/abs/on-random-order-online-contention-resolution-schemes-for-the-matching-polytope-of-bipartite-graphs-2209.075202024-04-03 https://scifaro.com/en/abs/tilde-o-n-mathrm-poly-k-time-algorithm-for-bounded-tree-edit-distance-2209.075242022-09-16 https://scifaro.com/en/abs/on-weighted-graph-sparsification-by-linear-sketching-2209.077292022-09-19 https://scifaro.com/en/abs/a-1-5-epsilon-approximation-algorithm-for-weighted-connectivity-augmentation-2209.078602022-09-19 https://scifaro.com/en/abs/fast-approximation-of-search-trees-on-trees-with-centroid-trees-2209.080242022-09-19 https://scifaro.com/en/abs/asymptotically-optimal-bounds-for-estimating-h-index-in-sublinear-time-with-applications-to-subgraph-counting-2209.081142022-09-20 https://scifaro.com/en/abs/the-trace-reconstruction-problem-for-spider-graphs-2209.081662026-05-06 https://scifaro.com/en/abs/a-nearly-tight-lower-bound-for-the-d-dimensional-cow-path-problem-2209.084272022-09-20 https://scifaro.com/en/abs/online-and-semi-online-scheduling-on-two-hierarchical-machines-with-a-common-due-date-to-maximize-the-total-early-work-2209.087042022-09-20 https://scifaro.com/en/abs/faster-randomized-interior-point-methods-for-tall-wide-linear-programs-2209.087222022-09-26 https://scifaro.com/en/abs/parameterized-complexity-of-path-set-packing-2209.087572024-06-03 https://scifaro.com/en/abs/a-simple-framework-for-finding-balanced-sparse-cuts-via-apsp-2209.088452022-09-20 https://scifaro.com/en/abs/gap-eth-tight-approximation-schemes-for-red-green-blue-separation-and-bicolored-noncrossing-euclidean-travelling-salesman-tours-2209.089042022-09-20 https://scifaro.com/en/abs/rounds-vs-communication-tradeoffs-for-maximal-independent-sets-2209.090492022-09-20 https://scifaro.com/en/abs/cache-oblivious-representation-of-b-tree-structures-2209.091662024-10-02 https://scifaro.com/en/abs/maria-multiple-alignment-r-index-with-aggregation-2209.092182022-09-20 https://scifaro.com/en/abs/natural-wave-numbers-natural-wave-co-numbers-and-the-computation-of-the-primes-2209.093132022-09-27 https://scifaro.com/en/abs/exact-matching-and-the-top-k-perfect-matching-problem-2209.096612022-09-21 https://scifaro.com/en/abs/maximizing-a-submodular-function-with-bounded-curvature-under-an-unknown-knapsack-constraint-2209.096682024-10-25 https://scifaro.com/en/abs/modeling-the-small-world-phenomenon-with-road-networks-2209.098882022-12-16 https://scifaro.com/en/abs/improved-approximation-for-two-edge-connectivity-2209.102652022-11-15 https://scifaro.com/en/abs/quasipolynomial-time-algorithms-for-gibbs-point-processes-2209.104532023-05-24 https://scifaro.com/en/abs/chaining-group-leverage-score-overestimates-and-fast-spectral-hypergraph-sparsification-2209.105392022-09-22 https://scifaro.com/en/abs/learning-augmented-algorithms-for-online-linear-and-semidefinite-programming-2209.106142022-10-24 https://scifaro.com/en/abs/a-cubic-algorithm-for-computing-the-hermite-normal-form-of-a-nonsingular-integer-matrix-2209.106852023-08-29 https://scifaro.com/en/abs/popular-edges-with-critical-nodes-2209.108052022-09-23 https://scifaro.com/en/abs/canadian-traveller-problem-with-predictions-2209.111002022-09-23 https://scifaro.com/en/abs/improved-approximation-algorithms-by-generalizing-the-primal-dual-method-beyond-uncrossable-functions-2209.112092024-01-10 https://scifaro.com/en/abs/local-distributed-rounding-generalized-to-mis-matching-set-cover-and-beyond-2209.116512022-09-26 https://scifaro.com/en/abs/improved-distributed-network-decomposition-hitting-sets-and-spanners-via-derandomization-2209.116692022-09-26 https://scifaro.com/en/abs/the-online-knapsack-problem-with-departures-2209.119342023-03-16 https://scifaro.com/en/abs/online-admission-control-and-rebalancing-in-payment-channel-networks-2209.119362022-09-27 https://scifaro.com/en/abs/improving-the-bounds-of-the-online-dynamic-power-management-problem-2209.120212022-09-27 https://scifaro.com/en/abs/twin-width-v-linear-minors-modular-counting-and-matrix-multiplication-2209.120232022-09-27 https://scifaro.com/en/abs/augmentation-based-approximation-algorithms-for-flexible-network-design-2209.122732022-09-27 https://scifaro.com/en/abs/constant-delay-enumeration-for-slp-compressed-documents-2209.123012025-02-26 https://scifaro.com/en/abs/random-graph-matching-at-otter-s-threshold-via-counting-chandeliers-2209.123132023-02-15 https://scifaro.com/en/abs/package-delivery-using-drones-with-restricted-movement-areas-2209.123142022-09-27 https://scifaro.com/en/abs/tree-decompositions-with-bounded-independence-number-beyond-independent-sets-2209.123152022-09-27 https://scifaro.com/en/abs/inferring-strings-from-position-heaps-in-linear-time-2209.124052022-12-13 https://scifaro.com/en/abs/obstructions-to-faster-diameter-computation-asteroidal-sets-2209.124382023-02-28 https://scifaro.com/en/abs/on-the-parameterized-intractability-of-determinant-maximization-2209.125192024-02-20 https://scifaro.com/en/abs/tglib-an-open-source-library-for-temporal-graph-analysis-2209.125872025-08-04 https://scifaro.com/en/abs/partial-and-simultaneous-transitive-orientations-via-modular-decomposition-2209.131752022-09-28 https://scifaro.com/en/abs/a-quantum-optimization-algorithm-for-single-machine-total-weighted-tardiness-minimization-2209.137122022-09-29 https://scifaro.com/en/abs/near-optimal-adaptive-policies-for-serving-stochastically-departing-customers-2209.138782022-09-29 https://scifaro.com/en/abs/worst-case-deterministic-fully-dynamic-planar-2-vertex-connectivity-2209.140792022-09-29 https://scifaro.com/en/abs/adaptive-out-orientations-with-applications-2209.140872023-02-16 https://scifaro.com/en/abs/dynamic-embeddings-of-dynamic-single-source-upward-planar-graphs-2209.140942022-09-29 https://scifaro.com/en/abs/time-and-energy-efficient-contention-resolution-in-asynchronous-shared-channels-2209.141402022-09-29 https://scifaro.com/en/abs/on-computing-exact-means-of-time-series-using-the-move-split-merge-metric-2209.141972022-09-29 https://scifaro.com/en/abs/shortest-beer-path-queries-in-interval-graphs-2209.144012022-09-30 https://scifaro.com/en/abs/efficient-parameterized-algorithms-on-graphs-with-heterogeneous-structure-combining-tree-depth-and-modular-width-2209.144292022-09-30 https://scifaro.com/en/abs/matroid-intersection-under-restricted-oracles-2209.145162023-02-07 https://scifaro.com/en/abs/tensor-based-sketching-method-for-the-low-rank-approximation-of-data-streams-2209.146372022-09-30 https://scifaro.com/en/abs/a-dichotomy-for-succinct-representations-of-homomorphisms-2209.146622023-05-29 https://scifaro.com/en/abs/on-constructing-spanners-from-random-gaussian-projections-2209.147752022-09-30 https://scifaro.com/en/abs/optimal-query-complexities-for-dynamic-trace-estimation-2209.152192022-10-03 https://scifaro.com/en/abs/assortment-optimization-under-the-multivariate-mnl-model-2209.152202022-10-12 https://scifaro.com/en/abs/deterministic-performance-guarantees-for-bidirectional-bfs-on-real-world-networks-2209.153002023-04-04 https://scifaro.com/en/abs/an-experimental-study-of-algorithms-for-obtaining-a-singly-connected-subgraph-2210.002432022-11-29 https://scifaro.com/en/abs/online-pen-testing-2210.006552022-11-23 https://scifaro.com/en/abs/local-computation-of-maximal-independent-set-2210.011042022-10-04 https://scifaro.com/en/abs/designing-a-parallel-suffix-sort-2210.014752022-10-05 https://scifaro.com/en/abs/scheduling-with-many-shared-resources-2210.015232022-10-05 https://scifaro.com/en/abs/sichash-small-irregular-cuckoo-tables-for-perfect-hashing-2210.015602022-11-09 https://scifaro.com/en/abs/bicriteria-approximation-algorithms-for-priority-matroid-median-2210.018882023-07-10 https://scifaro.com/en/abs/the-dag-visit-approach-for-pebbling-and-i-o-lower-bounds-2210.018972022-10-06 https://scifaro.com/en/abs/ruler-rolling-2210.019542024-04-08 https://scifaro.com/en/abs/finding-top-k-longest-palindromes-in-substrings-2210.020002023-06-21 https://scifaro.com/en/abs/computing-maximal-palindromes-in-non-standard-matching-models-2210.020672025-02-18 https://scifaro.com/en/abs/tight-lower-bounds-for-problems-parameterized-by-rank-width-2210.021172022-12-09 https://scifaro.com/en/abs/faster-parameterized-algorithms-for-modification-problems-to-minor-closed-classes-2210.021672024-08-14 https://scifaro.com/en/abs/double-ended-palindromic-trees-in-linear-time-2210.022922025-11-25 https://scifaro.com/en/abs/the-power-of-duality-response-time-analysis-meets-integer-programming-2210.023612023-11-02 https://scifaro.com/en/abs/romeo-and-juliet-meeting-in-forest-like-regions-2210.025822022-10-07 https://scifaro.com/en/abs/1-epsilon-approximate-fully-dynamic-densest-subgraph-linear-space-and-faster-update-time-2210.026112022-10-07 https://scifaro.com/en/abs/orthogonal-nonnegative-matrix-factorization-with-sparsity-constraints-2210.026722025-04-07 https://scifaro.com/en/abs/sequentially-swapping-tokens-further-on-graph-classes-2210.028352025-07-30 https://scifaro.com/en/abs/the-power-of-greedy-for-online-minimum-cost-matching-on-the-line-2210.031662025-03-28 https://scifaro.com/en/abs/an-approximation-algorithm-for-distance-constrained-vehicle-routing-on-trees-2210.038112022-10-11 https://scifaro.com/en/abs/how-to-make-your-approximation-algorithm-private-a-black-box-differentially-private-transformation-for-tunable-approximation-algorithms-of-functions-with-low-sensitivity-2210.038312023-09-12 https://scifaro.com/en/abs/a-finite-algorithm-for-the-realizabilty-of-a-delaunay-triangulation-2210.039322022-10-11 https://scifaro.com/en/abs/dynamic-tensor-product-regression-2210.039612023-01-11 https://scifaro.com/en/abs/selection-and-ordering-policies-for-hiring-pipelines-via-linear-programming-2210.040592023-10-30 https://scifaro.com/en/abs/iceberght-high-performance-pmem-hash-tables-through-stability-and-low-associativity-2210.040682022-10-13 https://scifaro.com/en/abs/a-hierarchical-grouping-algorithm-for-the-multi-vehicle-dial-a-ride-problem-2210.050002023-04-25 https://scifaro.com/en/abs/identifying-difficult-exercises-in-an-etextbook-using-item-response-theory-and-logged-data-analysis-2210.052942022-11-28 https://scifaro.com/en/abs/enhancing-branch-and-bound-for-multi-objective-0-1-programming-2210.053852023-09-26 https://scifaro.com/en/abs/hierarchical-categories-in-colored-searching-2210.054032022-10-12 https://scifaro.com/en/abs/parallel-solutions-for-preemptive-makespan-scheduling-on-two-identical-machines-2210.055432022-10-12 https://scifaro.com/en/abs/resolving-the-approximability-of-offline-and-online-non-monotone-dr-submodular-maximization-over-general-convex-sets-2210.059652022-10-13 https://scifaro.com/en/abs/a-nearly-optimal-randomized-algorithm-for-explorable-heap-selection-2210.059822024-09-12 https://scifaro.com/en/abs/fast-convergence-to-unanimity-in-dense-erd-h-o-s-r-enyi-graphs-2210.059922022-10-14 https://scifaro.com/en/abs/exact-and-approximation-algorithms-for-sensor-placement-against-ddos-attacks-2210.065592022-10-14 https://scifaro.com/en/abs/on-the-minimum-cycle-cover-problem-on-graphs-with-bounded-co-degeneracy-2210.067032022-10-14 https://scifaro.com/en/abs/perfect-matching-cuts-partitioning-a-graph-into-complementary-subgraphs-2210.067142022-10-14 https://scifaro.com/en/abs/online-matching-with-delays-and-stochastic-arrival-times-2210.070182025-01-07 https://scifaro.com/en/abs/threshold-treewidth-and-hypertree-width-2210.070402022-10-14 https://scifaro.com/en/abs/efficient-algorithms-for-obnoxious-facility-location-on-a-line-segment-or-circle-2210.071462022-10-14 https://scifaro.com/en/abs/condition-number-independent-convergence-rate-of-riemannian-hamiltonian-monte-carlo-with-numerical-integrators-2210.072192023-02-15 https://scifaro.com/en/abs/the-power-of-multi-step-vizing-chains-2210.073632023-03-30 https://scifaro.com/en/abs/time-space-tradeoffs-for-element-distinctness-and-set-intersection-via-pseudorandomness-2210.075342022-10-17 https://scifaro.com/en/abs/a-constructive-prophet-inequality-approach-to-the-adaptive-probemax-problem-2210.075562022-10-17 https://scifaro.com/en/abs/parallel-solutions-for-ordinal-scheduling-with-a-small-number-of-machines-2210.076392022-10-17 https://scifaro.com/en/abs/s-club-cluster-vertex-deletion-on-interval-and-well-partitioned-chordal-graphs-2210.076992022-10-17 https://scifaro.com/en/abs/1-1-cluster-editing-is-polynomial-time-solvable-2210.077222023-07-06 https://scifaro.com/en/abs/faster-space-efficient-str-ic-lcs-computation-2210.079792024-05-21 https://scifaro.com/en/abs/a-nearly-optimal-size-coreset-algorithm-with-nearly-linear-time-2210.083612022-10-18 https://scifaro.com/en/abs/capacitated-vehicle-routing-in-graphic-metrics-2210.098062022-10-19 https://scifaro.com/en/abs/performance-evaluation-of-approximation-algorithms-for-the-minimum-size-2-vertex-strongly-connected-subgraph-problem-2210.098442022-10-19 https://scifaro.com/en/abs/first-order-logic-on-pathwidth-revisited-again-2210.098992026-05-04 https://scifaro.com/en/abs/computing-mems-and-relatives-on-repetitive-text-collections-2210.099142023-09-06 https://scifaro.com/en/abs/faster-matrix-multiplication-via-asymmetric-hashing-2210.101732023-11-29 https://scifaro.com/en/abs/on-the-perturbation-function-of-ranking-and-balance-for-weighted-online-bipartite-matching-2210.103702023-07-06 https://scifaro.com/en/abs/near-optimal-coresets-for-robust-clustering-2210.103942022-10-20 https://scifaro.com/en/abs/identities-and-periodic-oscillations-of-divide-and-conquer-recurrences-splitting-at-half-2210.109682022-10-21 https://scifaro.com/en/abs/sketching-meets-differential-privacy-fast-algorithm-for-dynamic-kronecker-projection-maintenance-2210.115422024-09-09 https://scifaro.com/en/abs/online-resource-allocation-with-cancellations-2210.115702025-09-04 https://scifaro.com/en/abs/a-polynomial-time-algorithm-to-solve-the-airplane-refueling-problem-the-sequential-search-algorithm-2210.116342024-11-26 https://scifaro.com/en/abs/two-stage-stochastic-matching-and-pricing-with-applications-to-ride-hailing-2210.116482022-10-24 https://scifaro.com/en/abs/rerouting-planar-curves-and-disjoint-paths-2210.117782022-10-24 https://scifaro.com/en/abs/a-simple-deterministic-distributed-low-diameter-clustering-2210.117842022-10-24 https://scifaro.com/en/abs/solving-the-probabilistic-profitable-tour-problem-on-a-tree-2210.118812025-03-03 https://scifaro.com/en/abs/splay-top-trees-2210.119182023-02-07 https://scifaro.com/en/abs/efficient-submodular-optimization-under-noise-local-search-is-robust-2210.119922022-10-24 https://scifaro.com/en/abs/discrepancy-minimization-in-input-sparsity-time-2210.124682025-05-27 https://scifaro.com/en/abs/quartic-samples-suffice-for-fourier-interpolation-2210.124952023-02-09 https://scifaro.com/en/abs/edge-weighted-online-stochastic-matching-beating-1-frac1e-2210.125432025-10-15 https://scifaro.com/en/abs/sublinear-time-algorithms-for-max-cut-max-e2lin-q-and-unique-label-cover-on-expanders-2210.126012022-10-25 https://scifaro.com/en/abs/a-stack-free-traversal-algorithm-for-left-balanced-k-d-trees-2210.128592022-11-04 https://scifaro.com/en/abs/certifying-induced-subgraphs-in-large-graphs-2210.130572022-10-25 https://scifaro.com/en/abs/locality-preserving-minimal-perfect-hashing-of-k-mers-2210.130972023-04-13 https://scifaro.com/en/abs/towards-an-understanding-of-long-tailed-runtimes-of-sls-algorithms-2210.131592022-10-25 https://scifaro.com/en/abs/improved-bi-point-rounding-algorithms-and-a-golden-barrier-for-k-median-2210.133952022-10-25 https://scifaro.com/en/abs/worst-case-adaptive-submodular-cover-2210.136942023-02-14 https://scifaro.com/en/abs/deterministic-small-vertex-connectivity-in-almost-linear-time-2210.137392022-10-26 https://scifaro.com/en/abs/online-and-bandit-algorithms-beyond-ell-p-norms-2210.137552022-10-26 https://scifaro.com/en/abs/tight-analysis-of-the-lazy-algorithm-for-open-online-dial-a-ride-2210.138502023-05-23 https://scifaro.com/en/abs/an-improved-algorithm-for-open-online-dial-a-ride-2210.138542022-10-26 https://scifaro.com/en/abs/efficient-and-stable-fully-dynamic-facility-location-2210.138802022-10-26 https://scifaro.com/en/abs/fixed-parameter-tractability-of-graph-isomorphism-in-graphs-with-an-excluded-minor-2210.146382022-10-27 https://scifaro.com/en/abs/online-tsp-with-known-locations-2210.147222022-11-02 https://scifaro.com/en/abs/an-efficient-dynamic-multi-sources-to-single-destination-dms-sd-algorithm-in-smart-city-navigation-using-adjacent-matrix-2210.148692022-12-12 https://scifaro.com/en/abs/counting-perfect-matchings-in-dense-graphs-is-hard-2210.150142022-10-28 https://scifaro.com/en/abs/faster-linear-algebra-for-distance-matrices-2210.151142022-10-28 https://scifaro.com/en/abs/anonymized-histograms-in-intermediate-privacy-models-2210.151782022-10-28 https://scifaro.com/en/abs/anydijkstra-an-algorithm-to-compute-shortest-paths-on-images-with-anytime-properties-2210.154212022-10-28 https://scifaro.com/en/abs/in-stream-probabilistic-cardinality-estimation-for-bloom-filters-2210.156302022-11-02 https://scifaro.com/en/abs/dessert-an-efficient-algorithm-for-vector-set-search-with-vector-set-queries-2210.157482023-10-27 https://scifaro.com/en/abs/parallel-breadth-first-search-and-exact-shortest-paths-and-stronger-notions-for-approximate-distances-2210.163512022-11-01 https://scifaro.com/en/abs/improved-approximation-algorithms-for-capacitated-vehicle-routing-with-fixed-capacity-2210.165342025-07-08 https://scifaro.com/en/abs/a-practical-distributed-admm-solver-for-billion-scale-generalized-assignment-problems-2210.169862022-11-01 https://scifaro.com/en/abs/dominator-coloring-and-cd-coloring-in-almost-cluster-graphs-2210.173212023-08-01 https://scifaro.com/en/abs/beating-1-1-e-approximation-for-weighted-stochastic-matching-2210.175152022-11-01 https://scifaro.com/en/abs/gpu-friendly-parallel-and-almost-in-place-construction-of-left-balanced-k-d-trees-2211.001202023-04-06 https://scifaro.com/en/abs/composable-coresets-for-constrained-determinant-maximization-and-beyond-2211.002892025-10-08 https://scifaro.com/en/abs/computational-power-of-a-single-oblivious-mobile-agent-in-two-edge-connected-graphs-2211.003322022-11-15 https://scifaro.com/en/abs/a-near-linear-kernel-for-two-parsimony-distance-2211.003782022-11-02 https://scifaro.com/en/abs/alternative-polynomial-time-algorithm-for-bipartite-matching-2211.007112023-09-12 https://scifaro.com/en/abs/balancing-utility-and-fairness-in-submodular-maximization-technical-report-2211.009802023-09-04 https://scifaro.com/en/abs/set-selection-under-explorable-stochastic-uncertainty-via-covering-techniques-2211.010972023-06-16 https://scifaro.com/en/abs/new-tradeoffs-for-decremental-approximate-all-pairs-shortest-paths-2211.011522024-04-30 https://scifaro.com/en/abs/a-new-approach-to-estimating-effective-resistances-and-counting-spanning-trees-in-expander-graphs-2211.014682022-11-04 https://scifaro.com/en/abs/computing-a-many-to-many-matching-with-demands-and-capacities-between-two-sets-using-the-hungarian-algorithm-2211.016122022-11-04 https://scifaro.com/en/abs/pairing-optimization-via-statistics-algebraic-structure-in-pairing-problems-and-its-application-to-performance-enhancement-2211.016612023-01-25 https://scifaro.com/en/abs/round-and-bipartize-for-vertex-cover-approximation-2211.016992023-07-28 https://scifaro.com/en/abs/efficient-branch-and-bound-algorithms-for-finding-triangle-constrained-2-clubs-2211.017012022-11-09 https://scifaro.com/en/abs/squid-faster-analytics-via-sampled-quantile-estimation-2211.017262024-07-11 https://scifaro.com/en/abs/matching-augmentation-via-simultaneous-contractions-2211.019122023-05-29 https://scifaro.com/en/abs/distributed-maximal-matching-and-maximal-independent-set-on-hypergraphs-2211.019452022-11-04 https://scifaro.com/en/abs/competitive-kill-and-restart-and-preemptive-strategies-for-non-clairvoyant-scheduling-2211.020442024-07-24 https://scifaro.com/en/abs/variable-parameter-analysis-for-scheduling-one-machine-2211.021072022-11-07 https://scifaro.com/en/abs/connected-k-center-and-k-diameter-clustering-2211.021762023-10-19 https://scifaro.com/en/abs/online-matching-with-set-and-concave-delays-2211.023942023-07-11 https://scifaro.com/en/abs/online-learning-and-bandits-with-queried-hints-2211.027032022-11-08 https://scifaro.com/en/abs/a-degree-4-sum-of-squares-lower-bound-for-the-clique-number-of-the-paley-graph-2211.027132024-04-29 https://scifaro.com/en/abs/extension-of-simple-algorithms-to-the-matroid-secretary-problem-2211.027552022-11-08 https://scifaro.com/en/abs/online-nash-welfare-maximization-without-predictions-2211.030772024-11-11 https://scifaro.com/en/abs/balancing-graph-voronoi-diagrams-with-one-more-vertex-2211.031462022-11-08 https://scifaro.com/en/abs/4d-range-reporting-in-the-pointer-machine-model-in-almost-optimal-time-2211.031612022-11-08 https://scifaro.com/en/abs/on-vertex-bisection-width-of-random-d-regular-graphs-2211.032062022-11-08 https://scifaro.com/en/abs/approximate-trace-reconstruction-from-a-single-trace-2211.032922022-11-08 https://scifaro.com/en/abs/partially-disjoint-k-shortest-paths-2211.033352022-11-08 https://scifaro.com/en/abs/parameterized-algorithm-for-the-disjoint-path-problem-on-planar-graphs-exponential-in-k-2-and-linear-in-n-2211.033412022-11-09 https://scifaro.com/en/abs/towards-derandomising-markov-chain-monte-carlo-2211.034872023-04-05 https://scifaro.com/en/abs/towards-an-optimal-contention-resolution-scheme-for-matchings-2211.035992024-08-29 https://scifaro.com/en/abs/a-simple-combinatorial-algorithm-for-robust-matroid-center-2211.036012022-11-08 https://scifaro.com/en/abs/approximation-algorithms-for-node-weighted-steiner-problems-digraphs-with-additive-prizes-and-graphs-with-submodular-prizes-2211.036532022-11-15 https://scifaro.com/en/abs/simple-set-sketching-2211.036832022-11-08 https://scifaro.com/en/abs/additive-noise-mechanisms-for-making-randomized-approximation-algorithms-differentially-private-2211.036952023-07-19 https://scifaro.com/en/abs/further-improvements-on-approximating-the-uniform-cost-distance-steiner-tree-problem-2211.038302022-11-10 https://scifaro.com/en/abs/query-complexity-of-the-metric-steiner-tree-problem-2211.038932024-11-11 https://scifaro.com/en/abs/improved-streaming-algorithms-for-maximum-directed-cut-via-smoothed-snapshots-2211.039162023-05-11 https://scifaro.com/en/abs/on-the-amortized-complexity-of-approximate-counting-2211.039172022-11-09 https://scifaro.com/en/abs/fast-algorithms-for-ell-p-regression-2211.039632023-10-10 https://scifaro.com/en/abs/computing-palindromes-on-a-trie-in-linear-time-2211.039952022-11-11 https://scifaro.com/en/abs/comparing-two-counting-methods-for-estimating-the-probabilities-of-strings-2211.040242022-11-09 https://scifaro.com/en/abs/improved-pattern-avoidance-bounds-for-greedy-bsts-via-matrix-decomposition-2211.041122022-11-09 https://scifaro.com/en/abs/prophet-inequality-order-selection-beats-random-order-2211.041452023-05-23 https://scifaro.com/en/abs/deterministic-incremental-apsp-with-polylogarithmic-update-time-and-stretch-2211.042172023-03-28 https://scifaro.com/en/abs/extracting-and-pre-processing-event-logs-2211.043382022-11-09 https://scifaro.com/en/abs/summation-problem-revisited-more-robust-computation-2211.044022022-11-09 https://scifaro.com/en/abs/sampling-from-convex-sets-with-a-cold-start-using-multiscale-decompositions-2211.044392024-12-18 https://scifaro.com/en/abs/a-local-search-based-approach-for-set-covering-2211.044442022-11-09 https://scifaro.com/en/abs/computing-square-colorings-on-bounded-treewidth-and-planar-graphs-2211.044582022-11-09 https://scifaro.com/en/abs/on-the-cut-query-complexity-of-approximating-max-cut-2211.045062024-04-24 https://scifaro.com/en/abs/on-instance-optimal-algorithms-for-a-generalization-of-nuts-and-bolts-and-generalized-sorting-2211.046012024-07-16 https://scifaro.com/en/abs/computing-1-epsilon-approximate-degeneracy-in-sublinear-time-2211.046272022-11-16 https://scifaro.com/en/abs/a-4-3-approximation-algorithm-for-half-integral-cycle-cut-instances-of-the-tsp-2211.046392023-07-11 https://scifaro.com/en/abs/faster-walsh-hadamard-transform-and-matrix-multiplication-over-finite-fields-using-lookup-tables-2211.046432022-11-10 https://scifaro.com/en/abs/lipschitz-continuous-algorithms-for-graph-problems-2211.046742023-09-15 https://scifaro.com/en/abs/tight-bounds-for-vertex-connectivity-in-dynamic-streams-2211.046852022-11-10 https://scifaro.com/en/abs/shortest-cycles-with-monotone-submodular-costs-2211.047972022-11-10 https://scifaro.com/en/abs/an-iterative-approach-for-counting-reduced-ordered-binary-decision-diagrams-2211.049382023-07-06 https://scifaro.com/en/abs/sampling-an-edge-in-sublinear-time-exactly-and-optimally-2211.049812022-11-15 https://scifaro.com/en/abs/fast-and-scalable-channels-in-kotlin-coroutines-2211.049862022-11-10 https://scifaro.com/en/abs/a-nearly-time-optimal-distributed-approximation-of-minimum-cost-k-edge-connected-spanning-subgraph-2211.049942022-11-10 https://scifaro.com/en/abs/on-minimizing-tardy-processing-time-max-min-skewed-convolution-and-triangular-structured-ilps-2211.050532022-11-11 https://scifaro.com/en/abs/streaming-algorithms-for-the-missing-item-finding-problem-2211.051702022-11-11 https://scifaro.com/en/abs/fully-dynamic-to-incremental-reductions-with-known-deletion-order-e-g-sliding-window-2211.051782022-11-18 https://scifaro.com/en/abs/smaller-low-depth-circuits-for-kronecker-powers-2211.052172022-11-11 https://scifaro.com/en/abs/directed-isoperimetric-theorems-for-boolean-functions-on-the-hypergrid-and-an-widetilde-o-n-sqrt-d-monotonicity-tester-2211.052812022-11-11 https://scifaro.com/en/abs/streaming-euclidean-max-cut-dimension-vs-data-reduction-2211.052932023-03-30 https://scifaro.com/en/abs/winner-determination-algorithms-for-graph-games-with-matching-structures-2211.053072022-11-11 https://scifaro.com/en/abs/an-o-loglog-n-approximation-for-submodular-facility-location-2211.054742022-11-11 https://scifaro.com/en/abs/discrepancy-minimization-via-regularization-2211.055092026-04-15 https://scifaro.com/en/abs/column-generation-for-optimization-problems-in-communication-networks-2211.055472022-11-11 https://scifaro.com/en/abs/the-randomized-k-server-conjecture-is-false-2211.057532023-07-07 https://scifaro.com/en/abs/steiner-connectivity-augmentation-and-splitting-off-in-poly-logarithmic-maximum-flows-2211.057692022-11-11 https://scifaro.com/en/abs/a-new-conjecture-on-hardness-of-low-degree-2-csp-s-with-implications-to-hardness-of-densest-k-subgraph-and-other-problems-2211.059062022-11-14 https://scifaro.com/en/abs/dynamic-curing-and-network-design-in-sis-epidemic-processes-2211.060282024-08-15 https://scifaro.com/en/abs/external-memory-dictionaries-with-worst-case-update-cost-2211.060442022-11-14 https://scifaro.com/en/abs/extended-formulations-via-decision-diagrams-2211.060652023-09-07 https://scifaro.com/en/abs/a-dynamic-maxsat-based-approach-to-directed-feedback-vertex-sets-2211.061092022-11-14 https://scifaro.com/en/abs/approximate-max-flow-min-multicut-theorem-for-graphs-of-bounded-treewidth-2211.062672022-11-14 https://scifaro.com/en/abs/re-analyze-gauss-bounds-for-private-matrix-approximation-via-dyson-brownian-motion-2211.064182022-11-14 https://scifaro.com/en/abs/faster-walsh-hadamard-and-discrete-fourier-transforms-from-matrix-non-rigidity-2211.064592023-06-16 https://scifaro.com/en/abs/on-maximal-k-edge-connected-subgraphs-of-undirected-graphs-2211.065212023-05-02 https://scifaro.com/en/abs/approximation-algorithms-for-drone-delivery-scheduling-problem-2211.066362022-11-15 https://scifaro.com/en/abs/near-linear-sample-complexity-for-l-p-polynomial-regression-2211.067902022-11-15 https://scifaro.com/en/abs/improved-dynamic-colouring-of-sparse-graphs-2211.068582022-11-15 https://scifaro.com/en/abs/parallel-and-i-o-efficient-algorithms-for-non-linear-preferential-attachment-2211.068842023-01-18 https://scifaro.com/en/abs/having-hope-in-hops-new-spanners-preservers-and-lower-bounds-for-hopsets-2211.069202022-11-15 https://scifaro.com/en/abs/online-correlation-clustering-for-dynamic-complete-signed-graphs-2211.070002022-11-15 https://scifaro.com/en/abs/kernelization-for-partial-vertex-cover-via-additive-expansion-lemma-2211.070012022-11-15 https://scifaro.com/en/abs/exact-and-heuristic-algorithms-for-the-domination-problem-2211.070192023-09-04 https://scifaro.com/en/abs/a-local-to-global-theorem-for-congested-shortest-paths-2211.070422023-06-29 https://scifaro.com/en/abs/removing-additive-structure-in-3sum-based-reductions-2211.070482023-03-20 https://scifaro.com/en/abs/stronger-3-sum-lower-bounds-for-approximate-distance-oracles-via-additive-combinatorics-2211.070582023-10-24 https://scifaro.com/en/abs/the-ell-p-subspace-sketch-problem-in-small-dimensions-with-applications-to-support-vector-machines-2211.071322024-02-19 https://scifaro.com/en/abs/an-improved-parameterized-algorithm-for-treewidth-2211.071542023-08-21 https://scifaro.com/en/abs/bellman-ford-is-optimal-for-shortest-hop-bounded-paths-2211.073252023-02-15 https://scifaro.com/en/abs/complete-decomposition-of-symmetric-tensors-in-linear-time-and-polylogarithmic-precision-2211.074072025-03-12 https://scifaro.com/en/abs/efficient-algorithms-for-certifying-lower-bounds-on-the-discrepancy-of-random-matrices-2211.075032023-06-02 https://scifaro.com/en/abs/fast-distributed-brooks-theorem-2211.076062022-11-15 https://scifaro.com/en/abs/augmented-thresholds-for-moni-2211.077942022-11-16 https://scifaro.com/en/abs/massively-parallel-algorithms-for-b-matching-2211.077962022-11-16 https://scifaro.com/en/abs/on-sparsification-of-stochastic-packing-problems-2211.078292022-11-16 https://scifaro.com/en/abs/genome-on-diet-taming-large-scale-genomic-analyses-via-sparsified-genomics-2211.081572024-07-11 https://scifaro.com/en/abs/approximating-flexible-graph-connectivity-via-r-acke-tree-based-rounding-2211.083242022-11-16 https://scifaro.com/en/abs/sdps-and-robust-satisfiability-of-promise-csp-2211.083732025-09-09 https://scifaro.com/en/abs/optimizing-polymatroid-functions-2211.083812022-11-16 https://scifaro.com/en/abs/bandit-algorithms-for-prophet-inequality-and-pandora-s-box-2211.085862023-12-08 https://scifaro.com/en/abs/a-dichotomy-theorem-for-linear-time-homomorphism-orbit-counting-in-bounded-degeneracy-graphs-2211.086052024-09-25 https://scifaro.com/en/abs/on-the-power-of-learning-augmented-search-trees-2211.092512025-05-16 https://scifaro.com/en/abs/near-optimal-distributed-computation-of-small-vertex-cuts-2211.094152023-06-21 https://scifaro.com/en/abs/incremental-approximate-maximum-flow-in-m-1-2-o-1-update-time-2211.096062022-11-18 https://scifaro.com/en/abs/a-simple-classical-algorithm-for-estimating-betti-numbers-2211.096182023-12-13 https://scifaro.com/en/abs/minimum-path-cover-in-parameterized-linear-time-2211.096592022-11-18 https://scifaro.com/en/abs/features-for-the-0-1-knapsack-problem-based-on-inclusionwise-maximal-solutions-2211.096652022-11-18 https://scifaro.com/en/abs/extensions-of-the-p-q-flexible-graph-connectivity-model-2211.097472022-11-18 https://scifaro.com/en/abs/cheeger-inequalities-for-directed-graphs-and-hypergraphs-using-reweighted-eigenvalues-2211.097762022-11-18 https://scifaro.com/en/abs/optimal-algorithms-for-linear-algebra-in-the-current-matrix-multiplication-time-2211.099642023-01-20 https://scifaro.com/en/abs/listing-4-cycles-2211.100222022-11-21 https://scifaro.com/en/abs/identifying-correlation-in-stream-of-samples-2211.101372022-11-21 https://scifaro.com/en/abs/improved-approximations-for-unrelated-machine-scheduling-2211.103982022-11-21 https://scifaro.com/en/abs/prophet-inequalities-over-time-2211.104712025-09-08 https://scifaro.com/en/abs/efficient-determinant-maximization-for-all-matroids-2211.105072022-11-22 https://scifaro.com/en/abs/a-distanced-matching-game-decremental-apsp-in-expanders-and-faster-deterministic-algorithms-for-graph-cut-problems-2211.105562022-12-12 https://scifaro.com/en/abs/differential-privacy-from-locally-adjustable-graph-algorithms-k-core-decomposition-low-out-degree-ordering-and-densest-subgraphs-2211.108872022-11-22 https://scifaro.com/en/abs/optimal-resizable-arrays-2211.110092023-05-30 https://scifaro.com/en/abs/lemmas-of-differential-privacy-2211.111892022-11-22 https://scifaro.com/en/abs/toeplitz-low-rank-approximation-with-sublinear-query-complexity-2211.113282022-11-22 https://scifaro.com/en/abs/estimating-the-effective-support-size-in-constant-query-complexity-2211.113442022-11-22 https://scifaro.com/en/abs/expander-decomposition-in-dynamic-streams-2211.113842023-08-04 https://scifaro.com/en/abs/private-counting-of-distinct-and-k-occurring-items-in-time-windows-2211.117182022-11-22 https://scifaro.com/en/abs/the-berlekamp-massey-algorithm-revisited-2211.117212025-02-18 https://scifaro.com/en/abs/a-cut-matching-game-for-constant-hop-expanders-2211.117262024-10-29 https://scifaro.com/en/abs/algorithmic-applications-of-hypergraph-and-partition-containers-2211.117372022-11-22 https://scifaro.com/en/abs/labeled-nearest-neighbor-search-and-metric-spanners-via-locality-sensitive-orderings-2211.118462023-11-17 https://scifaro.com/en/abs/string-covering-a-survey-2211.118562026-04-08 https://scifaro.com/en/abs/upper-and-lower-bounds-on-the-smoothed-complexity-of-the-simplex-method-2211.118602025-10-22 https://scifaro.com/en/abs/quasi-stable-coloring-for-graph-compression-approximating-max-flow-linear-programs-and-centrality-2211.119122022-11-30 https://scifaro.com/en/abs/on-optimal-coreset-construction-for-euclidean-k-z-clustering-2211.119232024-03-14 https://scifaro.com/en/abs/online-facility-location-with-weights-and-congestion-2211.119612025-05-09 https://scifaro.com/en/abs/support-size-estimation-the-power-of-conditioning-2211.119672022-11-23 https://scifaro.com/en/abs/minimum-cost-temporal-walks-under-waiting-time-constraints-in-linear-time-2211.121362023-01-31 https://scifaro.com/en/abs/on-structural-parameterizations-of-star-coloring-2211.122262022-11-23 https://scifaro.com/en/abs/finding-almost-tight-witness-trees-2211.124312023-05-09 https://scifaro.com/en/abs/lower-bound-techniques-in-the-comparison-query-model-and-inversion-minimization-on-trees-2211.124412024-07-02 https://scifaro.com/en/abs/an-algorithmic-bridge-between-hamming-and-levenshtein-distances-2211.124962026-02-23 https://scifaro.com/en/abs/scalable-and-effective-conductance-based-graph-clustering-2211.125112022-11-24 https://scifaro.com/en/abs/worst-case-to-expander-case-reductions-2211.128332022-11-28 https://scifaro.com/en/abs/decision-diagram-based-branch-and-bound-with-caching-for-dominance-and-suboptimality-detection-2211.131182024-01-19 https://scifaro.com/en/abs/space-efficient-rlz-to-lz77-conversion-2211.132542022-12-06 https://scifaro.com/en/abs/a-fast-and-simple-o-z-log-n-space-index-for-finding-approximately-longest-common-substrings-2211.134342022-12-06 https://scifaro.com/en/abs/differentially-private-heatmaps-2211.134542022-11-28 https://scifaro.com/en/abs/estimation-of-similarity-between-dna-sequences-and-its-graphical-representation-2211.134622022-11-28 https://scifaro.com/en/abs/towards-better-bounds-for-finding-quasi-identifiers-2211.138822023-04-14 https://scifaro.com/en/abs/synthesis-cost-optimal-targeted-mutant-protein-libraries-2211.138982022-11-28 https://scifaro.com/en/abs/simple-algorithms-for-stochastic-score-classification-with-small-approximation-ratios-2211.140822024-01-23 https://scifaro.com/en/abs/better-trees-for-santa-claus-2211.142592022-11-28 https://scifaro.com/en/abs/faster-algorithm-for-structured-john-ellipsoid-computation-2211.144072025-10-29 https://scifaro.com/en/abs/identifying-a-3-vertex-strongly-biconnected-directed-subgraph-with-minimum-number-of-edges-2211.145722022-11-29 https://scifaro.com/en/abs/lower-bounds-on-retroactive-data-structures-2211.146642022-11-29 https://scifaro.com/en/abs/dynamic-kernel-graph-sparsifiers-2211.148252026-03-05 https://scifaro.com/en/abs/which-l-p-norm-is-the-fairest-approximations-for-fair-facility-location-across-all-p-2211.148732024-06-21 https://scifaro.com/en/abs/a-faster-k-means-algorithm-2211.151182024-02-15 https://scifaro.com/en/abs/a-quantum-algorithm-to-estimate-the-closeness-to-the-strict-avalanche-criterion-in-boolean-functions-2211.153562022-11-29 https://scifaro.com/en/abs/special-cases-of-the-minimum-spanning-tree-problem-under-explorable-edge-and-vertex-uncertainty-2211.156112022-11-29 https://scifaro.com/en/abs/sublinear-time-algorithms-and-complexity-of-approximate-maximum-matching-2211.158432022-11-30 https://scifaro.com/en/abs/quantum-speed-ups-for-string-synchronizing-sets-longest-common-substring-and-k-mismatch-matching-2211.159452022-11-30 https://scifaro.com/en/abs/online-unrelated-machine-load-balancing-and-generalized-flow-with-recourse-2211.162162022-11-30 https://scifaro.com/en/abs/outlier-robust-sparse-mean-estimation-for-heavy-tailed-distributions-2211.163332022-11-30 https://scifaro.com/en/abs/batching-and-optimal-multi-stage-bipartite-allocations-2211.165812022-12-01 https://scifaro.com/en/abs/approximating-binary-longest-common-subsequence-in-almost-linear-time-2211.166602023-02-13 https://scifaro.com/en/abs/approximate-minimum-cuts-and-their-enumeration-2211.167472022-12-01 https://scifaro.com/en/abs/gapped-string-indexing-in-subquadratic-space-and-sublinear-query-time-2211.168602024-03-06 https://scifaro.com/en/abs/improved-smoothed-analysis-of-2-opt-for-the-euclidean-tsp-2211.169082023-10-16 https://scifaro.com/en/abs/nonmonontone-submodular-maximization-under-routing-constraints-2211.171312022-12-13 https://scifaro.com/en/abs/sublinear-algorithms-for-1-5-epsilon-approximate-matching-2212.001892023-04-28 https://scifaro.com/en/abs/tight-conditional-lower-bounds-for-vertex-connectivity-problems-2212.003592023-04-18 https://scifaro.com/en/abs/an-improved-time-efficient-approximate-kernelization-for-connected-treedepth-deletion-set-2212.004182022-12-02 https://scifaro.com/en/abs/subquadratic-weighted-matroid-intersection-under-rank-oracles-2212.005082023-03-20 https://scifaro.com/en/abs/clustering-what-matters-optimal-approximation-for-clustering-with-outliers-2212.006962023-02-21 https://scifaro.com/en/abs/trie-compressed-intersectable-sets-2212.009462022-12-05 https://scifaro.com/en/abs/bin-packing-with-partition-matroid-can-be-approximated-within-o-opt-bins-2212.010252023-05-16 https://scifaro.com/en/abs/computing-the-optimal-bwt-of-very-large-string-collections-2212.011562022-12-05 https://scifaro.com/en/abs/pandora-s-problem-with-nonobligatory-inspection-optimal-structure-and-a-ptas-2212.015242022-12-06 https://scifaro.com/en/abs/parameterized-temporal-exploration-problems-2212.015942022-12-06 https://scifaro.com/en/abs/parameterized-approximation-for-maximum-weight-independent-set-of-rectangles-and-segments-2212.016202022-12-06 https://scifaro.com/en/abs/notes-on-the-complexity-of-coverings-for-kronecker-powers-of-symmetric-matrices-2212.017762022-12-06 https://scifaro.com/en/abs/clustering-permutations-new-techniques-with-streaming-applications-2212.018212026-02-23 https://scifaro.com/en/abs/space-efficient-conversions-from-slps-2212.023272023-10-11 https://scifaro.com/en/abs/two-6-approximation-algorithms-for-the-stochastic-score-classification-problem-2212.023702022-12-06 https://scifaro.com/en/abs/low-power-mesh-algorithms-for-image-problems-2212.026402022-12-07 https://scifaro.com/en/abs/improved-approximation-schemes-for-un-bounded-subset-sum-and-partition-2212.028832022-12-07 https://scifaro.com/en/abs/sparsity-dimension-trade-offs-for-oblivious-subspace-embeddings-2212.029132023-07-14 https://scifaro.com/en/abs/a-strongly-polynomial-algorithm-for-approximate-forster-transforms-and-its-application-to-halfspace-learning-2212.030082022-12-07 https://scifaro.com/en/abs/online-min-max-paging-2212.030162022-12-07 https://scifaro.com/en/abs/pareto-optimal-compression-of-genomic-dictionaries-with-or-without-random-access-in-main-memory-2212.030672022-12-07 https://scifaro.com/en/abs/a-decision-diagram-operation-for-reachability-2212.036842023-03-14 https://scifaro.com/en/abs/density-approximation-for-moving-groups-2212.036852023-04-18 https://scifaro.com/en/abs/an-improved-approximation-guarantee-for-prize-collecting-tsp-2212.037762023-04-13 https://scifaro.com/en/abs/computing-linear-sections-of-varieties-quantum-entanglement-tensor-decompositions-and-beyond-2212.038512023-05-09 https://scifaro.com/en/abs/fast-and-practical-dag-decomposition-with-reachability-applications-2212.039452022-12-09 https://scifaro.com/en/abs/demetris-counting-near-cliques-by-crawling-2212.039572022-12-09 https://scifaro.com/en/abs/breaking-the-barrier-2-k-for-subset-feedback-vertex-set-in-chordal-graphs-2212.047262025-01-06 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-mcs-partial-search-order-on-chordal-graphs-2212.048802023-08-28 https://scifaro.com/en/abs/robustness-implies-privacy-in-statistical-estimation-2212.050152024-06-18 https://scifaro.com/en/abs/transcoding-unicode-characters-with-avx-512-instructions-2212.050982024-08-06 https://scifaro.com/en/abs/beyond-circular-arc-graphs-recognizing-lollipop-graphs-and-medusa-graphs-2212.054332022-12-13 https://scifaro.com/en/abs/algorithms-approaching-the-threshold-for-semi-random-planted-clique-2212.056192023-06-07 https://scifaro.com/en/abs/minimum-weight-partitioning-of-a-set-with-associated-subsets-2212.058232022-12-13 https://scifaro.com/en/abs/a-slightly-improved-deterministic-approximation-algorithm-for-metric-tsp-2212.062962022-12-14 https://scifaro.com/en/abs/dynamic-maxflow-via-dynamic-interior-point-methods-2212.063152022-12-14 https://scifaro.com/en/abs/streaming-euclidean-mst-to-a-constant-factor-2212.065462022-12-14 https://scifaro.com/en/abs/dimensionality-reduction-on-complex-vector-spaces-for-euclidean-distance-with-dynamic-weights-2212.066052026-03-23 https://scifaro.com/en/abs/fast-number-parsing-without-fallback-2212.066442023-06-06 https://scifaro.com/en/abs/interweaving-real-time-jobs-with-energy-harvesting-to-maximize-throughput-2212.070022022-12-15 https://scifaro.com/en/abs/efficient-non-isomorphic-graph-enumeration-algorithms-for-subclasses-of-perfect-graphs-2212.071192022-12-15 https://scifaro.com/en/abs/performance-enhancement-strategies-for-sparse-matrix-vector-multiplication-spmv-and-iterative-linear-solvers-2212.074902022-12-16 https://scifaro.com/en/abs/correlating-theory-and-practice-in-finding-clubs-and-plexes-2212.075332022-12-16 https://scifaro.com/en/abs/min-max-submodular-ranking-for-multiple-agents-2212.076822023-03-28 https://scifaro.com/en/abs/parameterized-algorithms-for-string-matching-to-dags-funnels-and-beyond-2212.078702023-02-03 https://scifaro.com/en/abs/automatic-vehicle-trajectory-data-reconstruction-at-scale-2212.079072023-11-07 https://scifaro.com/en/abs/differentially-private-range-query-on-shortest-paths-2212.079972023-03-03 https://scifaro.com/en/abs/privately-estimating-a-gaussian-efficient-robust-and-optimal-2212.080182023-06-02 https://scifaro.com/en/abs/approximate-counting-using-taylor-s-theorem-a-survey-2212.081432022-12-19 https://scifaro.com/en/abs/on-the-optimum-scenarios-for-single-row-equidistant-facility-layout-problem-2212.086642022-12-22 https://scifaro.com/en/abs/unconstrained-traveling-tournament-problem-is-apx-complete-2212.091652022-12-20 https://scifaro.com/en/abs/high-performance-construction-of-recsplit-based-minimal-perfect-hash-functions-2212.095622023-07-06 https://scifaro.com/en/abs/dominance-for-containment-problems-2212.102472024-11-28 https://scifaro.com/en/abs/scheduling-with-predictions-2212.104332022-12-21 https://scifaro.com/en/abs/coloring-in-graph-streams-via-deterministic-and-adversarially-robust-algorithms-2212.106412022-12-22 https://scifaro.com/en/abs/count-free-weisfeiler-leman-and-group-isomorphism-2212.112472024-01-24 https://scifaro.com/en/abs/adaptive-and-dynamic-multi-resolution-hashing-for-pairwise-summations-2212.114082022-12-23 https://scifaro.com/en/abs/parameterizing-path-partitions-2212.116532024-12-24 https://scifaro.com/en/abs/graphtango-a-hybrid-representation-format-for-efficient-streaming-graph-updates-and-analysis-2212.119352022-12-23 https://scifaro.com/en/abs/bridge-girth-a-unifying-notion-in-network-design-2212.119442023-08-16 https://scifaro.com/en/abs/on-differentially-private-counting-on-trees-2212.119672023-04-28 https://scifaro.com/en/abs/practical-algorithms-with-guaranteed-approximation-ratio-for-ttp-with-maximum-tour-length-two-2212.122402022-12-26 https://scifaro.com/en/abs/a-cut-and-solve-algorithm-for-virtual-machine-consolidation-problem-2212.123412022-12-26 https://scifaro.com/en/abs/tight-bounds-for-connectivity-problems-parameterized-by-cutwidth-2212.123852022-12-26 https://scifaro.com/en/abs/triplet-reconstruction-and-all-other-phylogenetic-csps-are-approximation-resistant-2212.127652023-04-06 https://scifaro.com/en/abs/testing-distributions-of-huge-objects-2212.128022024-02-14 https://scifaro.com/en/abs/a-note-on-improved-results-for-one-round-distributed-clique-listing-2212.128432022-12-27 https://scifaro.com/en/abs/sparse-cuts-in-hypergraphs-from-random-walks-on-simplicial-complexes-2212.134062023-10-04 https://scifaro.com/en/abs/constant-ratio-fpt-approximation-of-hypertree-width-parameters-for-hypergraphs-of-bounded-rank-2212.134232023-05-16 https://scifaro.com/en/abs/a-polynomial-time-iterative-algorithm-for-matching-gaussian-matrices-with-non-vanishing-correlation-2212.136772025-09-01 https://scifaro.com/en/abs/induced-matching-below-guarantees-average-paves-the-way-for-fixed-parameter-tractability-2212.139622022-12-29 https://scifaro.com/en/abs/graph-searching-with-predictions-2212.142202023-01-02 https://scifaro.com/en/abs/constant-approximation-for-normalized-modularity-and-associations-clustering-2212.143342023-01-02 https://scifaro.com/en/abs/on-learning-the-structure-of-clusters-in-graphs-2212.143452023-01-02 https://scifaro.com/en/abs/a-quasi-quadratic-vertex-kernel-for-cograph-edge-editing-2212.148142023-01-02 https://scifaro.com/en/abs/deterministic-counting-lov-a-sz-local-lemma-beyond-linear-programming-2212.148472023-03-10 https://scifaro.com/en/abs/depth-first-search-performance-in-a-random-digraph-with-geometric-outdegree-distribution-2212.148652023-01-02 https://scifaro.com/en/abs/optimization-perspectives-on-shellsort-2301.003162023-01-03 https://scifaro.com/en/abs/correlation-clustering-algorithm-for-dynamic-complete-signed-graphs-an-index-based-approach-2301.003842025-06-03 https://scifaro.com/en/abs/exactly-hittable-interval-graphs-2301.003872024-02-14 https://scifaro.com/en/abs/algorithms-for-massive-data-lecture-notes-2301.007542026-02-27 https://scifaro.com/en/abs/parameterized-lower-bounds-for-problems-in-p-via-fine-grained-cross-compositions-2301.007972023-01-09 https://scifaro.com/en/abs/fast-parallel-algorithms-for-enumeration-of-simple-temporal-and-hop-constrained-cycles-2301.010682023-07-18 https://scifaro.com/en/abs/reducing-maximum-weighted-matching-to-the-largest-cardinality-matching-in-congest-2301.010842023-01-04 https://scifaro.com/en/abs/provably-fast-and-space-efficient-parallel-biconnectivity-2301.013562026-01-21 https://scifaro.com/en/abs/matching-using-sufficient-dimension-reduction-for-heterogeneity-causal-effect-estimation-2301.015492023-01-05 https://scifaro.com/en/abs/r-enyi-ulam-games-and-online-computation-with-imperfect-advice-2301.016312023-01-05 https://scifaro.com/en/abs/dynamic-maintenance-of-monotone-dynamic-programs-and-applications-2301.017442023-01-05 https://scifaro.com/en/abs/exact-and-heuristic-approaches-to-speeding-up-the-msm-time-series-distance-computation-2301.019772023-04-21 https://scifaro.com/en/abs/max-min-diversification-with-fairness-constraints-exact-and-approximation-algorithms-2301.020532023-04-27 https://scifaro.com/en/abs/better-differentially-private-approximate-histograms-and-heavy-hitters-using-the-misra-gries-sketch-2301.024572025-03-19 https://scifaro.com/en/abs/finding-and-counting-patterns-in-sparse-graphs-2301.025692023-01-09 https://scifaro.com/en/abs/sublinear-time-algorithms-for-several-geometric-optimization-with-outliers-problems-in-machine-learning-2301.028702023-01-10 https://scifaro.com/en/abs/assigning-agents-to-increase-network-based-neighborhood-diversity-2301.028762024-04-02 https://scifaro.com/en/abs/seedtree-a-dynamically-optimal-and-local-self-adjusting-tree-2301.030742023-01-10 https://scifaro.com/en/abs/dynamic-binary-search-trees-improved-lower-bounds-for-the-greedy-future-algorithm-2301.030842023-03-07 https://scifaro.com/en/abs/structural-equivalence-in-subgraph-matching-2301.031612023-01-10 https://scifaro.com/en/abs/space-query-tradeoffs-in-range-subgraph-counting-and-listing-2301.033902023-01-10 https://scifaro.com/en/abs/stream-k-work-centric-parallel-decomposition-for-dense-matrix-matrix-multiplication-on-the-gpu-2301.035982023-01-11 https://scifaro.com/en/abs/improved-approximation-algorithms-for-the-expanding-search-problem-2301.036382025-05-13 https://scifaro.com/en/abs/proportionally-fair-matching-with-multiple-groups-2301.038622023-01-11 https://scifaro.com/en/abs/maintaining-triconnected-components-under-node-expansion-2301.039722023-01-11 https://scifaro.com/en/abs/linear-time-online-algorithms-for-constructing-linear-size-suffix-trie-2301.042952023-12-06 https://scifaro.com/en/abs/a-note-on-property-testing-of-the-binary-rank-2301.044062023-01-12 https://scifaro.com/en/abs/private-estimation-algorithms-for-stochastic-block-models-and-mixture-models-2301.048222023-11-17 https://scifaro.com/en/abs/computing-m-eternal-domination-number-of-cactus-graphs-in-linear-time-2301.051552023-01-13 https://scifaro.com/en/abs/incremental-dead-state-detection-in-logarithmic-time-2301.053082023-05-30 https://scifaro.com/en/abs/computing-matching-statistics-on-wheeler-dfas-2301.053382023-01-16 https://scifaro.com/en/abs/sublinear-algorithms-for-tsp-via-path-covers-2301.053502024-04-30 https://scifaro.com/en/abs/quick-minimization-of-tardy-processing-time-on-a-single-machine-2301.054602023-01-18 https://scifaro.com/en/abs/differentially-private-continual-releases-of-streaming-frequency-moment-estimations-2301.056052023-01-16 https://scifaro.com/en/abs/long-directed-detours-reduction-to-2-disjoint-paths-2301.061052023-01-25 https://scifaro.com/en/abs/mobility-data-in-operations-the-facility-location-problem-2301.062462023-12-12 https://scifaro.com/en/abs/propagate-a-seed-propagation-framework-to-compute-distance-based-metrics-on-very-large-graphs-2301.064992023-08-23 https://scifaro.com/en/abs/faster-sinkhorn-s-algorithm-with-small-treewidth-2301.067412023-01-18 https://scifaro.com/en/abs/ranking-with-submodular-functions-on-the-fly-2301.067872023-01-18 https://scifaro.com/en/abs/faster-algorithms-for-evacuation-problems-in-networks-with-the-single-sink-of-small-degree-2301.068572023-03-01 https://scifaro.com/en/abs/algorithms-for-acyclic-weighted-finite-state-automata-with-failure-arcs-2301.068622023-07-12 https://scifaro.com/en/abs/engineering-fully-dynamic-delta-orientation-algorithms-2301.069682023-01-19 https://scifaro.com/en/abs/all-norm-load-balancing-in-graph-streams-via-the-multiplicative-weights-update-method-2301.070072023-01-18 https://scifaro.com/en/abs/subset-sum-in-time-2-n-2-poly-n-2301.071342023-01-31 https://scifaro.com/en/abs/two-new-upper-bounds-for-the-maximum-k-plex-problem-2301.073002024-01-22 https://scifaro.com/en/abs/an-improved-approximation-for-maximum-weighted-k-set-packing-2301.075372023-01-19 https://scifaro.com/en/abs/coresets-for-constrained-clustering-general-assignment-constraints-and-improved-size-bounds-2301.084602024-10-11 https://scifaro.com/en/abs/superpolynomial-lower-bounds-for-learning-monotone-classes-2301.084862023-01-31 https://scifaro.com/en/abs/online-dependent-rounding-schemes-for-bipartite-matchings-with-applications-2301.086802024-10-30 https://scifaro.com/en/abs/submodular-hypergraph-partitioning-metric-relaxations-and-fast-algorithms-via-an-improved-cut-matching-game-2301.089202023-07-27 https://scifaro.com/en/abs/a-graph-isomorphism-invariant-based-on-neighborhood-aggregation-2301.091872023-01-24 https://scifaro.com/en/abs/relaxed-models-for-adversarial-streaming-the-advice-model-and-the-bounded-interruptions-model-2301.092032023-01-24 https://scifaro.com/en/abs/multiplicative-auction-algorithm-for-approximate-maximum-weight-bipartite-matching-2301.092172024-01-25 https://scifaro.com/en/abs/a-new-approximation-algorithm-for-minimum-weight-1-m-connected-dominating-set-2301.092472023-02-22 https://scifaro.com/en/abs/improved-hardness-of-approximation-for-geometric-bin-packing-2301.092722025-02-11 https://scifaro.com/en/abs/approximating-knapsack-and-partition-via-dense-subset-sums-2301.093332023-01-24 https://scifaro.com/en/abs/a-new-dynamic-programming-approach-for-spanning-trees-with-chain-constraints-and-beyond-2301.093402023-09-13 https://scifaro.com/en/abs/sliding-window-string-indexing-in-streams-2301.094772023-01-24 https://scifaro.com/en/abs/distinct-elements-in-streams-an-algorithm-for-the-text-book-2301.101912023-05-25 https://scifaro.com/en/abs/online-variable-weight-scheduling-with-preempting-on-jobs-with-linear-and-exponential-penalties-2301.103772023-01-26 https://scifaro.com/en/abs/in-which-graph-structures-can-we-efficiently-find-temporally-disjoint-paths-and-walks-2301.105032023-01-26 https://scifaro.com/en/abs/succinct-planar-encoding-with-minor-operations-2301.105642024-01-18 https://scifaro.com/en/abs/deterministic-massively-parallel-symmetry-breaking-for-sparse-graphs-2301.112052023-07-03 https://scifaro.com/en/abs/algorithms-for-ranking-and-unranking-the-combinatorial-set-of-rna-secondary-structures-2301.118902023-01-30 https://scifaro.com/en/abs/cut-matching-games-for-generalized-hypergraph-ratio-cuts-2301.122742023-01-31 https://scifaro.com/en/abs/multi-priority-graph-sparsification-2301.125632023-01-31 https://scifaro.com/en/abs/the-leafed-induced-subtree-in-chordal-and-bounded-treewidth-graphs-2301.127832026-04-08 https://scifaro.com/en/abs/minimalistic-predictions-to-schedule-jobs-with-online-precedence-constraints-2301.128632023-01-31 https://scifaro.com/en/abs/fast-combinatorial-algorithms-for-min-max-correlation-clustering-2301.130792023-01-31 https://scifaro.com/en/abs/a-safety-framework-for-flow-decomposition-problems-via-integer-linear-programming-2301.132452023-02-01 https://scifaro.com/en/abs/the-iteration-number-of-the-weisfeiler-leman-algorithm-2301.133172025-04-21 https://scifaro.com/en/abs/weitzman-s-rule-for-pandora-s-box-with-correlations-2301.135342023-02-01 https://scifaro.com/en/abs/singular-value-approximation-and-sparsifying-random-walks-on-directed-graphs-2301.135412023-09-21 https://scifaro.com/en/abs/p-median-location-interdiction-on-trees-2301.137232023-02-01 https://scifaro.com/en/abs/bounds-for-c-ideal-hashing-2301.138322023-02-01 https://scifaro.com/en/abs/zero-memory-graph-exploration-with-unknown-inports-2301.138602023-02-01 https://scifaro.com/en/abs/exploring-wedges-of-an-oriented-grid-by-an-automaton-with-pebbles-2302.000522023-02-02 https://scifaro.com/en/abs/adding-an-edge-in-a-p-4-sparse-graph-2302.001122023-02-02 https://scifaro.com/en/abs/sublinear-approximation-schemes-for-scheduling-precedence-graphs-of-bounded-depth-2302.001332023-02-02 https://scifaro.com/en/abs/approximating-red-blue-set-cover-and-minimum-monotone-satisfying-assignment-2302.002132023-07-11 https://scifaro.com/en/abs/a-nearly-optimal-bound-for-fast-regression-with-ell-infty-guarantee-2302.002482023-02-02 https://scifaro.com/en/abs/faster-maximal-clique-enumeration-in-large-real-world-link-streams-2302.003602024-05-27 https://scifaro.com/en/abs/improved-exact-and-heuristic-algorithms-for-maximum-weight-clique-2302.004582023-02-02 https://scifaro.com/en/abs/parameterized-algorithms-for-colored-clustering-2302.006302023-02-02 https://scifaro.com/en/abs/adding-a-tail-in-classes-of-perfect-graphs-2302.006572023-02-02 https://scifaro.com/en/abs/order-preserving-squares-in-strings-2302.007242023-02-03 https://scifaro.com/en/abs/speed-oblivious-online-scheduling-knowing-precise-speeds-is-not-necessary-2302.009852023-05-31 https://scifaro.com/en/abs/optimal-heaviest-induced-ancestors-2302.013732023-02-06 https://scifaro.com/en/abs/chaining-of-maximal-exact-matches-in-graphs-2302.017482023-07-06 https://scifaro.com/en/abs/sketch-flip-merge-mergeable-sketches-for-private-distinct-counting-2302.020562023-02-07 https://scifaro.com/en/abs/on-2-strong-connectivity-orientations-of-mixed-graphs-and-related-problems-2302.022152024-04-15 https://scifaro.com/en/abs/maximal-k-edge-connected-subgraphs-in-weighted-graphs-via-local-random-contraction-2302.022902023-02-07 https://scifaro.com/en/abs/stochastic-minimum-vertex-cover-in-general-graphs-a-3-2-approximation-2302.025672023-02-07 https://scifaro.com/en/abs/optimal-lz-end-parsing-is-hard-2302.025862023-02-07 https://scifaro.com/en/abs/models-and-algorithms-for-simple-disjunctive-temporal-problems-2302.026442023-02-07 https://scifaro.com/en/abs/sparsification-of-monotone-k-submodular-functions-of-low-curvature-2302.031432023-02-08 https://scifaro.com/en/abs/calibrated-recommendations-for-users-with-decaying-attention-2302.032392024-07-15 https://scifaro.com/en/abs/two-parallel-pagerank-algorithms-via-improving-forward-push-2302.032452023-02-08 https://scifaro.com/en/abs/engineering-shared-memory-parallel-shuffling-to-generate-random-permutations-in-place-2302.033172023-02-08 https://scifaro.com/en/abs/the-solidarity-cover-problem-2302.034512023-02-08 https://scifaro.com/en/abs/tight-algorithms-for-connectivity-problems-parameterized-by-clique-width-2302.036272023-02-08 https://scifaro.com/en/abs/planted-bipartite-graph-detection-2302.036582024-03-07 https://scifaro.com/en/abs/storing-a-trie-with-compact-and-predictable-space-2302.036902023-03-28 https://scifaro.com/en/abs/cardinality-constrained-continuous-knapsack-problem-with-concave-piecewise-linear-utilities-2302.037812024-02-07 https://scifaro.com/en/abs/men-can-t-always-be-transformed-into-mice-decision-algorithms-and-complexity-for-sorting-by-symmetric-reversals-2302.037972023-02-09 https://scifaro.com/en/abs/approximately-optimal-core-shapes-for-tensor-decompositions-2302.038862024-06-19 https://scifaro.com/en/abs/fully-dynamic-approximate-decision-trees-with-worst-case-update-time-guarantees-2302.039942023-02-13 https://scifaro.com/en/abs/weighted-edit-distance-computation-strings-trees-and-dyck-2302.042292023-02-09 https://scifaro.com/en/abs/parallel-derandomization-for-coloring-2302.043782024-04-26 https://scifaro.com/en/abs/locally-consistent-decomposition-of-strings-with-applications-to-edit-distance-sketching-2302.044752023-11-28 https://scifaro.com/en/abs/a-new-width-parameter-of-graphs-based-on-edge-cuts-alpha-edge-crossing-width-2302.046242025-07-31 https://scifaro.com/en/abs/an-o-log-k-approximation-for-directed-steiner-tree-in-planar-graphs-2302.047472023-04-25 https://scifaro.com/en/abs/dynamic-1-epsilon-approximate-matching-size-in-truly-sublinear-update-time-2302.050302024-04-30 https://scifaro.com/en/abs/count-min-sketch-with-variable-number-of-hash-functions-an-experimental-study-2302.052452023-09-08 https://scifaro.com/en/abs/online-algorithms-with-randomly-infused-advice-2302.053662026-04-16 https://scifaro.com/en/abs/synchrony-asynchrony-vs-stationary-mobile-the-latter-is-superior-in-theory-2302.055202023-02-14 https://scifaro.com/en/abs/a-linear-delay-algorithm-for-enumeration-of-2-edge-vertex-connected-induced-subgraphs-2302.055262023-02-14 https://scifaro.com/en/abs/algorithmically-effective-differentially-private-synthetic-data-2302.055522023-05-22 https://scifaro.com/en/abs/improved-competitive-ratio-for-edge-weighted-online-stochastic-matching-2302.056332023-12-01 https://scifaro.com/en/abs/an-eptas-for-budgeted-matching-and-budgeted-matroid-intersection-2302.056812023-02-14 https://scifaro.com/en/abs/maintaining-discrete-probability-distributions-in-practice-2302.056822023-10-19 https://scifaro.com/en/abs/fully-dynamic-exact-edge-connectivity-in-sublinear-time-2302.059512024-03-25 https://scifaro.com/en/abs/computing-truncated-metric-dimension-of-trees-2302.059602023-02-14 https://scifaro.com/en/abs/infinite-lewis-weights-in-spectral-graph-theory-2302.059662023-02-14 https://scifaro.com/en/abs/algorithmic-aspects-of-the-log-laplace-transform-and-a-non-euclidean-proximal-sampler-2302.060852025-12-24 https://scifaro.com/en/abs/maximum-coverage-in-sublinear-space-faster-2302.061372023-12-13 https://scifaro.com/en/abs/sparse-dimensionality-reduction-revisited-2302.061652023-02-14 https://scifaro.com/en/abs/near-optimal-dynamic-time-warping-on-run-length-encoded-strings-2302.062522023-02-14 https://scifaro.com/en/abs/freight-fast-streaming-hypergraph-partitioning-2302.062592023-02-14 https://scifaro.com/en/abs/engineering-a-preprocessor-for-symmetry-detection-2302.063512023-02-14 https://scifaro.com/en/abs/efficient-1-laplacian-solvers-for-well-shaped-simplicial-complexes-beyond-betti-numbers-and-collapsing-sequences-2302.064992023-08-01 https://scifaro.com/en/abs/random-majority-opinion-diffusion-stabilization-time-absorbing-states-and-influential-nodes-2302.067602023-02-15 https://scifaro.com/en/abs/improved-learning-augmented-algorithms-for-the-multi-option-ski-rental-problem-via-best-possible-competitive-analysis-2302.068322023-02-15 https://scifaro.com/en/abs/scheduling-coflows-for-minimizing-the-makespan-in-identical-parallel-networks-2302.068462023-06-16 https://scifaro.com/en/abs/distributed-symmetry-breaking-on-power-graphs-via-sparsification-2302.068782023-02-15 https://scifaro.com/en/abs/worst-case-and-probabilistic-analysis-of-the-2-opt-algorithm-for-the-tsp-2302.068892023-02-15 https://scifaro.com/en/abs/grouped-domination-parameterized-by-vertex-cover-twin-cover-and-beyond-2302.069832023-02-15 https://scifaro.com/en/abs/advances-on-strictly-delta-modular-ips-2302.070292023-02-15 https://scifaro.com/en/abs/arc-flags-meet-trip-based-public-transit-routing-2302.071682023-02-15 https://scifaro.com/en/abs/compressibility-aware-quantum-algorithms-on-strings-2302.072352023-02-15 https://scifaro.com/en/abs/forbidden-patterns-in-temporal-graphs-resulting-from-encounters-in-a-corridor-2302.076662024-09-20 https://scifaro.com/en/abs/fully-dynamic-clustering-and-diversity-maximization-in-doubling-metrics-2302.077712023-09-06 https://scifaro.com/en/abs/perfect-sampling-of-q-spin-systems-on-mathbb-z-2-via-weak-spatial-mixing-2302.078212023-02-16 https://scifaro.com/en/abs/maximum-independent-set-when-excluding-an-induced-minor-k-1-tk-2-and-tc-3-uplus-c-4-2302.081822026-01-01 https://scifaro.com/en/abs/incremental-1-epsilon-approximate-dynamic-matching-in-o-poly-1-epsilon-update-time-2302.084322023-07-13 https://scifaro.com/en/abs/query-centered-temporal-community-search-via-time-constrained-personalized-pagerank-2302.087402023-02-20 https://scifaro.com/en/abs/realizing-temporal-graphs-from-fastest-travel-times-2302.088602024-05-02 https://scifaro.com/en/abs/partitioning-the-bags-of-a-tree-decomposition-into-cliques-2302.088702023-02-20 https://scifaro.com/en/abs/uniformity-testing-over-hypergrids-with-subcube-conditioning-2302.090132023-07-27 https://scifaro.com/en/abs/faster-wavelet-tree-queries-2302.092392023-11-10 https://scifaro.com/en/abs/parameterized-max-min-feedback-vertex-set-2302.096042025-03-24 https://scifaro.com/en/abs/communication-efficient-distributed-graph-clustering-and-sparsification-under-duplication-models-2302.096522023-02-21 https://scifaro.com/en/abs/classification-via-two-way-comparisons-2302.096922025-01-28 https://scifaro.com/en/abs/fully-dynamic-k-center-in-low-dimensions-via-approximate-furthest-neighbors-2302.097372023-02-21 https://scifaro.com/en/abs/fast-algorithms-via-dynamic-oracle-matroids-2302.097962023-04-28 https://scifaro.com/en/abs/the-continuous-time-joint-replenishment-problem-epsilon-optimal-policies-via-pairwise-alignment-2302.099412023-02-21 https://scifaro.com/en/abs/a-vectorised-packing-algorithm-for-efficient-generation-of-custom-traffic-matrices-2302.099702023-03-16 https://scifaro.com/en/abs/denseqmc-an-efficient-bit-slice-implementation-of-the-quine-mccluskey-algorithm-2302.100832023-02-21 https://scifaro.com/en/abs/approximating-bin-packing-with-conflict-graphs-via-maximization-techniques-2302.106132023-02-22 https://scifaro.com/en/abs/new-width-parameters-for-independent-set-one-sided-mim-width-and-neighbor-depth-2302.106432023-08-01 https://scifaro.com/en/abs/robust-mean-estimation-without-moments-for-symmetric-distributions-2302.108442023-11-09 https://scifaro.com/en/abs/the-target-charging-technique-for-privacy-accounting-across-interactive-computations-2302.110442023-04-13 https://scifaro.com/en/abs/differentially-private-l-2-heavy-hitters-in-the-sliding-window-model-2302.110812023-02-23 https://scifaro.com/en/abs/improved-coresets-for-clustering-with-capacity-and-fairness-constraints-2302.111512023-07-17 https://scifaro.com/en/abs/dynamic-debt-swapping-in-financial-networks-2302.112502026-01-30 https://scifaro.com/en/abs/approximation-ineffectiveness-of-a-tour-untangling-heuristic-2302.112642023-08-23 https://scifaro.com/en/abs/the-power-of-uniform-sampling-for-k-median-2302.113392023-02-23 https://scifaro.com/en/abs/differentially-private-continual-release-of-histograms-and-related-queries-2302.113412025-03-11 https://scifaro.com/en/abs/degrees-and-network-design-new-problems-and-approximations-2302.114752023-02-23 https://scifaro.com/en/abs/pattern-detection-in-ordered-graphs-2302.116192023-02-24 https://scifaro.com/en/abs/finding-a-small-vertex-cut-on-distributed-networks-2302.116512023-02-24 https://scifaro.com/en/abs/online-minimum-spanning-trees-with-weight-predictions-2302.120292023-02-24 https://scifaro.com/en/abs/a-simple-division-free-algorithm-for-computing-pfaffians-2302.120812023-02-24 https://scifaro.com/en/abs/warehouse-problem-with-bounds-fixed-costs-and-complementarity-constraints-2302.121362023-02-24 https://scifaro.com/en/abs/using-colors-and-sketches-to-count-subgraphs-in-a-streaming-graph-2302.122102023-02-24 https://scifaro.com/en/abs/beyond-moments-robustly-learning-affine-transformations-with-asymptotically-optimal-error-2302.122892023-02-27 https://scifaro.com/en/abs/optimal-bounds-for-noisy-sorting-2302.124402023-03-16 https://scifaro.com/en/abs/k-center-clustering-with-outliers-in-the-mpc-and-streaming-model-2302.128112023-02-27 https://scifaro.com/en/abs/limited-query-graph-connectivity-test-2302.130362023-12-19 https://scifaro.com/en/abs/mms-allocations-of-chores-with-connectivity-constraints-new-methods-and-new-results-2302.132242023-02-28 https://scifaro.com/en/abs/large-block-modular-addition-checksum-algorithms-2302.134322023-04-27 https://scifaro.com/en/abs/random-order-enumeration-for-self-reducible-np-problems-2302.135492023-02-28 https://scifaro.com/en/abs/dispatching-point-selection-for-a-drone-based-delivery-system-operating-in-a-mixed-euclidean-manhattan-grid-2302.135522023-02-28 https://scifaro.com/en/abs/contracting-edges-to-destroy-a-pattern-a-complexity-study-2302.136052023-07-26 https://scifaro.com/en/abs/3-coloring-in-time-o-1-3217-n-2302.136442023-02-28 https://scifaro.com/en/abs/online-interval-scheduling-with-predictions-2302.137012025-01-24 https://scifaro.com/en/abs/on-coresets-for-clustering-in-small-dimensional-euclidean-spaces-2302.137372023-02-28 https://scifaro.com/en/abs/an-algorithm-for-geo-distributed-and-redundant-storage-in-garage-2302.137982023-02-28 https://scifaro.com/en/abs/polynomial-delay-generation-of-functional-digraphs-up-to-isomorphism-2302.138322024-09-04 https://scifaro.com/en/abs/tight-algorithms-for-connectivity-problems-parameterized-by-modular-treewidth-2302.141282023-03-01 https://scifaro.com/en/abs/signal-propagation-in-double-edged-relays-2302.141682023-03-07 https://scifaro.com/en/abs/massively-parallel-computation-in-a-heterogeneous-regime-2302.146922023-03-01 https://scifaro.com/en/abs/parameterized-complexity-of-vertex-splitting-to-pathwidth-at-most-1-2302.147252023-07-12 https://scifaro.com/en/abs/dag-inducing-problems-and-algorithms-2302.148342024-04-11 https://scifaro.com/en/abs/computing-all-restricted-skyline-probabilities-on-uncertain-datasets-2303.002592024-01-15 https://scifaro.com/en/abs/sampling-with-barriers-faster-mixing-via-lewis-weights-2303.004802023-04-20 https://scifaro.com/en/abs/a-linear-time-algorithm-for-linearizing-quadratic-and-higher-order-shortest-path-problems-2303.005692023-03-02 https://scifaro.com/en/abs/predictive-flows-for-faster-ford-fulkerson-2303.008372023-03-03 https://scifaro.com/en/abs/pandora-s-problem-with-combinatorial-cost-2303.010782024-02-20 https://scifaro.com/en/abs/solving-distance-constrained-labeling-problems-for-small-diameter-graphs-via-tsp-2303.012902023-03-03 https://scifaro.com/en/abs/improved-algorithms-for-monotone-moldable-job-scheduling-using-compression-and-convolution-2303.014142023-03-03 https://scifaro.com/en/abs/improved-space-bounds-for-learning-with-experts-2303.014532023-03-03 https://scifaro.com/en/abs/faster-exact-and-approximation-algorithms-for-packing-and-covering-matroids-via-push-relabel-2303.014782023-03-03 https://scifaro.com/en/abs/near-optimal-memory-regret-tradeoff-for-online-learning-2303.016732023-03-10 https://scifaro.com/en/abs/streaming-algorithms-for-learning-with-experts-deterministic-versus-robust-2303.017092023-03-06 https://scifaro.com/en/abs/tight-bounds-for-the-sensitivity-of-cdawgs-with-left-end-edits-2303.017262025-01-28 https://scifaro.com/en/abs/linear-space-data-structures-for-finite-groups-with-constant-query-time-2303.019572023-03-06 https://scifaro.com/en/abs/on-maximum-bipartite-matching-with-separation-2303.022832023-03-20 https://scifaro.com/en/abs/efficient-maximal-cliques-enumeration-in-weakly-closed-graphs-2303.023902023-06-23 https://scifaro.com/en/abs/optimizing-low-dimensional-functions-over-the-integers-2303.024742023-03-07 https://scifaro.com/en/abs/electrical-flows-for-polylogarithmic-competitive-oblivious-routing-2303.024912023-12-14 https://scifaro.com/en/abs/expansion-lemma-variations-and-applications-to-polynomial-time-preprocessing-2303.026872023-03-07 https://scifaro.com/en/abs/a-simple-2-approximation-for-maximum-leaf-spanning-tree-2303.031252024-04-02 https://scifaro.com/en/abs/fairness-aware-maximal-biclique-enumeration-on-bipartite-graphs-2303.037052023-03-08 https://scifaro.com/en/abs/diversity-embeddings-and-the-hypergraph-sparsest-cut-2303.041992023-03-09 https://scifaro.com/en/abs/investigating-the-complexity-of-the-double-distance-problems-2303.042052023-04-04 https://scifaro.com/en/abs/change-a-bit-to-save-bytes-compression-for-floating-point-time-series-data-2303.044782023-08-29 https://scifaro.com/en/abs/b-treaps-revised-write-efficient-randomized-block-search-trees-with-high-load-2303.047222023-03-09 https://scifaro.com/en/abs/spatio-temporal-trajectory-similarity-measures-a-comprehensive-survey-and-quantitative-study-2303.050122023-03-20 https://scifaro.com/en/abs/robust-optimization-with-belief-functions-2303.050672023-03-10 https://scifaro.com/en/abs/distributed-half-integral-matching-and-beyond-2303.052502023-07-18 https://scifaro.com/en/abs/elastic-founder-graphs-improved-and-enhanced-2303.053362023-03-10 https://scifaro.com/en/abs/fast-algorithms-for-vizing-s-theorem-on-bounded-degree-graphs-2303.054082025-08-06 https://scifaro.com/en/abs/optimal-hash-exact-string-matching-algorithms-2303.057992023-03-13 https://scifaro.com/en/abs/faster-matroid-partition-algorithms-2303.059202023-12-04 https://scifaro.com/en/abs/simple-and-efficient-four-cycle-counting-on-sparse-graphs-2303.060902024-10-01 https://scifaro.com/en/abs/bootstrapping-dynamic-distance-oracles-2303.061022023-03-13 https://scifaro.com/en/abs/any-order-online-interval-selection-2303.061272023-05-29 https://scifaro.com/en/abs/generalizing-greenwald-khanna-streaming-quantile-summaries-for-weighted-inputs-2303.062882023-03-14 https://scifaro.com/en/abs/binary-search-with-distance-dependent-costs-2303.064882023-03-14 https://scifaro.com/en/abs/optimal-square-detection-over-general-alphabets-2303.072292023-03-14 https://scifaro.com/en/abs/computational-bounds-for-the-2048-game-2303.072662023-03-14 https://scifaro.com/en/abs/finding-diverse-minimum-s-t-cuts-2303.072902024-09-19 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-independent-packing-problems-on-fractionally-tree-independence-number-fragile-graphs-2303.074442025-04-23 https://scifaro.com/en/abs/fpt-constant-approximations-for-capacitated-clustering-to-minimize-the-sum-of-cluster-radii-2303.079232024-02-21 https://scifaro.com/en/abs/interlacing-polynomial-method-for-the-column-subset-selection-problem-2303.079842024-01-09 https://scifaro.com/en/abs/logarithmic-weisfeiler-leman-and-treewidth-2303.079852024-04-26 https://scifaro.com/en/abs/parameterised-approximation-of-the-fixation-probability-of-the-dominant-mutation-in-the-multi-type-moran-process-2303.081182023-03-15 https://scifaro.com/en/abs/a-2-opt-algorithm-for-locally-optimal-set-partition-optimization-2303.082192023-03-16 https://scifaro.com/en/abs/process-equivalence-problems-as-energy-games-2303.089042023-07-21 https://scifaro.com/en/abs/online-bipartite-matching-in-the-probe-commit-model-2303.089082024-12-16 https://scifaro.com/en/abs/high-dimensional-approximate-nearest-neighbor-search-with-reliable-and-efficient-distance-comparison-operations-2303.098552023-03-20 https://scifaro.com/en/abs/a-comparison-of-dijkstra-s-algorithm-using-fibonacci-heaps-binary-heaps-and-self-balancing-binary-trees-2303.100342023-03-22 https://scifaro.com/en/abs/explorable-families-of-graphs-2303.103942023-03-21 https://scifaro.com/en/abs/metric-dimension-parameterized-by-treewidth-in-chordal-graphs-2303.106462023-03-21 https://scifaro.com/en/abs/sparse-partial-tracing-2303.107842023-03-21 https://scifaro.com/en/abs/an-improved-exact-algorithm-for-knot-free-vertex-deletion-2303.108662023-03-21 https://scifaro.com/en/abs/on-the-maximal-independent-sets-of-k-mers-with-the-edit-distance-2303.109262023-03-21 https://scifaro.com/en/abs/optimal-fully-dynamic-k-center-clustering-for-adaptive-and-oblivious-adversaries-2303.118432023-03-22 https://scifaro.com/en/abs/high-probability-bounds-for-stochastic-continuous-submodular-maximization-2303.119372023-03-22 https://scifaro.com/en/abs/a-general-algorithm-for-solving-rank-one-matrix-sensing-2303.122982023-03-23 https://scifaro.com/en/abs/critical-relaxed-stable-matchings-with-ties-in-the-many-to-many-setting-2303.123252026-03-10 https://scifaro.com/en/abs/almost-optimal-sublinear-additive-spanners-2303.127682024-10-18 https://scifaro.com/en/abs/polyhedral-aspects-of-feedback-vertex-set-and-pseudoforest-deletion-set-2303.128502024-05-31 https://scifaro.com/en/abs/combinatorial-parameterized-algorithms-for-chemical-descriptors-based-on-molecular-graph-sparsity-2303.132792025-08-12 https://scifaro.com/en/abs/the-limited-memory-recursive-variational-gaussian-approximation-l-rvga-2303.141952023-03-28 https://scifaro.com/en/abs/exact-short-products-from-truncated-multipliers-2303.143212024-05-07 https://scifaro.com/en/abs/orbits-schemes-and-dynamic-programming-procedures-for-the-tsp-4-opt-neighborhood-2303.144242023-03-28 https://scifaro.com/en/abs/a-survey-on-the-densest-subgraph-problem-and-its-variants-2303.144672024-04-19 https://scifaro.com/en/abs/fredman-s-trick-meets-dominance-product-fine-grained-complexity-of-unweighted-apsp-3sum-counting-and-more-2303.145722023-03-28 https://scifaro.com/en/abs/similarity-analysis-of-dna-sequences-through-local-distribution-of-nucleotides-in-strategic-neighborhood-2303.149942024-09-27 https://scifaro.com/en/abs/online-k-median-with-consistent-clusters-2303.153792023-03-28 https://scifaro.com/en/abs/faster-isomorphism-for-p-groups-of-class-2-and-exponent-p-2303.154122023-03-28 https://scifaro.com/en/abs/randomized-rounding-algorithms-for-large-scale-unsplittable-flow-problems-2303.155502023-03-29 https://scifaro.com/en/abs/overcoming-probabilistic-faults-in-disoriented-linear-search-2303.156082023-03-29 https://scifaro.com/en/abs/algorithms-for-subgraph-complementation-to-some-classes-of-graphs-2303.158732023-03-29 https://scifaro.com/en/abs/faster-deterministic-distributed-mis-and-approximate-matching-2303.160432023-03-29 https://scifaro.com/en/abs/universal-coating-by-3d-hybrid-programmable-matter-2303.161802024-02-14 https://scifaro.com/en/abs/lower-bounds-for-pseudo-deterministic-counting-in-a-stream-2303.162872023-05-16 https://scifaro.com/en/abs/a-subquadratic-time-algorithm-for-the-weighted-k-center-problem-on-cactus-graphs-2303.172042023-03-31 https://scifaro.com/en/abs/directed-capacity-preserving-subgraphs-hardness-and-exact-polynomial-algorithms-2303.172742025-02-13 https://scifaro.com/en/abs/advice-complexity-bounds-for-online-delayed-f-node-h-node-and-h-edge-deletion-problems-2303.173462023-03-31 https://scifaro.com/en/abs/the-online-pause-and-resume-problem-optimal-algorithms-and-an-application-to-carbon-aware-load-shifting-2303.175512024-01-17 https://scifaro.com/en/abs/the-many-qualities-of-a-new-directly-accessible-compression-scheme-2303.180632023-04-03 https://scifaro.com/en/abs/almost-linear-constant-factor-sketching-for-ell-1-and-logistic-regression-2304.000512023-04-05 https://scifaro.com/en/abs/a-note-on-the-complexity-of-maximizing-temporal-reachability-via-edge-temporalisation-of-directed-graphs-2304.008172023-04-04 https://scifaro.com/en/abs/compressed-indexing-for-consecutive-occurrences-2304.008872023-04-04 https://scifaro.com/en/abs/a-greedy-approach-for-increased-vehicle-utilization-in-ridesharing-networks-2304.012252024-01-23 https://scifaro.com/en/abs/distribution-testing-under-the-parity-trace-2304.013742023-04-05 https://scifaro.com/en/abs/a-d-1-2-o-1-monotonicity-tester-for-boolean-functions-on-d-dimensional-hypergrids-2304.014162025-05-20 https://scifaro.com/en/abs/tight-space-lower-bound-for-pseudo-deterministic-approximate-counting-2304.014382024-10-08 https://scifaro.com/en/abs/minimum-cost-flow-in-the-congest-model-2304.016002023-04-05 https://scifaro.com/en/abs/algorithms-for-the-generalized-poset-sorting-problem-2304.016232023-07-18 https://scifaro.com/en/abs/dynamic-treewidth-2304.017442023-04-05 https://scifaro.com/en/abs/vc-set-systems-in-minor-free-di-graphs-and-applications-2304.017902023-11-07 https://scifaro.com/en/abs/chasing-positive-bodies-2304.018892024-05-08 https://scifaro.com/en/abs/strong-spatial-mixing-for-colorings-on-trees-and-its-algorithmic-applications-2304.019542024-02-14 https://scifaro.com/en/abs/online-time-windows-tsp-with-predictions-2304.019582023-04-05 https://scifaro.com/en/abs/set-covering-with-our-eyes-wide-shut-2304.020632023-04-06 https://scifaro.com/en/abs/determinantal-sieving-2304.020912025-10-08 https://scifaro.com/en/abs/the-bit-complexity-of-efficient-continuous-optimization-2304.021242023-04-06 https://scifaro.com/en/abs/folklore-sampling-is-optimal-for-exact-hopsets-confirming-the-sqrt-n-barrier-2304.021932024-04-23 https://scifaro.com/en/abs/algorithm-and-hardness-for-dynamic-attention-maintenance-in-large-language-models-2304.022072023-04-06 https://scifaro.com/en/abs/optimal-sketching-bounds-for-sparse-linear-regression-2304.022612023-04-06 https://scifaro.com/en/abs/the-laplacian-paradigm-in-deterministic-congested-clique-2304.023152023-04-06 https://scifaro.com/en/abs/improved-analysis-of-two-algorithms-for-min-weighted-sum-bin-packing-2304.024982023-04-06 https://scifaro.com/en/abs/a-simple-1-5-approximation-algorithm-for-a-wide-range-of-max-smti-problems-2304.025582024-02-23 https://scifaro.com/en/abs/fast-computation-of-approximate-weak-common-intervals-in-multiple-indeterminate-strings-2304.026572023-04-07 https://scifaro.com/en/abs/agnostic-proper-learning-of-monotone-functions-beyond-the-black-box-correction-barrier-2304.027002023-05-25 https://scifaro.com/en/abs/parameterized-approximation-schemes-for-clustering-with-general-norm-objectives-2304.031462023-04-07 https://scifaro.com/en/abs/krylov-methods-are-nearly-optimal-for-low-rank-approximation-2304.031912023-04-07 https://scifaro.com/en/abs/parameterized-algorithms-for-eccentricity-shortest-path-problem-2304.032332023-04-07 https://scifaro.com/en/abs/leveraging-reusability-improved-competitive-ratio-of-greedy-for-reusable-resources-2304.033772023-04-10 https://scifaro.com/en/abs/convex-minimization-with-integer-minima-in-widetilde-o-n-4-time-2304.034262023-11-15 https://scifaro.com/en/abs/on-rotation-distance-of-rank-bounded-trees-2304.039852026-04-08 https://scifaro.com/en/abs/prophet-inequalities-separating-random-order-from-order-selection-2304.040242024-11-05 https://scifaro.com/en/abs/a-simple-and-efficient-preprocessing-step-for-convex-hull-problem-2304.041962024-03-19 https://scifaro.com/en/abs/randomized-and-deterministic-attention-sparsification-algorithms-for-over-parameterized-feature-dimension-2304.043972023-04-11 https://scifaro.com/en/abs/path-reporting-distance-oracles-with-logarithmic-stretch-and-size-o-n-loglog-n-2304.044452024-08-27 https://scifaro.com/en/abs/interior-point-methods-with-a-gradient-oracle-2304.045502023-04-11 https://scifaro.com/en/abs/ranking-and-unranking-k-subsequence-universal-words-2304.045832023-04-11 https://scifaro.com/en/abs/almost-ruling-out-seth-lower-bounds-for-all-pairs-max-flow-2304.046672024-11-12 https://scifaro.com/en/abs/efficient-distributed-decomposition-and-routing-algorithms-in-minor-free-networks-and-their-applications-2304.046992026-03-25 https://scifaro.com/en/abs/achieving-long-term-fairness-in-submodular-maximization-through-randomization-2304.047002023-04-11 https://scifaro.com/en/abs/an-associativity-threshold-phenomenon-in-set-associative-caches-2304.049542023-04-12 https://scifaro.com/en/abs/longest-common-subsequence-with-gap-constraints-2304.052702023-06-05 https://scifaro.com/en/abs/negative-weight-single-source-shortest-paths-in-near-linear-time-now-faster-2304.052792023-04-12 https://scifaro.com/en/abs/when-should-you-wait-before-updating-toward-a-robustness-refinement-2304.058312023-04-13 https://scifaro.com/en/abs/on-parallel-k-center-clustering-2304.058832026-04-21 https://scifaro.com/en/abs/node-differentially-private-estimation-of-the-number-of-connected-components-2304.058902023-04-17 https://scifaro.com/en/abs/locality-via-global-ties-stability-of-the-2-core-against-misspecification-2304.061702023-04-14 https://scifaro.com/en/abs/universally-optimal-deterministic-broadcasting-in-the-hybrid-distributed-model-2304.063172023-04-14 https://scifaro.com/en/abs/load-balanced-demand-distribution-under-overload-penalties-2304.065432023-04-14 https://scifaro.com/en/abs/beyond-the-quadratic-time-barrier-for-network-unreliability-2304.065522023-07-21 https://scifaro.com/en/abs/list-update-with-delays-or-time-windows-2304.065652024-04-30 https://scifaro.com/en/abs/solving-tensor-low-cycle-rank-approximation-2304.065942023-04-14 https://scifaro.com/en/abs/improved-approximations-for-relative-survivable-network-design-2304.066562023-10-04 https://scifaro.com/en/abs/on-streaming-approximation-algorithms-for-constraint-satisfaction-problems-2304.066642023-04-14 https://scifaro.com/en/abs/a-polynomial-time-pure-differentially-private-estimator-for-binary-product-distributions-2304.067872024-01-29 https://scifaro.com/en/abs/pseudorandom-hashing-for-space-bounded-computation-with-applications-in-streaming-2304.068532024-01-05 https://scifaro.com/en/abs/the-longest-subsequence-repeated-subsequence-problem-2304.068622023-09-01 https://scifaro.com/en/abs/near-tight-shortest-paths-in-the-hybrid-model-2304.071072023-07-03 https://scifaro.com/en/abs/optimal-uncoordinated-unique-ids-2304.071092023-04-17 https://scifaro.com/en/abs/planar-and-minor-free-metrics-embed-into-metrics-of-polylogarithmic-treewidth-with-expected-multiplicative-distortion-arbitrarily-close-to-1-2304.072682023-04-17 https://scifaro.com/en/abs/fully-dynamic-shortest-path-reporting-against-an-adaptive-adversary-2304.074032023-11-28 https://scifaro.com/en/abs/robust-algorithms-on-adaptive-inputs-from-bounded-adversaries-2304.074132023-04-18 https://scifaro.com/en/abs/fully-scalable-massively-parallel-algorithms-for-embedded-planar-graphs-2304.074412023-10-31 https://scifaro.com/en/abs/learned-interpolation-for-better-streaming-quantile-approximation-with-worst-case-guarantees-2304.076522023-04-18 https://scifaro.com/en/abs/thin-trees-for-laminar-families-2304.076742023-04-18 https://scifaro.com/en/abs/an-algorithmic-approach-to-address-course-enrollment-challenges-2304.079822026-02-26 https://scifaro.com/en/abs/detection-of-dense-subhypergraphs-by-low-degree-polynomials-2304.081352023-04-18 https://scifaro.com/en/abs/finding-a-path-of-length-k-an-expository-2304.083002023-04-18 https://scifaro.com/en/abs/mantra-temporal-betweenness-centrality-approximation-through-sampling-2304.083562024-04-09 https://scifaro.com/en/abs/lossy-compressor-preserving-variant-calling-through-extended-bwt-2304.085342023-04-19 https://scifaro.com/en/abs/revisiting-block-diagonal-sdp-relaxations-for-the-clique-number-of-the-paley-graphs-2304.086152023-09-19 https://scifaro.com/en/abs/subcubic-algorithm-for-unweighted-unrooted-tree-edit-distance-2304.086322023-09-13 https://scifaro.com/en/abs/dynamic-vector-bin-packing-for-online-resource-allocation-in-the-cloud-2304.086482023-04-19 https://scifaro.com/en/abs/super-logarithmic-lower-bounds-for-dynamic-graph-problems-2304.087452023-04-19 https://scifaro.com/en/abs/parallel-greedy-spanners-2304.088922023-08-03 https://scifaro.com/en/abs/random-cuts-are-optimal-for-explainable-k-medians-2304.091132023-04-19 https://scifaro.com/en/abs/new-subset-selection-algorithms-for-low-rank-approximation-offline-and-online-2304.092172023-04-20 https://scifaro.com/en/abs/optimal-eigenvalue-approximation-via-sketching-2304.092812023-04-20 https://scifaro.com/en/abs/sliding-block-hashing-slick-basic-algorithmic-ideas-2304.092832023-04-20 https://scifaro.com/en/abs/a-new-deterministic-algorithm-for-fully-dynamic-all-pairs-shortest-paths-2304.093212023-04-20 https://scifaro.com/en/abs/provably-efficient-and-internally-deterministic-parallel-union-find-2304.093312023-04-24 https://scifaro.com/en/abs/uniform-generation-of-temporal-graphs-with-given-degrees-2304.096542023-10-11 https://scifaro.com/en/abs/the-price-of-explainability-for-clustering-2304.097432023-04-20 https://scifaro.com/en/abs/nearly-work-efficient-parallel-dfs-in-undirected-graphs-2304.097742023-04-20 https://scifaro.com/en/abs/temporal-betweenness-centrality-on-shortest-paths-2304.097912023-06-07 https://scifaro.com/en/abs/high-performance-and-flexible-parallel-algorithms-for-semisort-and-related-problems-2304.100782023-04-21 https://scifaro.com/en/abs/polylog-competitive-algorithms-for-dynamic-balanced-graph-partitioning-for-ring-demands-2304.103502023-04-21 https://scifaro.com/en/abs/new-lower-bounds-for-adaptive-tolerant-junta-testing-2304.106472023-04-24 https://scifaro.com/en/abs/faster-prefix-sorting-algorithms-for-deterministic-finite-automata-2304.109622023-04-24 https://scifaro.com/en/abs/solving-the-list-coloring-problem-through-a-branch-and-price-algorithm-2304.109952024-07-11 https://scifaro.com/en/abs/learned-monotone-minimal-perfect-hashing-2304.110122023-08-31 https://scifaro.com/en/abs/high-accuracy-multicommodity-flows-via-iterative-refinement-2304.112522023-04-25 https://scifaro.com/en/abs/euclidean-capacitated-vehicle-routing-in-random-setting-a-1-55-approximation-algorithm-2304.112812023-04-25 https://scifaro.com/en/abs/sorting-wild-pigs-2304.119522023-04-25 https://scifaro.com/en/abs/low-memory-algorithms-for-online-and-w-streaming-edge-coloring-2304.122852023-06-01 https://scifaro.com/en/abs/median-of-heaps-linear-time-selection-by-recursively-constructing-binary-heaps-2304.123132023-04-25 https://scifaro.com/en/abs/recognizing-and-generating-unswitchable-graphs-2304.123812023-04-26 https://scifaro.com/en/abs/fast-continuous-subgraph-matching-over-streaming-graphs-via-backtracking-reduction-2304.126102023-04-26 https://scifaro.com/en/abs/towards-generating-hop-constrained-s-t-simple-path-graphs-2304.126562023-04-26 https://scifaro.com/en/abs/an-approximation-algorithm-for-covering-vertices-by-4-paths-2304.127792023-04-26 https://scifaro.com/en/abs/the-incremental-knapsack-problem-with-monotone-submodular-all-or-nothing-profits-2304.129672023-04-26 https://scifaro.com/en/abs/faster-high-accuracy-multi-commodity-flow-from-single-commodity-techniques-2304.129922023-04-26 https://scifaro.com/en/abs/an-approximation-algorithm-for-two-edge-connected-subgraph-problem-via-triangle-free-two-edge-cover-2304.132282023-04-27 https://scifaro.com/en/abs/acceleration-for-timing-aware-gate-level-logic-simulation-with-one-pass-gpu-parallelism-2304.133982023-04-27 https://scifaro.com/en/abs/an-improved-modular-addition-checksum-algorithm-2304.134962024-04-01 https://scifaro.com/en/abs/efficient-approximation-for-subgraph-hitting-problems-in-sparse-graphs-and-geometric-intersection-graphs-2304.136952023-12-05 https://scifaro.com/en/abs/an-fptas-for-budgeted-laminar-matroid-independent-set-2304.139842023-04-28 https://scifaro.com/en/abs/a-barrier-for-further-approximating-sorting-by-transpositions-2304.139962023-07-11 https://scifaro.com/en/abs/improved-online-scheduling-of-moldable-task-graphs-under-common-speedup-models-2304.141272023-04-28 https://scifaro.com/en/abs/compact-distance-oracles-with-large-sensitivity-and-low-stretch-2304.141842023-04-28 https://scifaro.com/en/abs/fast-sampling-of-b-matchings-and-b-edge-covers-2304.142892023-08-02 https://scifaro.com/en/abs/the-covering-canadian-traveller-problem-revisited-2304.143192023-04-28 https://scifaro.com/en/abs/a-simple-and-efficient-parallel-laplacian-solver-2304.143452023-04-28 https://scifaro.com/en/abs/structural-parameterizations-for-two-bounded-degree-problems-revisited-2304.147242024-05-07 https://scifaro.com/en/abs/finding-agreement-cherry-reduced-subnetworks-in-level-1-networks-2305.000332023-05-02 https://scifaro.com/en/abs/faster-submodular-maximization-for-several-classes-of-matroids-2305.001222023-05-02 https://scifaro.com/en/abs/clustering-what-matters-in-constrained-settings-2305.001752025-04-22 https://scifaro.com/en/abs/uniqueness-and-rapid-mixing-in-the-bipartite-hardcore-model-2305.001862023-05-02 https://scifaro.com/en/abs/streaming-k-edit-approximate-pattern-matching-via-string-decomposition-2305.006152023-05-02 https://scifaro.com/en/abs/a-spectral-algorithm-for-list-decodable-covariance-estimation-in-relative-frobenius-norm-2305.009662023-05-02 https://scifaro.com/en/abs/approximating-submodular-k-partition-via-principal-partition-sequence-2305.010692023-07-11 https://scifaro.com/en/abs/robust-communication-complexity-of-matching-edcs-achieves-5-6-approximation-2305.010702023-05-03 https://scifaro.com/en/abs/temporal-betweenness-centrality-on-shortest-walks-variants-2305.010802024-02-13 https://scifaro.com/en/abs/an-update-intensive-lsm-based-r-tree-index-2305.010872023-05-03 https://scifaro.com/en/abs/complexity-framework-for-forbidden-subgraphs-iii-when-problems-are-tractable-on-subcubic-graphs-2305.011042023-05-03 https://scifaro.com/en/abs/unbounded-differentially-private-quantile-and-maximum-estimation-2305.011772023-10-17 https://scifaro.com/en/abs/incremental-maximization-via-continuization-2305.013102023-05-03 https://scifaro.com/en/abs/two-sets-cut-uncut-on-planar-graphs-2305.013142023-05-03 https://scifaro.com/en/abs/the-complexity-of-distributed-approximation-of-packing-and-covering-integer-linear-programs-2305.013242023-07-25 https://scifaro.com/en/abs/sample-based-distance-approximation-for-subsequence-freeness-2305.013582023-05-03 https://scifaro.com/en/abs/multi-layer-peeling-for-linear-arrangement-and-hierarchical-clustering-2305.013672023-05-03 https://scifaro.com/en/abs/a-subquadratic-bound-for-online-bisection-2305.014202024-03-19 https://scifaro.com/en/abs/fpt-approximations-for-capacitated-fair-clustering-with-outliers-2305.014712023-05-03 https://scifaro.com/en/abs/faster-0-1-knapsack-via-near-convex-min-plus-convolution-2305.015932023-10-24 https://scifaro.com/en/abs/randomized-algorithms-for-fully-online-multiprocessor-scheduling-with-testing-2305.016052023-06-29 https://scifaro.com/en/abs/streaming-edge-coloring-with-asymptotically-optimal-colors-2305.017142023-05-04 https://scifaro.com/en/abs/connectivity-queries-under-vertex-failures-not-optimal-but-practical-2305.017562023-09-06 https://scifaro.com/en/abs/experimental-design-for-any-p-norm-2305.019422023-05-04 https://scifaro.com/en/abs/computing-paths-of-large-rank-in-planar-frameworks-deterministically-2305.019932023-05-04 https://scifaro.com/en/abs/approximating-long-cycle-above-dirac-s-guarantee-2305.020112023-05-04 https://scifaro.com/en/abs/algorithmic-theory-of-qubit-routing-2305.020592023-05-16 https://scifaro.com/en/abs/an-efficient-algorithm-for-all-pairs-bounded-edge-connectivity-2305.021322023-05-04 https://scifaro.com/en/abs/minimum-chain-cover-in-almost-linear-time-2305.021662023-05-04 https://scifaro.com/en/abs/learning-augmented-online-tsp-on-rings-trees-flowers-and-almost-everywhere-else-2305.021692023-05-04 https://scifaro.com/en/abs/a-4-3-approximation-for-2-vertex-connectivity-2305.022402025-07-02 https://scifaro.com/en/abs/triangle-counting-with-local-edge-differential-privacy-2305.022632025-08-18 https://scifaro.com/en/abs/perfect-sampling-for-hard-spheres-from-strong-spatial-mixing-2305.024502024-08-22 https://scifaro.com/en/abs/efficient-caching-with-reserves-via-marking-2305.025082023-05-05 https://scifaro.com/en/abs/prefix-sorting-dfas-a-recursive-algorithm-2305.025262023-10-10 https://scifaro.com/en/abs/on-the-unreasonable-effectiveness-of-single-vector-krylov-methods-for-low-rank-approximation-2305.025352023-11-08 https://scifaro.com/en/abs/alpha-i-metric-graphs-radius-diameter-and-all-eccentricities-2305.025452023-05-05 https://scifaro.com/en/abs/local-computation-algorithms-for-hypergraph-coloring-following-beck-s-approach-full-version-2305.028312023-05-05 https://scifaro.com/en/abs/distributed-construction-of-near-optimal-compact-routing-schemes-for-planar-graphs-2305.028542023-05-15 https://scifaro.com/en/abs/coloring-tournaments-with-few-colors-algorithms-and-complexity-2305.029222024-11-25 https://scifaro.com/en/abs/what-else-can-voronoi-diagrams-do-for-diameter-in-planar-graphs-2305.029462023-07-06 https://scifaro.com/en/abs/convergence-to-lexicographically-optimal-base-in-a-contra-polymatroid-and-applications-to-densest-subgraph-and-tree-packing-2305.029872023-05-05 https://scifaro.com/en/abs/ranking-and-unranking-bordered-and-unbordered-words-2305.030002023-08-30 https://scifaro.com/en/abs/a-sparse-johnson-lindenstrauss-transform-using-fast-hashing-2305.031102023-05-08 https://scifaro.com/en/abs/testing-convex-truncation-2305.031462024-11-25 https://scifaro.com/en/abs/testing-and-learning-convex-sets-in-the-ternary-hypercube-2305.031942023-11-21 https://scifaro.com/en/abs/sum-of-local-effects-data-structures-for-separable-graphs-2305.032402023-05-08 https://scifaro.com/en/abs/tighter-approximation-for-the-uniform-cost-distance-steiner-tree-problem-2305.033812025-07-31 https://scifaro.com/en/abs/tight-bounds-for-chordal-interval-vertex-deletion-parameterized-by-treewidth-2305.034402025-01-31 https://scifaro.com/en/abs/fault-tolerant-st-diameter-oracles-2305.036972026-05-27 https://scifaro.com/en/abs/a-new-upper-bound-on-the-maximal-error-resilience-of-interactive-error-correcting-codes-2305.043762023-05-09 https://scifaro.com/en/abs/oblivious-algorithms-for-the-max-k-and-problem-2305.044382023-05-09 https://scifaro.com/en/abs/online-task-assignment-with-controllable-processing-time-2305.044532023-05-10 https://scifaro.com/en/abs/block-crossings-in-one-sided-tanglegrams-2305.046822023-05-09 https://scifaro.com/en/abs/cpma-an-efficient-batch-parallel-compressed-set-without-pointers-2305.050552024-02-20 https://scifaro.com/en/abs/memory-efficient-solutions-to-large-graph-mst-problems-2305.051212023-12-29 https://scifaro.com/en/abs/sorting-finite-automata-via-partition-refinement-2305.051292023-12-19 https://scifaro.com/en/abs/constant-competitiveness-for-random-assignment-matroid-secretary-without-knowing-the-matroid-2305.053532023-05-10 https://scifaro.com/en/abs/a-unified-approach-for-approximating-2-edge-connected-spanning-subgraph-and-2-vertex-connected-spanning-subgraph-2305.053982024-07-16 https://scifaro.com/en/abs/4-3-approximation-of-graphic-tsp-2305.054112024-11-05 https://scifaro.com/en/abs/fast-many-to-many-routing-for-ridesharing-with-multiple-pickup-and-dropoff-locations-2305.054172023-05-10 https://scifaro.com/en/abs/universal-matrix-sparsifiers-and-fast-deterministic-algorithms-for-linear-algebra-2305.058262024-01-15 https://scifaro.com/en/abs/constant-approximation-for-network-revenue-management-with-markovian-correlated-customer-arrivals-2305.058292023-10-16 https://scifaro.com/en/abs/acceleration-of-fm-index-queries-through-prefix-free-parsing-2305.058932023-05-11 https://scifaro.com/en/abs/average-awake-complexity-of-mis-and-matching-2305.061202023-05-11 https://scifaro.com/en/abs/optimal-mixing-of-the-down-up-walk-on-independent-sets-of-a-given-size-2305.061982023-05-11 https://scifaro.com/en/abs/a-near-optimal-deterministic-distributed-synchronizer-2305.064522023-05-12 https://scifaro.com/en/abs/optimal-algorithms-for-bounded-weighted-edit-distance-2305.066592023-10-25 https://scifaro.com/en/abs/hypergraph-dualization-with-fpt-delay-parameterized-by-the-degeneracy-and-dimension-2305.069742024-04-23 https://scifaro.com/en/abs/streaming-edge-coloring-with-subquadratic-palette-size-2305.070902024-04-18 https://scifaro.com/en/abs/learning-augmented-online-packet-scheduling-with-deadlines-2305.071642024-02-26 https://scifaro.com/en/abs/minimum-consistent-subset-for-trees-revisited-2305.072592023-05-15 https://scifaro.com/en/abs/reconfiguration-of-time-respecting-arborescences-2305.072622023-06-29 https://scifaro.com/en/abs/parameterized-approximation-for-robust-clustering-in-discrete-geometric-spaces-2305.073162024-09-17 https://scifaro.com/en/abs/matching-statistics-speed-up-bwt-construction-2305.073192023-05-15 https://scifaro.com/en/abs/the-2-3-set-packing-problem-and-a-frac-4-3-approximation-for-the-maximum-leaf-spanning-arborescence-problem-in-rooted-dags-2305.078082023-05-16 https://scifaro.com/en/abs/randomized-algorithm-for-the-maximum-profit-routing-problem-2305.078382023-05-16 https://scifaro.com/en/abs/fast-and-efficient-matching-algorithm-with-deadline-instances-2305.083532025-02-19 https://scifaro.com/en/abs/new-support-size-bounds-for-integer-programming-applied-to-makespan-minimization-on-uniformly-related-machines-2305.084322023-05-16 https://scifaro.com/en/abs/linear-sized-sparsifiers-via-near-linear-time-discrepancy-theory-2305.084342023-05-16 https://scifaro.com/en/abs/a-sweep-plane-algorithm-for-calculating-the-isolation-of-mountains-2305.084702023-05-16 https://scifaro.com/en/abs/sparsifying-sums-of-norms-2305.090492023-12-01 https://scifaro.com/en/abs/static-pricing-guarantees-for-queueing-systems-2305.091682025-12-09 https://scifaro.com/en/abs/lower-bounds-for-non-adaptive-shortest-path-relaxation-2305.092302023-05-17 https://scifaro.com/en/abs/sorting-and-hypergraph-orientation-under-uncertainty-with-predictions-2305.092452023-05-17 https://scifaro.com/en/abs/finding-maximal-exact-matches-in-graphs-2305.097522023-07-04 https://scifaro.com/en/abs/list-3-coloring-on-comb-convex-and-caterpillar-convex-bipartite-graphs-2305.101082023-12-14 https://scifaro.com/en/abs/linear-query-approximation-algorithms-for-non-monotone-submodular-maximization-under-knapsack-constraint-2305.102922023-07-11 https://scifaro.com/en/abs/cache-oblivious-parallel-convex-hull-in-the-binary-forking-model-2305.103892023-07-18 https://scifaro.com/en/abs/online-list-labeling-with-predictions-2305.105362023-06-21 https://scifaro.com/en/abs/fault-tolerant-consensus-in-quantum-networks-2305.106182023-05-19 https://scifaro.com/en/abs/online-resource-allocation-in-episodic-markov-decision-processes-2305.107442023-10-20 https://scifaro.com/en/abs/submodularity-gaps-for-selected-network-design-and-matching-problems-2305.109352023-05-19 https://scifaro.com/en/abs/noisy-gap-cycle-counting-strikes-back-random-order-streaming-lower-bounds-for-connected-components-and-beyond-2305.110532023-05-19 https://scifaro.com/en/abs/parameterized-complexity-of-equality-mincsp-2305.111312023-05-19 https://scifaro.com/en/abs/approximate-distance-sensitivity-oracles-in-subquadratic-space-2305.115802024-08-07 https://scifaro.com/en/abs/distributed-mis-with-low-energy-and-time-complexities-2305.116392023-05-24 https://scifaro.com/en/abs/deterministic-fault-tolerant-distributed-computing-in-linear-time-and-communication-2305.116442023-05-22 https://scifaro.com/en/abs/an-optimal-separation-between-two-property-testing-models-for-bounded-degree-directed-graphs-2305.130892023-05-23 https://scifaro.com/en/abs/error-tolerant-exact-query-learning-of-finite-set-partitions-with-same-cluster-oracle-2305.134022023-06-21 https://scifaro.com/en/abs/differentially-private-medians-and-interior-points-for-non-pathological-data-2305.134402023-05-24 https://scifaro.com/en/abs/single-pass-pivot-algorithm-for-correlation-clustering-keep-it-simple-2305.135602023-05-24 https://scifaro.com/en/abs/parameterized-complexity-classification-for-interval-constraints-2305.138892023-05-24 https://scifaro.com/en/abs/distributed-congest-algorithms-against-mobile-adversaries-2305.143002023-05-24 https://scifaro.com/en/abs/engineering-rank-select-data-structures-for-large-alphabet-strings-2305.144612024-05-03 https://scifaro.com/en/abs/deterministic-algorithmic-approaches-to-solve-generalised-wordle-2305.147562023-05-25 https://scifaro.com/en/abs/automated-tail-bound-analysis-for-probabilistic-recurrence-relations-2305.151042023-05-25 https://scifaro.com/en/abs/dynamic-constrained-submodular-optimization-with-polylogarithmic-update-time-2305.151922023-05-25 https://scifaro.com/en/abs/trading-prophets-2305.155662023-05-26 https://scifaro.com/en/abs/maximum-weight-independent-set-in-graphs-with-no-long-claws-in-quasi-polynomial-time-2305.157382025-09-24 https://scifaro.com/en/abs/maximizing-neutrality-in-news-ordering-2305.157902023-08-08 https://scifaro.com/en/abs/smoothed-complexity-of-swap-in-local-graph-partitioning-2305.158042023-05-26 https://scifaro.com/en/abs/online-and-streaming-algorithms-for-constrained-k-submodular-maximization-2305.160132023-05-26 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-spanning-centrality-2305.160862023-05-31 https://scifaro.com/en/abs/polylogarithmic-approximation-for-robust-s-t-path-2305.164392024-06-25 https://scifaro.com/en/abs/caramel-a-succinct-read-only-lookup-table-via-compressed-static-functions-2305.165452026-03-30 https://scifaro.com/en/abs/sublinear-space-streaming-algorithms-for-estimating-graph-parameters-on-sparse-graphs-2305.168152023-05-29 https://scifaro.com/en/abs/universal-weak-coreset-2305.168902023-05-29 https://scifaro.com/en/abs/feature-adaptation-for-sparse-linear-regression-2305.168922023-05-29 https://scifaro.com/en/abs/finding-diameter-reducing-shortcuts-in-trees-2305.173852023-05-30 https://scifaro.com/en/abs/overlapping-and-robust-edge-colored-clustering-in-hypergraphs-2305.175982024-01-09 https://scifaro.com/en/abs/pure-dp-aggregation-in-the-shuffle-model-error-optimal-and-communication-efficient-2305.176342023-05-30 https://scifaro.com/en/abs/online-dynamic-acknowledgement-with-learned-predictions-2305.182272023-05-30 https://scifaro.com/en/abs/an-alternate-proof-of-near-optimal-light-spanners-2305.186472025-01-15 https://scifaro.com/en/abs/algorithmic-foundations-of-inexact-computing-2305.187052023-05-31 https://scifaro.com/en/abs/optimal-dynamic-subset-sampling-theory-and-applications-2305.187852023-09-22 https://scifaro.com/en/abs/the-isomorphism-problem-of-power-graphs-and-a-question-of-cameron-2305.189362023-08-21 https://scifaro.com/en/abs/optimal-energetic-paths-for-electric-cars-2305.190152023-05-31 https://scifaro.com/en/abs/on-the-approximability-of-external-influence-driven-problems-2305.192512023-05-31 https://scifaro.com/en/abs/efficient-algorithms-for-exact-graph-matching-on-correlated-stochastic-block-models-with-constant-correlation-2305.196662023-06-05 https://scifaro.com/en/abs/quantum-speedups-for-bayesian-network-structure-learning-2305.196732025-06-03 https://scifaro.com/en/abs/fully-dynamic-submodular-maximization-over-matroids-2305.199182025-05-26 https://scifaro.com/en/abs/a-polynomial-time-iterative-algorithm-for-random-graph-matching-with-non-vanishing-correlation-2306.002662024-03-07 https://scifaro.com/en/abs/time-and-space-optimal-massively-parallel-algorithm-for-the-2-ruling-set-problem-2306.004322023-10-11 https://scifaro.com/en/abs/algorithms-transcending-the-sat-symmetry-interface-2306.006132024-01-02 https://scifaro.com/en/abs/evaluating-stability-in-massive-social-networks-efficient-streaming-algorithms-for-structural-balance-2306.006682023-06-02 https://scifaro.com/en/abs/attribute-efficient-pac-learning-of-low-degree-polynomial-threshold-functions-with-nasty-noise-2306.006732024-03-20 https://scifaro.com/en/abs/sharper-bounds-for-ell-p-sensitivity-sampling-2306.007322024-01-04 https://scifaro.com/en/abs/efficient-temporal-butterfly-counting-and-enumeration-on-temporal-bipartite-graphs-2306.008932026-04-21 https://scifaro.com/en/abs/dynamic-algorithms-for-matroid-submodular-maximization-2306.009592023-12-27 https://scifaro.com/en/abs/parameterized-complexity-of-broadcasting-in-graphs-2306.015362023-06-05 https://scifaro.com/en/abs/approximation-algorithms-for-capacitated-vehicle-routing-problems-a-comprehensive-survey-2306.018262026-04-07 https://scifaro.com/en/abs/revisiting-garg-s-2-approximation-algorithm-for-the-k-mst-problem-in-graphs-2306.018672023-06-21 https://scifaro.com/en/abs/fast-1-varepsilon-approximation-algorithms-for-binary-matrix-factorization-2306.018692023-06-06 https://scifaro.com/en/abs/accelerating-personalized-pagerank-vector-computation-2306.021022023-06-07 https://scifaro.com/en/abs/on-the-generalized-mean-densest-subgraph-problem-complexity-and-algorithms-2306.021722023-06-06 https://scifaro.com/en/abs/tight-cell-probe-lower-bounds-for-dynamic-succinct-dictionaries-2306.022532023-09-12 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-scheduling-coflows-with-total-weighted-completion-time-in-identical-parallel-networks-2306.022932023-12-21 https://scifaro.com/en/abs/sparse-convolution-for-approximate-sparse-instance-2306.023812023-06-06 https://scifaro.com/en/abs/fully-dynamic-all-pairs-shortest-paths-likely-optimal-worst-case-update-time-2306.026622024-08-28 https://scifaro.com/en/abs/hyper-distance-oracles-in-hypergraphs-2306.026962024-03-20 https://scifaro.com/en/abs/fast-partitioned-learned-bloom-filter-2306.028462023-10-31 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-st-orientations-with-few-transitive-edges-2306.031962023-07-11 https://scifaro.com/en/abs/tracking-evolving-labels-using-cone-based-oracles-2306.033062023-06-07 https://scifaro.com/en/abs/a-combinatorial-certifying-algorithm-for-linear-programming-problems-with-gainfree-leontief-substitution-systems-2306.033682023-06-07 https://scifaro.com/en/abs/representative-set-statements-for-delta-matroids-and-the-mader-delta-matroid-2306.036052025-11-21 https://scifaro.com/en/abs/buying-information-for-stochastic-optimization-2306.036072023-06-07 https://scifaro.com/en/abs/constant-sequence-extension-for-fast-search-using-weighted-hamming-distance-2306.036122023-06-07 https://scifaro.com/en/abs/quantum-distance-calculation-for-epsilon-graph-construction-2306.042902023-06-08 https://scifaro.com/en/abs/matroid-constrained-vertex-cover-2306.043422023-06-08 https://scifaro.com/en/abs/maintaining-the-cycle-structure-of-dynamic-permutations-2306.044702023-06-08 https://scifaro.com/en/abs/longest-common-prefix-arrays-for-succinct-k-spectra-2306.048502023-06-09 https://scifaro.com/en/abs/faster-approximation-algorithms-for-parameterized-graph-clustering-and-edge-labeling-2306.048842023-06-09 https://scifaro.com/en/abs/a-cover-time-study-of-a-non-markovian-algorithm-2306.049022023-08-14 https://scifaro.com/en/abs/analysis-of-knuth-s-sampling-algorithm-d-and-d-2306.052432023-06-13 https://scifaro.com/en/abs/robust-topological-orderings-for-directed-graphs-2306.054752023-06-12 https://scifaro.com/en/abs/an-improved-algorithm-for-finding-maximum-outerplanar-subgraphs-2306.055882023-06-16 https://scifaro.com/en/abs/space-time-trade-offs-for-the-lcp-array-of-wheeler-dfas-2306.056842024-08-20 https://scifaro.com/en/abs/improved-and-deterministic-online-service-with-deadlines-or-delay-2306.057442023-06-12 https://scifaro.com/en/abs/differentially-private-all-pairs-shortest-distances-for-low-tree-width-graphs-2306.059162023-06-12 https://scifaro.com/en/abs/optimal-distance-query-reconstruction-for-graphs-without-long-induced-cycles-2306.059792024-10-17 https://scifaro.com/en/abs/semi-online-scheduling-with-lookahead-2306.060032023-06-12 https://scifaro.com/en/abs/covering-planar-metrics-and-beyond-o-1-trees-suffice-2306.062152023-11-07 https://scifaro.com/en/abs/resolving-the-steiner-point-removal-problem-in-planar-graphs-via-shortcut-partitions-2306.062352023-09-14 https://scifaro.com/en/abs/counting-distinct-elements-in-the-turnstile-model-with-differential-privacy-under-continual-observation-2306.067232024-07-12 https://scifaro.com/en/abs/time-limited-bloom-filter-2306.067422023-06-13 https://scifaro.com/en/abs/scalable-fair-influence-maximization-2306.068202023-11-23 https://scifaro.com/en/abs/fitch-graph-completion-2306.068782023-06-13 https://scifaro.com/en/abs/rip-linked-list-2306.069422024-08-29 https://scifaro.com/en/abs/invertible-bloom-lookup-tables-with-less-memory-and-randomness-2306.075832024-11-27 https://scifaro.com/en/abs/expanding-the-scope-of-dawn-a-novel-version-for-weighted-shortest-path-problem-2306.078722023-06-14 https://scifaro.com/en/abs/continual-release-of-differentially-private-synthetic-data-from-longitudinal-data-collections-2306.078842024-05-28 https://scifaro.com/en/abs/online-matching-in-geometric-random-graphs-2306.078912024-10-28 https://scifaro.com/en/abs/graphvine-a-data-structure-to-optimize-dynamic-graph-processing-on-gpus-2306.082522023-07-27 https://scifaro.com/en/abs/the-secretary-problem-with-predictions-2306.083402023-08-21 https://scifaro.com/en/abs/recoverable-robust-optimization-with-commitment-2306.085462023-06-16 https://scifaro.com/en/abs/deterministic-and-work-efficient-parallel-batch-dynamic-trees-in-low-span-2306.087862023-06-16 https://scifaro.com/en/abs/fast-algorithms-for-directed-graph-partitioning-using-flows-and-reweighted-eigenvalues-2306.091282023-06-16 https://scifaro.com/en/abs/private-federated-frequency-estimation-adapting-to-the-hardness-of-the-instance-2306.093962023-12-05 https://scifaro.com/en/abs/an-efficient-algorithm-for-power-dominating-set-2306.098702023-06-19 https://scifaro.com/en/abs/nearly-optimal-hierarchical-clustering-for-well-clustered-graphs-2306.099502023-06-19 https://scifaro.com/en/abs/learning-spanning-forests-optimally-using-cut-queries-in-weighted-undirected-graphs-2306.101822023-06-21 https://scifaro.com/en/abs/algorithms-for-multiple-drone-delivery-scheduling-problem-mdsp-2306.103682023-06-21 https://scifaro.com/en/abs/on-the-complexity-of-co-secure-dominating-set-problem-2306.103782023-06-21 https://scifaro.com/en/abs/differentially-private-histogram-predecessor-and-set-cardinality-under-continual-observation-2306.104282023-06-21 https://scifaro.com/en/abs/efficient-parameterized-pattern-matching-in-sublinear-space-2306.107142023-06-21 https://scifaro.com/en/abs/a-bounded-partition-approach-to-identifying-one-fake-coin-and-its-type-2306.107332023-06-21 https://scifaro.com/en/abs/scheduling-with-cardinality-dependent-unavailability-periods-2306.109042023-06-21 https://scifaro.com/en/abs/quasipolynomiality-of-the-smallest-missing-induced-subgraph-2306.111852023-09-29 https://scifaro.com/en/abs/online-vector-bin-packing-and-hypergraph-coloring-illuminated-simpler-proofs-and-new-connections-2306.112412023-06-21 https://scifaro.com/en/abs/data-structures-for-density-estimation-2306.113122023-06-21 https://scifaro.com/en/abs/composition-of-nested-embeddings-with-an-application-to-outlier-removal-2306.116042023-11-08 https://scifaro.com/en/abs/near-optimal-dynamic-rounding-of-fractional-matchings-in-bipartite-graphs-2306.118282024-02-26 https://scifaro.com/en/abs/on-the-optimal-bounds-for-noisy-computing-2306.119512023-06-22 https://scifaro.com/en/abs/block-wise-index-modulation-and-receiver-design-for-high-mobility-otfs-communications-2306.120422023-06-22 https://scifaro.com/en/abs/optimal-degree-1-coloring-in-congested-clique-2306.120712026-03-18 https://scifaro.com/en/abs/online-resource-allocation-with-convex-set-machine-learned-advice-2306.122822026-05-19 https://scifaro.com/en/abs/memory-query-tradeoffs-for-randomized-convex-optimization-2306.125342023-06-23 https://scifaro.com/en/abs/on-differentially-private-sampling-from-gaussian-and-product-distributions-2306.125492023-06-23 https://scifaro.com/en/abs/fast-practical-compression-of-deterministic-finite-automata-2306.127712024-11-26 https://scifaro.com/en/abs/fast-maximum-k-plex-algorithms-parameterized-by-small-degeneracy-gaps-2306.132582023-11-15 https://scifaro.com/en/abs/on-minimum-t-claw-deletion-in-split-graphs-2306.133062023-06-26 https://scifaro.com/en/abs/improved-competitive-ratios-for-online-bipartite-matching-on-degree-bounded-graphs-2306.133872023-12-05 https://scifaro.com/en/abs/a-dynamic-data-structure-for-representing-timed-transitive-closures-on-disk-2306.139372023-06-27 https://scifaro.com/en/abs/on-scalable-testing-of-samplers-2306.139582023-06-27 https://scifaro.com/en/abs/approximation-algorithm-for-unrooted-prize-collecting-forest-with-multiple-components-and-its-application-on-prize-collecting-sweep-coverage-2306.139962023-10-31 https://scifaro.com/en/abs/on-finding-2-cuts-and-3-edge-connected-components-in-parallel-2306.141032023-06-27 https://scifaro.com/en/abs/approximation-algorithms-for-k-submodular-maximization-subject-to-a-knapsack-constraint-2306.145202023-09-18 https://scifaro.com/en/abs/prefix-free-graphs-and-suffix-array-construction-in-sublinear-space-2306.146892023-06-27 https://scifaro.com/en/abs/towards-optimal-effective-resistance-estimation-2306.148202023-06-27 https://scifaro.com/en/abs/approximate-counting-for-spin-systems-in-sub-quadratic-time-2306.148672025-01-15 https://scifaro.com/en/abs/optimally-repurposing-existing-algorithms-to-obtain-exponential-time-approximations-2306.153312023-06-28 https://scifaro.com/en/abs/on-the-deque-and-rique-numbers-of-complete-and-complete-bipartite-graphs-2306.153952023-06-28 https://scifaro.com/en/abs/scheduling-with-a-limited-testing-budget-2306.155972023-06-28 https://scifaro.com/en/abs/erasing-based-lossless-compression-method-for-streaming-floating-point-time-series-2306.160532023-06-29 https://scifaro.com/en/abs/approximate-cartesian-tree-matching-an-approach-using-swaps-2306.160652024-10-21 https://scifaro.com/en/abs/refining-the-adaptivity-notion-in-the-huge-object-model-2306.161292024-08-06 https://scifaro.com/en/abs/private-covariance-approximation-and-eigenvalue-gap-bounds-for-complex-gaussian-perturbations-2306.166482023-06-30 https://scifaro.com/en/abs/algorithms-for-computing-maximum-cliques-in-hyperbolic-random-graphs-2306.167752023-06-30 https://scifaro.com/en/abs/an-improved-kernelization-algorithm-for-trivially-perfect-editing-2306.168992023-10-27 https://scifaro.com/en/abs/5-approximation-for-mathcal-h-treewidth-essentially-as-fast-as-mathcal-h-deletion-parameterized-by-solution-size-2306.170652023-06-30 https://scifaro.com/en/abs/axis-parallel-right-angle-crossing-graphs-2306.170732023-06-30 https://scifaro.com/en/abs/improved-algorithms-for-online-rent-minimization-problem-under-unit-size-jobs-2306.172412023-07-03 https://scifaro.com/en/abs/efficient-parallel-output-sensitive-edit-distance-2306.174612023-09-01 https://scifaro.com/en/abs/subexponential-algorithms-in-geometric-graphs-via-the-subquadratic-grid-minor-property-the-role-of-local-radius-2306.177102024-04-17 https://scifaro.com/en/abs/an-improved-deterministic-algorithm-for-the-online-min-sum-set-cover-problem-2306.177552023-07-03 https://scifaro.com/en/abs/canonizing-graphs-of-bounded-rank-width-in-parallel-via-weisfeiler-leman-2306.177772024-04-26 https://scifaro.com/en/abs/solving-edge-clique-cover-exactly-via-synergistic-data-reduction-2306.178042023-07-06 https://scifaro.com/en/abs/a-simpler-and-parallelizable-o-sqrt-log-n-approximation-algorithm-for-sparsest-cut-2307.001152025-07-11 https://scifaro.com/en/abs/maximal-k-edge-connected-subgraphs-in-almost-linear-time-for-small-k-2307.001472023-07-04 https://scifaro.com/en/abs/on-finding-constrained-independent-sets-in-cycles-2307.003172023-07-04 https://scifaro.com/en/abs/abstract-orientable-incidence-structure-and-algorithms-for-finite-bounded-acyclic-categories-ii-data-structure-and-fundamental-operations-2307.003572023-07-04 https://scifaro.com/en/abs/kernelization-for-finding-lineal-topologies-depth-first-spanning-trees-with-many-or-few-leaves-2307.003622023-07-21 https://scifaro.com/en/abs/detecting-points-in-integer-cones-of-polytopes-is-double-exponentially-hard-2307.004062023-07-04 https://scifaro.com/en/abs/moments-random-walks-and-limits-for-spectrum-approximation-2307.004742023-07-04 https://scifaro.com/en/abs/massively-parallel-algorithms-for-the-stochastic-block-model-2307.005302023-08-16 https://scifaro.com/en/abs/listing-small-minimal-s-t-separators-in-fpt-delay-2307.006042023-10-05 https://scifaro.com/en/abs/new-bounds-for-time-dependent-scheduling-with-uniform-deterioration-2307.006272023-07-04 https://scifaro.com/en/abs/what-if-we-tried-less-power-lessons-from-studying-the-power-of-choices-in-hashing-based-data-structures-2307.006442023-07-04 https://scifaro.com/en/abs/an-ftp-algorithm-for-temporal-graph-untangling-2307.007862023-07-04 https://scifaro.com/en/abs/greedy-minimum-energy-scheduling-2307.009492023-07-04 https://scifaro.com/en/abs/new-prophet-inequalities-via-poissonization-and-sharding-2307.009712024-04-05 https://scifaro.com/en/abs/an-embarrassingly-parallel-optimal-space-cardinality-estimation-algorithm-2307.009852023-07-04 https://scifaro.com/en/abs/kernelizing-problems-on-planar-graphs-in-sublinear-space-and-polynomial-time-2307.009962023-07-04 https://scifaro.com/en/abs/learning-mixtures-of-gaussians-using-the-ddpm-objective-2307.011782023-07-04 https://scifaro.com/en/abs/effective-resistances-in-non-expander-graphs-2307.012182023-07-06 https://scifaro.com/en/abs/space-efficient-parameterized-algorithms-on-graphs-of-low-shrubdepth-2307.012852025-08-15 https://scifaro.com/en/abs/a-contraction-recursive-algorithm-for-treewidth-2307.013182023-07-06 https://scifaro.com/en/abs/polynomial-time-approximation-of-independent-set-parameterized-by-treewidth-2307.013412023-07-06 https://scifaro.com/en/abs/constant-time-edge-label-and-leaf-pointer-maintenance-on-sliding-suffix-trees-2307.014122024-03-01 https://scifaro.com/en/abs/matrix-multiplication-using-only-addition-2307.014152023-07-06 https://scifaro.com/en/abs/linear-time-computation-of-dawgs-symmetric-indexing-structures-and-maws-for-integer-alphabets-2307.014282023-07-06 https://scifaro.com/en/abs/an-optimal-multiple-class-encoding-scheme-for-a-graph-of-bounded-hadwiger-number-2307.015002023-07-06 https://scifaro.com/en/abs/improved-approximation-algorithms-for-some-capacitated-k-edge-connectivity-problems-2307.016502023-07-06 https://scifaro.com/en/abs/threshold-testing-and-semi-online-prophet-inequalities-2307.017762024-06-13 https://scifaro.com/en/abs/faster-detours-in-undirected-graphs-2307.017812023-07-06 https://scifaro.com/en/abs/fast-private-kernel-density-estimation-via-locality-sensitive-quantization-2307.018772023-07-06 https://scifaro.com/en/abs/linear-time-computation-of-generalized-minimal-absent-words-for-multiple-strings-2307.019672023-08-01 https://scifaro.com/en/abs/independent-sets-in-elimination-graphs-with-a-submodular-objective-2307.020222023-07-11 https://scifaro.com/en/abs/exact-and-parameterized-algorithms-for-the-independent-cutset-problem-2307.021072023-11-21 https://scifaro.com/en/abs/improved-approximation-for-two-dimensional-vector-multiple-knapsack-2307.021372023-07-06 https://scifaro.com/en/abs/directed-poincar-e-inequalities-and-l-1-monotonicity-testing-of-lipschitz-functions-2307.021932023-07-06 https://scifaro.com/en/abs/an-approximation-algorithm-for-the-exact-matching-problem-in-bipartite-graphs-2307.022052023-07-06 https://scifaro.com/en/abs/approximate-turing-kernelization-and-lower-bounds-for-domination-problems-2307.022412023-07-06 https://scifaro.com/en/abs/sorting-pattern-avoiding-permutations-via-0-1-matrices-forbidding-product-patterns-2307.022942023-07-11 https://scifaro.com/en/abs/density-sensitive-algorithms-for-delta-1-edge-coloring-2307.024152024-08-05 https://scifaro.com/en/abs/the-landscape-of-compressibility-measures-for-two-dimensional-data-2307.026292024-05-21 https://scifaro.com/en/abs/efficiency-of-self-adjusting-heaps-2307.027722025-02-13 https://scifaro.com/en/abs/approximation-algorithms-for-directed-weighted-spanners-2307.027742023-07-10 https://scifaro.com/en/abs/shortest-beer-path-queries-based-on-graph-decomposition-2307.027872023-07-12 https://scifaro.com/en/abs/a-simple-1-epsilon-approximation-semi-streaming-algorithm-for-maximum-weighted-matching-2307.029682025-08-06 https://scifaro.com/en/abs/a-near-linear-time-algorithm-for-the-chamfer-distance-2307.030432023-07-07 https://scifaro.com/en/abs/differential-privacy-for-clustering-under-continual-observation-2307.034302023-07-28 https://scifaro.com/en/abs/a-multivariate-complexity-analysis-of-the-generalized-noah-s-ark-problem-2307.035182025-11-18 https://scifaro.com/en/abs/improved-algorithms-for-white-box-adversarial-streams-2307.035292023-07-10 https://scifaro.com/en/abs/efficient-correlation-clustering-methods-for-large-consensus-clustering-instances-2307.038182023-07-11 https://scifaro.com/en/abs/efficient-approximation-algorithms-for-scheduling-coflows-with-precedence-constraints-in-identical-parallel-networks-to-minimize-weighted-completion-time-2307.041072023-12-21 https://scifaro.com/en/abs/a-randomized-algorithm-for-single-source-shortest-path-on-undirected-real-weighted-graphs-2307.041392023-10-05 https://scifaro.com/en/abs/budgeted-matroid-maximization-a-parameterized-viewpoint-2307.041732023-07-11 https://scifaro.com/en/abs/private-data-stream-analysis-for-universal-symmetric-norm-estimation-2307.042492023-07-11 https://scifaro.com/en/abs/improved-diversity-maximization-algorithms-for-matching-and-pseudoforest-2307.043292023-07-11 https://scifaro.com/en/abs/on-the-exponential-growth-of-geometric-shapes-2307.043852024-02-12 https://scifaro.com/en/abs/a-linear-time-quantum-algorithm-for-pairwise-sequence-alignment-2307.044792025-09-05 https://scifaro.com/en/abs/predicting-memory-demands-of-bdd-operations-using-maximum-graph-cuts-extended-paper-2307.044882025-05-21 https://scifaro.com/en/abs/tight-algorithmic-applications-of-clique-width-generalizations-2307.046282023-07-11 https://scifaro.com/en/abs/on-detecting-some-defective-items-in-group-testing-2307.048222023-07-12 https://scifaro.com/en/abs/ell-p-regression-in-the-arbitrary-partition-model-of-communication-2307.051172023-07-12 https://scifaro.com/en/abs/quantitative-comparison-of-nearest-neighbor-search-algorithms-2307.052352023-07-12 https://scifaro.com/en/abs/parameterized-results-on-acyclic-matchings-with-implications-for-related-problems-2307.054462023-07-12 https://scifaro.com/en/abs/distance-preserving-graph-compression-techniques-2307.058292024-09-19 https://scifaro.com/en/abs/sublinear-time-shortest-path-in-expander-graphs-2307.061132023-08-01 https://scifaro.com/en/abs/connectivity-labeling-and-routing-with-multiple-vertex-failures-2307.062762023-11-17 https://scifaro.com/en/abs/faster-rectangular-matrix-multiplication-by-combination-loss-analysis-2307.065352023-12-29 https://scifaro.com/en/abs/edge-coloring-algorithms-for-bounded-degree-multigraphs-2307.065792023-10-31 https://scifaro.com/en/abs/fast-and-practical-quantum-inspired-classical-algorithms-for-solving-linear-systems-2307.066272023-12-01 https://scifaro.com/en/abs/breaking-3-factor-approximation-for-correlation-clustering-in-polylogarithmic-rounds-2307.067232023-07-14 https://scifaro.com/en/abs/approximation-algorithms-for-the-square-min-sum-bin-packing-problem-2307.067762023-07-14 https://scifaro.com/en/abs/planar-disjoint-paths-treewidth-and-kernels-2307.067922023-07-14 https://scifaro.com/en/abs/local-elimination-in-the-traveling-salesman-problem-2307.070542023-07-17 https://scifaro.com/en/abs/error-correction-for-message-streams-2307.070872025-10-29 https://scifaro.com/en/abs/parallelising-glauber-dynamics-2307.071312024-07-11 https://scifaro.com/en/abs/approximating-edit-distance-in-the-fully-dynamic-model-2307.071752023-07-17 https://scifaro.com/en/abs/a-3-2-varepsilon-approximation-for-multiple-tsp-with-a-variable-number-of-depots-2307.071802023-07-17 https://scifaro.com/en/abs/optimal-fault-tolerant-reachability-labeling-in-planar-graphs-2307.072222023-07-17 https://scifaro.com/en/abs/random-wheeler-automata-2307.072672024-06-11 https://scifaro.com/en/abs/delaying-decisions-and-reservation-costs-2307.072842023-07-17 https://scifaro.com/en/abs/sparse-induced-subgraphs-in-p-6-free-graphs-2307.073302023-07-17 https://scifaro.com/en/abs/a-simple-deterministic-near-linear-time-approximation-scheme-for-transshipment-with-arbitrary-positive-edge-costs-2307.074402024-06-27 https://scifaro.com/en/abs/differentially-private-clustering-in-data-streams-2307.074492025-10-03 https://scifaro.com/en/abs/tur-a-n-s-theorem-through-algorithmic-lens-2307.074562023-07-17 https://scifaro.com/en/abs/diverse-approximations-for-monotone-submodular-maximization-problems-with-a-matroid-constraint-2307.075672023-07-18 https://scifaro.com/en/abs/decomposition-based-refinement-for-the-network-interdiction-problem-2307.075772023-09-18 https://scifaro.com/en/abs/on-diameter-approximation-in-directed-graphs-2307.075832023-07-18 https://scifaro.com/en/abs/zip-zip-trees-making-zip-trees-more-balanced-biased-compact-or-persistent-2307.076602025-02-11 https://scifaro.com/en/abs/computing-seq-ic-lcs-of-labeled-graphs-2307.076762023-07-18 https://scifaro.com/en/abs/sandpile-prediction-on-undirected-graphs-2307.077112024-04-09 https://scifaro.com/en/abs/wsrpt-is-1-2259-competitive-for-weighted-completion-time-scheduling-2307.077392023-07-18 https://scifaro.com/en/abs/lower-bounds-for-matroid-optimization-problems-with-a-linear-constraint-2307.077732024-04-23 https://scifaro.com/en/abs/fully-scalable-mpc-algorithms-for-clustering-in-high-dimension-2307.078482024-07-09 https://scifaro.com/en/abs/new-bounds-for-matrix-multiplication-from-alpha-to-omega-2307.079702023-11-07 https://scifaro.com/en/abs/sampling-proper-colorings-on-line-graphs-using-1-o-1-delta-colors-2307.080802024-03-25 https://scifaro.com/en/abs/better-diameter-algorithms-for-bounded-vc-dimension-graphs-and-geometric-intersection-graphs-2307.081622024-07-16 https://scifaro.com/en/abs/combinatorial-approach-for-factorization-of-variance-and-entropy-in-spin-systems-2307.082122023-07-18 https://scifaro.com/en/abs/lipschitz-continuous-algorithms-for-covering-problems-2307.082132024-10-16 https://scifaro.com/en/abs/extending-the-primal-dual-2-approximation-algorithm-beyond-uncrossable-set-families-2307.082702023-07-21 https://scifaro.com/en/abs/quantum-graph-drawing-2307.083712023-07-18 https://scifaro.com/en/abs/maximum-flows-in-parametric-graph-templates-2307.084202023-07-18 https://scifaro.com/en/abs/fast-algorithms-for-energy-games-in-special-cases-2307.084422023-11-17 https://scifaro.com/en/abs/santa-claus-meets-makespan-and-matroids-algorithms-and-reductions-2307.084532023-07-18 https://scifaro.com/en/abs/approximation-algorithms-for-the-graph-burning-on-cactus-and-directed-trees-2307.085052023-07-18 https://scifaro.com/en/abs/splitting-off-in-hypergraphs-2307.085552024-02-19 https://scifaro.com/en/abs/tight-bounds-for-budgeted-maximum-weight-independent-set-in-bipartite-and-perfect-graphs-2307.085922023-07-18 https://scifaro.com/en/abs/fully-dynamic-matching-2-sqrt-2-approximation-in-polylog-update-time-2307.087722023-07-19 https://scifaro.com/en/abs/resource-augmentation-analysis-of-the-greedy-algorithm-for-the-online-transportation-problem-2307.088322023-07-19 https://scifaro.com/en/abs/grammar-boosting-a-new-technique-for-proving-lower-bounds-for-computation-over-compressed-data-2307.088332024-09-24 https://scifaro.com/en/abs/quantum-tutte-embeddings-2307.088512023-07-26 https://scifaro.com/en/abs/fixed-parameter-algorithms-for-fair-hitting-set-problems-2307.088542023-07-19 https://scifaro.com/en/abs/the-predicted-updates-dynamic-model-offline-incremental-and-decremental-to-fully-dynamic-transformations-2307.088902023-11-29 https://scifaro.com/en/abs/scalable-auction-algorithms-for-bipartite-maximum-matching-problems-2307.089792023-07-19 https://scifaro.com/en/abs/cut-sparsification-and-succinct-representation-of-submodular-hypergraphs-2307.091102024-02-20 https://scifaro.com/en/abs/minimum-target-sets-in-non-progressive-threshold-models-when-timing-matters-2307.091112023-07-19 https://scifaro.com/en/abs/fast-2-approximate-all-pairs-shortest-paths-2307.092582023-10-31 https://scifaro.com/en/abs/the-role-of-dimension-in-the-online-chasing-problem-2307.093502024-02-14 https://scifaro.com/en/abs/solving-knapsack-with-small-items-via-l0-proximity-2307.094542023-08-10 https://scifaro.com/en/abs/dynamic-planar-embedding-is-in-dynfo-2307.094732023-07-19 https://scifaro.com/en/abs/submodular-maximization-under-the-intersection-of-matroid-and-knapsack-constraints-2307.094872023-07-20 https://scifaro.com/en/abs/approximately-counting-independent-sets-in-dense-bipartite-graphs-via-subspace-enumeration-2307.095332023-07-20 https://scifaro.com/en/abs/group-testing-in-arbitrary-hypergraphs-and-related-combinatorial-structures-2307.096082023-11-28 https://scifaro.com/en/abs/continuous-non-monotone-dr-submodular-maximization-with-down-closed-convex-constraint-2307.096162024-03-27 https://scifaro.com/en/abs/on-the-tractability-of-defensive-alliance-problem-2307.097602023-07-20 https://scifaro.com/en/abs/on-dynamic-graph-algorithms-with-predictions-2307.099612023-12-11 https://scifaro.com/en/abs/fast-algorithms-for-a-new-relaxation-of-optimal-transport-2307.100422023-07-20 https://scifaro.com/en/abs/average-case-matrix-discrepancy-asymptotics-and-online-algorithms-2307.100552024-07-23 https://scifaro.com/en/abs/dynamic-constant-time-parallel-graph-algorithms-with-sub-linear-work-2307.101072023-07-20 https://scifaro.com/en/abs/on-the-work-of-dynamic-constant-time-parallel-algorithms-for-regular-tree-languages-and-context-free-languages-2307.101312023-07-20 https://scifaro.com/en/abs/the-full-landscape-of-robust-mean-testing-sharp-separations-between-oblivious-and-adaptive-contamination-2307.102732023-07-21 https://scifaro.com/en/abs/labeling-methods-for-partially-ordered-paths-2307.103322024-08-13 https://scifaro.com/en/abs/efficient-algorithms-for-enumerating-maximal-common-subsequences-of-two-strings-2307.105522023-07-21 https://scifaro.com/en/abs/parameterized-complexity-of-biclique-contraction-and-balanced-biclique-contraction-2307.106072026-01-15 https://scifaro.com/en/abs/computing-a-subtrajectory-cluster-from-c-packed-trajectories-2307.106102023-07-21 https://scifaro.com/en/abs/a-parameterized-approximation-scheme-for-the-2d-knapsack-problem-with-wide-items-2307.106722023-07-21 https://scifaro.com/en/abs/shortest-dominating-set-reconfiguration-under-token-sliding-2307.108472023-07-21 https://scifaro.com/en/abs/hypergraph-diffusions-and-resolvents-for-norm-based-hypergraph-laplacians-2307.110422023-07-21 https://scifaro.com/en/abs/a-fair-and-memory-time-efficient-hashmap-2307.113552024-04-16 https://scifaro.com/en/abs/subset-sampling-and-its-extensions-2307.115852023-07-24 https://scifaro.com/en/abs/improved-approximate-distance-oracles-bypassing-the-thorup-zwick-bound-in-dense-graphs-2307.116772023-07-24 https://scifaro.com/en/abs/formal-concept-lattice-representations-and-algorithms-for-hypergraphs-2307.116812023-07-24 https://scifaro.com/en/abs/efficient-algorithms-and-hardness-results-for-the-weighted-k-server-problem-2307.119132023-07-25 https://scifaro.com/en/abs/total-domination-separated-clusters-cd-coloring-algorithms-and-hardness-2307.120732024-10-01 https://scifaro.com/en/abs/treebar-maps-schematic-representation-of-networks-at-scale-2307.123932023-07-25 https://scifaro.com/en/abs/fast-consistent-hashing-in-constant-time-2307.124482023-12-29 https://scifaro.com/en/abs/tight-approximations-for-graphical-house-allocation-2307.124822023-10-16 https://scifaro.com/en/abs/correcting-matrix-products-over-the-ring-of-integers-2307.125132024-04-22 https://scifaro.com/en/abs/knapsack-connectedness-path-and-shortest-path-2307.125472024-01-25 https://scifaro.com/en/abs/optimality-of-glauber-dynamics-for-general-purpose-ising-model-sampling-and-free-energy-approximation-2307.125812023-12-01 https://scifaro.com/en/abs/faster-algorithms-for-bounded-knapsack-and-bounded-subset-sum-via-fine-grained-proximity-results-2307.125822023-12-06 https://scifaro.com/en/abs/shortest-two-disjoint-paths-in-conservative-graphs-2307.126022024-01-10 https://scifaro.com/en/abs/a-1-5-pproximation-algorithms-for-activating-2-disjoint-st-paths-2307.126462023-07-25 https://scifaro.com/en/abs/gaussian-cooling-and-dikin-walks-the-interior-point-method-for-logconcave-sampling-2307.129432024-03-25 https://scifaro.com/en/abs/on-the-relationship-between-several-variants-of-the-linear-hashing-conjecture-2307.130162024-05-21 https://scifaro.com/en/abs/detection-of-common-subtrees-with-identical-label-distribution-2307.130682024-01-05 https://scifaro.com/en/abs/estimating-single-node-pagerank-in-tilde-o-left-min-d-t-sqrt-m-right-time-2307.131622023-07-27 https://scifaro.com/en/abs/online-maximum-independent-set-of-hyperrectangles-2307.132612024-10-10 https://scifaro.com/en/abs/federated-heavy-hitter-recovery-under-linear-sketching-2307.133472023-07-26 https://scifaro.com/en/abs/noisy-k-means-revisited-2307.136852023-07-26 https://scifaro.com/en/abs/a-compact-dag-for-storing-and-searching-maximal-common-subsequences-2307.136952023-07-26 https://scifaro.com/en/abs/fully-dynamic-consistent-k-center-clustering-2307.137472023-07-27 https://scifaro.com/en/abs/upward-planarity-testing-of-biconnected-outerplanar-dags-solves-partition-2307.137992023-12-27 https://scifaro.com/en/abs/on-the-hardness-of-finding-balanced-independent-sets-in-random-bipartite-graphs-2307.139212023-07-27 https://scifaro.com/en/abs/on-minimizing-generalized-makespan-on-unrelated-machines-2307.139372023-07-27 https://scifaro.com/en/abs/fast-algorithms-for-k-submodular-maximization-subject-to-a-matroid-constraint-2307.139962023-07-27 https://scifaro.com/en/abs/a-tight-monte-carlo-algorithm-for-steiner-tree-parameterized-by-clique-width-2307.142642024-02-27 https://scifaro.com/en/abs/hypergraph-isomorphism-computation-2307.143942023-07-28 https://scifaro.com/en/abs/shorter-and-faster-than-sort3alphadev-2307.145032023-07-28 https://scifaro.com/en/abs/a-sampling-lov-a-sz-local-lemma-for-large-domain-sizes-2307.148722024-04-05 https://scifaro.com/en/abs/evaluating-regular-path-queries-on-compressed-adjacency-matrices-2307.149302024-04-24 https://scifaro.com/en/abs/3-coloring-c-4-or-c-3-free-diameter-two-graphs-2307.150362023-07-28 https://scifaro.com/en/abs/dynamic-algorithms-for-k-center-on-graphs-2307.155572024-01-10 https://scifaro.com/en/abs/towards-optimal-output-sensitive-clique-listing-or-listing-cliques-from-smaller-cliques-2307.158712024-03-25 https://scifaro.com/en/abs/fitting-tree-metrics-with-minimum-disagreements-2307.160662023-08-01 https://scifaro.com/en/abs/light-reliable-spanners-2307.166122023-08-01 https://scifaro.com/en/abs/on-the-complexity-of-algorithms-with-predictions-for-dynamic-graph-problems-2307.167712023-09-12 https://scifaro.com/en/abs/smoothed-analysis-of-the-2-opt-heuristic-for-the-tsp-under-gaussian-noise-2308.003062023-08-02 https://scifaro.com/en/abs/structural-parameterizations-of-the-biclique-free-vertex-deletion-problem-2308.005012024-11-20 https://scifaro.com/en/abs/massively-parallel-algorithms-for-high-dimensional-euclidean-minimum-spanning-tree-2308.005032023-08-02 https://scifaro.com/en/abs/shortcut-partitions-in-minor-free-graphs-steiner-point-removal-distance-oracles-tree-covers-and-more-2308.005552023-08-02 https://scifaro.com/en/abs/nearly-optimal-dynamic-set-cover-breaking-the-quadratic-in-f-time-barrier-2308.007932024-10-29 https://scifaro.com/en/abs/an-algorithm-for-the-longest-common-subsequence-and-substring-problem-2308.009252023-08-03 https://scifaro.com/en/abs/a-fast-monte-carlo-algorithm-for-evaluating-matrix-functions-with-application-in-complex-networks-2308.010372024-09-23 https://scifaro.com/en/abs/one-tree-to-rule-them-all-poly-logarithmic-universal-steiner-tree-2308.011992023-08-03 https://scifaro.com/en/abs/enumeration-kernels-of-polynomial-size-for-cuts-of-bounded-degree-2308.012862025-04-22 https://scifaro.com/en/abs/an-algorithm-for-the-constrained-longest-common-subsequence-and-substring-problem-2308.013222023-08-04 https://scifaro.com/en/abs/fast-coloring-despite-congested-relays-2308.013592023-08-04 https://scifaro.com/en/abs/optimal-online-discrepancy-minimization-2308.014062023-08-04 https://scifaro.com/en/abs/simultaneously-approximating-all-ell-p-norms-in-correlation-clustering-2308.015342024-03-12 https://scifaro.com/en/abs/another-hamiltonian-cycle-in-bipartite-pfaffian-graphs-2308.015742024-02-23 https://scifaro.com/en/abs/meta-theorems-for-parameterized-streaming-algorithms-2308.015982023-08-04 https://scifaro.com/en/abs/kernelization-of-counting-problems-2308.021882023-08-07 https://scifaro.com/en/abs/optimally-computing-compressed-indexing-arrays-based-on-the-compact-directed-acyclic-word-graph-2308.022692023-08-07 https://scifaro.com/en/abs/single-source-unsplittable-flows-in-planar-graphs-2308.026512023-08-08 https://scifaro.com/en/abs/an-overview-of-analysis-methods-and-evaluation-results-for-caching-strategies-2308.028752023-08-08 https://scifaro.com/en/abs/a-logarithmic-approximation-algorithm-for-the-activation-edge-multicover-problem-2308.029012023-09-15 https://scifaro.com/en/abs/solving-a-random-asymmetric-tsp-exactly-in-quasi-polynomial-time-w-h-p-2308.029462025-12-16 https://scifaro.com/en/abs/knapsack-with-small-items-in-near-quadratic-time-2308.030752024-02-27 https://scifaro.com/en/abs/testing-graph-properties-with-the-container-method-2308.032892026-03-09 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-the-max-3-section-problem-2308.035162023-08-08 https://scifaro.com/en/abs/terahac-hierarchical-agglomerative-clustering-of-trillion-edge-graphs-2308.035782024-06-12 https://scifaro.com/en/abs/collapsing-the-hierarchy-of-compressed-data-structures-suffix-arrays-in-optimal-compressed-space-2308.036352024-09-24 https://scifaro.com/en/abs/nucleotide-string-indexing-using-range-matching-2308.038042023-08-09 https://scifaro.com/en/abs/optimal-clustering-with-dependent-costs-in-bayesian-networks-2308.039702025-12-24 https://scifaro.com/en/abs/0-1-knapsack-in-nearly-quadratic-time-2308.040932024-04-02 https://scifaro.com/en/abs/on-the-node-averaged-complexity-of-locally-checkable-problems-on-trees-2308.042512024-02-16 https://scifaro.com/en/abs/distance-estimation-for-high-dimensional-discrete-distributions-2308.042642025-09-09 https://scifaro.com/en/abs/linear-time-construction-of-cover-suffix-tree-and-applications-2308.042892023-08-09 https://scifaro.com/en/abs/deterministic-k-vertex-connectivity-in-k-2-max-flows-2308.046952023-08-10 https://scifaro.com/en/abs/induced-minor-free-graphs-separator-theorem-subexponential-algorithms-and-improved-hardness-of-recognition-2308.047952023-08-10 https://scifaro.com/en/abs/improved-approximation-algorithms-for-the-joint-replenishment-problem-with-outliers-and-with-fairness-constraints-2308.048462023-08-10 https://scifaro.com/en/abs/controlling-tail-risk-in-online-ski-rental-2308.050672023-08-10 https://scifaro.com/en/abs/mnl-prophet-sequential-assortment-selection-under-uncertainty-2308.052072023-08-11 https://scifaro.com/en/abs/algorithms-for-encoding-and-decoding-3d-hilbert-orderings-2308.056732023-09-26 https://scifaro.com/en/abs/simple-analysis-of-priority-sampling-2308.059072024-08-21 https://scifaro.com/en/abs/competitive-analysis-of-online-facility-assignment-for-general-layout-of-servers-on-a-line-2308.059332023-08-14 https://scifaro.com/en/abs/lossy-kernelization-for-implicit-hitting-set-problems-2308.059742023-08-14 https://scifaro.com/en/abs/breaking-a-barrier-in-constructing-compact-indexes-for-parameterized-pattern-matching-2308.059772023-08-14 https://scifaro.com/en/abs/finding-long-directed-cycles-is-hard-even-when-dfvs-is-small-or-girth-is-large-2308.061452023-08-14 https://scifaro.com/en/abs/simpler-constant-factor-approximation-algorithms-for-weighted-flow-time-now-for-any-p-norm-2308.062092023-08-14 https://scifaro.com/en/abs/a-better-than-1-6-approximation-for-prize-collecting-tsp-2308.062542025-01-14 https://scifaro.com/en/abs/parameterized-matroid-constrained-maximum-coverage-2308.065202023-08-15 https://scifaro.com/en/abs/an-approximation-algorithm-for-ancestral-maximum-likelihood-and-phylogeography-inference-problems-under-time-reversible-markov-evolutionary-models-2308.065612023-08-15 https://scifaro.com/en/abs/optimal-fifo-grouping-in-public-transit-networks-2308.066292024-07-02 https://scifaro.com/en/abs/exploration-of-graphs-with-excluded-minors-2308.068232023-08-15 https://scifaro.com/en/abs/1-epsilon-approximation-of-knapsack-in-nearly-quadratic-time-2308.070042025-08-12 https://scifaro.com/en/abs/kd-club-an-efficient-exact-algorithm-with-new-coloring-based-upper-bound-for-the-maximum-k-defective-clique-problem-2308.072352024-01-11 https://scifaro.com/en/abs/a-fast-algorithm-for-all-pairs-shortest-paths-suitable-for-neural-networks-2308.074032024-07-25 https://scifaro.com/en/abs/approximations-for-the-steiner-multicycle-problem-2308.074712023-08-16 https://scifaro.com/en/abs/dependent-rounding-with-strong-negative-correlation-and-scheduling-on-unrelated-machines-to-minimize-completion-time-2308.074762025-12-11 https://scifaro.com/en/abs/improved-lower-bound-for-estimating-the-number-of-defective-items-2308.077212023-08-16 https://scifaro.com/en/abs/a-tight-competitive-ratio-for-online-submodular-welfare-maximization-2308.077462026-03-25 https://scifaro.com/en/abs/another-virtue-of-wavelet-forests-2308.078092023-08-16 https://scifaro.com/en/abs/a-nearly-quadratic-time-fptas-for-knapsack-2308.078212025-01-08 https://scifaro.com/en/abs/approximation-algorithms-for-norm-multiway-cut-2308.083732023-08-17 https://scifaro.com/en/abs/tightest-admissible-shortest-path-2308.084532024-03-29 https://scifaro.com/en/abs/improved-approximation-bounds-for-minimum-weight-cycle-in-the-congest-model-2308.086702024-05-24 https://scifaro.com/en/abs/approximating-min-diameter-standard-and-bichromatic-2308.086742023-08-21 https://scifaro.com/en/abs/approximation-algorithms-for-steiner-connectivity-augmentation-2308.086902024-08-12 https://scifaro.com/en/abs/mitigating-misinformation-spreading-in-social-networks-via-edge-blocking-2308.088602023-08-21 https://scifaro.com/en/abs/computing-complexity-measures-of-degenerate-graphs-2308.088682023-08-21 https://scifaro.com/en/abs/sensitivity-and-dynamic-distance-oracles-via-generic-matrices-and-frobenius-form-2308.088702023-08-21 https://scifaro.com/en/abs/minimum-path-cover-the-power-of-parameterization-2308.089602023-08-21 https://scifaro.com/en/abs/simpler-analyses-of-union-find-2308.090212023-08-21 https://scifaro.com/en/abs/algorithms-and-computational-study-on-a-transportation-system-integrating-public-transit-and-ridesharing-of-personal-vehicles-2308.091912023-08-21 https://scifaro.com/en/abs/efficient-algorithms-for-attributed-graph-alignment-with-vanishing-edge-correlation-2308.092102024-06-12 https://scifaro.com/en/abs/shockhash-towards-optimal-space-minimal-perfect-hashing-beyond-brute-force-2308.095612023-11-14 https://scifaro.com/en/abs/a-scalable-clustering-algorithm-to-approximate-graph-cuts-2308.096132024-10-15 https://scifaro.com/en/abs/on-lifting-integrality-gaps-to-sseh-hardness-for-globally-constrained-csps-2308.096672023-08-21 https://scifaro.com/en/abs/near-linear-time-samplers-for-matroid-independent-sets-with-applications-2308.096832023-09-28 https://scifaro.com/en/abs/counting-and-sampling-labeled-chordal-graphs-in-polynomial-time-2308.097032024-10-04 https://scifaro.com/en/abs/when-stochastic-rewards-reduce-to-deterministic-rewards-in-online-bipartite-matching-2308.097672024-01-10 https://scifaro.com/en/abs/wheeler-maps-2308.098362023-08-22 https://scifaro.com/en/abs/minimizing-carbon-footprint-for-timely-e-truck-transportation-hardness-and-approximation-algorithm-2308.098662023-08-22 https://scifaro.com/en/abs/laminar-matroid-secretary-greedy-strikes-back-2308.098802024-07-03 https://scifaro.com/en/abs/computing-the-vapnik-chervonenkis-dimension-for-non-discrete-settings-2308.100412023-08-22 https://scifaro.com/en/abs/higher-order-cheeger-inequality-for-partitioning-with-buffers-2308.101602023-08-22 https://scifaro.com/en/abs/improved-algorithms-for-integer-complexity-2308.103012023-09-14 https://scifaro.com/en/abs/almost-tight-bounds-for-differentially-private-densest-subgraph-2308.103162024-04-09 https://scifaro.com/en/abs/fair-rank-aggregation-2308.104992023-08-22 https://scifaro.com/en/abs/practical-parallel-algorithms-for-non-monotone-submodular-maximization-2308.106562024-12-04 https://scifaro.com/en/abs/parameterized-complexity-of-fair-bisection-fpt-approximation-meets-unbreakability-2308.106572023-08-22 https://scifaro.com/en/abs/characterization-of-random-walks-on-space-of-unordered-trees-using-efficient-metric-simulation-2308.108612023-08-22 https://scifaro.com/en/abs/finding-small-complete-subgraphs-efficiently-2308.111462026-02-18 https://scifaro.com/en/abs/simple-and-faster-algorithms-for-knapsack-2308.113072024-01-30 https://scifaro.com/en/abs/parameterized-complexity-of-simultaneous-planarity-2308.114012025-05-01 https://scifaro.com/en/abs/consistency-checking-problems-a-gateway-to-parameterized-sample-complexity-2308.114162023-08-23 https://scifaro.com/en/abs/sequencing-stochastic-jobs-with-a-single-sample-2308.114612023-08-23 https://scifaro.com/en/abs/tight-lower-bound-on-equivalence-testing-in-conditional-sampling-model-2308.115582023-08-23 https://scifaro.com/en/abs/dynamic-compact-data-structure-for-temporal-reachability-with-unsorted-contact-insertions-2308.117342023-08-24 https://scifaro.com/en/abs/linear-programming-based-reductions-for-multiple-visit-tsp-and-vehicle-routing-problems-2308.117422023-08-24 https://scifaro.com/en/abs/quantum-circuits-for-fixed-substring-matching-problems-2308.117582023-08-24 https://scifaro.com/en/abs/adaptive-encoding-strategies-for-erasing-based-lossless-floating-point-compression-2308.119152023-09-15 https://scifaro.com/en/abs/linear-sized-spectral-sparsifiers-and-the-kadison-singer-problem-2308.124832024-01-09 https://scifaro.com/en/abs/no-polynomial-kernels-for-knapsack-2308.125932023-10-11 https://scifaro.com/en/abs/an-eptas-for-cardinality-constrained-multiple-knapsack-via-iterative-randomized-rounding-2308.126222024-06-11 https://scifaro.com/en/abs/sink-location-problems-in-dynamic-flow-grid-networks-2308.126512023-08-30 https://scifaro.com/en/abs/shortest-odd-paths-in-undirected-graphs-with-conservative-weight-functions-2308.126532023-08-25 https://scifaro.com/en/abs/counting-distinct-elements-under-person-level-differential-privacy-2308.129472023-10-30 https://scifaro.com/en/abs/are-there-graphs-whose-shortest-path-structure-requires-large-edge-weights-2308.130542025-06-30 https://scifaro.com/en/abs/optimizing-hierarchical-queries-for-the-attribution-reporting-api-2308.135102023-11-28 https://scifaro.com/en/abs/sage-a-storage-based-approach-for-scalable-and-efficient-sparse-generalized-matrix-matrix-multiplication-2308.136262023-08-29 https://scifaro.com/en/abs/spanning-adjacency-oracles-in-sublinear-time-2308.138902023-12-20 https://scifaro.com/en/abs/an-improved-kernel-and-parameterized-algorithm-for-almost-induced-matching-2308.141162024-02-22 https://scifaro.com/en/abs/the-apx-hardness-of-the-traveling-tournament-problem-2308.141242025-05-29 https://scifaro.com/en/abs/multidepot-capacitated-vehicle-routing-with-improved-approximation-guarantees-2308.141312024-04-18 https://scifaro.com/en/abs/locally-uniform-hashing-2308.141342023-09-29 https://scifaro.com/en/abs/sampling-unknown-large-networks-restricted-by-low-sampling-rates-2308.142792024-06-12 https://scifaro.com/en/abs/efficient-batch-dynamic-graphlet-counting-2308.144932023-08-29 https://scifaro.com/en/abs/local-lipschitz-filters-for-bounded-range-functions-with-applications-to-arbitrary-real-valued-functions-2308.147162024-05-06 https://scifaro.com/en/abs/faster-min-cost-flow-and-approximate-tree-decomposition-on-bounded-treewidth-graphs-2308.147272024-07-02 https://scifaro.com/en/abs/breaking-the-vlb-barrier-for-oblivious-reconfigurable-networks-2308.148372023-12-04 https://scifaro.com/en/abs/cagra-highly-parallel-graph-construction-and-approximate-nearest-neighbor-search-for-gpus-2308.151362024-07-10 https://scifaro.com/en/abs/approximate-monotone-local-search-for-weighted-problems-2308.153062023-08-30 https://scifaro.com/en/abs/adversarial-low-degree-testing-2308.154412023-08-30 https://scifaro.com/en/abs/graph-theory-and-its-uses-in-graph-algorithms-and-beyond-2308.154732023-08-30 https://scifaro.com/en/abs/scalable-algorithms-for-2-packing-sets-on-arbitrary-graphs-2308.155152024-02-13 https://scifaro.com/en/abs/fpt-approximation-and-subexponential-algorithms-for-covering-few-or-many-edges-2308.155462023-08-31 https://scifaro.com/en/abs/streaming-local-and-multi-level-hyper-graph-decomposition-2308.156172023-08-31 https://scifaro.com/en/abs/parameterized-and-approximation-algorithms-for-the-maximum-bimodal-subgraph-problem-2308.156352023-08-31 https://scifaro.com/en/abs/a-task-parallel-approach-for-localized-topological-data-structures-2308.156382025-04-03 https://scifaro.com/en/abs/a-global-analysis-of-the-primal-dual-method-for-pliable-families-2308.157142025-04-10 https://scifaro.com/en/abs/an-improved-greedy-curvature-bound-in-finite-horizon-string-optimization-with-application-to-a-sensor-coverage-problem-2308.157582023-09-08 https://scifaro.com/en/abs/on-colorful-vertex-and-edge-cover-problems-2308.158422023-08-31 https://scifaro.com/en/abs/data-reduction-for-directed-feedback-vertex-set-on-graphs-without-long-induced-cycles-2308.159002025-01-23 https://scifaro.com/en/abs/sorting-signed-permutations-by-reversals-in-nearly-linear-time-2308.159282023-08-31 https://scifaro.com/en/abs/jaccard-constrained-dense-subgraph-discovery-2308.159362023-08-31 https://scifaro.com/en/abs/support-testing-in-the-huge-object-model-2308.159882024-09-18 https://scifaro.com/en/abs/decomposing-triangulations-into-4-connected-components-2308.160202023-08-31 https://scifaro.com/en/abs/optimal-non-adaptive-cell-probe-dictionaries-and-hashing-2308.160422024-04-22 https://scifaro.com/en/abs/enumerating-minimal-vertex-covers-and-dominating-sets-with-capacity-and-or-connectivity-constraints-2308.164262024-11-15 https://scifaro.com/en/abs/ultraloglog-a-practical-and-more-space-efficient-alternative-to-hyperloglog-for-approximate-distinct-counting-2308.168622024-06-11 https://scifaro.com/en/abs/the-complexity-of-cluster-vertex-splitting-and-company-2309.005042024-04-04 https://scifaro.com/en/abs/a-double-decomposition-based-parallel-exact-algorithm-for-the-feedback-length-minimization-problem-2309.008112023-09-14 https://scifaro.com/en/abs/approximating-fair-k-min-sum-radii-in-euclidean-space-2309.008342024-10-01 https://scifaro.com/en/abs/from-specific-to-generic-learned-sorted-set-dictionaries-a-theoretically-sound-paradigm-yelding-competitive-data-structural-boosters-in-practice-2309.009462023-09-06 https://scifaro.com/en/abs/relaxed-agreement-forests-2309.011102023-09-06 https://scifaro.com/en/abs/min-matrix-and-vector-products-for-inputs-decomposable-into-few-monotone-subsequences-2309.011362023-09-06 https://scifaro.com/en/abs/longest-common-substring-and-longest-palindromic-substring-in-tilde-mathcal-o-sqrt-n-time-2309.012502023-09-06 https://scifaro.com/en/abs/random-projections-of-sparse-adjacency-matrices-2309.013602023-09-06 https://scifaro.com/en/abs/a-5-approximation-algorithm-for-the-traveling-tournament-problem-2309.019022023-09-06 https://scifaro.com/en/abs/online-hitting-set-of-d-dimensional-fat-objects-2309.022692023-09-06 https://scifaro.com/en/abs/efficient-maximum-k-defective-clique-computation-with-improved-time-complexity-2309.026352023-09-07 https://scifaro.com/en/abs/solving-the-recoverable-robust-shortest-path-problem-in-dags-2309.028162023-09-07 https://scifaro.com/en/abs/efficient-algorithms-for-injectivity-and-bounded-surjectivity-of-one-dimensional-nonlinear-cellular-automata-2309.030732024-07-29 https://scifaro.com/en/abs/testing-properties-of-distributions-in-the-streaming-model-2309.032452023-09-08 https://scifaro.com/en/abs/parameterized-aspects-of-distinct-kemeny-rank-aggregation-2309.035172023-09-08 https://scifaro.com/en/abs/adjacency-sketches-in-adversarial-environments-2309.037282023-09-08 https://scifaro.com/en/abs/noisy-computing-of-the-mathsf-or-and-mathsf-max-functions-2309.039862023-09-11 https://scifaro.com/en/abs/hardness-of-approximating-bounded-degree-max-2-csp-and-independent-set-on-k-claw-free-graphs-2309.040992023-09-11 https://scifaro.com/en/abs/value-compressed-sparse-column-vcsc-sparse-matrix-storage-for-redundant-data-2309.043552025-07-01 https://scifaro.com/en/abs/on-interactive-coding-schemes-with-adaptive-termination-2309.045862023-09-12 https://scifaro.com/en/abs/parallel-submodular-function-minimization-2309.046432023-09-12 https://scifaro.com/en/abs/hutchinson-s-estimator-is-bad-at-kronecker-trace-estimation-2309.049522025-02-03 https://scifaro.com/en/abs/how-to-assign-volunteers-to-tasks-compatibly-a-graph-theoretic-and-parameterized-approach-2309.049952023-09-12 https://scifaro.com/en/abs/parallel-ram-from-cyclic-circuits-2309.051332023-10-30 https://scifaro.com/en/abs/streaming-semidefinite-programs-o-sqrt-n-passes-small-space-and-fast-runtime-2309.051352023-09-12 https://scifaro.com/en/abs/2-approximation-for-prize-collecting-steiner-forest-2309.051722024-05-08 https://scifaro.com/en/abs/data-summarization-beyond-monotonicity-non-monotone-two-stage-submodular-maximization-2309.051832023-11-03 https://scifaro.com/en/abs/influence-maximization-in-ising-models-2309.052062024-01-05 https://scifaro.com/en/abs/two-way-linear-probing-revisited-2309.053082023-09-20 https://scifaro.com/en/abs/let-them-have-cakes-a-cutting-edge-algorithm-for-scalable-efficient-and-exact-search-on-big-data-2309.054912025-01-28 https://scifaro.com/en/abs/concentration-of-submodular-functions-and-read-k-families-under-negative-dependence-2309.055542024-09-27 https://scifaro.com/en/abs/private-distribution-testing-with-heterogeneous-constraints-your-epsilon-might-not-be-mine-2309.060682023-09-14 https://scifaro.com/en/abs/the-time-complexity-of-fully-sparse-matrix-multiplication-2309.063172023-09-13 https://scifaro.com/en/abs/fault-tolerant-spanners-against-bounded-degree-edge-failures-linearly-more-faults-almost-for-free-2309.066962023-09-14 https://scifaro.com/en/abs/harvesting-brownian-motion-zero-energy-computational-sampling-2309.069572024-08-30 https://scifaro.com/en/abs/breaking-the-k-log-k-barrier-in-collective-tree-exploration-via-tree-mining-2309.070112023-11-01 https://scifaro.com/en/abs/international-competition-on-graph-counting-algorithms-2023-2309.073812023-09-15 https://scifaro.com/en/abs/a-fast-optimization-view-reformulating-single-layer-attention-in-llm-based-on-tensor-and-svm-trick-and-solving-it-in-matrix-multiplication-time-2309.074182023-09-15 https://scifaro.com/en/abs/massively-parallel-heat-map-sorting-and-applications-to-explainable-clustering-2309.074862023-09-15 https://scifaro.com/en/abs/dynamic-programming-on-bipartite-tree-decompositions-2309.077542025-12-01 https://scifaro.com/en/abs/improved-shortest-path-restoration-lemmas-for-multiple-edge-failures-trade-offs-between-fault-tolerance-and-subpaths-2309.079642024-03-06 https://scifaro.com/en/abs/fast-triangle-counting-2309.090642023-09-21 https://scifaro.com/en/abs/two-sided-capacitated-submodular-maximization-in-gig-platforms-2309.090982023-09-19 https://scifaro.com/en/abs/total-variation-distance-meets-probabilistic-inference-2309.091342024-07-02 https://scifaro.com/en/abs/a-tight-lower-bound-of-omega-log-n-for-the-estimation-of-the-number-of-defective-items-2309.096132023-09-19 https://scifaro.com/en/abs/how-to-make-knockout-tournaments-more-popular-2309.099672024-01-24 https://scifaro.com/en/abs/simple-and-optimal-online-contention-resolution-schemes-for-k-uniform-matroids-2309.100782023-11-28 https://scifaro.com/en/abs/graph-threading-2309.101222024-05-29 https://scifaro.com/en/abs/maintaining-matroid-intersections-online-2309.102142023-09-20 https://scifaro.com/en/abs/a-tight-lower-bound-on-non-adaptive-group-testing-estimation-2309.102862023-12-08 https://scifaro.com/en/abs/online-matching-with-stochastic-rewards-advanced-analyses-using-configuration-linear-programs-2309.102892023-09-20 https://scifaro.com/en/abs/worst-case-and-smoothed-analysis-of-the-hartigan-wong-method-for-k-means-clustering-2309.103682024-01-18 https://scifaro.com/en/abs/k-shortest-simple-paths-using-biobjective-path-search-2309.103772023-09-20 https://scifaro.com/en/abs/improved-guarantees-for-the-a-priori-tsp-2309.106632023-09-20 https://scifaro.com/en/abs/testing-frequency-distributions-in-a-stream-2309.111752025-08-26 https://scifaro.com/en/abs/single-exponential-fpt-algorithms-for-enumerating-secluded-mathcal-f-free-subgraphs-and-deleting-to-scattered-graph-classes-2309.113662023-09-21 https://scifaro.com/en/abs/distribution-independent-regression-for-generalized-linear-models-with-oblivious-corruptions-2309.116572023-09-29 https://scifaro.com/en/abs/balcon-resource-balancing-algorithm-for-vm-consolidation-2309.118592023-09-22 https://scifaro.com/en/abs/robust-approximation-algorithms-for-non-monotone-k-submodular-maximization-under-a-knapsack-constraint-2309.120252023-09-22 https://scifaro.com/en/abs/simple-approximation-algorithms-for-minimizing-the-total-weighted-completion-time-of-precedence-constrained-jobs-2309.120312023-09-22 https://scifaro.com/en/abs/user-level-differential-privacy-with-few-examples-per-user-2309.125002023-09-25 https://scifaro.com/en/abs/dynamic-succincter-2309.129502023-09-25 https://scifaro.com/en/abs/faster-approximate-all-pairs-shortest-paths-2309.132252023-09-26 https://scifaro.com/en/abs/online-bin-covering-with-exact-parameter-advice-2309.136472023-09-26 https://scifaro.com/en/abs/a-simple-linear-time-algorithm-for-generating-auxiliary-3-edge-connected-subgraphs-2309.138272024-08-14 https://scifaro.com/en/abs/temporal-separators-with-deadlines-2309.141852023-09-26 https://scifaro.com/en/abs/revisiting-tree-isomorphism-an-algorithmic-bric-a-brac-2309.144412024-02-13 https://scifaro.com/en/abs/bicriteria-approximation-algorithms-for-the-submodular-cover-problem-2309.145582023-09-27 https://scifaro.com/en/abs/on-deterministically-approximating-total-variation-distance-2309.146962023-09-27 https://scifaro.com/en/abs/on-the-advice-complexity-of-online-unit-clustering-2309.147302024-09-27 https://scifaro.com/en/abs/small-space-algorithms-for-the-online-language-distance-problem-for-palindromes-and-squares-2309.147882024-05-01 https://scifaro.com/en/abs/composable-coresets-for-determinant-maximization-greedy-is-almost-optimal-2309.152862023-09-28 https://scifaro.com/en/abs/multi-dimensional-data-quick-query-for-blockchain-based-federated-learning-2309.153482023-09-28 https://scifaro.com/en/abs/counting-perfect-matchings-and-hamiltonian-cycles-faster-2309.154222026-05-05 https://scifaro.com/en/abs/the-st-planar-edge-completion-problem-is-fixed-parameter-tractable-2309.154542023-09-28 https://scifaro.com/en/abs/sidestepping-barriers-for-dominating-set-in-parameterized-complexity-2309.156452023-09-28 https://scifaro.com/en/abs/minimum-monotone-tree-decomposition-of-density-functions-defined-on-graphs-2309.160452023-09-29 https://scifaro.com/en/abs/matrix-multiplication-verification-using-coding-theory-2309.161762024-07-23 https://scifaro.com/en/abs/cut-a-numeric-string-into-required-pieces-2309.162122023-09-29 https://scifaro.com/en/abs/deterministic-fully-dynamic-sssp-and-more-2309.165942023-09-29 https://scifaro.com/en/abs/a-deterministic-almost-linear-time-algorithm-for-minimum-cost-flow-2309.166292023-09-29 https://scifaro.com/en/abs/sparse-submodular-function-minimization-2309.166322024-07-09 https://scifaro.com/en/abs/constant-approximation-for-individual-preference-stable-clustering-2309.168402023-10-02 https://scifaro.com/en/abs/kernels-for-the-disjoint-paths-problem-on-subclasses-of-chordal-graphs-2309.168922023-10-02 https://scifaro.com/en/abs/dynamic-batching-of-online-arrivals-to-leverage-economies-of-scale-2309.169112025-08-04 https://scifaro.com/en/abs/max-weight-independent-set-in-sparse-graphs-with-no-long-claws-2309.169952024-01-15 https://scifaro.com/en/abs/fpt-approximation-of-generalised-hypertree-width-for-bounded-intersection-hypergraphs-2309.170492024-01-09 https://scifaro.com/en/abs/bandwidth-parameterized-by-cluster-vertex-deletion-number-2309.172042025-05-06 https://scifaro.com/en/abs/handling-correlated-rounding-error-via-preclustering-a-1-73-approximation-for-correlation-clustering-2309.172432023-10-02 https://scifaro.com/en/abs/optimal-bounds-on-private-graph-approximation-2309.173302023-10-02 https://scifaro.com/en/abs/degree-distribution-identifiability-of-stochastic-kronecker-graphs-2310.001712023-10-03 https://scifaro.com/en/abs/tight-bounds-for-volumetric-spanners-and-applications-2310.001752023-10-03 https://scifaro.com/en/abs/the-complexity-of-distance-r-dominating-set-reconfiguration-2310.002412026-03-10 https://scifaro.com/en/abs/new-sdp-roundings-and-certifiable-approximation-for-cubic-optimization-2310.003932023-10-03 https://scifaro.com/en/abs/on-the-complexity-of-the-eigenvalue-deletion-problem-2310.006002023-10-03 https://scifaro.com/en/abs/an-fpras-for-two-terminal-reliability-in-directed-acyclic-graphs-2310.009382024-02-16 https://scifaro.com/en/abs/an-objective-improvement-approach-to-solving-discounted-payoff-games-2310.010082023-10-03 https://scifaro.com/en/abs/finding-a-reconfiguration-sequence-between-longest-increasing-subsequences-2310.010662023-10-03 https://scifaro.com/en/abs/on-b-matching-and-fully-dynamic-maximum-k-edge-coloring-2310.011492025-04-11 https://scifaro.com/en/abs/clustering-graphs-of-bounded-treewidth-to-minimize-the-sum-of-radius-dependent-costs-2310.021302023-10-05 https://scifaro.com/en/abs/efficient-enumeration-of-drawings-and-combinatorial-structures-for-maximal-planar-graphs-2310.022472023-10-04 https://scifaro.com/en/abs/sgorp-a-subgradient-based-method-for-d-dimensional-rectilinear-partitioning-2310.024702023-10-05 https://scifaro.com/en/abs/a-faster-deterministic-approximation-algorithm-for-ttp-2-2310.025922024-03-01 https://scifaro.com/en/abs/online-algorithms-for-spectral-hypergraph-sparsification-2310.026432023-11-08 https://scifaro.com/en/abs/searching-2d-strings-for-matching-frames-2310.026702024-04-19 https://scifaro.com/en/abs/on-the-length-of-strongly-monotone-descending-chains-over-mathbb-n-d-2310.028472024-07-03 https://scifaro.com/en/abs/streaming-euclidean-k-median-and-k-means-with-o-log-n-space-2310.028822023-10-05 https://scifaro.com/en/abs/fpt-approximations-for-packing-and-covering-problems-parameterized-by-elimination-distance-and-even-less-2310.034692023-10-06 https://scifaro.com/en/abs/finding-missing-items-requires-strong-forms-of-randomness-2310.036342024-07-04 https://scifaro.com/en/abs/testing-higher-order-clusterability-on-graphs-2310.040182023-10-09 https://scifaro.com/en/abs/how-to-capture-higher-order-correlations-generalizing-matrix-softmax-attention-to-kronecker-computation-2310.040642023-10-09 https://scifaro.com/en/abs/deterministic-clustering-in-high-dimensional-spaces-sketches-and-approximation-2310.040762023-10-09 https://scifaro.com/en/abs/errata-to-faster-deterministic-exponential-time-algorithm-for-energy-games-and-mean-payoff-games-2310.041302023-10-09 https://scifaro.com/en/abs/a-fixed-parameter-tractable-algorithm-for-counting-markov-equivalence-classes-with-the-same-skeleton-2310.042182024-07-04 https://scifaro.com/en/abs/optimization-with-pattern-avoiding-input-2310.042362025-11-25 https://scifaro.com/en/abs/kernelization-for-counting-problems-on-graphs-preserving-the-number-of-minimum-solutions-2310.043032023-10-09 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-multiway-near-separator-2310.043322023-10-09 https://scifaro.com/en/abs/submodular-norms-with-applications-to-online-facility-location-and-stochastic-probing-2310.045482023-10-10 https://scifaro.com/en/abs/algorithms-for-the-ridesharing-with-profit-constraint-problem-2310.049332023-10-10 https://scifaro.com/en/abs/limitations-of-stochastic-selection-with-pairwise-independent-priors-2310.052402024-03-19 https://scifaro.com/en/abs/efficient-self-adjusting-search-trees-via-lazy-updates-2310.052982023-10-10 https://scifaro.com/en/abs/emergent-chaotic-iterations-in-hard-sparse-instances-of-hamiltonian-path-problem-2310.054272023-10-10 https://scifaro.com/en/abs/drawn-tree-decomposition-new-approach-for-graph-drawing-problems-2310.054712023-10-10 https://scifaro.com/en/abs/collective-graph-exploration-parameterized-by-vertex-cover-2310.054802023-10-10 https://scifaro.com/en/abs/finding-a-minimum-spanning-tree-with-a-small-non-terminal-set-2310.054942025-01-30 https://scifaro.com/en/abs/hidden-permutations-to-the-rescue-multi-pass-semi-streaming-lower-bounds-for-approximate-matchings-2310.057282023-10-12 https://scifaro.com/en/abs/improved-scheduling-with-a-shared-resource-2310.057322023-10-11 https://scifaro.com/en/abs/parameterized-complexity-of-mincsp-over-the-point-algebra-2310.058392024-05-08 https://scifaro.com/en/abs/adaptive-cache-friendly-priority-queue-enhancing-heap-tree-efficiency-for-modern-computing-2310.066632023-11-27 https://scifaro.com/en/abs/fault-tolerant-k-supplier-with-outliers-2310.072082024-01-18 https://scifaro.com/en/abs/algorithmic-study-on-liar-s-vertex-edge-domination-problem-2310.074652024-01-25 https://scifaro.com/en/abs/approximating-subset-sum-ratio-faster-than-subset-sum-2310.075952023-10-12 https://scifaro.com/en/abs/on-1-varepsilon-approximate-flow-sparsifiers-2310.078572023-10-13 https://scifaro.com/en/abs/an-tilde-omega-big-sqrt-log-t-big-lower-bound-for-steiner-point-removal-2310.078622023-10-13 https://scifaro.com/en/abs/secretary-problems-with-random-number-of-candidates-how-prior-distributional-information-helps-2310.078842023-10-13 https://scifaro.com/en/abs/core-sets-for-fair-and-diverse-data-summarization-2310.081222023-10-13 https://scifaro.com/en/abs/computing-twin-width-parameterized-by-the-feedback-edge-number-2310.082432023-10-13 https://scifaro.com/en/abs/when-location-shapes-choice-placement-optimization-of-substitutable-products-2310.085682025-10-06 https://scifaro.com/en/abs/the-complexity-of-homomorphism-reconstructibility-2310.090092023-10-16 https://scifaro.com/en/abs/sparse-suffix-and-lcp-array-simple-direct-small-and-fast-2310.090232024-07-08 https://scifaro.com/en/abs/a-4-approximation-algorithm-for-min-max-correlation-clustering-2310.091962024-02-15 https://scifaro.com/en/abs/sorting-and-selection-in-rounds-with-adversarial-comparisons-2310.094832025-09-09 https://scifaro.com/en/abs/improved-combinatorial-approximations-for-weighted-correlation-clustering-2310.096382025-07-16 https://scifaro.com/en/abs/tree-containment-above-minimum-degree-is-fpt-2310.096782023-10-17 https://scifaro.com/en/abs/random-order-contention-resolution-via-continuous-induction-tightness-for-bipartite-matching-under-vertex-arrivals-2310.101012023-12-14 https://scifaro.com/en/abs/efficiently-matching-random-inhomogeneous-graphs-via-degree-profiles-2310.104412025-08-19 https://scifaro.com/en/abs/content-moderation-and-the-formation-of-online-communities-a-theoretical-framework-2310.105732023-10-17 https://scifaro.com/en/abs/streaming-algorithms-for-graph-k-matching-with-optimal-or-near-optimal-update-time-2310.108152023-10-18 https://scifaro.com/en/abs/fast-and-simple-spectral-clustering-in-theory-and-practice-2310.109392023-10-18 https://scifaro.com/en/abs/separator-theorem-and-algorithms-for-planar-hyperbolic-graphs-2310.112832023-10-18 https://scifaro.com/en/abs/towards-the-characterization-of-terminal-cut-functions-a-condition-for-laminar-families-2310.113672024-03-21 https://scifaro.com/en/abs/faster-algorithms-for-generalized-mean-densest-subgraph-problem-2310.113772023-10-18 https://scifaro.com/en/abs/simpler-reductions-from-exact-triangle-2310.115752023-10-19 https://scifaro.com/en/abs/open-problems-in-hyper-graph-decomposition-2310.118122023-10-19 https://scifaro.com/en/abs/deterministic-sparse-pattern-matching-via-the-baur-strassen-theorem-2310.119132023-10-19 https://scifaro.com/en/abs/the-asymptotic-rank-conjecture-and-the-set-cover-conjecture-are-not-both-true-2310.119262023-10-19 https://scifaro.com/en/abs/simpler-and-higher-lower-bounds-for-shortcut-sets-2310.120512023-10-19 https://scifaro.com/en/abs/vital-edges-for-s-t-mincut-efficient-algorithms-compact-structures-and-optimal-sensitivity-oracle-2310.120962024-10-22 https://scifaro.com/en/abs/on-the-space-usage-of-approximate-distance-oracles-with-sub-2-stretch-2310.122392024-10-02 https://scifaro.com/en/abs/nearly-optimal-bounds-for-sample-based-testing-and-learning-of-k-monotone-functions-2310.123752024-08-21 https://scifaro.com/en/abs/an-o-log-n-competitive-posted-price-algorithm-for-online-matching-on-the-line-2310.123942023-10-20 https://scifaro.com/en/abs/online-combinatorial-linear-optimization-via-a-frank-wolfe-based-metarounding-algorithm-2310.126292023-11-21 https://scifaro.com/en/abs/an-enumerative-perspective-on-connectivity-2310.128892024-12-25 https://scifaro.com/en/abs/edge-disjoint-paths-in-expanders-online-with-removals-2310.130822023-10-23 https://scifaro.com/en/abs/faster-algorithms-for-text-to-pattern-hamming-distances-2310.131742024-12-20 https://scifaro.com/en/abs/one-phase-batch-update-on-sparse-merkle-trees-for-rollups-2310.133282023-10-23 https://scifaro.com/en/abs/an-analysis-of-d-alpha-seeding-for-k-means-2310.134742023-10-23 https://scifaro.com/en/abs/a-new-and-faster-representation-for-counting-integer-points-in-parametric-polyhedra-2310.137882024-12-05 https://scifaro.com/en/abs/densest-subhypergraph-negative-supermodular-functions-and-strongly-localized-methods-2310.137922024-02-23 https://scifaro.com/en/abs/fast-approximation-of-similarity-graphs-with-kernel-density-estimation-2310.138702023-10-24 https://scifaro.com/en/abs/caching-connections-in-matchings-2310.140582024-02-26 https://scifaro.com/en/abs/online-duet-between-metric-embeddings-and-minimum-weight-perfect-matchings-2310.140782024-11-05 https://scifaro.com/en/abs/sorting-from-crowdsourced-comparisons-using-expert-verifications-2310.141132023-10-24 https://scifaro.com/en/abs/listing-6-cycles-2310.145752023-10-24 https://scifaro.com/en/abs/shockhash-near-optimal-space-minimal-perfect-hashing-beyond-brute-force-2310.149592024-06-14 https://scifaro.com/en/abs/probabilistic-counting-in-generalized-turnstile-models-2310.149772023-10-24 https://scifaro.com/en/abs/the-quantum-tortoise-and-the-classical-hare-a-simple-framework-for-understanding-which-problems-quantum-computing-will-accelerate-and-which-it-will-not-2310.155052023-10-25 https://scifaro.com/en/abs/efficient-online-string-matching-through-linked-weak-factors-2310.157112023-10-25 https://scifaro.com/en/abs/metric-clustering-and-mst-with-strong-and-weak-distance-oracles-2310.158632023-10-25 https://scifaro.com/en/abs/fast-algorithms-for-separable-linear-programs-2310.163512023-10-26 https://scifaro.com/en/abs/o-1-varepsilon-is-the-answer-in-online-weighted-throughput-maximization-2310.166972023-10-26 https://scifaro.com/en/abs/finding-the-saddlepoint-faster-than-sorting-2310.168012023-10-26 https://scifaro.com/en/abs/robust-sparsification-for-matroid-intersection-with-applications-2310.168272023-10-26 https://scifaro.com/en/abs/fully-dynamic-k-clustering-in-tilde-o-k-update-time-2310.174202023-10-27 https://scifaro.com/en/abs/a-sublinear-time-spectral-clustering-oracle-with-improved-preprocessing-time-2310.178782024-01-01 https://scifaro.com/en/abs/simple-linear-size-additive-emulators-2310.178862024-01-09 https://scifaro.com/en/abs/sketching-and-streaming-for-dictionary-compression-2310.179802024-08-20 https://scifaro.com/en/abs/experimental-evaluation-of-fully-dynamic-k-means-via-coresets-2310.180342023-10-30 https://scifaro.com/en/abs/fast-and-simple-unrooted-dynamic-forests-2310.180362024-01-09 https://scifaro.com/en/abs/deterministic-primal-dual-algorithms-for-online-k-way-matching-with-delays-2310.180712023-10-30 https://scifaro.com/en/abs/adaptive-out-orientations-with-applications-2310.181462023-11-07 https://scifaro.com/en/abs/structured-semidefinite-programming-for-recovering-structured-preconditioners-2310.182652023-10-30 https://scifaro.com/en/abs/last-truck-scheduling-for-middle-mile-next-day-delivery-coverage-2310.183882025-04-22 https://scifaro.com/en/abs/a-novel-skip-orthogonal-list-for-dynamic-optimal-transport-problem-2310.184462024-01-30 https://scifaro.com/en/abs/methodology-of-algorithm-engineering-2310.189792025-09-17 https://scifaro.com/en/abs/sketching-algorithms-for-sparse-dictionary-learning-ptas-and-turnstile-streaming-2310.190682023-10-31 https://scifaro.com/en/abs/worst-case-performance-of-popular-approximate-nearest-neighbor-search-implementations-guarantees-and-limitations-2310.191262023-10-31 https://scifaro.com/en/abs/faster-qubo-brute-force-solving-using-gray-code-2310.193732023-10-31 https://scifaro.com/en/abs/arborescences-colorful-forests-and-popularity-2310.194552023-10-31 https://scifaro.com/en/abs/approximate-earth-mover-s-distance-in-truly-subquadratic-time-2310.195142023-11-14 https://scifaro.com/en/abs/superpolynomial-smoothed-complexity-of-3-flip-in-local-max-cut-2310.195942024-09-27 https://scifaro.com/en/abs/rank-and-select-on-degenerate-strings-2310.197022023-12-05 https://scifaro.com/en/abs/improved-roundtrip-spanners-emulators-and-directed-girth-approximation-2310.204732023-11-01 https://scifaro.com/en/abs/dynamic-dictionary-with-subconstant-wasted-bits-per-key-2310.205362023-11-01 https://scifaro.com/en/abs/fast-and-delay-robust-multimodal-journey-planning-2310.205542023-11-07 https://scifaro.com/en/abs/online-conversion-with-switching-costs-robust-and-learning-augmented-algorithms-2310.205982024-11-11 https://scifaro.com/en/abs/fully-dynamic-approximation-schemes-on-planar-and-apex-minor-free-graphs-2310.206232023-11-01 https://scifaro.com/en/abs/constrained-planarity-in-practice-engineering-the-synchronized-planarity-algorithm-2310.206322023-11-01 https://scifaro.com/en/abs/local-max-cut-on-sparse-graphs-2311.001822024-04-23 https://scifaro.com/en/abs/adversarially-robust-distributed-count-tracking-via-partial-differential-privacy-2311.003462023-11-02 https://scifaro.com/en/abs/couples-can-be-tractable-new-algorithms-and-hardness-results-for-the-hospitals-residents-problem-with-couples-2311.004052024-09-26 https://scifaro.com/en/abs/maximum-k-vs-ell-colourings-of-graphs-2311.004402024-12-17 https://scifaro.com/en/abs/parameterized-covering-in-semi-ladder-free-hypergraphs-2311.004662023-11-09 https://scifaro.com/en/abs/the-eclipse-layout-kernel-2311.005332023-11-02 https://scifaro.com/en/abs/a-survey-of-approximability-results-for-traveling-salesman-problems-using-the-tsp-t3co-definition-scheme-2311.006042025-11-10 https://scifaro.com/en/abs/near-optimal-k-clustering-in-the-sliding-window-model-2311.006422023-11-02 https://scifaro.com/en/abs/sorting-with-predictions-2311.007492023-11-03 https://scifaro.com/en/abs/shortest-paths-on-polymatroids-and-hypergraphic-polytopes-2311.007792023-11-07 https://scifaro.com/en/abs/code-sparsification-and-its-applications-2311.007882023-11-03 https://scifaro.com/en/abs/finer-grained-reductions-in-fine-grained-hardness-of-approximation-2311.007982023-11-03 https://scifaro.com/en/abs/sharp-noisy-binary-search-with-monotonic-probabilities-2311.008402023-11-03 https://scifaro.com/en/abs/2-fault-tolerant-strong-connectivity-oracles-2311.008542023-12-05 https://scifaro.com/en/abs/online-combinatorial-assignment-in-independence-systems-2311.008902023-11-03 https://scifaro.com/en/abs/a-ptas-for-ell-0-low-rank-approximation-solving-dense-csps-over-reals-2311.008922023-11-03 https://scifaro.com/en/abs/a-constant-factor-approximation-for-directed-feedback-vertex-set-in-graphs-of-bounded-genus-2311.010262024-05-14 https://scifaro.com/en/abs/on-conflict-free-cuts-algorithms-and-complexity-2311.010772023-11-03 https://scifaro.com/en/abs/max-s-t-flow-oracles-and-negative-cycle-detection-in-planar-digraphs-2311.010942023-11-03 https://scifaro.com/en/abs/dynamically-maintaining-the-persistent-homology-of-time-series-2311.011152024-07-03 https://scifaro.com/en/abs/constrained-submodular-maximization-via-new-bounds-for-dr-submodular-functions-2311.011292023-11-03 https://scifaro.com/en/abs/simpler-distribution-testing-with-little-memory-2311.011452023-11-03 https://scifaro.com/en/abs/collective-tree-exploration-via-potential-function-method-2311.013542023-11-03 https://scifaro.com/en/abs/fast-many-to-many-routing-for-dynamic-taxi-sharing-with-meeting-points-2311.015812023-11-06 https://scifaro.com/en/abs/generalizations-of-matrix-multiplication-can-solve-the-light-bulb-problem-2311.016302023-11-06 https://scifaro.com/en/abs/near-optimal-quantum-algorithms-for-bounded-edit-distance-and-lempel-ziv-factorization-2311.017932023-11-06 https://scifaro.com/en/abs/parameterized-algorithms-for-block-structured-integer-programs-with-large-entries-2311.018902025-07-23 https://scifaro.com/en/abs/a-lower-bound-for-the-max-entropy-algorithm-for-tsp-2311.019502025-10-02 https://scifaro.com/en/abs/hardness-of-low-rank-approximation-of-entrywise-transformed-matrix-products-2311.019602023-11-06 https://scifaro.com/en/abs/semi-streaming-algorithms-for-weighted-k-disjoint-matchings-2311.020732024-07-09 https://scifaro.com/en/abs/structural-properties-of-search-trees-with-2-way-comparisons-2311.022242023-11-07 https://scifaro.com/en/abs/list-decoding-of-tanner-and-expander-amplified-codes-from-distance-certificates-2311.022632023-11-07 https://scifaro.com/en/abs/algorithms-for-proportional-representation-in-parliament-in-divisor-and-multiplicative-form-2311.022792023-11-07 https://scifaro.com/en/abs/succinct-data-structure-for-graphs-with-d-dimensional-t-representation-2311.024272024-02-07 https://scifaro.com/en/abs/single-source-shortest-paths-with-negative-real-weights-in-tilde-o-mn-8-9-time-2311.025202023-11-14 https://scifaro.com/en/abs/group-testing-for-accurate-and-efficient-range-based-near-neighbor-search-for-plagiarism-detection-2311.025732024-09-10 https://scifaro.com/en/abs/highly-connected-steiner-subgraph-parameterized-algorithms-and-applications-to-hitting-set-problems-2311.027082025-10-07 https://scifaro.com/en/abs/cell-probe-lower-bound-for-accessible-interval-graphs-2311.028392023-11-07 https://scifaro.com/en/abs/incremental-approximate-maximum-flow-on-undirected-graphs-in-subpolynomial-update-time-2311.031742023-11-07 https://scifaro.com/en/abs/dichotomies-for-tree-minor-containment-with-structural-parameters-2311.032252024-12-06 https://scifaro.com/en/abs/balancing-notions-of-equity-trade-offs-between-fair-portfolio-sizes-and-achievable-guarantees-2311.032302024-09-24 https://scifaro.com/en/abs/on-finding-optimal-dynamic-arborescences-2311.032622023-11-07 https://scifaro.com/en/abs/nibbling-at-long-cycles-dynamic-and-static-edge-coloring-in-optimal-time-2311.032672023-11-07 https://scifaro.com/en/abs/exact-shortest-paths-with-rational-weights-on-the-word-ram-2311.033212023-11-07 https://scifaro.com/en/abs/sketching-methods-with-small-window-guarantee-using-minimum-decycling-sets-2311.035922023-11-08 https://scifaro.com/en/abs/novel-data-structures-for-label-based-queries-specifically-efficient-for-billion-property-graph-networks-using-kinetica-graph-2311.036312023-11-08 https://scifaro.com/en/abs/dynamic-non-monotone-submodular-maximization-2311.036852023-11-08 https://scifaro.com/en/abs/improved-deterministic-streaming-algorithms-for-non-monotone-submodular-maximization-2311.038952023-11-08 https://scifaro.com/en/abs/practical-parallel-algorithms-for-near-optimal-densest-subgraphs-on-massive-graphs-2311.043332023-11-09 https://scifaro.com/en/abs/improved-approximations-for-ultrametric-violation-distance-2311.045332023-11-09 https://scifaro.com/en/abs/faster-maximal-exact-matches-with-lazy-lcp-evaluation-2311.045382023-11-09 https://scifaro.com/en/abs/simple-and-asymptotically-optimal-online-bipartite-edge-coloring-2311.045742023-11-09 https://scifaro.com/en/abs/online-min-cost-circulation-for-multi-object-tracking-on-fragments-2311.047492023-11-09 https://scifaro.com/en/abs/computing-the-5-edge-connected-components-in-linear-time-2311.048652023-11-09 https://scifaro.com/en/abs/network-flow-problems-with-electric-vehicles-2311.050402023-11-10 https://scifaro.com/en/abs/inference-for-probabilistic-dependency-graphs-2311.055802023-11-10 https://scifaro.com/en/abs/on-the-density-of-primes-of-the-form-x-2-c-2311.056472023-12-20 https://scifaro.com/en/abs/an-algorithm-for-bichromatic-sorting-with-polylog-competitive-ratio-2311.057732023-11-13 https://scifaro.com/en/abs/structural-parameterizations-of-vertex-integrity-2311.058922024-11-01 https://scifaro.com/en/abs/multiplying-matrices-using-n-arithmetic-operations-2311.059472023-11-13 https://scifaro.com/en/abs/a-3-epsilon-approximation-algorithm-for-the-minimum-sum-of-radii-problem-with-outliers-and-extensions-for-generalized-lower-bounds-2311.061112023-11-13 https://scifaro.com/en/abs/better-sparsifiers-for-directed-eulerian-graphs-2311.062322023-11-13 https://scifaro.com/en/abs/efficient-parallelization-of-a-ubiquitous-sequential-computation-2311.062812023-12-29 https://scifaro.com/en/abs/a-dynamic-shortest-paths-toolbox-low-congestion-vertex-sparsifiers-and-their-applications-2311.064022023-11-14 https://scifaro.com/en/abs/generating-signed-permutations-by-twisting-two-sided-ribbons-2311.069742024-06-17 https://scifaro.com/en/abs/maximum-flow-on-highly-dynamic-graphs-2311.070162023-11-14 https://scifaro.com/en/abs/learning-arithmetic-formulas-in-the-presence-of-noise-a-general-framework-and-applications-to-unsupervised-learning-2311.072842023-11-14 https://scifaro.com/en/abs/differentially-private-approximate-pattern-matching-2311.074152023-11-14 https://scifaro.com/en/abs/finding-planted-cliques-using-gradient-descent-2311.075402025-05-19 https://scifaro.com/en/abs/fast-and-space-efficient-parallel-algorithms-for-influence-maximization-2311.075542024-02-06 https://scifaro.com/en/abs/on-algorithmic-cache-optimization-2311.076152023-11-15 https://scifaro.com/en/abs/estimating-the-matrix-p-rightarrow-q-norm-2311.076772023-11-15 https://scifaro.com/en/abs/a-primal-dual-analysis-of-monotone-submodular-maximization-2311.078082023-11-15 https://scifaro.com/en/abs/quantum-algorithms-for-graph-coloring-and-other-partitioning-covering-and-packing-problems-2311.080422023-11-15 https://scifaro.com/en/abs/arboricity-dependent-algorithms-for-edge-coloring-2311.083672024-02-08 https://scifaro.com/en/abs/query-efficient-weighted-stochastic-matching-2311.085132023-11-16 https://scifaro.com/en/abs/color-fault-tolerant-spanners-2311.088682023-11-16 https://scifaro.com/en/abs/semidefinite-programs-simulate-approximate-message-passing-robustly-2311.090172023-11-16 https://scifaro.com/en/abs/new-graph-decompositions-and-combinatorial-boolean-matrix-multiplication-algorithms-2311.090952024-05-28 https://scifaro.com/en/abs/prophet-inequalities-require-only-a-constant-number-of-samples-2311.091412023-11-16 https://scifaro.com/en/abs/local-computation-algorithms-for-maximum-matching-new-lower-bounds-2311.093592023-11-17 https://scifaro.com/en/abs/near-optimal-streaming-ellipsoidal-rounding-for-general-convex-polytopes-2311.094602023-11-17 https://scifaro.com/en/abs/a-dichotomy-hierarchy-characterizing-linear-time-subgraph-counting-in-bounded-degeneracy-graphs-2311.095842023-11-17 https://scifaro.com/en/abs/ghost-value-augmentation-for-k-edge-connectivity-2311.099412024-04-25 https://scifaro.com/en/abs/the-minimum-clique-routing-problem-on-cycles-2311.100552023-11-17 https://scifaro.com/en/abs/scalable-algorithms-for-laplacian-pseudo-inverse-computation-2311.102902023-11-20 https://scifaro.com/en/abs/scalable-edge-clustering-of-dynamic-graphs-via-weighted-line-graphs-2311.103372023-11-20 https://scifaro.com/en/abs/invariant-subspaces-and-pca-in-nearly-matrix-multiplication-time-2311.104592024-10-30 https://scifaro.com/en/abs/sparsity-parameterised-dynamic-edge-colouring-2311.106162025-01-15 https://scifaro.com/en/abs/optimal-embedding-dimension-for-sparse-subspace-embeddings-2311.106802025-11-18 https://scifaro.com/en/abs/cactus-representations-in-polylogarithmic-max-flow-via-maximal-isolating-mincuts-2311.107062023-11-20 https://scifaro.com/en/abs/a-whole-new-ball-game-a-primal-accelerated-method-for-matrix-games-and-minimizing-the-maximum-of-smooth-functions-2311.108862023-11-21 https://scifaro.com/en/abs/faster-streaming-and-scalable-algorithms-for-finding-directed-dense-subgraphs-in-large-graphs-2311.109242023-11-21 https://scifaro.com/en/abs/hierarchical-cut-labelling-scaling-up-distance-queries-on-road-networks-2311.110632023-11-21 https://scifaro.com/en/abs/pairwise-sequence-alignment-with-block-and-character-edit-operations-2311.110822024-07-04 https://scifaro.com/en/abs/dueling-optimization-with-a-monotone-adversary-2311.111852023-11-21 https://scifaro.com/en/abs/testing-with-non-identically-distributed-samples-2311.111942025-11-05 https://scifaro.com/en/abs/online-makespan-minimization-beat-lpt-by-dynamic-locking-2311.111952025-10-13 https://scifaro.com/en/abs/improved-approximation-algorithms-for-minimizing-the-total-weighted-completion-time-of-coflows-2311.112962023-12-27 https://scifaro.com/en/abs/approximation-algorithms-for-packing-cycles-and-paths-in-complete-graphs-2311.113322024-05-28 https://scifaro.com/en/abs/perfect-simulation-of-las-vegas-algorithms-via-local-computation-2311.116792024-04-08 https://scifaro.com/en/abs/universal-optimality-of-dijkstra-via-beyond-worst-case-heaps-2311.117932025-05-08 https://scifaro.com/en/abs/a-ptas-for-triangle-free-2-matching-2311.118692023-11-21 https://scifaro.com/en/abs/linear-time-online-visibility-graph-transformation-algorithm-for-both-natural-and-horizontal-visibility-criteria-2311.123892023-11-22 https://scifaro.com/en/abs/a-general-technique-for-searching-in-implicit-sets-via-function-inversion-2311.124712026-04-23 https://scifaro.com/en/abs/informative-path-planning-with-limited-adaptivity-2311.126982023-11-22 https://scifaro.com/en/abs/fast-deterministic-rendezvous-in-labeled-lines-2311.129762023-11-23 https://scifaro.com/en/abs/learning-augmented-dynamic-submodular-maximization-2311.130062024-03-11 https://scifaro.com/en/abs/fast-parallel-algorithms-for-submodular-p-superseparable-maximization-2311.131232024-02-05 https://scifaro.com/en/abs/orientable-burning-number-of-graphs-2311.131322023-11-23 https://scifaro.com/en/abs/testing-closeness-of-multivariate-distributions-via-ramsey-theory-2311.131542023-11-23 https://scifaro.com/en/abs/triangle-free-2-matchings-2311.135902025-05-16 https://scifaro.com/en/abs/on-the-size-overhead-of-pairwise-spanners-2311.136732023-11-27 https://scifaro.com/en/abs/work-efficient-parallel-derandomization-i-chernoff-like-concentrations-via-pairwise-independence-2311.137642023-11-27 https://scifaro.com/en/abs/work-efficient-parallel-derandomization-ii-optimal-concentrations-via-bootstrapping-2311.137712023-11-27 https://scifaro.com/en/abs/geometric-covering-using-random-fields-2311.140822023-11-27 https://scifaro.com/en/abs/maximum-cardinality-f-matching-in-time-o-n-2-3-m-2311.142362023-11-27 https://scifaro.com/en/abs/distribution-testing-with-a-confused-collector-2311.142472023-11-27 https://scifaro.com/en/abs/four-set-hypergraphlets-for-characterization-of-directed-hypergraphs-2311.142892023-11-27 https://scifaro.com/en/abs/instance-specific-asymmetric-sensitivity-in-differential-privacy-2311.146812023-11-28 https://scifaro.com/en/abs/recursive-lattice-reduction-a-framework-for-finding-short-lattice-vectors-2311.150642025-04-22 https://scifaro.com/en/abs/testable-learning-with-distribution-shift-2311.151422024-05-22 https://scifaro.com/en/abs/grafite-taming-adversarial-queries-with-optimal-range-filters-2311.153802024-03-28 https://scifaro.com/en/abs/on-approximating-cutwidth-and-pathwidth-2311.156392024-04-15 https://scifaro.com/en/abs/size-constrained-weighted-ancestors-with-applications-2311.157772024-05-24 https://scifaro.com/en/abs/simple-lattice-basis-computation-the-generalization-of-the-euclidean-algorithm-2311.159022023-11-28 https://scifaro.com/en/abs/low-degree-hardness-of-detection-for-correlated-erd-h-o-s-r-enyi-graphs-2311.159312025-11-11 https://scifaro.com/en/abs/a-combinatorial-approach-to-robust-pca-2311.164162023-11-29 https://scifaro.com/en/abs/property-testing-with-online-adversaries-2311.165662023-11-29 https://scifaro.com/en/abs/l2match-optimization-techniques-on-subgraph-matching-algorithm-using-label-pair-neighboring-label-index-and-jump-redo-method-2311.166032023-11-29 https://scifaro.com/en/abs/k-times-bin-packing-and-its-application-to-fair-electricity-distribution-2311.167422025-01-22 https://scifaro.com/en/abs/space-efficient-data-structures-for-polyominoes-and-bar-graphs-2311.169572023-11-29 https://scifaro.com/en/abs/new-approximation-bounds-for-small-set-vertex-expansion-2311.170012023-11-29 https://scifaro.com/en/abs/node-connectivity-augmentation-of-highly-connected-graphs-2311.170102023-11-29 https://scifaro.com/en/abs/lower-bounds-on-adaptive-sensing-for-matrix-recovery-2311.172812024-02-21 https://scifaro.com/en/abs/metric-embeddings-beyond-bi-lipschitz-distortion-via-sherali-adams-2311.178402025-05-19 https://scifaro.com/en/abs/space-optimal-profile-estimation-in-data-streams-with-applications-to-symmetric-functions-2311.178682023-11-30 https://scifaro.com/en/abs/sparsifying-generalized-linear-models-2311.181452023-12-01 https://scifaro.com/en/abs/almost-linear-time-algorithms-for-incremental-graphs-cycle-detection-sccs-s-t-shortest-path-and-minimum-cost-flow-2311.182952023-12-01 https://scifaro.com/en/abs/a-threshold-greedy-algorithm-for-noisy-submodular-maximization-2312.001552024-04-11 https://scifaro.com/en/abs/online-graph-coloring-with-predictions-2312.006012023-12-04 https://scifaro.com/en/abs/suffixient-sets-2312.013592024-06-06 https://scifaro.com/en/abs/a-tight-lower-bound-for-3-coloring-grids-in-the-online-local-model-2312.013842024-05-02 https://scifaro.com/en/abs/moderate-dimension-reduction-for-k-center-clustering-2312.013912026-02-23 https://scifaro.com/en/abs/finding-and-counting-small-tournaments-in-large-tournaments-2312.014192023-12-05 https://scifaro.com/en/abs/near-optimal-algorithms-for-gaussians-with-huber-contamination-mean-estimation-and-linear-regression-2312.015472023-12-05 https://scifaro.com/en/abs/faster-sublinear-time-edit-distance-2312.017592023-12-05 https://scifaro.com/en/abs/a-note-on-the-complexity-of-the-picker-routing-problem-in-multi-block-warehouses-and-related-problems-2312.018572025-01-27 https://scifaro.com/en/abs/isomorphism-for-tournaments-of-small-twin-width-2312.020482026-03-11 https://scifaro.com/en/abs/connected-components-in-linear-work-and-near-optimal-time-2312.023322025-01-31 https://scifaro.com/en/abs/embedding-probability-distributions-into-low-dimensional-ell-1-tree-ising-models-via-truncated-metrics-2312.024352024-04-09 https://scifaro.com/en/abs/on-optimal-consistency-robustness-trade-off-for-learning-augmented-multi-option-ski-rental-2312.025472023-12-06 https://scifaro.com/en/abs/a-subexponential-time-algorithm-for-makespan-scheduling-of-unit-jobs-with-precedence-constraints-2312.034952023-12-07 https://scifaro.com/en/abs/streaming-algorithms-for-the-k-submodular-cover-problem-2312.035932023-12-07 https://scifaro.com/en/abs/testing-connectedness-of-images-2312.036812024-07-02 https://scifaro.com/en/abs/a-tight-threshold-bound-for-search-trees-with-2-way-comparisons-2312.038962023-12-08 https://scifaro.com/en/abs/computing-the-volume-of-a-restricted-independent-set-polytope-deterministically-2312.039062023-12-08 https://scifaro.com/en/abs/pecann-parallel-efficient-clustering-with-graph-based-approximate-nearest-neighbor-search-2312.039402025-06-04 https://scifaro.com/en/abs/approximating-the-graph-edit-distance-with-compact-neighborhood-representations-2312.041232023-12-08 https://scifaro.com/en/abs/distances-and-shortest-paths-on-graphs-of-bounded-highway-dimension-simple-fast-dynamic-2312.042352023-12-08 https://scifaro.com/en/abs/on-the-maximum-linear-arrangement-problem-for-trees-2312.044872024-07-10 https://scifaro.com/en/abs/optimal-multi-pass-lower-bounds-for-mst-in-dynamic-streams-2312.046742023-12-11 https://scifaro.com/en/abs/scheduling-splittable-jobs-on-configurable-machines-2312.054162023-12-12 https://scifaro.com/en/abs/distinct-shortest-walk-enumeration-for-rpqs-2312.055052024-03-08 https://scifaro.com/en/abs/fault-tree-reliability-analysis-via-squarefree-polynomials-2312.058362023-12-12 https://scifaro.com/en/abs/mean-estimation-in-the-add-remove-model-of-differential-privacy-2312.066582024-02-21 https://scifaro.com/en/abs/the-complexity-of-envy-free-graph-cutting-2312.070432023-12-13 https://scifaro.com/en/abs/exploiting-automorphisms-of-temporal-graphs-for-fast-exploration-and-rendezvous-2312.071402024-07-19 https://scifaro.com/en/abs/the-parameterized-complexity-of-coordinated-motion-planning-2312.071442023-12-19 https://scifaro.com/en/abs/top-down-drawings-of-compound-graphs-2312.073192024-10-14 https://scifaro.com/en/abs/improved-frequency-estimation-algorithms-with-and-without-predictions-2312.075352023-12-13 https://scifaro.com/en/abs/a-symbolic-arithmetic-for-teaching-double-black-node-removal-in-red-black-trees-2312.075662023-12-14 https://scifaro.com/en/abs/finding-a-cluster-in-incomplete-data-2312.076282023-12-14 https://scifaro.com/en/abs/approximation-algorithms-for-k-median-problems-on-complex-networks-theory-and-practice-2312.076442023-12-14 https://scifaro.com/en/abs/near-optimal-differentially-private-k-core-decomposition-2312.077062024-03-01 https://scifaro.com/en/abs/approximate-fully-dynamic-directed-densest-subgraph-2312.078272023-12-19 https://scifaro.com/en/abs/a-structural-complexity-analysis-of-synchronous-dynamical-systems-2312.083852023-12-15 https://scifaro.com/en/abs/connectivity-oracles-for-predictable-vertex-failures-2312.084892024-09-24 https://scifaro.com/en/abs/on-the-complexity-of-list-mathcal-h-packing-for-sparse-graph-classes-2312.086392023-12-15 https://scifaro.com/en/abs/approximate-integer-solution-counts-over-linear-arithmetic-constraints-2312.087762023-12-15 https://scifaro.com/en/abs/solving-dense-linear-systems-faster-than-via-preconditioning-2312.088932024-06-10 https://scifaro.com/en/abs/matching-noisy-keys-for-obfuscation-2312.089812023-12-15 https://scifaro.com/en/abs/decremental-matching-in-general-weighted-graphs-2312.089962023-12-15 https://scifaro.com/en/abs/entropy-regularization-and-faster-decremental-matching-in-general-graphs-2312.090772024-12-05 https://scifaro.com/en/abs/accelerating-spatio-textual-queries-with-learned-indices-2312.098642023-12-18 https://scifaro.com/en/abs/on-the-instance-optimality-of-detecting-collisions-and-subgraphs-2312.101962024-08-05 https://scifaro.com/en/abs/theoretical-aspects-of-generating-instances-with-unique-solutions-pre-assignment-models-for-unique-vertex-cover-2312.105992023-12-19 https://scifaro.com/en/abs/testing-self-reducible-samplers-2312.109992023-12-19 https://scifaro.com/en/abs/on-computing-optimal-temporal-branchings-and-spanning-subgraphs-2312.113902023-12-19 https://scifaro.com/en/abs/an-algebraic-approach-to-the-longest-path-problem-2312.114692024-08-01 https://scifaro.com/en/abs/nearly-optimal-internal-dictionary-matching-2312.118732025-05-16 https://scifaro.com/en/abs/fpt-approximation-using-treewidth-capacitated-vertex-cover-target-set-selection-and-vector-dominating-set-2312.119442024-01-22 https://scifaro.com/en/abs/a-huffman-based-short-message-service-compression-technique-using-adjacent-distance-array-2312.124952023-12-21 https://scifaro.com/en/abs/a-faster-combinatorial-algorithm-for-maximum-bipartite-matching-2312.125842023-12-21 https://scifaro.com/en/abs/graph-based-generalization-of-galam-model-convergence-time-and-influential-nodes-2312.128112023-12-25 https://scifaro.com/en/abs/flash-tb-integrating-arc-flags-and-trip-based-public-transit-routing-2312.131462025-10-10 https://scifaro.com/en/abs/mathcal-o-log-log-n-passes-is-optimal-for-semi-streaming-maximal-independent-set-2312.131782023-12-21 https://scifaro.com/en/abs/a-faster-fpras-for-nfa-2312.133202024-04-09 https://scifaro.com/en/abs/dimension-accuracy-tradeoffs-in-contrastive-embeddings-for-triplets-terminals-top-k-nearest-neighbors-2312.134902024-01-01 https://scifaro.com/en/abs/new-tools-for-peak-memory-scheduling-2312.135262023-12-22 https://scifaro.com/en/abs/the-fuse-xorier-lookup-table-exploration-implementation-and-revision-of-probabilistic-sets-and-maps-2312.135412023-12-22 https://scifaro.com/en/abs/time-lower-bounds-for-the-metropolis-process-and-simulated-annealing-2312.135542023-12-22 https://scifaro.com/en/abs/counting-problems-in-trees-with-applications-to-fixed-points-of-cellular-automata-2312.137692023-12-22 https://scifaro.com/en/abs/phylogenetic-tree-distance-computation-over-succinct-representations-2312.140292023-12-22 https://scifaro.com/en/abs/online-covering-with-multiple-experts-2312.145642023-12-25 https://scifaro.com/en/abs/the-effect-of-sparsity-on-k-dominating-set-and-related-first-order-graph-properties-2312.145932023-12-25 https://scifaro.com/en/abs/the-group-access-bounds-for-binary-search-trees-2312.154262023-12-27 https://scifaro.com/en/abs/improved-approximation-guarantees-for-power-scheduling-problems-with-sum-of-squares-constraints-2312.154322023-12-27 https://scifaro.com/en/abs/range-r-enyi-entropy-queries-and-partitioning-2312.159592025-11-05 https://scifaro.com/en/abs/nearly-tight-bounds-for-differentially-private-min-s-t-and-multiway-cut-2312.163702023-12-29 https://scifaro.com/en/abs/improved-approximation-coflows-scheduling-algorithms-for-minimizing-the-total-weighted-completion-time-and-makespan-in-heterogeneous-parallel-networks-2312.164132023-12-29 https://scifaro.com/en/abs/deterministic-minimum-steiner-cut-in-maximum-flow-time-2312.164152024-07-03 https://scifaro.com/en/abs/algorithms-for-optimally-shifting-intervals-under-intersection-graph-models-2312.169642026-04-03 https://scifaro.com/en/abs/selective-run-length-encoding-2312.170242023-12-29 https://scifaro.com/en/abs/competitive-search-in-the-line-and-the-star-with-predictions-2312.175392024-01-01 https://scifaro.com/en/abs/dynamic-1-epsilon-ln-n-approximation-algorithms-for-minimum-set-cover-and-dominating-set-2312.176252024-01-01 https://scifaro.com/en/abs/faster-fixed-parameter-tractable-algorithms-for-counting-markov-equivalence-classes-with-special-skeletons-2312.176262024-01-01 https://scifaro.com/en/abs/parallel-two-stage-approach-for-joint-symbolic-approximation-of-time-series-2401.001092026-04-28 https://scifaro.com/en/abs/approximation-algorithms-for-job-scheduling-with-reconfigurable-resources-2401.004192024-01-02 https://scifaro.com/en/abs/parallel-integer-sort-theory-and-practice-2401.007102026-05-18 https://scifaro.com/en/abs/approximating-single-source-personalized-pagerank-with-absolute-error-guarantees-2401.010192024-03-21 https://scifaro.com/en/abs/a-nearly-linear-time-construction-of-approximate-single-source-distance-sensitivity-oracles-2401.011032024-07-03 https://scifaro.com/en/abs/on-the-uniqueness-and-computation-of-commuting-extensions-2401.013022024-01-03 https://scifaro.com/en/abs/scalable-network-reconstruction-in-subquadratic-time-2401.014042024-05-08 https://scifaro.com/en/abs/minimizing-the-weighted-number-of-tardy-jobs-is-w-1-hard-2401.017402024-01-04 https://scifaro.com/en/abs/enumerating-m-length-walks-in-directed-graphs-with-constant-delay-2401.021632024-01-08 https://scifaro.com/en/abs/faster-optimal-univariate-microgaggregation-2401.023812024-01-05 https://scifaro.com/en/abs/a-quasi-monte-carlo-data-structure-for-smooth-kernel-evaluations-2401.025622024-01-08 https://scifaro.com/en/abs/technical-report-modeling-average-false-positive-rates-of-recycling-bloom-filters-2401.026472024-02-06 https://scifaro.com/en/abs/approximation-algorithms-for-the-weighted-nash-social-welfare-via-convex-and-non-convex-programs-2401.029182024-01-08 https://scifaro.com/en/abs/size-minimization-for-multi-output-and-functions-2401.032632024-01-09 https://scifaro.com/en/abs/linear-size-suffix-tries-and-linear-size-cdawgs-simplified-and-improved-2401.045092024-08-09 https://scifaro.com/en/abs/bin-packing-under-random-order-breaking-the-barrier-of-3-2-2401.047142024-01-10 https://scifaro.com/en/abs/parameterized-algorithms-for-minimum-sum-vertex-cover-2401.050852024-01-11 https://scifaro.com/en/abs/diversity-aware-clustering-computational-complexity-and-approximation-algorithms-2401.055022025-05-21 https://scifaro.com/en/abs/deterministic-near-linear-time-minimum-cut-in-weighted-graphs-2401.056272024-01-12 https://scifaro.com/en/abs/faster-multi-source-directed-reachability-via-shortcuts-and-matrix-multiplication-2401.056282024-01-15 https://scifaro.com/en/abs/recoverable-robust-shortest-path-problem-under-interval-budgeted-uncertainty-representations-2401.057152024-07-16 https://scifaro.com/en/abs/modeling-online-paging-in-multi-core-systems-2401.058342024-01-15 https://scifaro.com/en/abs/graph-reconstruction-via-mis-queries-2401.058452024-12-04 https://scifaro.com/en/abs/a-k-swap-local-search-for-makespan-scheduling-2401.059562025-05-14 https://scifaro.com/en/abs/computing-data-distribution-from-query-selectivities-2401.060472024-01-12 https://scifaro.com/en/abs/holey-graphs-very-large-betti-numbers-are-testable-2401.061092025-02-19 https://scifaro.com/en/abs/new-lower-bounds-in-merlin-arthur-communication-and-graph-streaming-verification-2401.063782024-01-15 https://scifaro.com/en/abs/characterizing-the-integer-points-in-2-decomposable-polyhedra-by-closedness-under-operations-2401.064052024-01-15 https://scifaro.com/en/abs/are-we-still-missing-an-item-2401.065472024-01-23 https://scifaro.com/en/abs/fpt-approximation-for-capacitated-sum-of-radii-2401.067142024-01-15 https://scifaro.com/en/abs/the-online-submodular-assignment-problem-2401.069812024-12-30 https://scifaro.com/en/abs/testing-sumsets-is-hard-2401.072422024-02-06 https://scifaro.com/en/abs/binary-weights-spanning-trees-and-the-k-red-spanning-tree-problem-in-linear-time-2401.073412024-01-17 https://scifaro.com/en/abs/selection-improvements-on-the-parallel-iterative-algorithm-for-stable-matching-2401.074672024-08-27 https://scifaro.com/en/abs/directed-ear-anonymity-2401.076402024-01-17 https://scifaro.com/en/abs/centrality-of-shortest-paths-algorithms-and-complexity-results-2401.080192025-12-19 https://scifaro.com/en/abs/fast-parallel-sampling-under-isoperimetry-2401.090162024-01-18 https://scifaro.com/en/abs/sarriguren-a-polynomial-time-complete-algorithm-for-random-k-sat-with-relatively-dense-clauses-2401.092342025-04-08 https://scifaro.com/en/abs/foundations-of-vector-retrieval-2401.093502024-04-02 https://scifaro.com/en/abs/lower-bounds-on-0-extension-with-steiner-nodes-2401.095852024-01-19 https://scifaro.com/en/abs/fully-dynamic-min-cut-of-superconstant-size-in-subpolynomial-time-2401.097002024-01-19 https://scifaro.com/en/abs/techniques-for-authenticating-quantile-digests-2401.101182024-01-22 https://scifaro.com/en/abs/quickly-determining-who-won-an-election-2401.104762024-01-22 https://scifaro.com/en/abs/deterministic-simple-delta-varepsilon-alpha-edge-coloring-in-near-linear-time-2401.105382024-07-10 https://scifaro.com/en/abs/influential-slot-and-tag-selection-in-billboard-advertisement-2401.106012025-06-23 https://scifaro.com/en/abs/network-design-on-undirected-series-parallel-graphs-2401.107292024-01-22 https://scifaro.com/en/abs/warehouse-problem-with-multiple-vendors-and-generalized-complementarity-constraints-2401.107382024-01-22 https://scifaro.com/en/abs/cactus-representation-of-minimum-cuts-derandomize-and-speed-up-2401.108562024-01-22 https://scifaro.com/en/abs/efficient-data-shapley-for-weighted-nearest-neighbor-algorithms-2401.111032024-01-23 https://scifaro.com/en/abs/optimization-in-sanger-sequencing-2401.118542024-01-23 https://scifaro.com/en/abs/robust-popular-matchings-2401.126532025-10-23 https://scifaro.com/en/abs/computing-diameter-1-in-truly-subquadratic-time-for-unit-disk-graphs-2401.128812024-11-01 https://scifaro.com/en/abs/faster-combinatorial-k-clique-algorithms-2401.135022024-08-06 https://scifaro.com/en/abs/searching-in-trees-with-monotonic-query-times-2401.137472024-01-26 https://scifaro.com/en/abs/separating-k-median-from-the-supplier-version-2401.138192024-01-26 https://scifaro.com/en/abs/edge-coloring-sparse-graphs-with-delta-colors-in-quasilinear-time-2401.138392024-07-08 https://scifaro.com/en/abs/tight-competitive-and-variance-analyses-of-matching-policies-in-gig-platforms-2401.138422024-01-26 https://scifaro.com/en/abs/on-sparse-covers-of-minor-free-graphs-low-dimensional-metric-embeddings-and-other-applications-2401.140602024-10-30 https://scifaro.com/en/abs/libcdict-fast-dictionaries-in-c-2401.142722024-01-26 https://scifaro.com/en/abs/maximizing-the-minimum-eigenvalue-in-constant-dimension-2401.143172024-01-26 https://scifaro.com/en/abs/construction-of-orientable-sequences-in-o-1-amortized-time-per-bit-2401.143412024-05-27 https://scifaro.com/en/abs/o-1-insertion-for-random-walk-d-ary-cuckoo-hashing-up-to-the-load-threshold-2401.143942025-12-04 https://scifaro.com/en/abs/online-bin-covering-with-frequency-predictions-2401.148812024-01-29 https://scifaro.com/en/abs/fair-and-efficient-ridesharing-a-dynamic-programming-based-relocation-approach-2401.153632025-04-24 https://scifaro.com/en/abs/the-discrepancy-of-shortest-paths-2401.157812024-04-23 https://scifaro.com/en/abs/pushing-the-limits-concurrency-detection-in-acyclic-sound-free-choice-workflow-nets-in-o-p-2-t-2-2401.160972026-02-04 https://scifaro.com/en/abs/towards-optimal-grammars-for-rna-structures-2401.166232024-01-31 https://scifaro.com/en/abs/the-sherali-adams-and-weisfeiler-leman-hierarchies-in-promise-valued-constraint-satisfaction-problems-2401.169982024-01-31 https://scifaro.com/en/abs/dependency-aware-online-caching-2401.171462024-01-31 https://scifaro.com/en/abs/estimating-diffusion-degree-on-graph-streams-2401.176112024-02-01 https://scifaro.com/en/abs/efficient-shape-formation-by-3d-hybrid-programmable-matter-an-algorithm-for-low-diameter-intermediate-structures-2401.177342024-05-15 https://scifaro.com/en/abs/decomposable-submodular-maximization-in-federated-setting-2402.001382024-06-04 https://scifaro.com/en/abs/not-all-learnable-distribution-classes-are-privately-learnable-2402.002672026-05-20 https://scifaro.com/en/abs/revising-apetrei-s-bounding-volume-hierarchy-construction-algorithm-to-allow-stackless-traversal-2402.006652024-12-24 https://scifaro.com/en/abs/the-en-route-truck-drone-delivery-problem-2402.008292024-02-02 https://scifaro.com/en/abs/approximating-maximum-size-properly-colored-forests-2402.008342024-02-02 https://scifaro.com/en/abs/approximate-nearest-neighbor-search-with-window-filters-2402.009432024-06-05 https://scifaro.com/en/abs/simple-symmetric-sustainable-sorting-the-greensort-article-2402.018162024-02-06 https://scifaro.com/en/abs/parsimonious-learning-augmented-approximations-for-dense-instances-of-mathcal-np-hard-problems-2402.020622024-05-24 https://scifaro.com/en/abs/budget-feasible-egalitarian-allocation-of-conflicting-jobs-2402.027192024-02-06 https://scifaro.com/en/abs/accelerating-matroid-optimization-through-fast-imprecise-oracles-2402.027742024-11-06 https://scifaro.com/en/abs/a-note-on-rounding-matchings-in-general-graphs-2402.030682024-02-06 https://scifaro.com/en/abs/freeze-tag-in-l-1-has-wake-up-time-five-2402.032582024-02-06 https://scifaro.com/en/abs/algorithms-and-complexity-of-difference-logic-2402.032732024-02-06 https://scifaro.com/en/abs/median-and-small-parsimony-problems-on-rna-trees-2402.034552024-02-07 https://scifaro.com/en/abs/an-effective-branch-and-bound-algorithm-with-new-bounding-methods-for-the-maximum-s-bundle-problem-2402.037362024-02-07 https://scifaro.com/en/abs/succinct-data-structure-for-chordal-graphs-with-bounded-vertex-leafage-2402.037482024-04-12 https://scifaro.com/en/abs/strongly-polynomial-frame-scaling-to-high-precision-2402.047992024-02-08 https://scifaro.com/en/abs/low-degree-phase-transitions-for-detecting-a-planted-clique-in-sublinear-time-2402.054512024-02-09 https://scifaro.com/en/abs/tight-approximation-bounds-on-a-simple-algorithm-for-minimum-average-search-time-in-trees-2402.055602024-07-08 https://scifaro.com/en/abs/shiftdtw-adapting-the-dtw-metric-for-cyclic-time-series-clustering-2402.056312024-02-13 https://scifaro.com/en/abs/assortment-planning-with-sponsored-products-2402.061582024-02-12 https://scifaro.com/en/abs/quick-sort-style-approximation-algorithms-for-generalizations-of-feedback-vertex-set-in-tournaments-2402.064072024-02-12 https://scifaro.com/en/abs/an-exercise-in-tournament-design-when-some-matches-must-be-scheduled-2402.065382024-02-12 https://scifaro.com/en/abs/value-based-resource-matching-with-fairness-criteria-application-to-agricultural-water-trading-2402.065762024-02-13 https://scifaro.com/en/abs/learning-augmented-online-algorithm-for-two-level-ski-rental-problem-2402.067152024-02-13 https://scifaro.com/en/abs/a-scalable-algorithm-for-individually-fair-k-means-clustering-2402.067302024-02-14 https://scifaro.com/en/abs/taxonomic-classification-with-maximal-exact-matches-in-katka-kernels-and-minimizer-digests-2402.069352024-04-08 https://scifaro.com/en/abs/quantum-speedup-for-spectral-approximation-of-kronecker-products-2402.070272024-02-14 https://scifaro.com/en/abs/the-k-opt-algorithm-for-the-traveling-salesman-problem-has-exponential-running-time-for-k-ge-5-2402.070612024-06-14 https://scifaro.com/en/abs/pattern-matching-with-mismatches-and-wildcards-2402.077322024-05-22 https://scifaro.com/en/abs/engineering-weighted-connectivity-augmentation-algorithms-2402.077532024-02-13 https://scifaro.com/en/abs/insights-into-k-rho-shortcutting-algorithms-2402.077712024-02-13 https://scifaro.com/en/abs/an-approximation-algorithm-for-maximum-dicut-vs-cut-2402.078632024-09-16 https://scifaro.com/en/abs/tight-algorithm-for-connected-odd-cycle-transversal-parameterized-by-clique-width-2402.080462024-02-27 https://scifaro.com/en/abs/an-improved-approximation-algorithm-for-metric-triangle-packing-2402.082162024-02-14 https://scifaro.com/en/abs/integrating-high-dimensional-functions-deterministically-2402.082322024-02-14 https://scifaro.com/en/abs/tight-double-exponential-bounds-for-identification-problems-locating-dominating-set-and-test-cover-2402.083462025-08-25 https://scifaro.com/en/abs/polynomial-time-algorithms-for-weaver-s-discrepancy-problem-in-a-dense-regime-2402.085452024-02-14 https://scifaro.com/en/abs/sampling-space-saving-set-sketches-2402.086042024-02-14 https://scifaro.com/en/abs/primal-dual-algorithms-with-predictions-for-online-bounded-allocation-and-ad-auctions-problems-2402.087012024-02-15 https://scifaro.com/en/abs/almost-tight-bounds-for-online-hypergraph-matching-2402.087752024-02-15 https://scifaro.com/en/abs/parameterized-dynamic-data-structure-for-split-completion-2402.088162024-02-15 https://scifaro.com/en/abs/sequence-graphs-realizations-and-ambiguity-in-language-models-2402.088302025-07-14 https://scifaro.com/en/abs/improved-deterministic-distributed-maximum-weight-independent-set-approximation-in-sparse-graphs-2402.090112024-02-15 https://scifaro.com/en/abs/better-decremental-and-fully-dynamic-sensitivity-oracles-for-subgraph-connectivity-2402.091502024-02-15 https://scifaro.com/en/abs/iterated-straight-line-programs-2402.092322024-02-16 https://scifaro.com/en/abs/a-modern-approach-to-electoral-delimitation-using-the-quadtree-data-structure-2402.093362024-02-19 https://scifaro.com/en/abs/fixed-sparsity-matrix-approximation-from-matrix-vector-products-2402.093792024-03-27 https://scifaro.com/en/abs/robust-learning-augmented-dictionaries-2402.096872024-02-16 https://scifaro.com/en/abs/on-the-adversarial-robustness-of-locality-sensitive-hashing-in-hamming-space-2402.097072024-06-18 https://scifaro.com/en/abs/parameterized-algorithms-for-steiner-forest-in-bounded-width-graphs-2402.098352024-07-26 https://scifaro.com/en/abs/parameterized-vertex-integrity-revisited-2402.099712024-04-29 https://scifaro.com/en/abs/a-piecewise-approach-for-the-analysis-of-exact-algorithms-2402.100152024-07-02 https://scifaro.com/en/abs/streaming-algorithm-for-balance-gain-and-cost-with-cardinality-constraint-on-the-integer-lattice-2402.102982024-02-19 https://scifaro.com/en/abs/correlation-clustering-with-vertex-splitting-2402.103352024-08-30 https://scifaro.com/en/abs/non-adaptive-bellman-ford-yen-s-improvement-is-optimal-2402.103432025-02-04 https://scifaro.com/en/abs/composition-orderings-for-linear-functions-and-matrix-multiplication-orderings-2402.104512024-02-19 https://scifaro.com/en/abs/learning-augmented-search-data-structures-2402.104572025-03-10 https://scifaro.com/en/abs/on-permutation-selectors-and-their-applications-in-ad-hoc-radio-networks-protocols-2402.107832024-02-19 https://scifaro.com/en/abs/streaming-algorithms-for-connectivity-augmentation-2402.108062024-02-19 https://scifaro.com/en/abs/core-stability-in-additively-separable-hedonic-games-of-low-treewidth-2402.108152024-02-19 https://scifaro.com/en/abs/hypergraph-connectivity-augmentation-in-strongly-polynomial-time-2402.108612024-02-19 https://scifaro.com/en/abs/incremental-topological-ordering-and-cycle-detection-with-predictions-2402.110282024-02-20 https://scifaro.com/en/abs/online-flexible-busy-time-scheduling-on-heterogeneous-machines-2402.111092026-03-09 https://scifaro.com/en/abs/approximating-partition-in-near-linear-time-2402.114262024-04-09 https://scifaro.com/en/abs/odd-cycle-transversal-on-p-5-free-graphs-in-polynomial-time-2402.114652024-02-20 https://scifaro.com/en/abs/faster-algorithms-on-linear-delta-matroids-2402.115962024-02-20 https://scifaro.com/en/abs/to-store-or-not-to-store-a-graph-theoretical-approach-for-dataset-versioning-2402.117412024-02-20 https://scifaro.com/en/abs/buffered-streaming-edge-partitioning-2402.119802024-02-20 https://scifaro.com/en/abs/collision-free-robot-scheduling-2402.120192025-07-03 https://scifaro.com/en/abs/connectivity-labeling-in-faulty-colored-graphs-2402.121442024-02-20 https://scifaro.com/en/abs/almost-linear-time-parameterized-algorithm-for-rankwidth-via-dynamic-rankwidth-2402.123642024-02-20 https://scifaro.com/en/abs/distance-recoloring-2402.127052026-05-19 https://scifaro.com/en/abs/a-lower-bound-on-the-competitive-ratio-of-the-permutation-algorithm-for-online-facility-assignment-on-a-line-2402.127342024-02-26 https://scifaro.com/en/abs/nearly-optimal-fault-tolerant-distance-oracle-2402.128322026-04-08 https://scifaro.com/en/abs/locally-rainbow-paths-2402.129052024-02-21 https://scifaro.com/en/abs/efficient-enumeration-of-large-maximal-k-plexes-2402.130082024-06-11 https://scifaro.com/en/abs/scalable-pattern-matching-in-computation-graphs-2402.130652025-03-27 https://scifaro.com/en/abs/deterministic-dynamic-edge-colouring-2402.131392025-11-10 https://scifaro.com/en/abs/almost-tight-bounds-on-preserving-cuts-in-classes-of-submodular-hypergraphs-2402.131512024-02-21 https://scifaro.com/en/abs/online-matching-on-3-uniform-hypergraphs-2402.132272026-04-20 https://scifaro.com/en/abs/minimizing-tardy-processing-time-on-a-single-machine-in-near-linear-time-2402.133572025-07-23 https://scifaro.com/en/abs/exaloglog-space-efficient-and-practical-approximate-distinct-counting-up-to-the-exa-scale-2402.137262025-02-28 https://scifaro.com/en/abs/multi-agent-online-graph-exploration-on-cycles-and-tadpole-graphs-2402.138452024-03-26 https://scifaro.com/en/abs/a-uniformly-random-solution-to-algorithmic-redistricting-2402.138682024-02-22 https://scifaro.com/en/abs/practical-algorithms-for-hierarchical-overlap-graphs-2402.139202024-09-24 https://scifaro.com/en/abs/robust-recovery-for-stochastic-block-models-simplified-and-generalized-2402.139212024-02-22 https://scifaro.com/en/abs/a-5-3-epsilon-approximation-for-tricolored-non-crossing-euclidean-tsp-2402.139382024-02-22 https://scifaro.com/en/abs/chasing-convex-functions-with-long-term-constraints-2402.140122024-07-15 https://scifaro.com/en/abs/masked-matrix-multiplication-for-emergent-sparsity-2402.141182024-02-23 https://scifaro.com/en/abs/random-order-online-independent-set-of-intervals-and-hyperrectangles-2402.142012024-06-28 https://scifaro.com/en/abs/parameterized-complexity-of-finding-dissimilar-shortest-paths-2402.143762024-02-23 https://scifaro.com/en/abs/an-improved-pseudopolynomial-time-algorithm-for-subset-sum-2402.144932026-04-29 https://scifaro.com/en/abs/approximate-circular-pattern-matching-under-edit-distance-2402.145502024-02-23 https://scifaro.com/en/abs/time-efficient-implementation-for-online-k-server-problem-on-trees-2402.146332024-04-05 https://scifaro.com/en/abs/hitting-meets-packing-how-hard-can-it-be-2402.149272024-02-26 https://scifaro.com/en/abs/parallel-approximate-maximum-flows-in-near-linear-work-and-polylogarithmic-depth-2402.149502024-02-26 https://scifaro.com/en/abs/tight-inapproximability-of-target-set-reconfiguration-2402.150762024-02-26 https://scifaro.com/en/abs/algorithmically-fair-maximization-of-multiple-submodular-objective-functions-2402.151552024-07-22 https://scifaro.com/en/abs/tight-approximation-and-kernelization-bounds-for-vertex-disjoint-shortest-paths-2402.153482025-04-23 https://scifaro.com/en/abs/graph-partitioning-with-limited-moves-2402.154852024-02-26 https://scifaro.com/en/abs/on-the-complexity-of-community-aware-network-sparsification-2402.154942024-02-26 https://scifaro.com/en/abs/pruned-pivot-correlation-clustering-algorithm-for-dynamic-parallel-and-local-computation-models-2402.156682024-06-17 https://scifaro.com/en/abs/tree-decompositions-meet-induced-matchings-beyond-max-weight-independent-set-2402.158342024-02-27 https://scifaro.com/en/abs/online-drone-scheduling-for-last-mile-delivery-2402.160852024-02-27 https://scifaro.com/en/abs/enhanced-graph-pattern-matching-2402.162052024-02-27 https://scifaro.com/en/abs/a-fast-implementation-of-the-good-suffix-array-for-the-boyer-moore-string-matching-algorithm-2402.164692024-02-27 https://scifaro.com/en/abs/the-bottom-left-algorithm-for-the-strip-packing-problem-2402.165722024-02-27 https://scifaro.com/en/abs/the-complexity-of-diameter-on-h-free-graphs-2402.166782025-05-28 https://scifaro.com/en/abs/the-art-of-staying-ahead-of-deadlines-improved-algorithms-for-the-minimum-tardy-processing-time-2402.168472024-02-29 https://scifaro.com/en/abs/ingrass-incremental-graph-spectral-sparsification-via-low-resistance-diameter-decomposition-2402.169902024-09-09 https://scifaro.com/en/abs/energy-efficient-scheduling-with-predictions-2402.171432024-02-28 https://scifaro.com/en/abs/scalable-and-interpretable-identification-of-minimal-undesignable-rna-structure-motifs-with-rotational-invariance-2402.172062025-05-06 https://scifaro.com/en/abs/shortest-cover-after-edit-2402.174282024-04-29 https://scifaro.com/en/abs/purelottery-fair-and-bias-resistant-leader-election-with-a-novel-single-elimination-tournament-algorithm-2402.174592024-02-28 https://scifaro.com/en/abs/fliphash-a-constant-time-consistent-range-hashing-algorithm-2402.175492024-02-28 https://scifaro.com/en/abs/deterministic-cache-oblivious-funnelselect-2402.176312024-02-28 https://scifaro.com/en/abs/learning-based-algorithms-for-graph-searching-problems-2402.177362024-03-19 https://scifaro.com/en/abs/decremental-1-epsilon-approximate-maximum-eigenvector-dynamic-power-method-2402.179292025-01-07 https://scifaro.com/en/abs/tighter-bounds-for-local-differentially-private-core-decomposition-and-densest-subgraph-2402.180202024-02-29 https://scifaro.com/en/abs/computing-minimal-absent-words-and-extended-bispecial-factors-with-cdawg-space-2402.180902024-05-21 https://scifaro.com/en/abs/max-cut-with-epsilon-accurate-predictions-2402.182632024-02-29 https://scifaro.com/en/abs/output-sensitive-enumeration-of-potential-maximal-cliques-in-polynomial-space-2402.182652025-05-15 https://scifaro.com/en/abs/online-edge-coloring-is-nearly-as-easy-as-offline-2402.183392024-02-29 https://scifaro.com/en/abs/polynomial-time-approximation-schemes-for-induced-subgraph-problems-on-fractionally-tree-independence-number-fragile-graphs-2402.183522025-04-23 https://scifaro.com/en/abs/interval-constrained-bipartite-matching-over-time-2402.184692025-08-15 https://scifaro.com/en/abs/on-the-enumeration-of-signatures-of-xor-cnf-s-2402.185372025-08-05 https://scifaro.com/en/abs/dynamic-deterministic-constant-approximate-distance-oracles-with-n-epsilon-worst-case-update-time-2402.185412024-04-12 https://scifaro.com/en/abs/efficient-processing-of-subsequent-densest-subgraph-query-2402.188832024-03-01 https://scifaro.com/en/abs/subsequence-matching-and-lcs-under-cartesian-tree-equivalence-2402.191462026-01-01 https://scifaro.com/en/abs/edit-and-alphabet-ordering-sensitivity-of-lex-parse-2402.192232024-05-14 https://scifaro.com/en/abs/total-completion-time-scheduling-under-scenarios-2402.192592024-03-01 https://scifaro.com/en/abs/beyond-worst-case-local-computation-algorithms-2403.001292025-06-27 https://scifaro.com/en/abs/analysis-of-phylogeny-tracking-algorithms-for-serial-and-multiprocess-applications-2403.002462024-03-05 https://scifaro.com/en/abs/algorithms-for-efficient-compact-online-data-stream-curation-2403.002662024-03-04 https://scifaro.com/en/abs/qpms-sigma-an-efficient-and-exact-parallel-algorithm-for-the-planted-l-d-motif-search-problem-2403.003062024-03-04 https://scifaro.com/en/abs/polyamorous-scheduling-2403.004652024-03-28 https://scifaro.com/en/abs/approximating-the-geometric-knapsack-problem-in-near-linear-time-and-dynamically-2403.005362024-03-04 https://scifaro.com/en/abs/undercomplete-decomposition-of-symmetric-tensors-in-linear-time-and-smoothed-analysis-of-the-condition-number-2403.006432025-03-12 https://scifaro.com/en/abs/a-strongly-subcubic-combinatorial-algorithm-for-triangle-detection-with-applications-2403.010852024-03-08 https://scifaro.com/en/abs/approximations-and-hardness-of-packing-partially-ordered-items-2403.015682024-03-05 https://scifaro.com/en/abs/unleashing-graph-partitioning-for-large-scale-nearest-neighbor-search-2403.017972024-03-05 https://scifaro.com/en/abs/fully-polynomial-time-algorithms-parameterized-by-vertex-integrity-using-fast-matrix-multiplication-2403.018392024-03-05 https://scifaro.com/en/abs/the-canadian-traveller-problem-on-outerplanar-graphs-2403.018722025-02-14 https://scifaro.com/en/abs/random-generation-of-git-graphs-2403.019022024-06-26 https://scifaro.com/en/abs/how-to-find-long-maximal-exact-matches-and-ignore-short-ones-2403.020082024-07-02 https://scifaro.com/en/abs/matching-algorithms-in-the-sparse-stochastic-block-model-2403.021402024-03-05 https://scifaro.com/en/abs/constraint-satisfaction-problems-with-advice-2403.022122024-07-31 https://scifaro.com/en/abs/statistical-query-lower-bounds-for-learning-truncated-gaussians-2403.023002024-03-05 https://scifaro.com/en/abs/on-approximate-fully-dynamic-matching-and-online-matrix-vector-multiplication-2403.025822024-03-06 https://scifaro.com/en/abs/algorithms-for-galois-words-detection-factorization-and-rotation-2403.026362024-04-24 https://scifaro.com/en/abs/dgap-efficient-dynamic-graph-analysis-on-persistent-memory-2403.026652024-03-06 https://scifaro.com/en/abs/cover-edge-based-novel-triangle-counting-2403.029972024-03-06 https://scifaro.com/en/abs/the-exchange-problem-2403.030462024-03-06 https://scifaro.com/en/abs/fine-grained-privacy-guarantees-for-coverage-problems-2403.033372024-03-07 https://scifaro.com/en/abs/double-exponential-lower-bound-for-telephone-broadcast-2403.035012024-03-07 https://scifaro.com/en/abs/graph-visualization-for-blockchain-data-2403.035042024-03-07 https://scifaro.com/en/abs/largest-common-subgraph-of-two-forests-2403.036962024-03-07 https://scifaro.com/en/abs/parameterized-algorithms-for-balanced-cluster-edge-modification-problems-2403.038302024-09-05 https://scifaro.com/en/abs/on-htlc-based-protocols-for-multi-party-cross-chain-swaps-2403.039062024-03-18 https://scifaro.com/en/abs/a-sierpinski-triangle-data-structure-for-efficient-array-value-update-and-prefix-sum-calculation-2403.039902024-03-08 https://scifaro.com/en/abs/equivalence-testing-the-power-of-bounded-adaptivity-2403.042302024-03-08 https://scifaro.com/en/abs/switching-classes-characterization-and-computation-2403.042632024-08-15 https://scifaro.com/en/abs/near-optimal-algorithm-for-directed-expander-decompositions-2403.045422025-02-12 https://scifaro.com/en/abs/algorithms-and-complexity-for-path-covers-of-temporal-dags-when-is-dilworth-dynamic-2403.045892024-03-08 https://scifaro.com/en/abs/optimizing-inventory-placement-for-a-downstream-online-matching-problem-2403.045982025-05-06 https://scifaro.com/en/abs/time-aware-projections-truly-node-private-graph-statistics-under-continual-observation-2403.046302025-11-06 https://scifaro.com/en/abs/a-sub-quadratic-time-algorithm-for-robust-sparse-mean-estimation-2403.047262024-03-08 https://scifaro.com/en/abs/improved-lower-bound-for-differentially-private-facility-location-2403.048742024-03-11 https://scifaro.com/en/abs/np-completeness-for-the-space-optimality-of-double-array-tries-2403.049512024-03-11 https://scifaro.com/en/abs/a-basic-lower-bound-for-property-testing-2403.049992024-04-18 https://scifaro.com/en/abs/data-dependent-lsh-for-the-earth-mover-s-distance-2403.050412024-03-11 https://scifaro.com/en/abs/single-family-algebra-operation-on-bdds-and-zdds-leads-to-exponential-blow-up-2403.050742024-10-01 https://scifaro.com/en/abs/efficient-algorithms-for-personalized-pagerank-computation-a-survey-2403.051982024-03-21 https://scifaro.com/en/abs/scalable-k-clique-densest-subgraph-search-2403.057752024-03-12 https://scifaro.com/en/abs/approximate-bipartite-b-matching-using-multiplicative-auction-2403.057812024-03-12 https://scifaro.com/en/abs/path-cover-hamiltonicity-and-independence-number-an-fpt-perspective-2403.059432026-03-09 https://scifaro.com/en/abs/revisiting-path-contraction-and-cycle-contraction-2403.062902024-03-12 https://scifaro.com/en/abs/improved-fpt-approximation-scheme-and-approximate-kernel-for-biclique-free-max-k-weight-sat-greedy-strikes-back-2403.063352024-06-05 https://scifaro.com/en/abs/fun-maximizing-search-non-instance-optimality-and-video-games-for-parrots-2403.065472024-03-12 https://scifaro.com/en/abs/arborescences-and-shortest-path-trees-when-colors-matter-2403.065802024-07-24 https://scifaro.com/en/abs/balanced-substructures-in-bicolored-graphs-2403.066082024-04-03 https://scifaro.com/en/abs/optimal-bounds-for-distinct-quartics-2403.066672024-03-12 https://scifaro.com/en/abs/noisy-computing-of-the-threshold-function-2403.072272024-12-24 https://scifaro.com/en/abs/satisfiability-to-coverage-in-presence-of-fairness-matroid-and-global-constraints-2403.073282024-03-13 https://scifaro.com/en/abs/residue-domination-in-bounded-treewidth-graphs-2403.075242025-05-08 https://scifaro.com/en/abs/maximum-defective-clique-computation-improved-time-complexities-and-practical-performance-2403.075612024-03-13 https://scifaro.com/en/abs/simplified-tight-bounds-for-monotone-minimal-perfect-hashing-2403.077602024-04-19 https://scifaro.com/en/abs/highway-preferential-attachment-models-for-geographic-routing-2403.081052025-02-11 https://scifaro.com/en/abs/height-bounded-lempel-ziv-encodings-2403.082092024-04-26 https://scifaro.com/en/abs/worst-case-to-expander-case-reductions-derandomized-and-generalized-2403.083942024-07-02 https://scifaro.com/en/abs/improved-randomized-approximation-of-hard-universality-and-emptiness-problems-2403.087072024-03-14 https://scifaro.com/en/abs/approximating-small-sparse-cuts-2403.089832024-03-15 https://scifaro.com/en/abs/efficient-size-prescribed-k-core-search-2403.092142024-03-15 https://scifaro.com/en/abs/outlier-robust-multivariate-polynomial-regression-2403.094652024-03-15 https://scifaro.com/en/abs/bat-lz-out-of-hell-2403.098932024-04-24 https://scifaro.com/en/abs/scalable-algorithms-for-individual-preference-stable-clustering-2403.103652024-03-18 https://scifaro.com/en/abs/first-passage-percolation-with-queried-hints-2403.106402025-06-11 https://scifaro.com/en/abs/approximation-ratio-of-the-min-degree-greedy-algorithm-for-maximum-independent-set-on-interval-and-chordal-graphs-2403.108682024-03-19 https://scifaro.com/en/abs/on-the-average-runtime-of-an-open-source-binomial-random-variate-generation-algorithm-2403.110182024-03-19 https://scifaro.com/en/abs/barely-random-algorithms-and-collective-metrical-task-systems-2403.112672024-11-08 https://scifaro.com/en/abs/a-constant-time-complexity-algorithm-for-the-unbounded-knapsack-problem-with-bounded-coefficients-2403.113202024-03-19 https://scifaro.com/en/abs/eth-tight-algorithm-for-cycle-packing-on-unit-disk-graphs-2403.114262024-03-19 https://scifaro.com/en/abs/private-graphon-estimation-via-sum-of-squares-2403.122132024-04-19 https://scifaro.com/en/abs/revisiting-local-computation-of-pagerank-simple-and-optimal-2403.126482024-10-23 https://scifaro.com/en/abs/exact-and-heuristic-computation-of-the-scanwidth-of-directed-acyclic-graphs-2403.127342026-05-21 https://scifaro.com/en/abs/a-textbook-solution-for-dynamic-strings-2403.131622024-08-15 https://scifaro.com/en/abs/how-to-relax-instantly-elastic-relaxation-of-concurrent-data-structures-2403.136442024-03-21 https://scifaro.com/en/abs/improved-algorithms-for-maximum-coverage-in-dynamic-and-random-order-streams-2403.140872024-03-22 https://scifaro.com/en/abs/space-efficient-indexes-for-uncertain-strings-2403.142562024-03-22 https://scifaro.com/en/abs/a-differentially-private-clustering-algorithm-for-well-clustered-graphs-2403.143322024-03-22 https://scifaro.com/en/abs/induced-subforests-and-superforests-2403.144922024-03-22 https://scifaro.com/en/abs/harmonic-decomposition-in-data-sketches-2403.153662024-11-06 https://scifaro.com/en/abs/approximation-algorithms-for-network-design-in-non-uniform-fault-models-2403.155472024-03-26 https://scifaro.com/en/abs/group-fairness-and-multi-criteria-optimization-in-school-assignment-2403.156232025-04-24 https://scifaro.com/en/abs/distance-adjustment-of-a-graph-drawing-stress-model-2403.158112024-03-26 https://scifaro.com/en/abs/on-the-complexity-and-approximability-of-bounded-access-lempel-ziv-coding-2403.158712024-03-26 https://scifaro.com/en/abs/convolution-and-knapsack-in-higher-dimensions-2403.161172025-08-12 https://scifaro.com/en/abs/hashing-geographical-point-data-using-the-space-filling-h-curve-2403.162162024-03-26 https://scifaro.com/en/abs/a-novel-exact-algorithm-for-economic-lot-sizing-with-piecewise-linear-production-costs-2403.163142024-04-01 https://scifaro.com/en/abs/adaptive-frequency-bin-interval-in-fft-via-dense-sampling-factor-alpha-2403.166652024-03-27 https://scifaro.com/en/abs/minimum-cost-paths-for-electric-cars-2403.169362024-03-26 https://scifaro.com/en/abs/capacity-provisioning-motivated-online-non-convex-optimization-problem-with-memory-and-switching-cost-2403.174802024-07-02 https://scifaro.com/en/abs/parameterized-analysis-of-bribery-in-challenge-the-champ-tournaments-2403.175872024-03-27 https://scifaro.com/en/abs/generalising-the-maximum-independent-set-algorithm-via-boolean-networks-2403.176582025-01-23 https://scifaro.com/en/abs/a-note-on-lookahead-in-real-life-and-computing-2403.179422024-03-28 https://scifaro.com/en/abs/optimality-of-non-adaptive-algorithms-in-online-submodular-welfare-maximization-with-stochastic-outcomes-2403.180592026-01-06 https://scifaro.com/en/abs/minimum-sum-vertex-cover-kernelization-and-parameterized-algorithms-2403.184972024-04-16 https://scifaro.com/en/abs/realizing-temporal-transportation-trees-2403.185132025-04-22 https://scifaro.com/en/abs/jumpbackhash-say-goodbye-to-the-modulo-operation-to-distribute-keys-uniformly-to-buckets-2403.186822025-11-11 https://scifaro.com/en/abs/new-graph-and-hypergraph-container-lemmas-with-applications-in-property-testing-2403.187772024-03-28 https://scifaro.com/en/abs/hypergraph-unreliability-in-quasi-polynomial-time-2403.187812024-03-28 https://scifaro.com/en/abs/on-the-communication-complexity-of-approximate-pattern-matching-2403.188122024-10-10 https://scifaro.com/en/abs/a-faster-algorithm-for-pigeonhole-equal-sums-2403.191172024-03-29 https://scifaro.com/en/abs/improving-the-bit-complexity-of-communication-for-distributed-convex-optimization-2403.191462024-03-29 https://scifaro.com/en/abs/constructing-decision-trees-from-data-streams-2403.198672025-04-18 https://scifaro.com/en/abs/algorithmic-strategies-for-finding-the-best-tsp-2-opt-move-in-average-sub-quadratic-time-2403.198782024-04-01 https://scifaro.com/en/abs/a-simple-and-efficient-algorithm-for-sorting-signed-permutations-by-reversals-2403.201652024-04-01 https://scifaro.com/en/abs/weighted-reservoir-sampling-with-replacement-from-data-streams-2403.202562026-03-18 https://scifaro.com/en/abs/optimal-communication-for-classic-functions-in-the-coordinator-model-and-beyond-2403.203072024-04-01 https://scifaro.com/en/abs/shaving-logs-via-large-sieve-inequality-faster-algorithms-for-sparse-convolution-and-more-2403.203262024-04-01 https://scifaro.com/en/abs/on-contention-resolution-for-the-hypergraph-matching-knapsack-and-k-column-sparse-packing-problems-2404.000412024-04-02 https://scifaro.com/en/abs/circular-arc-graphs-and-the-helly-property-2404.004162024-04-10 https://scifaro.com/en/abs/prophet-inequalities-with-cancellation-costs-2404.005272025-04-22 https://scifaro.com/en/abs/super-non-singular-decompositions-of-polynomials-and-their-application-to-robustly-learning-low-degree-ptfs-2404.005292024-04-02 https://scifaro.com/en/abs/improved-approximation-ratio-for-covering-pliable-set-families-2404.006832024-04-02 https://scifaro.com/en/abs/adversarially-robust-inference-on-trees-via-belief-propagation-2404.007682024-04-02 https://scifaro.com/en/abs/on-the-complexity-of-minimizing-energy-consumption-of-partitioning-dag-tasks-2404.010222024-09-17 https://scifaro.com/en/abs/a-faster-algorithm-for-the-construction-of-optimal-factoring-automata-2404.023542024-04-04 https://scifaro.com/en/abs/learning-intersections-of-halfspaces-with-distribution-shift-improved-algorithms-and-sq-lower-bounds-2404.023642024-05-22 https://scifaro.com/en/abs/minimizing-the-number-of-tardy-jobs-and-maximal-tardiness-on-a-single-machine-is-np-hard-2404.027842025-02-17 https://scifaro.com/en/abs/on-computing-approximate-lewis-weights-2404.028812024-04-04 https://scifaro.com/en/abs/lower-bounds-for-graph-reconstruction-with-maximal-independent-set-queries-2404.034722024-04-05 https://scifaro.com/en/abs/sensitivity-proximity-and-fpt-algorithms-for-exact-matroid-problems-2404.037472024-08-27 https://scifaro.com/en/abs/additive-approximation-algorithm-for-geodesic-centers-in-delta-hyperbolic-graphs-2404.038122024-06-13 https://scifaro.com/en/abs/optimal-quantile-estimation-beyond-the-comparison-model-2404.038472024-04-08 https://scifaro.com/en/abs/minor-containment-and-disjoint-paths-in-almost-linear-time-2404.039582024-04-08 https://scifaro.com/en/abs/stability-in-graphs-with-matroid-constraints-2404.039792024-04-08 https://scifaro.com/en/abs/an-objective-improvement-approach-to-solving-discounted-payoff-games-2404.041242026-03-11 https://scifaro.com/en/abs/a-fine-grained-classification-of-subquadratic-patterns-for-subgraph-listing-and-friends-2404.043692024-04-09 https://scifaro.com/en/abs/fast-and-simple-sorting-using-partial-information-2404.045522026-05-06 https://scifaro.com/en/abs/spectral-independence-beyond-total-influence-on-trees-and-related-graphs-2404.046682024-04-09 https://scifaro.com/en/abs/approximating-unrelated-machine-weighted-completion-time-using-iterative-rounding-and-computer-assisted-proofs-2404.047732024-10-22 https://scifaro.com/en/abs/range-longest-increasing-subsequence-and-its-relatives-2404.047952025-12-02 https://scifaro.com/en/abs/fast-deterministic-chromatic-number-under-the-asymptotic-rank-conjecture-2404.049872024-12-09 https://scifaro.com/en/abs/directed-buy-at-bulk-spanners-2404.051722024-04-10 https://scifaro.com/en/abs/scheduling-multi-server-jobs-is-not-easy-2404.052712024-07-02 https://scifaro.com/en/abs/combinatorial-correlation-clustering-2404.054332024-07-17 https://scifaro.com/en/abs/bfs-versus-dfs-for-random-targets-in-ordered-trees-2404.056642024-04-09 https://scifaro.com/en/abs/even-faster-knapsack-via-rectangular-monotone-min-plus-convolution-and-balancing-2404.056812024-07-02 https://scifaro.com/en/abs/polynomial-time-derivation-of-optimal-k-tree-topology-from-markov-networks-2404.059912024-04-10 https://scifaro.com/en/abs/fully-dynamic-matching-and-ordered-ruzsa-szemer-edi-graphs-2404.060692024-09-26 https://scifaro.com/en/abs/efficient-algorithms-and-new-characterizations-for-csp-sparsification-2404.063272024-11-07 https://scifaro.com/en/abs/bounded-edit-distance-optimal-static-and-dynamic-algorithms-for-small-integer-weights-2404.064012025-02-04 https://scifaro.com/en/abs/language-generation-in-the-limit-2404.067572024-04-11 https://scifaro.com/en/abs/correlation-clustering-beyond-the-pivot-algorithm-2404.067972025-07-15 https://scifaro.com/en/abs/an-asymptotically-optimal-algorithm-for-generating-bin-cardinalities-2404.070112024-09-10 https://scifaro.com/en/abs/exploring-repetitiveness-measures-for-two-dimensional-strings-2404.070302024-04-11 https://scifaro.com/en/abs/computing-the-d-base-and-d-relation-in-finite-closure-systems-2404.070372025-09-23 https://scifaro.com/en/abs/generalized-straight-line-programs-2404.070572024-04-11 https://scifaro.com/en/abs/dynamic-suffix-array-in-optimal-compressed-space-2404.075102024-11-11 https://scifaro.com/en/abs/parameterized-complexity-of-submodular-minimization-under-uncertainty-2404.075162024-07-30 https://scifaro.com/en/abs/an-improvement-of-degree-based-hashing-dbh-graph-partition-method-using-a-novel-metric-2404.076242024-04-12 https://scifaro.com/en/abs/an-efficient-uniqueness-theorem-for-overcomplete-tensor-decomposition-2404.078012025-02-12 https://scifaro.com/en/abs/matrix-multiplication-reductions-2404.080852024-04-15 https://scifaro.com/en/abs/naively-sorting-evolving-data-is-optimal-and-robust-2404.081622024-09-24 https://scifaro.com/en/abs/anarchy-in-the-apsp-algorithm-and-hardness-for-incorrect-implementation-of-floyd-warshall-2404.081732024-06-06 https://scifaro.com/en/abs/bottom-up-rebalancing-binary-search-trees-by-flipping-a-coin-2404.082872024-04-15 https://scifaro.com/en/abs/tight-bounds-for-sorting-under-partial-information-2404.084682024-08-01 https://scifaro.com/en/abs/destroying-densest-subgraphs-is-hard-2404.085992024-04-15 https://scifaro.com/en/abs/improved-approximations-for-flexible-network-design-2404.089722024-04-16 https://scifaro.com/en/abs/better-space-time-robustness-trade-offs-for-set-reconciliation-2404.096072024-04-16 https://scifaro.com/en/abs/a-circus-of-circuits-connections-between-decision-diagrams-circuits-and-automata-2404.096742024-04-16 https://scifaro.com/en/abs/online-multi-level-aggregation-with-delays-and-stochastic-arrivals-2404.097112024-10-01 https://scifaro.com/en/abs/search-space-reduction-via-essential-vertices-revisited-vertex-multicut-and-cograph-deletion-2404.097692024-04-16 https://scifaro.com/en/abs/parameterized-algorithms-for-editing-to-uniform-cluster-graph-2404.100232025-02-06 https://scifaro.com/en/abs/private-vector-mean-estimation-in-the-shuffle-model-optimal-rates-require-many-messages-2404.102012024-04-26 https://scifaro.com/en/abs/bit-catastrophes-for-the-burrows-wheeler-transform-2404.104262025-06-10 https://scifaro.com/en/abs/how-quickly-can-you-pack-short-paths-engineering-a-search-tree-algorithm-for-disjoint-s-t-paths-of-bounded-length-2404.104692024-04-17 https://scifaro.com/en/abs/subsequences-with-generalised-gap-constraints-upper-and-lower-complexity-bounds-2404.104972024-04-17 https://scifaro.com/en/abs/simple-k-crashing-plan-with-a-good-approximation-ratio-2404.105142024-04-17 https://scifaro.com/en/abs/a-fast-3-approximation-for-the-capacitated-tree-cover-problem-with-edge-loads-2404.106382024-04-17 https://scifaro.com/en/abs/the-traveling-tournament-problem-improved-algorithms-based-on-cycle-packing-2404.109552024-04-18 https://scifaro.com/en/abs/on-approximability-of-the-permanent-of-psd-matrices-2404.109592024-04-18 https://scifaro.com/en/abs/drawing-competitive-districts-in-redistricting-2404.109642024-04-18 https://scifaro.com/en/abs/distribution-free-testing-of-decision-lists-with-a-sublinear-number-of-queries-2404.111032024-04-18 https://scifaro.com/en/abs/approximate-min-sum-subset-convolution-2404.113642024-08-12 https://scifaro.com/en/abs/testing-intersectingness-of-uniform-families-2404.115042024-07-19 https://scifaro.com/en/abs/the-edge-language-extended-general-einsums-for-graph-algorithms-2404.115912026-05-28 https://scifaro.com/en/abs/private-federated-discovery-of-out-of-vocabulary-words-for-gboard-2404.116072024-04-19 https://scifaro.com/en/abs/hairpin-completion-distance-lower-bound-2404.116732024-04-19 https://scifaro.com/en/abs/public-event-scheduling-with-busy-agents-2404.118792024-04-19 https://scifaro.com/en/abs/on-gamma-contraction-and-beta-contraction-a-unified-framework-for-colour-preserving-graph-reduction-2404.120802026-03-04 https://scifaro.com/en/abs/the-graph-alignment-problem-fundamental-limits-and-efficient-algorithms-2404.124182024-04-22 https://scifaro.com/en/abs/contract-scheduling-with-distributional-and-multiple-advice-2404.124852024-04-22 https://scifaro.com/en/abs/an-algorithm-with-a-delay-of-mathcal-o-k-delta-for-enumerating-connected-induced-subgraphs-of-size-k-2404.125592025-07-09 https://scifaro.com/en/abs/exploiting-new-properties-of-string-net-frequency-for-efficient-computation-2404.127012024-04-24 https://scifaro.com/en/abs/dynamic-parameterized-feedback-problems-in-tournaments-2404.129072024-04-22 https://scifaro.com/en/abs/on-multidimensional-generalization-of-binary-search-2404.131932024-04-23 https://scifaro.com/en/abs/non-linear-paging-2404.133342024-04-23 https://scifaro.com/en/abs/new-structures-and-algorithms-for-length-constrained-expander-decompositions-2404.134462024-05-16 https://scifaro.com/en/abs/an-optimal-mpc-algorithm-for-subunit-monge-matrix-multiplication-with-applications-to-lis-2404.134862024-04-23 https://scifaro.com/en/abs/optimal-non-adaptive-tolerant-junta-testing-via-local-estimators-2404.135022024-04-23 https://scifaro.com/en/abs/stochastic-multi-round-submodular-optimization-with-budget-2404.137372024-09-26 https://scifaro.com/en/abs/sublinear-time-low-rank-approximation-of-toeplitz-matrices-2404.137572024-04-23 https://scifaro.com/en/abs/faster-algorithms-for-dual-failure-replacement-paths-2404.139072024-04-23 https://scifaro.com/en/abs/engineering-edge-orientation-algorithms-2404.139972024-04-23 https://scifaro.com/en/abs/decline-and-fall-of-the-icalp-2008-modular-decomposition-algorithm-2404.140492024-04-23 https://scifaro.com/en/abs/a-tight-subexponential-time-algorithm-for-two-page-book-embedding-2404.140872024-04-23 https://scifaro.com/en/abs/semirandom-planted-clique-and-the-restricted-isometry-property-2404.141592024-10-10 https://scifaro.com/en/abs/minimizing-the-number-of-tardy-jobs-with-uniform-processing-times-on-parallel-machines-2404.142082024-04-23 https://scifaro.com/en/abs/computing-the-lcp-array-of-a-labeled-graph-2404.142352024-04-23 https://scifaro.com/en/abs/it-s-hard-to-hac-with-average-linkage-2404.147302025-02-06 https://scifaro.com/en/abs/cycling-in-the-forest-with-wilson-s-algorithm-2404.148032025-07-10 https://scifaro.com/en/abs/parameterized-maximum-node-disjoint-paths-2404.148492025-09-18 https://scifaro.com/en/abs/renting-servers-for-multi-parameter-jobs-in-the-cloud-2404.154442024-04-25 https://scifaro.com/en/abs/online-disjoint-set-covers-randomization-is-not-necessary-2404.155542025-01-14 https://scifaro.com/en/abs/detecting-disjoint-shortest-paths-in-linear-time-and-more-2404.159162024-05-13 https://scifaro.com/en/abs/hardness-and-tight-approximations-of-demand-strip-packing-2404.159172025-07-02 https://scifaro.com/en/abs/seed-selection-in-the-heterogeneous-moran-process-2404.159862024-05-14 https://scifaro.com/en/abs/combinatorial-approximations-for-cluster-deletion-simpler-faster-and-better-2404.161312024-04-26 https://scifaro.com/en/abs/unweighted-layered-graph-traversal-passing-a-crown-via-entropy-maximization-2404.161762024-10-22 https://scifaro.com/en/abs/fault-tolerant-bounded-flow-preservers-2404.162172024-04-26 https://scifaro.com/en/abs/dynamic-pagerank-algorithms-and-lower-bounds-2404.162672024-05-20 https://scifaro.com/en/abs/parallel-and-nearly-work-efficient-dynamic-programming-2404.163142024-05-24 https://scifaro.com/en/abs/on-approximating-the-dynamic-and-discrete-network-flow-problem-2404.163292024-04-26 https://scifaro.com/en/abs/more-asymmetry-yields-faster-matrix-multiplication-2404.163492024-10-22 https://scifaro.com/en/abs/cost-driven-data-replication-with-predictions-2404.164892024-04-26 https://scifaro.com/en/abs/scalable-distributed-string-sorting-2404.165172024-04-26 https://scifaro.com/en/abs/approximation-algorithm-of-minimum-all-ones-problem-for-arbitrary-graphs-2404.165402024-04-26 https://scifaro.com/en/abs/layered-list-labeling-2404.166232024-04-26 https://scifaro.com/en/abs/multilayer-correlation-clustering-2404.166762026-05-20 https://scifaro.com/en/abs/kernelization-dichotomies-for-hitting-subgraphs-under-structural-parameterizations-2404.166952024-04-26 https://scifaro.com/en/abs/on-the-streaming-complexity-of-expander-decomposition-2404.167012024-05-30 https://scifaro.com/en/abs/efficient-and-near-optimal-noise-generation-for-streaming-differential-privacy-2404.167062024-05-07 https://scifaro.com/en/abs/constrained-level-planarity-is-fpt-with-respect-to-the-vertex-cover-number-2404.167232024-04-26 https://scifaro.com/en/abs/approximation-algorithms-for-hop-constrained-and-buy-at-bulk-network-design-via-hop-constrained-oblivious-routing-2404.167252024-04-26 https://scifaro.com/en/abs/parameterized-complexity-of-efficient-sortation-2404.167412024-09-16 https://scifaro.com/en/abs/distributed-computation-of-temporal-twins-in-periodic-undirected-time-varying-graphs-2404.171952024-04-29 https://scifaro.com/en/abs/set-selection-with-uncertain-weights-non-adaptive-queries-and-thresholds-2404.172142024-04-29 https://scifaro.com/en/abs/exact-and-approximate-high-multiplicity-scheduling-on-identical-machines-2404.172742025-02-03 https://scifaro.com/en/abs/internal-pattern-matching-in-small-space-and-applications-2404.175022024-04-29 https://scifaro.com/en/abs/understanding-the-cluster-lp-for-correlation-clustering-2404.175092025-11-03 https://scifaro.com/en/abs/root-to-leaf-scheduling-in-write-optimized-trees-2404.175442024-04-29 https://scifaro.com/en/abs/approximation-algorithms-for-ell-p-shortest-path-and-ell-p-group-steiner-tree-2404.176692024-04-30 https://scifaro.com/en/abs/lower-bounds-for-private-estimation-of-gaussian-covariance-matrices-under-all-reasonable-parameter-regimes-2404.177142024-04-30 https://scifaro.com/en/abs/directed-isoperimetry-and-monotonicity-testing-a-dynamical-approach-2404.178822024-10-03 https://scifaro.com/en/abs/approximation-and-fpt-algorithms-for-finding-dm-irreducible-spanning-subgraphs-2404.179272024-09-19 https://scifaro.com/en/abs/parameterized-linear-time-transitive-closure-2404.179542024-05-02 https://scifaro.com/en/abs/varia-c-c-oes-do-problema-de-dist-ancia-de-rearranjos-2404.179962024-05-21 https://scifaro.com/en/abs/testing-c-k-freeness-in-bounded-arboricity-graphs-2404.181262024-04-30 https://scifaro.com/en/abs/additive-spanner-lower-bounds-with-optimal-inner-graph-structure-2404.183372024-04-30 https://scifaro.com/en/abs/phobic-perfect-hashing-with-optimized-bucket-sizes-and-interleaved-coding-2404.184972024-04-30 https://scifaro.com/en/abs/did-fourier-really-meet-m-obius-fast-subset-convolution-via-fft-2404.185222024-04-30 https://scifaro.com/en/abs/private-graph-colouring-with-limited-defectiveness-2404.186922025-09-05 https://scifaro.com/en/abs/improved-bounds-for-group-testing-in-arbitrary-hypergraphs-2404.187832024-07-02 https://scifaro.com/en/abs/learning-general-gaussian-mixtures-with-efficient-score-matching-2404.188932024-11-20 https://scifaro.com/en/abs/equitable-connected-partition-and-structural-parameters-revisited-n-fold-beats-lenstra-2404.189682024-05-01 https://scifaro.com/en/abs/optimal-parallel-algorithms-for-dendrogram-computation-and-single-linkage-clustering-2404.190192024-05-14 https://scifaro.com/en/abs/delta-1-vertex-coloring-in-o-n-communication-2404.190812025-01-03 https://scifaro.com/en/abs/efficient-algorithms-for-earliest-and-fastest-paths-in-public-transport-networks-2404.194222024-05-01 https://scifaro.com/en/abs/finding-diverse-strings-and-longest-common-subsequences-in-a-graph-2405.001312024-06-12 https://scifaro.com/en/abs/improved-massively-parallel-triangle-counting-in-o-1-rounds-2405.002622024-05-02 https://scifaro.com/en/abs/subquadratic-submodular-maximization-with-a-general-matroid-constraint-2405.003592024-05-02 https://scifaro.com/en/abs/improved-linearly-ordered-colorings-of-hypergraphs-via-sdp-rounding-2405.004272024-09-24 https://scifaro.com/en/abs/clique-free-t-matchings-in-degree-bounded-graphs-2405.004292024-05-02 https://scifaro.com/en/abs/nearly-optimal-list-labeling-2405.008072024-05-03 https://scifaro.com/en/abs/reespot-reeb-graph-models-semantic-patterns-of-normalcy-in-human-trajectories-2405.008082024-10-01 https://scifaro.com/en/abs/approximation-schemes-for-orienteering-and-deadline-tsp-in-doubling-metrics-2405.008182024-05-03 https://scifaro.com/en/abs/teaching-algorithm-design-a-literature-review-2405.008322024-05-03 https://scifaro.com/en/abs/sensitivity-sampling-for-k-means-worst-case-and-stability-optimal-coreset-bounds-2405.013392024-05-03 https://scifaro.com/en/abs/metric-dimension-and-geodetic-set-parameterized-by-vertex-cover-2405.013442025-03-18 https://scifaro.com/en/abs/in-and-out-algorithmic-diffusion-for-sampling-convex-bodies-2405.014252026-03-23 https://scifaro.com/en/abs/new-tools-for-smoothed-analysis-least-singular-value-bounds-for-random-matrices-with-dependent-entries-2405.015172025-09-29 https://scifaro.com/en/abs/on-smale-s-17th-problem-over-the-reals-2405.017352024-12-10 https://scifaro.com/en/abs/combining-crown-structures-for-vulnerability-measures-2405.023782024-12-02 https://scifaro.com/en/abs/improved-all-pairs-approximate-shortest-paths-in-congested-clique-2405.026952026-01-21 https://scifaro.com/en/abs/an-fpt-algorithm-for-the-exact-matching-problem-and-np-hardness-of-related-problems-2405.028292024-05-07 https://scifaro.com/en/abs/tsp-escapes-the-o-2-n-n-2-curse-2405.030182024-05-28 https://scifaro.com/en/abs/approximate-realizations-for-outerplanaric-degree-sequences-2405.032782024-05-07 https://scifaro.com/en/abs/distributed-model-checking-on-graphs-of-bounded-treedepth-2405.033212024-05-07 https://scifaro.com/en/abs/fast-approximate-determinants-using-rational-functions-2405.034742024-05-07 https://scifaro.com/en/abs/content-oblivious-leader-election-on-rings-2405.036462024-05-07 https://scifaro.com/en/abs/competitive-strategies-to-use-warm-start-algorithms-with-predictions-2405.036612024-05-07 https://scifaro.com/en/abs/prize-collecting-steiner-tree-a-1-79-approximation-2405.037922024-05-08 https://scifaro.com/en/abs/finding-most-shattering-minimum-vertex-cuts-of-polylogarithmic-size-in-near-linear-time-2405.038012024-07-15 https://scifaro.com/en/abs/finding-perfect-matchings-in-bridgeless-cubic-multigraphs-without-dynamic-2-connectivity-2405.038562024-05-08 https://scifaro.com/en/abs/minimizing-the-minimizers-via-alphabet-reordering-2405.040522024-05-08 https://scifaro.com/en/abs/bbk-a-simpler-faster-algorithm-for-enumerating-maximal-bicliques-in-large-sparse-bipartite-graphs-2405.044282024-05-27 https://scifaro.com/en/abs/online-list-labeling-with-near-logarithmic-writes-2405.044672024-05-08 https://scifaro.com/en/abs/simpler-and-more-general-distributed-coloring-based-on-simple-list-defective-coloring-algorithms-2405.046482026-05-06 https://scifaro.com/en/abs/counting-cohesive-subgraphs-with-hereditary-properties-2405.048232024-05-09 https://scifaro.com/en/abs/sorting-multibay-block-stacking-storage-systems-2405.048472026-01-07 https://scifaro.com/en/abs/discretely-beyond-1-e-guided-combinatorial-algorithms-for-submodular-maximization-2405.052022025-02-06 https://scifaro.com/en/abs/spider-improved-succinct-rank-and-select-performance-2405.052142024-05-09 https://scifaro.com/en/abs/distributed-least-squares-in-small-space-via-sketching-and-bias-reduction-2405.053432024-05-10 https://scifaro.com/en/abs/certifying-euclidean-sections-and-finding-planted-sparse-vectors-beyond-the-sqrt-n-dimension-threshold-2405.053732024-05-10 https://scifaro.com/en/abs/reconfiguration-of-multisets-with-applications-to-bin-packing-2405.055352024-10-29 https://scifaro.com/en/abs/fine-grained-analysis-and-faster-algorithms-for-iteratively-solving-linear-systems-2405.058182025-06-18 https://scifaro.com/en/abs/faster-linear-systems-and-matrix-norm-approximation-via-multi-level-sketched-preconditioning-2405.058652025-04-14 https://scifaro.com/en/abs/improved-evolutionary-algorithms-for-submodular-maximization-with-cost-constraints-2405.059422024-08-20 https://scifaro.com/en/abs/new-algorithms-and-lower-bounds-for-streaming-tournaments-2405.059522024-05-10 https://scifaro.com/en/abs/a-lock-free-binary-trie-2405.062082025-09-04 https://scifaro.com/en/abs/fast-and-slow-mixing-of-the-kawasaki-dynamics-on-bounded-degree-graphs-2405.062092025-11-25 https://scifaro.com/en/abs/a-frac32-frac1-mathrm-e-approximation-algorithm-for-ordered-tsp-2405.062442024-05-13 https://scifaro.com/en/abs/tree-proof-of-position-algorithms-2405.067612024-06-05 https://scifaro.com/en/abs/a-weakly-polynomial-algorithm-for-aivf-coding-2405.068052024-05-14 https://scifaro.com/en/abs/better-algorithms-for-constructing-minimum-cost-markov-chains-and-aifv-codes-2405.068312024-07-08 https://scifaro.com/en/abs/towards-metric-dbscan-exact-approximate-and-streaming-algorithms-2405.068992025-01-07 https://scifaro.com/en/abs/pcf-learned-sort-a-learning-augmented-sort-algorithm-with-o-n-log-log-n-expected-complexity-2405.071222025-11-11 https://scifaro.com/en/abs/distributed-lov-a-sz-local-lemma-under-bandwidth-limitations-2405.073532024-05-14 https://scifaro.com/en/abs/practical-computation-of-graph-vc-dimension-2405.075882024-05-14 https://scifaro.com/en/abs/online-load-and-graph-balancing-for-random-order-inputs-2405.079492024-05-22 https://scifaro.com/en/abs/anytime-sorting-algorithms-extended-version-2405.085642024-05-15 https://scifaro.com/en/abs/online-busy-time-scheduling-with-flexible-jobs-2405.085952025-10-20 https://scifaro.com/en/abs/explicit-orthogonal-arrays-and-universal-hashing-with-arbitrary-parameters-2405.087872024-05-15 https://scifaro.com/en/abs/expanderizing-higher-order-random-walks-2405.089272024-06-04 https://scifaro.com/en/abs/a-qptas-for-facility-location-on-unit-disk-graphs-2405.089312024-05-16 https://scifaro.com/en/abs/pointwise-lipschitz-continuous-graph-algorithms-2405.089382025-11-11 https://scifaro.com/en/abs/symmetric-difference-degeneracy-and-signed-tree-models-2405.090112024-05-16 https://scifaro.com/en/abs/tree-packing-revisited-faster-fully-dynamic-min-cut-and-arboricity-2405.091412024-12-05 https://scifaro.com/en/abs/interval-selection-in-sliding-windows-2405.093382024-11-13 https://scifaro.com/en/abs/risk-sensitive-online-algorithms-2405.098592024-05-28 https://scifaro.com/en/abs/dynamic-online-matching-with-budget-refills-2405.099202025-07-08 https://scifaro.com/en/abs/distributed-delta-coloring-under-bandwidth-limitations-2405.099752024-05-17 https://scifaro.com/en/abs/near-uniform-triangle-sampling-over-adjacency-list-graph-streams-2405.101672024-05-17 https://scifaro.com/en/abs/rounding-large-independent-sets-on-expanders-2405.102382024-11-07 https://scifaro.com/en/abs/adaptive-quotient-filters-2405.102532024-05-17 https://scifaro.com/en/abs/a-polynomial-time-approximation-for-pairwise-fair-k-median-clustering-2405.103782025-02-28 https://scifaro.com/en/abs/lock-free-augmented-trees-2405.105062024-05-20 https://scifaro.com/en/abs/parameterized-complexity-of-dominating-set-variants-in-almost-cluster-and-split-graphs-2405.105562024-05-20 https://scifaro.com/en/abs/real-world-graph-analysis-techniques-for-static-dynamic-and-temporal-communities-2405.108242024-05-20 https://scifaro.com/en/abs/string-2-covers-with-no-length-restrictions-2405.114752024-05-21 https://scifaro.com/en/abs/fair-set-cover-2405.116392025-04-22 https://scifaro.com/en/abs/byo-a-unified-framework-for-benchmarking-large-scale-graph-containers-2405.116712024-05-21 https://scifaro.com/en/abs/scheduling-jobs-with-work-inefficient-parallel-solutions-2405.119862024-05-21 https://scifaro.com/en/abs/count-min-sketch-with-conservative-updates-worst-case-analysis-2405.120342024-05-22 https://scifaro.com/en/abs/a-nearly-quadratic-improvement-for-memory-reallocation-2405.121522024-05-21 https://scifaro.com/en/abs/enhanced-deterministic-approximation-algorithm-for-non-monotone-submodular-maximization-under-knapsack-constraint-with-linear-query-complexity-2405.122522024-05-22 https://scifaro.com/en/abs/aligning-multiple-inhomogeneous-random-graphs-fundamental-limits-of-exact-recovery-2405.122932025-07-01 https://scifaro.com/en/abs/algorithms-for-generating-small-random-samples-2405.123712025-01-10 https://scifaro.com/en/abs/sorting-in-one-and-two-rounds-using-t-comparators-2405.126782024-05-22 https://scifaro.com/en/abs/faster-linear-size-and-or-path-and-adder-circuits-2405.127652024-05-24 https://scifaro.com/en/abs/approximating-traveling-salesman-problems-using-a-bridge-lemma-2405.128762026-03-23 https://scifaro.com/en/abs/average-sensitivity-of-the-knapsack-problem-2405.133432024-05-24 https://scifaro.com/en/abs/faster-vizing-and-near-vizing-edge-coloring-algorithms-2405.133712024-05-24 https://scifaro.com/en/abs/cascading-tree-algorithm-for-the-0-1-knapsack-problem-in-memory-of-heiner-m-u-ller-merbach-a-former-president-of-ifors-2405.134502024-05-24 https://scifaro.com/en/abs/enumerating-graphlets-with-amortized-time-complexity-independent-of-graph-size-2405.136132025-05-15 https://scifaro.com/en/abs/path-reporting-distance-oracles-with-linear-size-2405.142542024-05-24 https://scifaro.com/en/abs/polynomial-pass-semi-streaming-lower-bounds-for-k-cores-and-degeneracy-2405.148352024-05-24 https://scifaro.com/en/abs/lower-bound-on-the-greedy-approximation-ratio-for-adaptive-submodular-cover-2405.149952024-05-27 https://scifaro.com/en/abs/efficient-certificates-of-anti-concentration-beyond-gaussians-2405.150842024-10-29 https://scifaro.com/en/abs/worst-case-optimal-adaptive-dynamic-bitvectors-2405.150882025-05-22 https://scifaro.com/en/abs/engineering-optimal-parallel-task-scheduling-2405.153712024-10-22 https://scifaro.com/en/abs/when-far-is-better-the-chamberlin-courant-approach-to-obnoxious-committee-selection-2405.153722024-05-27 https://scifaro.com/en/abs/faster-delta-1-edge-coloring-breaking-the-m-sqrt-n-time-barrier-2405.154492024-05-27 https://scifaro.com/en/abs/finding-induced-subgraphs-from-graphs-with-small-mim-width-2405.154922024-05-27 https://scifaro.com/en/abs/maximizing-weighted-dominance-in-the-plane-2405.158112024-11-28 https://scifaro.com/en/abs/learning-minimum-linear-arrangement-of-cliques-and-lines-2405.159632024-05-28 https://scifaro.com/en/abs/hierarchical-clustering-via-local-search-2405.159832024-05-28 https://scifaro.com/en/abs/boolean-matrix-multiplication-for-highly-clustered-data-on-the-congested-clique-2405.161032024-05-28 https://scifaro.com/en/abs/reconfiguration-and-enumeration-of-optimal-cyclic-ladder-lotteries-2405.164082024-05-28 https://scifaro.com/en/abs/private-edge-density-estimation-for-random-graphs-optimal-efficient-and-robust-2405.166632024-06-05 https://scifaro.com/en/abs/finding-maximum-common-contractions-between-phylogenetic-networks-2405.167132025-02-21 https://scifaro.com/en/abs/fully-subexponential-time-approximation-scheme-for-product-partition-2405.176922024-05-29 https://scifaro.com/en/abs/unmasking-vulnerabilities-cardinality-sketches-under-adaptive-inputs-2405.177802024-05-29 https://scifaro.com/en/abs/banana-trees-for-the-persistence-in-time-series-experimentally-2405.179202025-03-20 https://scifaro.com/en/abs/graph-threading-with-turn-costs-2405.179532024-05-29 https://scifaro.com/en/abs/tree-coloring-random-order-and-predictions-2405.181512024-05-29 https://scifaro.com/en/abs/individualized-privacy-accounting-via-subsampling-with-applications-in-combinatorial-optimization-2405.185342024-05-30 https://scifaro.com/en/abs/a-faster-heuristic-for-the-traveling-salesman-problem-with-drone-2405.185662024-05-30 https://scifaro.com/en/abs/warm-starting-push-relabel-2405.185682024-05-30 https://scifaro.com/en/abs/navigable-graphs-for-high-dimensional-nearest-neighbor-search-constructions-and-limits-2405.186802025-03-18 https://scifaro.com/en/abs/gist-greedy-independent-set-thresholding-for-max-min-diversification-with-submodular-utility-2405.187542025-10-21 https://scifaro.com/en/abs/an-overview-of-some-single-machine-scheduling-problems-polynomial-algorithms-complexity-and-approximability-2405.187892024-06-19 https://scifaro.com/en/abs/multiplicative-weights-update-area-convexity-and-random-coordinate-descent-for-densest-subgraph-problems-2405.188092024-06-18 https://scifaro.com/en/abs/theoretical-insights-and-an-experimental-comparison-of-tango-trees-and-multi-splay-trees-2405.188252024-05-30 https://scifaro.com/en/abs/the-structural-complexity-landscape-of-finding-balance-fair-shortest-paths-2405.188662024-05-30 https://scifaro.com/en/abs/fast-gaussian-distributed-pseudorandom-number-generation-in-java-via-the-ziggurat-algorithm-2405.194932024-05-31 https://scifaro.com/en/abs/muvera-multi-vector-retrieval-via-fixed-dimensional-encodings-2405.195042024-05-31 https://scifaro.com/en/abs/simisketch-efficiently-estimating-similarity-of-streaming-multisets-2405.197112024-05-31 https://scifaro.com/en/abs/consistent-submodular-maximization-2405.199772024-05-31 https://scifaro.com/en/abs/private-mean-estimation-with-person-level-differential-privacy-2405.204052024-07-22 https://scifaro.com/en/abs/exact-algorithms-for-maxcut-on-split-graphs-2405.205992024-06-03 https://scifaro.com/en/abs/optimally-improving-cooperative-learning-in-a-social-setting-2405.208082024-06-03 https://scifaro.com/en/abs/locally-stationary-distributions-a-framework-for-analyzing-slow-mixing-markov-chains-2405.208492025-07-08 https://scifaro.com/en/abs/maximum-bipartite-matching-in-n-2-o-1-time-via-a-combinatorial-algorithm-2405.208612024-06-03 https://scifaro.com/en/abs/finding-diverse-solutions-parameterized-by-cliquewidth-2405.209312026-03-30 https://scifaro.com/en/abs/submodular-maximization-in-exactly-n-queries-2406.001482024-08-29 https://scifaro.com/en/abs/individual-fairness-in-graph-decomposition-2406.002132024-06-04 https://scifaro.com/en/abs/counting-on-general-run-length-grammars-2406.002212025-01-30 https://scifaro.com/en/abs/optimal-bounds-for-ell-p-sensitivity-sampling-via-ell-2-augmentation-2406.003282024-06-04 https://scifaro.com/en/abs/turnstile-ell-p-leverage-score-sampling-with-applications-2406.003392024-06-04 https://scifaro.com/en/abs/better-coloring-of-3-colorable-graphs-2406.003572024-06-04 https://scifaro.com/en/abs/approaching-100-confidence-in-stream-summary-through-reliablesketch-2406.003762024-06-04 https://scifaro.com/en/abs/structural-and-algorithmic-results-for-stable-cycles-and-partitions-in-the-roommates-problem-2406.004372024-11-26 https://scifaro.com/en/abs/knapsack-with-vertex-cover-set-cover-and-hitting-set-2406.010572025-05-02 https://scifaro.com/en/abs/linear-index-for-logarithmic-search-time-for-any-string-under-any-internal-node-in-suffix-trees-2406.011742024-06-04 https://scifaro.com/en/abs/on-approximation-of-robust-max-cut-and-related-problems-using-randomized-rounding-algorithms-2406.018562024-06-05 https://scifaro.com/en/abs/convergence-properties-of-the-asynchronous-maximum-model-2406.019102024-06-05 https://scifaro.com/en/abs/random-abstract-cell-complexes-2406.019992025-11-21 https://scifaro.com/en/abs/on-the-computation-of-2-dimensional-recurrence-equations-2406.020822024-06-05 https://scifaro.com/en/abs/reweighted-solutions-for-weighted-low-rank-approximation-2406.024312024-06-05 https://scifaro.com/en/abs/coresets-for-multiple-ell-p-regression-2406.024322024-06-05 https://scifaro.com/en/abs/local-search-k-means-with-foresight-2406.027392024-06-06 https://scifaro.com/en/abs/tolerant-algorithms-for-learning-with-arbitrary-covariate-shift-2406.027422024-06-06 https://scifaro.com/en/abs/efficient-leverage-score-sampling-for-tensor-train-decomposition-2406.027492024-06-07 https://scifaro.com/en/abs/private-stochastic-convex-optimization-with-heavy-tails-near-optimality-from-simple-reductions-2406.027892024-06-06 https://scifaro.com/en/abs/high-dimensional-geometric-streaming-for-nearly-low-rank-data-2406.029102024-06-06 https://scifaro.com/en/abs/dynamic-spectral-clustering-with-provable-approximation-guarantee-2406.031522024-06-06 https://scifaro.com/en/abs/a-simple-learning-augmented-algorithm-for-online-packing-with-concave-objectives-2406.035742024-06-07 https://scifaro.com/en/abs/maximum-flow-by-augmenting-paths-in-n-2-o-1-time-2406.036482025-09-30 https://scifaro.com/en/abs/learning-safe-strategies-for-value-maximizing-buyers-in-uniform-price-auctions-2406.036742025-10-07 https://scifaro.com/en/abs/a-nearly-optimal-deterministic-algorithm-for-online-transportation-problem-2406.037782025-04-24 https://scifaro.com/en/abs/engineering-semi-streaming-dfs-algorithms-2406.039222024-06-10 https://scifaro.com/en/abs/l-algorithme-pourquoi-et-comment-le-d-e-finir-pour-l-enseigner-2406.043852024-12-17 https://scifaro.com/en/abs/a-lower-bound-for-light-spanners-in-general-graphs-2406.044592024-09-09 https://scifaro.com/en/abs/explicit-combinatoric-structures-of-palindromes-and-chromatic-number-of-restriction-graphs-2406.045072024-06-10 https://scifaro.com/en/abs/learning-augmented-priority-queues-2406.047932024-11-19 https://scifaro.com/en/abs/a-near-linear-time-approximation-algorithm-for-beyond-worst-case-graph-clustering-2406.048572024-06-10 https://scifaro.com/en/abs/efficient-centroid-linkage-clustering-2406.050662024-06-10 https://scifaro.com/en/abs/comparative-performance-of-the-avl-tree-and-three-variants-of-the-red-black-tree-2406.051622025-08-06 https://scifaro.com/en/abs/simple-and-optimal-sublinear-algorithms-for-mean-estimation-2406.052542025-10-07 https://scifaro.com/en/abs/optimal-preprocessing-for-answering-on-line-product-queries-2406.063212024-06-11 https://scifaro.com/en/abs/randomized-binary-and-tree-search-under-pressure-2406.064682024-06-19 https://scifaro.com/en/abs/fast-sampling-based-sketches-for-tensors-2406.067352024-06-12 https://scifaro.com/en/abs/lookback-prophet-inequalities-2406.068052024-11-19 https://scifaro.com/en/abs/fast-white-box-adversarial-streaming-without-a-random-oracle-2406.068082024-06-12 https://scifaro.com/en/abs/streaming-algorithms-with-few-state-changes-2406.068212024-06-12 https://scifaro.com/en/abs/optimal-electrical-oblivious-routing-on-expanders-2406.072522024-06-12 https://scifaro.com/en/abs/using-single-neuron-representations-for-hierarchical-concepts-as-abstractions-of-multi-neuron-representations-2406.072972025-03-25 https://scifaro.com/en/abs/faster-spectral-density-estimation-and-sparsification-in-the-nuclear-norm-2406.075212024-06-12 https://scifaro.com/en/abs/bipartite-matching-in-massive-graphs-a-tight-analysis-of-edcs-2406.076302024-06-13 https://scifaro.com/en/abs/a-unified-framework-for-integer-programming-formulation-of-graph-matching-problems-2406.076662024-06-13 https://scifaro.com/en/abs/approximating-optimum-online-for-capacitated-resource-allocation-2406.077572024-06-13 https://scifaro.com/en/abs/approximating-maximum-matching-requires-almost-quadratic-time-2406.085952024-06-14 https://scifaro.com/en/abs/a-sublinear-algorithm-for-approximate-shortest-paths-in-large-networks-2406.086242024-06-14 https://scifaro.com/en/abs/matching-with-nested-and-bundled-pandora-boxes-2406.087112025-06-30 https://scifaro.com/en/abs/the-behavior-of-tree-width-and-path-width-under-graph-operations-and-graph-transformations-2406.089852024-06-14 https://scifaro.com/en/abs/dynamic-correlation-clustering-in-sublinear-update-time-2406.091372024-06-14 https://scifaro.com/en/abs/reducing-the-space-used-by-the-sieve-of-eratosthenes-when-factoring-2406.091502024-11-13 https://scifaro.com/en/abs/compact-parallel-hash-tables-on-the-gpu-2406.092552024-06-14 https://scifaro.com/en/abs/efficient-discrepancy-testing-for-learning-with-distribution-shift-2406.093732024-06-14 https://scifaro.com/en/abs/optimal-kernel-orchestration-for-tensor-programs-with-korch-2406.094652024-06-17 https://scifaro.com/en/abs/block-coordinate-descent-methods-for-optimization-under-j-orthogonality-constraints-with-applications-2406.097712024-06-17 https://scifaro.com/en/abs/seat-arrangement-problems-under-b-utility-and-w-utility-2406.099652026-01-27 https://scifaro.com/en/abs/fully-dynamic-strongly-connected-components-in-planar-digraphs-2406.104202024-06-18 https://scifaro.com/en/abs/scheduling-two-types-of-jobs-with-minimum-makespan-2406.104672025-03-17 https://scifaro.com/en/abs/scalable-temporal-motif-densest-subnetwork-discovery-2406.106082024-06-26 https://scifaro.com/en/abs/string-partition-for-building-long-burrows-wheeler-transforms-2406.106102025-05-15 https://scifaro.com/en/abs/solving-co-path-cycle-packing-and-co-path-packing-faster-than-3-k-2406.108292024-09-02 https://scifaro.com/en/abs/perturbation-resilient-trades-for-dynamic-service-balancing-2406.110752024-06-24 https://scifaro.com/en/abs/almost-linear-size-edit-distance-sketch-2406.112252024-06-18 https://scifaro.com/en/abs/diagram-control-and-model-order-for-sugiyama-layouts-2406.113932024-06-18 https://scifaro.com/en/abs/making-old-things-new-a-unified-algorithm-for-differentially-private-clustering-2406.116492024-06-18 https://scifaro.com/en/abs/tight-streaming-lower-bounds-for-deterministic-approximate-counting-2406.121492024-06-19 https://scifaro.com/en/abs/implementation-of-dynamic-de-bruijn-graphs-via-learned-index-2406.123392024-06-19 https://scifaro.com/en/abs/biased-pareto-optimization-for-subset-selection-with-dynamic-cost-constraints-2406.123832024-09-10 https://scifaro.com/en/abs/massively-parallel-ruling-set-made-deterministic-2406.127272024-10-22 https://scifaro.com/en/abs/sample-based-matroid-prophet-inequalities-2406.127992024-06-19 https://scifaro.com/en/abs/randomized-greedy-online-edge-coloring-succeeds-for-dense-and-randomly-ordered-graphs-2406.130002024-10-30 https://scifaro.com/en/abs/tight-lower-bounds-for-directed-cut-sparsification-and-distributed-min-cut-2406.132312024-06-21 https://scifaro.com/en/abs/satsuma-structure-based-symmetry-breaking-in-sat-2406.135572024-06-21 https://scifaro.com/en/abs/improved-bounds-for-fully-dynamic-matching-via-ordered-ruzsa-szemeredi-graphs-2406.135732024-10-22 https://scifaro.com/en/abs/barter-exchange-with-shared-item-valuations-2406.139832024-06-21 https://scifaro.com/en/abs/expander-hierarchies-for-normalized-cuts-on-graphs-2406.141112026-04-27 https://scifaro.com/en/abs/efficient-deterministic-algorithms-for-maximizing-symmetric-submodular-functions-2406.142782024-06-21 https://scifaro.com/en/abs/low-step-multi-commodity-flow-emulators-2406.143842024-06-21 https://scifaro.com/en/abs/online-matching-and-contention-resolution-for-edge-arrivals-with-vanishing-probabilities-2406.145062024-10-10 https://scifaro.com/en/abs/np-completeness-of-the-combinatorial-distance-matrix-realisation-problem-2406.147292024-06-24 https://scifaro.com/en/abs/colorful-priority-k-supplier-2406.149842024-06-24 https://scifaro.com/en/abs/space-efficient-slp-encoding-for-o-log-n-time-random-access-2406.150112026-01-09 https://scifaro.com/en/abs/minimum-1-steiner-cuts-and-dual-edge-sensitivity-oracle-bridging-the-gap-between-global-cut-and-s-t-cut-2406.151292025-05-05 https://scifaro.com/en/abs/supermodular-approximation-of-norms-and-applications-2406.151802024-06-24 https://scifaro.com/en/abs/setting-targets-is-all-you-need-improved-order-competitive-ratio-for-online-selection-2406.151922024-06-24 https://scifaro.com/en/abs/calculation-of-the-comparative-efficiency-of-algorithms-using-a-single-metric-2406.155102024-06-25 https://scifaro.com/en/abs/exponential-time-approximation-for-coloring-3-colorable-graphs-2406.155632024-06-25 https://scifaro.com/en/abs/pairwise-independent-contention-resolution-2406.158762024-06-25 https://scifaro.com/en/abs/learning-based-heavy-hitters-and-flow-frequency-estimation-in-streams-2406.162702024-06-25 https://scifaro.com/en/abs/on-computing-pairwise-statistics-with-local-differential-privacy-2406.163052024-06-25 https://scifaro.com/en/abs/optimal-generation-of-strictly-increasing-binary-trees-and-beyond-2406.163962024-06-25 https://scifaro.com/en/abs/bijective-bwt-based-compression-schemes-2406.164752024-08-20 https://scifaro.com/en/abs/an-fpras-for-model-counting-for-non-deterministic-read-once-branching-programs-2406.165152025-12-04 https://scifaro.com/en/abs/optimizing-search-strategies-a-study-of-two-pointer-linear-search-implementation-2406.167292024-06-25 https://scifaro.com/en/abs/scheduling-with-obligatory-tests-2406.167342024-06-25 https://scifaro.com/en/abs/competitive-policies-for-online-collateral-maintenance-2406.171212024-08-06 https://scifaro.com/en/abs/dynamic-metric-embedding-into-ell-p-space-2406.172102024-08-15 https://scifaro.com/en/abs/cfg-and-dnnf-admit-fpras-2406.182242026-05-18 https://scifaro.com/en/abs/complexity-classes-for-online-problems-with-and-without-predictions-2406.182652026-02-02 https://scifaro.com/en/abs/lift-and-project-integrality-gaps-for-santa-claus-2406.182732024-10-18 https://scifaro.com/en/abs/sum-of-squares-lower-bounds-for-independent-set-in-ultra-sparse-random-graphs-2406.184292024-06-27 https://scifaro.com/en/abs/generalized-cuts-and-grothendieck-covers-a-primal-dual-approximation-framework-extending-the-goemans-williamson-algorithm-2406.186702024-06-28 https://scifaro.com/en/abs/approximate-minimum-sum-colorings-and-maximum-k-colorable-subgraphs-of-chordal-graphs-2406.188352024-06-28 https://scifaro.com/en/abs/vertimrf-differentially-private-vertical-federated-data-synthesis-2406.190082024-06-28 https://scifaro.com/en/abs/exact-minimum-weight-spanners-via-column-generation-2406.191642024-06-28 https://scifaro.com/en/abs/online-sorting-and-online-tsp-randomized-stochastic-and-high-dimensional-2406.192572024-06-28 https://scifaro.com/en/abs/near-optimal-dual-fault-tolerant-distance-oracle-2406.197092024-07-03 https://scifaro.com/en/abs/steiner-tree-parameterized-by-multiway-cut-and-even-less-2406.198192024-07-01 https://scifaro.com/en/abs/fully-dynamic-k-means-coreset-in-near-optimal-update-time-2406.199262024-07-01 https://scifaro.com/en/abs/a-dichotomy-for-maximum-pcsps-on-graphs-2406.200692026-03-03 https://scifaro.com/en/abs/fast-computation-of-the-discrete-fourier-transform-square-index-coefficients-2407.001822024-12-18 https://scifaro.com/en/abs/the-even-path-problem-in-directed-single-crossing-minor-free-graphs-2407.002372024-07-02 https://scifaro.com/en/abs/wooly-graphs-a-mathematical-framework-for-knitting-2407.005112024-07-04 https://scifaro.com/en/abs/a-simple-representation-of-tree-covering-utilizing-balanced-parentheses-and-efficient-implementation-of-average-case-optimal-rmqs-2407.005732024-08-09 https://scifaro.com/en/abs/computing-vertex-and-edge-connectivity-of-graphs-embedded-with-crossings-2407.005862025-10-14 https://scifaro.com/en/abs/balanced-learned-sort-a-new-learned-model-for-fast-and-balanced-item-bucketing-2407.007342024-07-03 https://scifaro.com/en/abs/efficient-algorithms-for-computing-bisimulations-for-nondeterministic-fuzzy-transition-systems-2407.010522024-07-02 https://scifaro.com/en/abs/linear-time-maxcut-in-multigraphs-parameterized-above-the-poljak-turz-ik-bound-2407.010712024-07-02 https://scifaro.com/en/abs/graph-spanners-for-group-steiner-distances-2407.014312024-07-02 https://scifaro.com/en/abs/kick-the-cliques-2407.014652024-07-02 https://scifaro.com/en/abs/validation-and-implementation-of-ilbfs-2407.016372024-07-16 https://scifaro.com/en/abs/from-directed-steiner-tree-to-directed-polymatroid-steiner-tree-in-planar-graphs-2407.019042024-07-03 https://scifaro.com/en/abs/online-unbounded-knapsack-2407.020452024-11-01 https://scifaro.com/en/abs/on-polynomial-kernelization-for-stable-cutset-2407.020862024-07-03 https://scifaro.com/en/abs/minsum-problem-for-discrete-and-weighted-set-flow-on-dynamic-path-network-2407.021772024-07-03 https://scifaro.com/en/abs/finer-grained-hardness-of-kernel-density-estimation-2407.023722024-07-03 https://scifaro.com/en/abs/improved-space-efficient-approximate-nearest-neighbor-search-using-function-inversion-2407.024682024-07-03 https://scifaro.com/en/abs/optimizing-probabilistic-propagation-in-graphs-by-adding-edges-2407.026242025-07-14 https://scifaro.com/en/abs/matching-multi-cut-algorithms-complexity-and-enumeration-2407.028982024-07-04 https://scifaro.com/en/abs/finding-spanning-trees-with-perfect-matchings-2407.029582024-07-12 https://scifaro.com/en/abs/matroid-intersection-under-minimum-rank-oracle-2407.032292025-12-29 https://scifaro.com/en/abs/ridge-leverage-score-sampling-for-ell-p-subspace-approximation-2407.032622025-04-04 https://scifaro.com/en/abs/greedy-bst-on-permutation-initial-tree-2407.036662025-08-11 https://scifaro.com/en/abs/multiway-cuts-with-a-choice-of-representatives-2407.038772024-07-08 https://scifaro.com/en/abs/near-optimal-size-linear-sketches-for-hypergraph-cut-sparsifiers-2407.039342024-07-08 https://scifaro.com/en/abs/fair-repetitive-interval-scheduling-2407.039872024-07-08 https://scifaro.com/en/abs/improved-outerplanarity-bounds-for-planar-graphs-2407.042822024-07-08 https://scifaro.com/en/abs/a-frac-4-3-approximation-for-the-maximum-leaf-spanning-arborescence-problem-in-dags-2407.043422024-07-08 https://scifaro.com/en/abs/bicriterial-approximation-for-the-incremental-prize-collecting-steiner-tree-problem-2407.044472024-07-08 https://scifaro.com/en/abs/rapid-mixing-via-coupling-independence-for-spin-systems-with-unbounded-degree-2407.046722024-07-08 https://scifaro.com/en/abs/near-optimal-hierarchical-matrix-approximation-from-matrix-vector-products-2407.046862024-10-25 https://scifaro.com/en/abs/a-decomposition-theorem-for-dynamic-flows-2407.047612026-02-05 https://scifaro.com/en/abs/the-submodular-santa-claus-problem-2407.048242024-07-09 https://scifaro.com/en/abs/faster-single-source-shortest-paths-with-negative-real-weights-via-proper-hop-distance-2407.048722024-12-10 https://scifaro.com/en/abs/a-linear-time-algorithm-for-1-epsilon-delta-edge-coloring-2407.048872025-02-10 https://scifaro.com/en/abs/universal-perfect-samplers-for-incremental-streams-2407.049312024-07-09 https://scifaro.com/en/abs/counting-permutation-patterns-with-multidimensional-trees-2407.049712024-07-09 https://scifaro.com/en/abs/congestion-approximators-from-the-bottom-up-2407.049762025-01-14 https://scifaro.com/en/abs/fptas-for-holant-problems-with-log-concave-signatures-2407.049892024-07-09 https://scifaro.com/en/abs/competitive-analysis-of-online-path-selection-impacts-of-path-length-topology-and-system-level-costs-2407.052392024-07-09 https://scifaro.com/en/abs/online-matching-a-brief-survey-2407.053812024-07-09 https://scifaro.com/en/abs/hamming-distance-oracle-2407.054302024-07-09 https://scifaro.com/en/abs/polynomial-time-algorithms-for-integer-programming-and-unbounded-subset-sum-in-the-total-regime-2407.054352024-07-12 https://scifaro.com/en/abs/stochastic-traveling-salesperson-problem-with-neighborhoods-for-object-detection-2407.063662024-07-10 https://scifaro.com/en/abs/a-lossless-deamortization-for-dynamic-greedy-set-cover-2407.064312024-07-10 https://scifaro.com/en/abs/efficient-stochastic-routing-in-path-centric-uncertain-road-networks-extended-version-2407.068812024-07-10 https://scifaro.com/en/abs/optimal-neighborhood-exploration-for-dynamic-independent-sets-2407.069122024-07-10 https://scifaro.com/en/abs/a-simple-nearly-optimal-algorithm-for-differentially-private-all-pairs-shortest-distances-2407.069132024-07-16 https://scifaro.com/en/abs/an-efficient-implementation-for-solving-the-all-pairs-minimax-path-problem-in-an-undirected-dense-graph-2407.070582025-08-28 https://scifaro.com/en/abs/spectral-toolkit-of-algorithms-for-graphs-technical-report-2-2407.070962024-07-11 https://scifaro.com/en/abs/differential-privacy-and-sublinear-time-are-incompatible-sometimes-2407.072622025-01-15 https://scifaro.com/en/abs/a-new-approach-for-approximating-directed-rooted-networks-2407.075432024-07-11 https://scifaro.com/en/abs/on-sampling-from-ising-models-with-spectral-constraints-2407.076452024-07-11 https://scifaro.com/en/abs/aptas-for-bin-packing-with-general-cost-structures-2407.076772024-07-11 https://scifaro.com/en/abs/revisiting-the-folklore-algorithm-for-random-access-to-grammar-compressed-strings-2407.081902024-07-12 https://scifaro.com/en/abs/hybrid-k-clustering-blending-k-median-and-k-center-2407.082952024-07-12 https://scifaro.com/en/abs/improved-online-load-balancing-with-known-makespan-2407.083762024-07-12 https://scifaro.com/en/abs/improved-fpt-approximation-for-non-metric-tsp-2407.083922024-07-12 https://scifaro.com/en/abs/a-note-on-the-conditional-optimality-of-chiba-and-nishizeki-s-algorithms-2407.085622024-07-12 https://scifaro.com/en/abs/the-cdawg-index-and-pattern-matching-on-grammar-compressed-strings-2407.088262024-07-15 https://scifaro.com/en/abs/optimal-protocols-for-2-party-contention-resolution-2407.088452024-07-15 https://scifaro.com/en/abs/bipartizing-pseudo-disk-graphs-approximation-with-a-ratio-better-than-3-2407.093562024-07-15 https://scifaro.com/en/abs/maximum-unique-coverage-on-streams-improved-fpt-approximation-scheme-and-tighter-space-lower-bound-2407.093682024-07-15 https://scifaro.com/en/abs/nearly-tight-bounds-for-flow-sparsifiers-in-quasi-bipartite-graphs-2407.094332024-09-09 https://scifaro.com/en/abs/a-distance-for-geometric-graphs-via-the-labeled-merge-tree-interleaving-distance-2407.094422024-07-15 https://scifaro.com/en/abs/interactive-coding-with-unbounded-noise-2407.094632024-07-15 https://scifaro.com/en/abs/fine-grained-optimality-of-partially-dynamic-shortest-paths-and-more-2407.096512024-07-16 https://scifaro.com/en/abs/an-efficient-algorithm-to-compute-the-minimum-free-energy-of-interacting-nucleic-acid-strands-2407.096762024-07-16 https://scifaro.com/en/abs/orientability-of-undirected-phylogenetic-networks-to-a-desired-class-practical-algorithms-and-application-to-tree-child-orientation-2407.097762025-09-30 https://scifaro.com/en/abs/a-dynamic-algorithm-for-weighted-submodular-cover-problem-2407.100032024-07-16 https://scifaro.com/en/abs/partial-implementation-of-max-flow-and-min-cost-flow-in-almost-linear-time-2407.100342024-07-16 https://scifaro.com/en/abs/unsplittable-flow-on-a-short-path-2407.101382024-07-16 https://scifaro.com/en/abs/fine-grained-lower-bounds-for-multidimensional-knapsack-2407.101462024-07-16 https://scifaro.com/en/abs/competitive-query-minimization-for-stable-matching-with-one-sided-uncertainty-2407.101702024-07-16 https://scifaro.com/en/abs/low-sensitivity-hopsets-2407.102492024-07-16 https://scifaro.com/en/abs/online-matroid-embeddings-2407.103162025-10-20 https://scifaro.com/en/abs/the-average-value-allocation-problem-2407.104012025-09-09 https://scifaro.com/en/abs/9-7-approximation-for-two-edge-connectivity-and-two-vertex-connectivity-2407.105262024-09-27 https://scifaro.com/en/abs/spanning-trees-minimizing-branching-costs-2407.105712025-07-16 https://scifaro.com/en/abs/from-data-completion-to-problems-on-hypercubes-a-parameterized-analysis-of-the-independent-set-problem-2407.106992024-07-16 https://scifaro.com/en/abs/almost-linear-time-algorithms-for-decremental-graphs-min-cost-flow-and-more-via-duality-2407.108302024-07-16 https://scifaro.com/en/abs/cut-preserving-vertex-sparsifiers-for-planar-and-quasi-bipartite-graphs-2407.108522024-10-18 https://scifaro.com/en/abs/improved-lower-bounds-on-the-expected-length-of-longest-common-subsequences-2407.109252024-07-16 https://scifaro.com/en/abs/3-2-approximation-for-the-forest-augmentation-problem-2407.111012024-10-28 https://scifaro.com/en/abs/trace-reconstruction-from-local-statistical-queries-2407.111772024-07-17 https://scifaro.com/en/abs/faster-and-simpler-greedy-algorithm-for-k-median-and-k-means-2407.112172025-10-30 https://scifaro.com/en/abs/on-the-houdr-e-tetali-conjecture-about-an-isoperimetric-constant-of-graphs-2407.113572024-07-17 https://scifaro.com/en/abs/learning-augmented-maximum-independent-set-2407.113642024-07-17 https://scifaro.com/en/abs/speed-robust-scheduling-revisited-2407.116702024-07-17 https://scifaro.com/en/abs/iid-prophet-inequality-with-random-horizon-going-beyond-increasing-hazard-rates-2407.117522025-06-23 https://scifaro.com/en/abs/independent-set-reconfiguration-under-bounded-hop-token-2407.117682026-05-19 https://scifaro.com/en/abs/text-indexing-for-long-patterns-using-locally-consistent-anchors-2407.118192024-07-17 https://scifaro.com/en/abs/faster-algorithms-for-schatten-p-low-rank-approximation-2407.119592024-07-17 https://scifaro.com/en/abs/optimal-distance-labeling-for-permutation-graphs-2407.121472024-07-18 https://scifaro.com/en/abs/optimal-padded-decomposition-for-bounded-treewidth-graphs-2407.122302025-10-15 https://scifaro.com/en/abs/engineering-fully-dynamic-exact-delta-orientation-algorithms-2407.125952024-07-18 https://scifaro.com/en/abs/sampling-with-a-black-box-faster-parameterized-approximation-algorithms-for-vertex-deletion-problems-2407.126542024-07-18 https://scifaro.com/en/abs/r-enyi-infinity-constrained-sampling-with-d-3-membership-queries-2407.129672024-07-19 https://scifaro.com/en/abs/the-madness-of-multiple-entries-in-march-madness-2407.134382024-07-19 https://scifaro.com/en/abs/accurate-analysis-of-sparse-random-projections-2407.145182024-07-23 https://scifaro.com/en/abs/differential-privacy-with-multiple-selections-2407.146412024-07-23 https://scifaro.com/en/abs/online-metric-matching-beyond-the-worst-case-2407.147852025-10-16 https://scifaro.com/en/abs/squaresort-a-cache-oblivious-sorting-algorithm-2407.148012024-07-23 https://scifaro.com/en/abs/interdiction-of-minimum-spanning-trees-and-other-matroid-bases-2407.149062024-07-23 https://scifaro.com/en/abs/new-philosopher-inequalities-for-online-bayesian-matching-via-pivotal-sampling-2407.152852024-07-23 https://scifaro.com/en/abs/twin-width-meets-feedback-edges-and-vertex-integrity-2407.155142024-07-23 https://scifaro.com/en/abs/online-string-attractors-2407.155992024-07-23 https://scifaro.com/en/abs/scheduling-on-a-stochastic-number-of-machines-2407.157372024-07-23 https://scifaro.com/en/abs/universal-optimization-for-non-clairvoyant-subadditive-joint-replenishment-2407.158092024-07-23 https://scifaro.com/en/abs/color-refinement-for-relational-structures-2407.160222026-02-05 https://scifaro.com/en/abs/two-results-on-lpt-a-near-linear-time-algorithm-and-parcel-delivery-using-drones-2407.163232024-10-02 https://scifaro.com/en/abs/hardness-and-approximability-of-dimension-reduction-on-the-probability-simplex-2407.163522024-07-24 https://scifaro.com/en/abs/canadian-traveller-problems-in-temporal-graphs-2407.164912024-07-24 https://scifaro.com/en/abs/a-simple-algorithm-for-near-vizing-edge-coloring-in-near-linear-time-2407.165852024-07-24 https://scifaro.com/en/abs/a-faster-branching-algorithm-for-the-maximum-k-defective-clique-problem-2407.165882024-07-25 https://scifaro.com/en/abs/sublinear-space-graph-algorithms-in-the-continual-release-model-2407.176192025-04-17 https://scifaro.com/en/abs/improving-online-algorithms-via-ml-predictions-2407.177122024-07-26 https://scifaro.com/en/abs/all-pairs-suffix-prefix-on-fully-dynamic-set-of-strings-2407.178142025-03-04 https://scifaro.com/en/abs/multi-view-structural-graph-summaries-2407.180362024-12-23 https://scifaro.com/en/abs/efficient-computation-of-periods-and-covers-using-sampling-2407.182162025-03-03 https://scifaro.com/en/abs/parameterized-algorithms-on-integer-sets-with-small-doubling-integer-programming-subset-sum-and-k-sum-2407.182282024-07-26 https://scifaro.com/en/abs/reconstruction-of-geometric-random-graphs-with-the-simple-algorithm-2407.185912024-07-29 https://scifaro.com/en/abs/rollercoasters-with-plateaus-2407.186202024-07-29 https://scifaro.com/en/abs/suffixient-arrays-a-new-efficient-suffix-array-compression-technique-2407.187532025-03-19 https://scifaro.com/en/abs/miov-reordering-movi-for-even-better-locality-2407.189562024-07-30 https://scifaro.com/en/abs/subsequence-matching-and-lcs-with-segment-number-constraints-2407.197962025-02-27 https://scifaro.com/en/abs/the-bidirected-cut-relaxation-for-steiner-tree-has-integrality-gap-smaller-than-2-2407.199052024-08-09 https://scifaro.com/en/abs/engineering-an-efficient-approximate-dnf-counter-2407.199462024-07-30 https://scifaro.com/en/abs/planning-for-edge-failure-in-fixed-charge-flow-networks-2407.200362024-07-30 https://scifaro.com/en/abs/fast-computation-of-permanents-over-mathbb-f-3-via-mathbb-f-2-arithmetic-2407.202052024-08-06 https://scifaro.com/en/abs/randomized-rounding-approaches-to-online-allocation-sequencing-and-matching-2407.204192024-11-21 https://scifaro.com/en/abs/greedy-conjecture-for-the-shortest-common-superstring-problem-and-its-strengthenings-2407.204222024-07-31 https://scifaro.com/en/abs/random-order-interval-selection-2407.209412025-06-03 https://scifaro.com/en/abs/settling-the-pass-complexity-of-approximate-matchings-in-dynamic-graph-streams-2407.210052024-07-31 https://scifaro.com/en/abs/an-invertible-state-space-for-process-trees-2407.214682024-08-01 https://scifaro.com/en/abs/simpler-optimal-sorting-from-a-directed-acyclic-graph-2407.215912026-02-10 https://scifaro.com/en/abs/maintaining-k-minhash-signatures-over-fully-dynamic-data-streams-with-recovery-2407.216142025-03-11 https://scifaro.com/en/abs/finding-a-shortest-m-link-path-in-a-monge-directed-acyclic-graph-2408.002272024-08-02 https://scifaro.com/en/abs/online-computation-of-string-net-frequency-2408.003082024-08-02 https://scifaro.com/en/abs/log-diameter-rounds-mst-verification-and-sensitivity-in-mpc-2408.003982024-08-02 https://scifaro.com/en/abs/infrequent-resolving-algorithm-for-online-linear-programming-2408.004652025-11-18 https://scifaro.com/en/abs/discrepancy-algorithms-for-the-binary-perceptron-2408.007962025-05-27 https://scifaro.com/en/abs/algorithms-for-minimum-membership-dominating-set-problem-2408.007972024-08-05 https://scifaro.com/en/abs/on-constrained-and-k-shortest-paths-2408.008992024-08-05 https://scifaro.com/en/abs/fully-dynamic-k-clustering-with-fast-update-time-and-small-recourse-2408.013252024-08-05 https://scifaro.com/en/abs/differentially-private-gomory-hu-trees-2408.017982024-08-06 https://scifaro.com/en/abs/first-order-stochastic-optimization-with-oblivious-noise-2408.020902024-08-06 https://scifaro.com/en/abs/improved-bounds-for-high-dimensional-equivalence-and-product-testing-using-subcube-queries-2408.023472024-08-06 https://scifaro.com/en/abs/online-deterministic-minimum-cost-bipartite-matching-with-delays-on-a-line-2408.025262024-08-06 https://scifaro.com/en/abs/faster-and-simpler-online-sliding-rightmost-lempel-ziv-factorizations-2408.030082024-08-07 https://scifaro.com/en/abs/rapid-mixing-of-the-down-up-walk-on-matchings-of-a-fixed-size-2408.034662024-08-08 https://scifaro.com/en/abs/deterministic-algorithm-and-faster-algorithm-for-submodular-maximization-subject-to-a-matroid-constraint-2408.035832025-09-18 https://scifaro.com/en/abs/longest-common-extensions-with-wildcards-trade-off-and-applications-2408.036102025-05-23 https://scifaro.com/en/abs/deterministic-online-bipartite-edge-coloring-2408.036612024-10-28 https://scifaro.com/en/abs/finding-longer-cycles-via-shortest-colourful-cycle-2408.036992024-08-15 https://scifaro.com/en/abs/lower-bounds-for-approximate-exact-k-disjoint-shortest-paths-2408.039332024-08-08 https://scifaro.com/en/abs/reducing-matroid-optimization-to-basis-search-2408.041182025-02-19 https://scifaro.com/en/abs/simple-linear-time-repetition-factorization-2408.042532024-08-09 https://scifaro.com/en/abs/approximating-delta-covering-2408.045172024-08-09 https://scifaro.com/en/abs/faster-run-length-compressed-suffix-arrays-2408.045372025-04-22 https://scifaro.com/en/abs/core-sparse-monge-matrix-multiplication-improved-algorithm-and-applications-2408.046132025-07-08 https://scifaro.com/en/abs/ssd-set-system-graph-decomposition-and-hamiltonian-cycle-2408.046152024-09-26 https://scifaro.com/en/abs/regularized-unconstrained-weakly-submodular-maximization-2408.046202024-08-20 https://scifaro.com/en/abs/a-simple-quadratic-kernel-for-token-jumping-on-surfaces-2408.047432026-02-13 https://scifaro.com/en/abs/locally-private-histograms-in-all-privacy-regimes-2408.048882024-09-05 https://scifaro.com/en/abs/on-the-number-of-non-equivalent-parameterized-squares-in-a-string-2408.049202024-08-12 https://scifaro.com/en/abs/two-edge-connectivity-via-pac-man-gluing-2408.052822025-12-10 https://scifaro.com/en/abs/competitive-capacitated-online-recoloring-2408.053702024-08-13 https://scifaro.com/en/abs/simple-and-nearly-optimal-sampling-for-rank-1-tensor-completion-via-gauss-jordan-2408.054312024-08-21 https://scifaro.com/en/abs/improved-approximation-guarantees-for-joint-replenishment-in-continuous-time-2408.054432024-08-13 https://scifaro.com/en/abs/memento-filter-a-fast-dynamic-and-robust-range-filter-2408.056252024-10-29 https://scifaro.com/en/abs/high-probability-latency-sequential-change-detection-over-an-unknown-finite-horizon-2408.058172024-09-20 https://scifaro.com/en/abs/spectral-sparsification-by-deterministic-discrepancy-walk-2408.061462024-08-13 https://scifaro.com/en/abs/batched-ranged-random-integer-generation-2408.062132025-04-08 https://scifaro.com/en/abs/sequential-non-determinism-in-tile-self-assembly-a-general-framework-and-an-application-to-efficient-temperature-1-self-assembly-of-squares-2408.062412024-08-13 https://scifaro.com/en/abs/dynamic-traffic-assignment-for-public-transport-with-vehicle-capacities-2408.063082024-08-13 https://scifaro.com/en/abs/fast-john-ellipsoid-computation-with-differential-privacy-optimization-2408.063952025-02-24 https://scifaro.com/en/abs/massively-parallel-minimum-spanning-tree-in-general-metric-spaces-2408.064552025-10-10 https://scifaro.com/en/abs/quasi-monte-carlo-beyond-hardy-krause-2408.064752024-08-14 https://scifaro.com/en/abs/path-partitions-of-phylogenetic-networks-2408.064892024-10-18 https://scifaro.com/en/abs/faster-lattice-basis-computation-via-a-natural-generalization-of-the-euclidean-algorithm-2408.066852024-11-08 https://scifaro.com/en/abs/engineering-hypergraph-b-matching-algorithms-2408.069242024-08-14 https://scifaro.com/en/abs/faster-private-minimum-spanning-trees-2408.069972024-08-14 https://scifaro.com/en/abs/a-5-4-approximation-for-two-edge-connectivity-2408.070192025-03-31 https://scifaro.com/en/abs/on-the-accurate-computation-of-expected-modularity-in-probabilistic-networks-2408.071612025-04-23 https://scifaro.com/en/abs/prophet-inequalities-competing-with-the-top-ell-items-is-easy-2408.076162025-01-13 https://scifaro.com/en/abs/learning-augmented-competitive-algorithms-for-spatiotemporal-online-allocation-with-deadline-constraints-2408.078312025-03-14 https://scifaro.com/en/abs/coupling-without-communication-and-drafter-invariant-speculative-decoding-2408.079782025-08-21 https://scifaro.com/en/abs/evolving-a-to-efficiently-solve-the-k-shortest-path-problem-extended-version-2408.082272024-08-16 https://scifaro.com/en/abs/palette-sparsification-for-graphs-with-sparse-neighborhoods-2408.082562024-11-05 https://scifaro.com/en/abs/kernelization-for-orthogonality-dimension-2408.083802024-08-19 https://scifaro.com/en/abs/improved-approximation-algorithms-for-index-coding-2408.083822024-08-19 https://scifaro.com/en/abs/algebraic-vertex-ordering-of-a-sparse-graph-for-adjacency-access-locality-and-graph-compression-2408.084392024-10-01 https://scifaro.com/en/abs/accelerating-spectral-clustering-on-quantum-and-analog-platforms-2408.084862025-03-05 https://scifaro.com/en/abs/optimal-sketching-for-residual-error-estimation-for-matrix-and-vector-norms-2408.084942024-08-19 https://scifaro.com/en/abs/more-basis-reduction-for-linear-codes-backward-reduction-bkz-slide-reduction-and-more-2408.085072024-08-19 https://scifaro.com/en/abs/a-tight-3-2-varepsilon-approximation-algorithm-for-demand-strip-packing-2408.086272024-08-19 https://scifaro.com/en/abs/online-matching-with-delays-and-size-based-costs-2408.086582024-08-19 https://scifaro.com/en/abs/quantum-algorithm-for-jaccard-similarity-2408.089402024-08-20 https://scifaro.com/en/abs/unbreakable-decomposition-in-close-to-linear-time-2408.093682024-08-20 https://scifaro.com/en/abs/parallel-sampling-via-counting-2408.094422024-08-20 https://scifaro.com/en/abs/efficient-online-sensitivity-analysis-for-the-injective-bottleneck-path-problem-2408.094432024-10-02 https://scifaro.com/en/abs/pre-assignment-problem-for-unique-minimum-vertex-cover-on-bounded-clique-width-graphs-2408.095912024-08-23 https://scifaro.com/en/abs/work-efficient-parallel-counting-via-sampling-2408.097192026-04-07 https://scifaro.com/en/abs/improved-distance-sensitivity-oracles-with-subquadratic-space-2408.100142024-08-21 https://scifaro.com/en/abs/eulerian-graph-sparsification-by-effective-resistance-decomposition-2408.101722024-08-20 https://scifaro.com/en/abs/spectral-guarantees-for-adversarial-streaming-pca-2408.103322024-08-21 https://scifaro.com/en/abs/on-the-advice-complexity-of-online-matching-on-the-line-2408.111612024-12-11 https://scifaro.com/en/abs/approximately-covering-vertices-by-order-5-or-longer-paths-2408.112252024-08-22 https://scifaro.com/en/abs/a-simple-dynamic-spanner-via-apsp-2408.113682024-08-22 https://scifaro.com/en/abs/bootstrapping-dynamic-apsp-via-sparsification-2408.113752024-08-22 https://scifaro.com/en/abs/scenario-based-robust-optimization-of-tree-structures-2408.114222024-08-22 https://scifaro.com/en/abs/private-counting-of-distinct-elements-in-the-turnstile-model-and-extensions-2408.116372024-08-22 https://scifaro.com/en/abs/a-tighter-complexity-analysis-of-sparsegpt-2408.121512024-10-21 https://scifaro.com/en/abs/sharper-bounds-for-chebyshev-moment-matching-with-applications-2408.123852026-05-20 https://scifaro.com/en/abs/stochastic-online-correlated-selection-2408.125242024-08-23 https://scifaro.com/en/abs/single-machine-scheduling-to-minimize-the-number-of-tardy-jobs-with-release-dates-2408.129672024-08-26 https://scifaro.com/en/abs/the-adaptive-complexity-of-parallelized-log-concave-sampling-2408.130452025-05-21 https://scifaro.com/en/abs/the-power-of-migrations-in-dynamic-bin-packing-2408.131782024-08-26 https://scifaro.com/en/abs/parallel-set-cover-and-hypergraph-matching-via-uniform-random-sampling-2408.133622024-10-18 https://scifaro.com/en/abs/the-parameterized-complexity-landscape-of-two-sets-cut-uncut-2408.135432024-08-27 https://scifaro.com/en/abs/revisit-the-partial-coloring-method-prefix-spencer-and-sampling-2408.137562024-08-27 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-eulerian-strong-component-arc-deletion-2408.138192025-07-04 https://scifaro.com/en/abs/quantum-speedups-for-approximating-the-john-ellipsoid-2408.140182024-08-27 https://scifaro.com/en/abs/an-efficient-and-exact-algorithm-for-locally-h-clique-densest-subgraph-discovery-2408.140222024-08-27 https://scifaro.com/en/abs/multi-variable-quantification-of-bdds-in-external-memory-using-nested-sweeping-extended-paper-2408.142162026-03-25 https://scifaro.com/en/abs/the-power-of-proportional-fairness-for-non-clairvoyant-scheduling-under-polyhedral-constraints-2408.143102024-11-19 https://scifaro.com/en/abs/fully-dynamic-shortest-paths-in-sparse-digraphs-2408.144062024-08-27 https://scifaro.com/en/abs/dynamic-locality-sensitive-orderings-in-doubling-metrics-2408.146172025-03-31 https://scifaro.com/en/abs/channel-allocation-revisited-through-1-extendability-of-graphs-2408.146332024-08-28 https://scifaro.com/en/abs/new-weighted-additive-spanners-2408.146382024-08-28 https://scifaro.com/en/abs/on-controlling-knockout-tournaments-without-perfect-information-2408.150682024-09-02 https://scifaro.com/en/abs/faster-cycle-detection-in-the-congested-clique-2408.151322024-08-28 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-computing-good-edge-labelings-2408.151812026-03-24 https://scifaro.com/en/abs/weighted-matching-in-the-random-order-streaming-and-robust-communication-models-2408.154342024-08-29 https://scifaro.com/en/abs/when-to-give-up-on-a-parallel-implementation-2408.160922024-08-30 https://scifaro.com/en/abs/improving-lagarias-odlyzko-algorithm-for-average-case-subset-sum-modular-arithmetic-approach-2408.161082024-08-30 https://scifaro.com/en/abs/online-probabilistic-metric-embedding-a-general-framework-for-bypassing-inherent-bounds-2408.162982024-09-02 https://scifaro.com/en/abs/approximation-algorithms-for-correlated-knapsack-orienteering-2408.165662024-12-02 https://scifaro.com/en/abs/fast-and-simple-1-epsilon-delta-edge-coloring-of-dense-graphs-2408.166922025-02-14 https://scifaro.com/en/abs/e-graphs-as-circuits-and-optimal-extraction-via-treewidth-2408.170422024-11-15 https://scifaro.com/en/abs/unfairly-splitting-separable-necklaces-2408.171262024-09-02 https://scifaro.com/en/abs/upward-pointset-embeddings-of-planar-st-graphs-2408.173692025-01-06 https://scifaro.com/en/abs/preprocessing-to-reduce-the-search-space-for-odd-cycle-transversal-2409.002452024-10-08 https://scifaro.com/en/abs/survey-of-results-on-the-modpath-and-modcycle-problems-2409.007702024-09-04 https://scifaro.com/en/abs/scalable-neighborhood-local-search-for-single-machine-scheduling-with-family-setup-times-2409.007712025-03-25 https://scifaro.com/en/abs/exposort-breaking-the-quasi-polynomial-time-barrier-for-reluctant-sorting-2409.007942024-09-05 https://scifaro.com/en/abs/fitting-trees-to-ell-1-hyperbolic-distances-2409.010102024-09-04 https://scifaro.com/en/abs/differentially-private-kernel-density-estimation-2409.016882025-03-25 https://scifaro.com/en/abs/accelerating-graph-neural-networks-with-a-novel-matrix-compression-format-2409.022082024-09-05 https://scifaro.com/en/abs/hadamard-row-wise-generation-algorithm-2409.024062024-09-05 https://scifaro.com/en/abs/an-effective-tag-assignment-approach-for-billboard-advertisement-2409.024552024-09-05 https://scifaro.com/en/abs/v-words-lyndon-words-and-galois-words-2409.027572024-09-05 https://scifaro.com/en/abs/key-compression-limits-for-k-minimum-value-sketches-2409.028522024-09-05 https://scifaro.com/en/abs/revisiting-ilp-models-for-exact-crossing-minimization-in-storyline-drawings-2409.028582024-09-05 https://scifaro.com/en/abs/a-note-on-deterministic-submodular-maximization-with-bounded-curvature-2409.029432024-09-06 https://scifaro.com/en/abs/online-scheduling-via-gradient-descent-for-weighted-flow-time-minimization-2409.030202024-09-06 https://scifaro.com/en/abs/minimizing-cost-rather-than-maximizing-reward-in-restless-multi-armed-bandits-2409.030712024-09-06 https://scifaro.com/en/abs/does-subset-sum-admit-short-proofs-2409.035262024-09-06 https://scifaro.com/en/abs/constant-approximating-disjoint-paths-on-acyclic-digraphs-is-w-1-hard-2409.035962024-09-06 https://scifaro.com/en/abs/fine-grained-equivalence-for-problems-related-to-integer-linear-programming-2409.036752024-09-06 https://scifaro.com/en/abs/space-efficient-algorithm-for-integer-programming-with-few-constraints-2409.036812024-09-06 https://scifaro.com/en/abs/constant-congestion-linkages-in-polynomially-strong-digraphs-in-polynomial-time-2409.038732024-11-05 https://scifaro.com/en/abs/random-local-access-for-sampling-k-sat-solutions-2409.039512025-08-11 https://scifaro.com/en/abs/rcm-reverse-cuthill-mckee-ordering-with-bi-criteria-node-finder-2409.041712024-09-20 https://scifaro.com/en/abs/new-algorithm-for-combinatorial-n-folds-and-applications-2409.042122025-10-13 https://scifaro.com/en/abs/fpt-algorithms-using-minimal-parameters-for-a-generalized-version-of-maximin-shares-2409.042252024-09-09 https://scifaro.com/en/abs/faster-sampling-from-log-concave-densities-over-polytopes-via-efficient-linear-solvers-2409.043202024-09-09 https://scifaro.com/en/abs/matwa-a-web-toolkit-for-matching-under-preferences-2409.044022024-09-09 https://scifaro.com/en/abs/subexponential-parameterized-algorithms-for-hitting-subgraphs-2409.047862025-02-19 https://scifaro.com/en/abs/centralized-selection-with-preferences-in-the-presence-of-biases-2409.048972024-09-10 https://scifaro.com/en/abs/fpt-approximations-for-capacitated-sum-of-radii-and-diameters-2409.049842025-09-09 https://scifaro.com/en/abs/diffusion-map-autoencoder-2409.059012025-10-31 https://scifaro.com/en/abs/robust-max-selection-2409.060142024-09-11 https://scifaro.com/en/abs/exploring-monotone-priority-queues-for-dijkstra-optimization-2409.060612024-10-17 https://scifaro.com/en/abs/structured-downsampling-for-fast-memory-efficient-curation-of-online-data-streams-2409.061992024-09-24 https://scifaro.com/en/abs/learning-multiple-secrets-in-mastermind-2409.064532024-09-11 https://scifaro.com/en/abs/differentially-private-high-dimensional-approximate-range-counting-revisited-2409.071872025-05-05 https://scifaro.com/en/abs/dual-step-optimization-for-binary-sequences-with-high-merit-factors-2409.072222025-05-27 https://scifaro.com/en/abs/deterministic-approximation-for-the-volume-of-the-truncated-fractional-matching-polytope-2409.072832024-09-12 https://scifaro.com/en/abs/maximum-and-vs-even-sat-2409.078372026-03-02 https://scifaro.com/en/abs/computing-the-lz-end-parsing-easy-to-implement-and-practically-efficient-2409.078402024-09-18 https://scifaro.com/en/abs/an-optimal-algorithm-for-sorting-pattern-avoiding-sequences-2409.078682024-09-13 https://scifaro.com/en/abs/fine-grained-complexity-of-multiple-domination-and-dominating-patterns-in-sparse-graphs-2409.080372024-09-13 https://scifaro.com/en/abs/an-efficient-heuristic-for-approximate-maximum-flow-computations-2409.083502024-09-16 https://scifaro.com/en/abs/a-simple-4-approximation-algorithm-for-maximum-agreement-forests-on-multiple-unrooted-binary-trees-2409.084402024-09-16 https://scifaro.com/en/abs/vertex-identification-to-a-forest-2409.088832024-09-16 https://scifaro.com/en/abs/revisiting-local-pagerank-estimation-on-undirected-graphs-simple-and-optimal-2409.089782024-09-16 https://scifaro.com/en/abs/multi-slot-tag-assignment-problem-in-billboard-advertisement-2409.096232024-09-17 https://scifaro.com/en/abs/entrywise-approximate-laplacian-solving-2409.100222024-09-17 https://scifaro.com/en/abs/efficient-approximation-schemes-for-scheduling-on-a-stochastic-number-of-machines-2409.101552024-09-17 https://scifaro.com/en/abs/pareto-sums-of-pareto-sets-lower-bounds-and-algorithms-2409.102322024-09-17 https://scifaro.com/en/abs/a-tie-breaking-based-local-search-algorithm-for-stable-matching-problems-2409.105752025-08-26 https://scifaro.com/en/abs/clustering-with-non-adaptive-subset-queries-2409.109082025-04-16 https://scifaro.com/en/abs/selective-algorithm-processing-of-subset-sum-distributions-2409.110762024-09-18 https://scifaro.com/en/abs/tight-bounds-for-classical-open-addressing-2409.112802024-09-18 https://scifaro.com/en/abs/learning-augmented-frequency-estimation-in-sliding-windows-2409.115162024-09-19 https://scifaro.com/en/abs/reconfiguration-of-labeled-matchings-in-triangular-grid-graphs-2409.117232024-09-19 https://scifaro.com/en/abs/on-the-complexity-of-the-upgrading-version-of-the-maximal-covering-location-problem-2409.119002024-09-19 https://scifaro.com/en/abs/optimal-offline-oram-with-perfect-security-via-simple-oblivious-priority-queues-2409.120212024-12-16 https://scifaro.com/en/abs/lempel-ziv-lz77-factorization-in-sublinear-time-2409.121462025-06-19 https://scifaro.com/en/abs/generalized-compression-and-compressive-search-of-large-datasets-2409.121612024-12-04 https://scifaro.com/en/abs/canonical-forms-for-matrix-tuples-in-polynomial-time-2409.124572024-09-20 https://scifaro.com/en/abs/mimicking-networks-for-constrained-multicuts-in-hypergraphs-2409.125482024-09-23 https://scifaro.com/en/abs/comparing-the-hardness-of-online-minimization-and-maximization-problems-with-predictions-2409.126942026-02-24 https://scifaro.com/en/abs/learning-partitions-using-rank-queries-2409.130922024-09-23 https://scifaro.com/en/abs/obstacle-free-path-planning-for-autonomous-drones-using-floyd-algorithm-2409.131492024-12-30 https://scifaro.com/en/abs/evaluating-optimal-safe-flows-decomposition-for-rna-assembly-2409.132792024-09-23 https://scifaro.com/en/abs/dynamic-parameterized-problems-on-unit-disk-graphs-2409.134032024-09-23 https://scifaro.com/en/abs/a-polynomial-kernel-for-deletion-to-the-scattered-class-of-cliques-and-trees-2409.142092026-05-20 https://scifaro.com/en/abs/extending-the-extension-deterministic-algorithm-for-non-monotone-submodular-maximization-2409.143252024-09-24 https://scifaro.com/en/abs/a-high-performance-external-validity-index-for-clustering-with-a-large-number-of-clusters-2409.144552024-09-24 https://scifaro.com/en/abs/computing-string-covers-in-sublinear-time-2409.145592024-09-24 https://scifaro.com/en/abs/substring-compression-variations-and-lz78-derivates-2409.146492024-09-24 https://scifaro.com/en/abs/fast-and-small-subsampled-r-indexes-2409.146542024-09-24 https://scifaro.com/en/abs/gabow-s-cardinality-matching-algorithm-in-general-graphs-implementation-and-experiments-2409.148492024-09-24 https://scifaro.com/en/abs/bounded-indegree-k-forests-problem-and-a-faster-algorithm-for-directed-graph-augmentation-2409.148812025-10-16 https://scifaro.com/en/abs/reducing-concept-lattices-by-means-of-a-weaker-notion-of-congruence-2409.149152024-09-25 https://scifaro.com/en/abs/impact-of-local-congruences-in-variable-selection-from-datasets-2409.149312024-09-25 https://scifaro.com/en/abs/dynamic-pricing-algorithms-for-online-set-cover-2409.150942024-09-24 https://scifaro.com/en/abs/fast-and-accurate-triangle-counting-in-graph-streams-using-predictions-2409.152052024-09-24 https://scifaro.com/en/abs/a-near-optimal-low-energy-deterministic-distributed-sssp-with-ramifications-on-congestion-and-apsp-2409.154702024-09-25 https://scifaro.com/en/abs/parallel-dynamic-maximal-matching-2409.154762024-09-25 https://scifaro.com/en/abs/stochastic-minimum-spanning-trees-with-a-single-sample-2409.161192024-09-25 https://scifaro.com/en/abs/a-strong-separation-for-adversarially-robust-ell-0-estimation-for-linear-sketches-2409.161532024-09-25 https://scifaro.com/en/abs/a-simple-distributed-algorithm-for-sparse-fractional-covering-and-packing-problems-2409.161682024-09-25 https://scifaro.com/en/abs/extending-stable-and-popular-matching-algorithms-from-bipartite-to-arbitrary-instances-2409.161732025-10-07 https://scifaro.com/en/abs/on-the-tractability-and-approximability-of-non-submodular-cardinality-based-s-t-cut-problems-in-hypergraphs-2409.161952024-09-25 https://scifaro.com/en/abs/succinct-data-structures-for-baxter-permutation-and-related-families-2409.166502024-09-26 https://scifaro.com/en/abs/kernelization-complexity-of-solution-discovery-problems-2409.172502024-09-27 https://scifaro.com/en/abs/fully-dynamic-graph-algorithms-with-edge-differential-privacy-2409.176232025-05-16 https://scifaro.com/en/abs/optimal-sensitivity-oracle-for-steiner-mincut-2409.177152024-09-27 https://scifaro.com/en/abs/optimal-dynamic-parameterized-subset-sampling-2409.180362024-09-27 https://scifaro.com/en/abs/revisiting-weighted-information-extraction-a-simpler-and-faster-algorithm-for-ranked-enumeration-2409.185632024-10-08 https://scifaro.com/en/abs/toward-greener-matrix-operations-by-lossless-compressed-formats-2409.186202024-09-30 https://scifaro.com/en/abs/split-or-decompose-improved-fpt-branching-algorithms-for-maximum-agreement-forests-2409.186342026-03-24 https://scifaro.com/en/abs/temporal-queries-for-dynamic-temporal-forests-2409.187502024-09-30 https://scifaro.com/en/abs/an-11-6-approximation-algorithm-for-vertex-cover-on-string-graphs-2409.188202024-09-30 https://scifaro.com/en/abs/fast-approximate-counting-of-cycles-2409.192922024-10-01 https://scifaro.com/en/abs/exact-algorithms-for-clustered-planarity-with-linear-saturators-2409.194102024-10-01 https://scifaro.com/en/abs/online-and-offline-algorithms-for-counting-distinct-closed-factors-via-sliding-suffix-trees-2409.195762024-10-01 https://scifaro.com/en/abs/the-problem-of-computing-a-2-t-connected-spanning-subgraph-with-minimum-number-of-edges-in-directed-graphs-2409.197732024-10-01 https://scifaro.com/en/abs/acceleration-meets-inverse-maintenance-faster-ell-infty-regression-2409.200302025-04-29 https://scifaro.com/en/abs/simple-realizability-of-abstract-topological-graphs-2409.201082025-03-17 https://scifaro.com/en/abs/sliding-block-slick-hashing-an-implementation-benchmarks-2409.201252024-10-01 https://scifaro.com/en/abs/rsvp-beyond-weisfeiler-lehman-graph-isomorphism-test-2409.201572024-10-01 https://scifaro.com/en/abs/efficient-approximation-of-fractional-hypertree-width-2409.201722024-10-01 https://scifaro.com/en/abs/graph-matching-based-on-similarities-in-structure-and-attributes-2409.202122024-10-01 https://scifaro.com/en/abs/width-parameters-for-minimum-flow-decomposition-2409.202782025-12-01 https://scifaro.com/en/abs/faster-algorithms-for-packing-forests-in-graphs-and-related-problems-2409.203142026-01-26 https://scifaro.com/en/abs/twinarray-sort-an-ultrarapid-conditional-non-comparison-based-sorting-algorithm-2409.203622024-10-01 https://scifaro.com/en/abs/the-secretary-problem-with-predicted-additive-gap-2409.204602024-10-01 https://scifaro.com/en/abs/closed-repeats-2410.002092024-10-02 https://scifaro.com/en/abs/approximation-of-spanning-tree-congestion-using-hereditary-bisection-2410.005682026-05-05 https://scifaro.com/en/abs/fpt-approximations-for-fair-k-min-sum-radii-2410.005982024-10-02 https://scifaro.com/en/abs/the-telephone-k-multicast-problem-2410.010482026-05-01 https://scifaro.com/en/abs/expected-maximin-fairness-in-max-cut-and-other-combinatorial-optimization-problems-2410.025892024-10-04 https://scifaro.com/en/abs/can-you-link-up-with-treewidth-2410.026062025-05-19 https://scifaro.com/en/abs/when-is-local-search-both-effective-and-efficient-2410.026342026-01-13 https://scifaro.com/en/abs/small-space-encoding-and-recognition-of-k-palindromic-prefixes-2410.033092025-04-18 https://scifaro.com/en/abs/subexponential-algorithms-for-clique-cover-on-unit-disk-and-unit-ball-graphs-2410.036092024-10-07 https://scifaro.com/en/abs/pseudo-deterministic-construction-of-irreducible-polynomials-over-finite-fields-2410.040712024-10-08 https://scifaro.com/en/abs/a-branch-price-approach-to-the-unrooted-maximum-agreement-forest-problem-2410.041222024-10-08 https://scifaro.com/en/abs/vizing-s-theorem-in-near-linear-time-2410.052402025-10-15 https://scifaro.com/en/abs/log-concave-sampling-from-a-convex-body-with-a-barrier-a-robust-and-unified-dikin-walk-2410.057002024-11-14 https://scifaro.com/en/abs/faster-algorithms-for-graph-monopolarity-2410.063372025-07-08 https://scifaro.com/en/abs/losing-treewidth-in-the-presence-of-weights-2410.063432024-10-10 https://scifaro.com/en/abs/a-decomposition-approach-to-the-weighted-k-server-problem-2410.064852024-10-10 https://scifaro.com/en/abs/a-short-note-about-the-learning-augmented-secretary-problem-2410.065832024-11-05 https://scifaro.com/en/abs/an-optimal-algorithm-for-the-stacker-crane-problem-on-fixed-topologies-2410.067642025-09-18 https://scifaro.com/en/abs/a-polynomial-time-algorithm-for-steiner-tree-when-terminals-avoid-a-k-4-minor-2410.067932024-10-10 https://scifaro.com/en/abs/near-optimal-time-quantum-algorithms-for-approximate-pattern-matching-2410.068082024-10-10 https://scifaro.com/en/abs/faster-and-simpler-online-computation-of-string-net-frequency-2410.068372026-01-01 https://scifaro.com/en/abs/online-matching-meets-sampling-without-replacement-2410.068682024-10-10 https://scifaro.com/en/abs/packed-acyclic-deterministic-finite-automata-2410.076022024-10-11 https://scifaro.com/en/abs/partitioning-trillion-edge-graphs-on-edge-devices-2410.077322024-10-11 https://scifaro.com/en/abs/parks-and-recreation-color-fault-tolerant-spanners-made-local-2410.078442024-10-11 https://scifaro.com/en/abs/simple-length-constrained-minimum-spanning-trees-2410.081702025-06-17 https://scifaro.com/en/abs/parameterized-spanning-tree-congestion-2410.083142026-05-28 https://scifaro.com/en/abs/subgraph-counting-in-subquadratic-time-for-bounded-degeneracy-graphs-2410.083762025-03-05 https://scifaro.com/en/abs/a-simple-yet-exact-analysis-of-the-multiqueue-2410.087142025-02-20 https://scifaro.com/en/abs/grandchildren-weight-balanced-binary-search-trees-2410.088252025-07-08 https://scifaro.com/en/abs/rapid-exploration-of-assembly-chemical-space-of-molecular-graphs-2410.091002025-08-19 https://scifaro.com/en/abs/simultaneously-approximating-all-norms-for-massively-parallel-correlation-clustering-2410.093212024-10-23 https://scifaro.com/en/abs/computational-complexity-of-the-recoverable-robust-shortest-path-problem-in-acyclic-digraphs-2410.094252025-06-06 https://scifaro.com/en/abs/greediness-is-not-always-a-vice-efficient-discovery-algorithms-for-assignment-problems-2410.094342024-10-15 https://scifaro.com/en/abs/many-flavors-of-edit-distance-2410.098772024-10-15 https://scifaro.com/en/abs/towards-a-parameterized-approximation-dichotomy-of-mincsp-for-linear-equations-over-finite-commutative-rings-2410.099322024-11-20 https://scifaro.com/en/abs/a-fully-dynamic-approximation-algorithm-for-maximum-weight-b-matchings-in-graphs-2410.099652024-10-15 https://scifaro.com/en/abs/asymptotically-optimal-representation-of-palindromic-structure-2410.099842025-12-01 https://scifaro.com/en/abs/tight-bounds-and-phase-transitions-for-incremental-and-dynamic-retrieval-2410.100022024-10-25 https://scifaro.com/en/abs/swift-high-performance-sparse-tensor-contraction-for-scientific-applications-2410.100942024-10-15 https://scifaro.com/en/abs/differentially-private-selection-using-smooth-sensitivity-2410.101872024-10-15 https://scifaro.com/en/abs/quasilinear-time-eccentricities-computation-and-more-on-median-graphs-2410.102352024-10-15 https://scifaro.com/en/abs/routing-on-sparse-graphs-with-non-metric-costs-for-the-prize-collecting-travelling-salesperson-problem-2410.104402024-10-15 https://scifaro.com/en/abs/from-donkeys-to-kings-in-tournaments-2410.104752024-10-15 https://scifaro.com/en/abs/from-chinese-postman-to-salesman-and-beyond-i-approximating-shortest-tours-delta-covering-all-points-on-all-edges-2410.106132025-02-25 https://scifaro.com/en/abs/experimental-design-using-interlacing-polynomials-2410.113902024-10-16 https://scifaro.com/en/abs/almost-optimal-fully-dynamic-k-center-clustering-with-recourse-2410.114702025-06-03 https://scifaro.com/en/abs/hyperbolic-random-graphs-clique-number-and-degeneracy-with-implications-for-colouring-2410.115492025-02-14 https://scifaro.com/en/abs/the-quasi-probability-method-and-applications-for-trace-reconstruction-2410.119802024-10-17 https://scifaro.com/en/abs/subquadratic-algorithms-in-minor-free-digraphs-weighted-distance-oracles-decremental-reachability-and-more-2410.120032024-10-17 https://scifaro.com/en/abs/ranking-with-multiple-objectives-2410.121392024-10-17 https://scifaro.com/en/abs/orienteering-with-time-windows-on-restricted-graph-classes-2410.124012024-10-17 https://scifaro.com/en/abs/even-faster-delta-1-edge-coloring-via-shorter-multi-step-vizing-chains-2410.124792024-10-17 https://scifaro.com/en/abs/quasi-linear-distance-query-reconstruction-for-graphs-of-bounded-treelength-2410.125942024-10-17 https://scifaro.com/en/abs/improved-kernelization-and-fixed-parameter-algorithms-for-bicluster-editing-2410.131232024-10-24 https://scifaro.com/en/abs/fast-construction-of-partitioned-learned-bloom-filter-with-theoretical-guarantees-2410.132782024-10-18 https://scifaro.com/en/abs/graph-exploration-the-impact-of-a-distance-constraint-2410.133862024-10-18 https://scifaro.com/en/abs/parallel-and-distributed-expander-decomposition-simple-fast-and-near-optimal-2410.134512025-01-07 https://scifaro.com/en/abs/forward-feasibility-oriented-random-walk-inspired-algorithm-for-radial-reconfiguration-in-distribution-networks-2410.140802024-10-21 https://scifaro.com/en/abs/bidirectional-dijkstra-s-algorithm-is-instance-optimal-2410.146382025-06-16 https://scifaro.com/en/abs/instance-optimality-in-i-o-efficient-sampling-and-sequential-estimation-2410.146432024-10-21 https://scifaro.com/en/abs/packing-inspired-algorithms-for-periodic-scheduling-problems-with-harmonic-periods-2410.147562025-03-04 https://scifaro.com/en/abs/efficient-matroid-intersection-via-a-batch-update-auction-algorithm-2410.149012024-10-22 https://scifaro.com/en/abs/the-constrained-layer-tree-problem-and-applications-to-solar-farm-cabling-2410.150312024-10-22 https://scifaro.com/en/abs/a-simplified-parameterized-algorithm-for-directed-feedback-vertex-set-2410.154112024-10-22 https://scifaro.com/en/abs/timetable-nodes-for-public-transport-network-2410.157152024-10-24 https://scifaro.com/en/abs/a-simpler-approach-for-monotone-parametric-minimum-cut-finding-the-breakpoints-in-order-2410.159202024-10-22 https://scifaro.com/en/abs/relating-left-and-right-extensions-of-maximal-repeats-2410.159582024-10-22 https://scifaro.com/en/abs/streaming-and-communication-complexity-of-load-balancing-via-matching-contractors-2410.160942024-10-22 https://scifaro.com/en/abs/3sum-in-preprocessed-universes-faster-and-simpler-2410.167842025-10-22 https://scifaro.com/en/abs/the-parameterized-complexity-landscape-of-the-unsplittable-flow-problem-2410.169642024-10-23 https://scifaro.com/en/abs/faster-approximation-algorithms-for-restricted-shortest-paths-in-directed-graphs-2410.171792024-10-23 https://scifaro.com/en/abs/parallel-cluster-bfs-and-applications-to-shortest-paths-2410.172262024-10-29 https://scifaro.com/en/abs/optimal-robust-estimation-under-local-and-global-corruptions-stronger-adversary-and-smaller-error-2410.172302024-10-23 https://scifaro.com/en/abs/a-polylogarithmic-approximation-for-directed-steiner-forest-in-planar-digraphs-2410.174032024-10-24 https://scifaro.com/en/abs/a-unified-construction-of-streaming-sketches-via-the-l-evy-khintchine-representation-theorem-2410.174262026-04-07 https://scifaro.com/en/abs/validating-a-ptas-for-triangle-free-2-matching-via-a-simple-decomposition-theorem-2410.175082024-10-24 https://scifaro.com/en/abs/collision-free-exploration-by-mobile-agents-using-pebbles-2410.175422024-10-24 https://scifaro.com/en/abs/fixed-parameter-tractability-of-hedge-cut-2410.176412024-10-24 https://scifaro.com/en/abs/tight-bounds-for-online-balanced-partitioning-in-the-generalized-learning-model-2410.177772024-10-24 https://scifaro.com/en/abs/theoretically-grounded-pruning-of-large-ground-sets-for-constrained-discrete-optimization-2410.179452024-10-24 https://scifaro.com/en/abs/putting-off-the-catching-up-online-joint-replenishment-problem-with-holding-and-backlog-costs-2410.185352024-10-25 https://scifaro.com/en/abs/stronger-adversaries-grow-cheaper-forests-online-node-weighted-steiner-problems-2410.185422024-10-29 https://scifaro.com/en/abs/counting-locally-optimal-tours-in-the-tsp-2410.186502024-10-25 https://scifaro.com/en/abs/recognizing-sumsets-is-np-complete-2410.186612024-10-29 https://scifaro.com/en/abs/deterministic-edge-connectivity-and-max-flow-using-subquadratic-cut-queries-2410.187042024-10-25 https://scifaro.com/en/abs/deterministic-2-3-varepsilon-approximation-of-matroid-intersection-using-nearly-linear-independence-oracle-queries-2410.188202025-04-22 https://scifaro.com/en/abs/packing-short-cycles-2410.188782024-10-28 https://scifaro.com/en/abs/connectivity-labeling-schemes-for-edge-and-vertex-faults-via-expander-hierarchies-2410.188852024-10-25 https://scifaro.com/en/abs/testing-support-size-more-efficiently-than-learning-histograms-2410.189152026-05-27 https://scifaro.com/en/abs/matching-composition-and-efficient-weight-reduction-in-dynamic-matching-2410.189362024-10-25 https://scifaro.com/en/abs/on-generating-k-factorable-graphic-sequences-with-connected-resp-no-connected-k-factors-2410.189992024-10-28 https://scifaro.com/en/abs/min-csps-on-complete-instances-2410.190662024-10-28 https://scifaro.com/en/abs/tera-scale-multilevel-graph-partitioning-2410.191192024-10-28 https://scifaro.com/en/abs/overcoming-non-submodularity-towards-constant-approximation-for-network-immunization-2410.192052026-02-19 https://scifaro.com/en/abs/paths-and-intersections-characterization-of-quasi-metrics-in-directed-okamura-seymour-instances-2410.192462024-10-28 https://scifaro.com/en/abs/near-optimal-deterministic-network-decomposition-and-ruling-set-and-improved-mis-2410.195162024-10-28 https://scifaro.com/en/abs/dynamic-o-arboricity-coloring-in-polylogarithmic-worst-case-time-2410.195362024-10-28 https://scifaro.com/en/abs/improved-hardness-of-approximation-for-token-swapping-2410.196382024-10-28 https://scifaro.com/en/abs/low-degree-spanning-trees-of-2-edge-connected-graphs-in-linear-time-2410.201372024-10-29 https://scifaro.com/en/abs/on-the-i-o-complexity-of-the-cyk-algorithm-and-of-a-family-of-related-dp-algorithms-2410.203372024-10-29 https://scifaro.com/en/abs/improved-online-reachability-preservers-2410.204712024-10-29 https://scifaro.com/en/abs/on-sparsest-cut-and-conductance-in-directed-polymatroidal-networks-2410.205252024-10-29 https://scifaro.com/en/abs/a-new-method-for-inserting-train-paths-into-a-timetable-2410.205612024-10-29 https://scifaro.com/en/abs/new-applications-of-3sum-counting-in-fine-grained-complexity-and-pattern-matching-2410.207642024-10-29 https://scifaro.com/en/abs/parameterized-approximation-for-capacitated-d-hitting-set-with-hard-capacities-2410.209002024-10-29 https://scifaro.com/en/abs/popping-bubbles-in-pangenome-graphs-2410.209322024-10-29 https://scifaro.com/en/abs/a-simple-parallel-algorithm-with-near-linear-work-for-negative-weight-single-source-shortest-paths-2410.209592024-10-29 https://scifaro.com/en/abs/matrix-by-matrix-multiplication-algorithm-with-o-n-2log-2n-computational-complexity-for-variable-precision-arithmetic-2410.210502025-08-19 https://scifaro.com/en/abs/sos-certifiability-of-subgaussian-distributions-and-its-algorithmic-applications-2410.211942024-10-29 https://scifaro.com/en/abs/deterministic-complexity-analysis-of-hermitian-eigenproblems-2410.215502025-04-29 https://scifaro.com/en/abs/maximum-partial-list-h-coloring-on-p-5-free-graphs-in-polynomial-time-2410.215692026-03-06 https://scifaro.com/en/abs/improved-spectral-density-estimation-via-explicit-and-implicit-deflation-2410.216902024-12-05 https://scifaro.com/en/abs/edge-arrival-online-matching-the-power-of-free-disposal-on-acyclic-graphs-2410.217272024-10-30 https://scifaro.com/en/abs/beating-bellman-s-algorithm-for-subset-sum-2410.219422024-10-30 https://scifaro.com/en/abs/sumsets-3sum-subset-sum-now-for-real-2410.219532024-10-30 https://scifaro.com/en/abs/ideal-membership-problem-for-boolean-minority-and-dual-discriminator-2410.221022024-10-30 https://scifaro.com/en/abs/faster-two-dimensional-pattern-matching-with-k-mismatches-2410.221092024-10-30 https://scifaro.com/en/abs/testing-identity-of-distributions-under-kolmogorov-distance-in-polylogarithmic-space-2410.221232024-10-30 https://scifaro.com/en/abs/i-o-complexity-and-pebble-games-with-partial-computations-2410.222372026-03-10 https://scifaro.com/en/abs/approximately-counting-knapsack-solutions-in-subquadratic-time-2410.222672024-10-30 https://scifaro.com/en/abs/faster-algorithms-for-average-case-orthogonal-vectors-and-closest-pair-problems-2410.224772024-10-31 https://scifaro.com/en/abs/uniform-sampling-of-negative-edge-weights-in-shortest-path-networks-2410.227172024-10-31 https://scifaro.com/en/abs/sampling-and-counting-triangle-free-graphs-near-the-critical-density-2410.229512024-10-31 https://scifaro.com/en/abs/dynamic-matching-with-post-allocation-service-and-its-application-to-refugee-resettlement-2410.229922025-07-03 https://scifaro.com/en/abs/the-days-on-days-off-scheduling-problem-2410.230562025-09-03 https://scifaro.com/en/abs/statistical-computational-trade-offs-for-density-estimation-2410.230872024-10-31 https://scifaro.com/en/abs/deterministic-counting-from-coupling-independence-2410.232252025-04-08 https://scifaro.com/en/abs/breaking-the-bellman-ford-shortest-path-bound-2410.233832024-11-01 https://scifaro.com/en/abs/all-hops-shortest-paths-2410.236172024-11-01 https://scifaro.com/en/abs/lightweight-near-additive-spanners-2410.238262024-11-01 https://scifaro.com/en/abs/feedback-vertex-set-for-pseudo-disk-graphs-in-subexponential-fpt-time-2410.238782024-11-01 https://scifaro.com/en/abs/an-algorithm-for-a-variation-of-the-shortest-common-superstring-problem-2410.239002024-11-05 https://scifaro.com/en/abs/clustering-to-minimize-cluster-aware-norm-objectives-2410.241042024-11-01 https://scifaro.com/en/abs/embedding-planar-graphs-into-graphs-of-treewidth-o-log-3-n-2411.002162024-11-04 https://scifaro.com/en/abs/perfect-matchings-and-popularity-in-the-many-to-many-setting-2411.003842024-11-04 https://scifaro.com/en/abs/a-bellman-ford-algorithm-for-the-path-length-weighted-distance-in-graphs-2411.008192024-11-05 https://scifaro.com/en/abs/prophet-secretary-and-matching-the-significance-of-the-largest-item-2411.011912024-11-05 https://scifaro.com/en/abs/near-optimal-relative-error-streaming-quantile-estimation-via-elastic-compactors-2411.013842024-11-05 https://scifaro.com/en/abs/computing-experiment-constrained-d-optimal-designs-2411.014052024-11-05 https://scifaro.com/en/abs/the-gap-between-greedy-algorithm-and-minimum-multiplicative-spanner-2411.014862024-11-05 https://scifaro.com/en/abs/optimality-of-frequency-moment-estimation-2411.021482025-08-06 https://scifaro.com/en/abs/about-the-kannan-bachem-algorithm-2411.024222024-11-06 https://scifaro.com/en/abs/a-linear-time-gap-eth-tight-approximation-scheme-for-euclidean-tsp-2411.025852025-04-07 https://scifaro.com/en/abs/linear-time-algorithms-for-k-edge-connected-components-k-lean-tree-decompositions-and-more-2411.026582024-11-06 https://scifaro.com/en/abs/sensitivity-lower-bounds-for-approximaiton-algorithms-2411.027442025-10-17 https://scifaro.com/en/abs/sampling-permutations-satisfying-constraints-within-the-lopsided-local-lemma-regime-2411.027502025-08-15 https://scifaro.com/en/abs/fast-robust-approximate-message-passing-2411.027642024-11-06 https://scifaro.com/en/abs/faster-exact-and-parameterized-algorithm-for-feedback-vertex-set-in-bipartite-tournaments-2411.028212024-11-06 https://scifaro.com/en/abs/max-distance-sparsification-for-diversification-and-clustering-2411.028452025-06-30 https://scifaro.com/en/abs/counting-random-k-sat-near-the-satisfiability-threshold-2411.029802024-11-06 https://scifaro.com/en/abs/top-k-stabbing-interval-queries-2411.030372024-11-06 https://scifaro.com/en/abs/multi-dimensional-approximate-counting-2411.030712024-11-06 https://scifaro.com/en/abs/on-differentially-private-linear-algebra-2411.030872024-11-06 https://scifaro.com/en/abs/fully-dynamic-k-median-with-near-optimal-update-time-and-recourse-2411.031212024-11-06 https://scifaro.com/en/abs/tight-sampling-bounds-for-eigenvalue-approximation-2411.032272024-11-06 https://scifaro.com/en/abs/concurrent-composition-for-differentially-private-continual-mechanisms-2411.032992026-03-17 https://scifaro.com/en/abs/rapid-mixing-at-the-uniqueness-threshold-2411.034132026-01-08 https://scifaro.com/en/abs/redundancy-is-all-you-need-for-csp-sparsification-2411.034512026-05-19 https://scifaro.com/en/abs/learning-constant-depth-circuits-in-malicious-noise-models-2411.035702024-11-07 https://scifaro.com/en/abs/optimal-prefix-suffix-queries-with-applications-2411.037842024-11-07 https://scifaro.com/en/abs/safe-sequences-via-dominators-in-dags-for-path-covering-problems-2411.038712025-09-05 https://scifaro.com/en/abs/fully-dynamic-delta-1-coloring-against-adaptive-adversaries-2411.044182025-01-22 https://scifaro.com/en/abs/approximate-counting-of-permutation-patterns-2411.047182025-10-27 https://scifaro.com/en/abs/unbounded-error-correcting-codes-2411.048032025-04-09 https://scifaro.com/en/abs/on-the-complexity-of-2-club-cluster-editing-with-vertex-splitting-2411.048462025-06-06 https://scifaro.com/en/abs/faster-feasibility-for-dynamic-flows-and-transshipments-on-temporal-networks-2411.049062025-02-20 https://scifaro.com/en/abs/average-distortion-sketching-2411.051562025-04-11 https://scifaro.com/en/abs/monotone-submodular-multiway-partition-2411.052552025-07-22 https://scifaro.com/en/abs/near-optimal-dimension-reduction-for-facility-location-2411.054322024-11-11 https://scifaro.com/en/abs/recursive-and-iterative-approaches-to-generate-rotation-gray-codes-for-stamp-foldings-and-semi-meanders-2411.054582024-11-11 https://scifaro.com/en/abs/separating-coverage-and-submodular-maximization-subject-to-a-cardinality-constraint-2411.055532025-03-26 https://scifaro.com/en/abs/on-differentially-private-string-distances-2411.057502024-11-11 https://scifaro.com/en/abs/simple-approximation-algorithms-for-polyamorous-scheduling-2411.062922024-11-12 https://scifaro.com/en/abs/one-attack-to-rule-them-all-tight-quadratic-bounds-for-adaptive-queries-on-cardinality-sketches-2411.063702025-03-17 https://scifaro.com/en/abs/parallel-higher-order-truss-decomposition-2411.064052024-11-12 https://scifaro.com/en/abs/faster-weighted-and-unweighted-tree-edit-distance-and-apsp-equivalence-2411.065022025-04-02 https://scifaro.com/en/abs/counterexamples-to-a-weitz-style-reduction-for-multispin-systems-2411.065412025-02-11 https://scifaro.com/en/abs/lower-bounds-for-adaptive-relaxation-based-algorithms-for-single-source-shortest-paths-2411.065462024-11-12 https://scifaro.com/en/abs/phase-transitions-via-complex-extensions-of-markov-chains-2411.068572025-01-03 https://scifaro.com/en/abs/compressed-game-solving-2411.072732025-04-15 https://scifaro.com/en/abs/an-improved-algorithm-for-sparse-instances-of-sat-2411.073892024-11-13 https://scifaro.com/en/abs/listing-6-cycles-in-sparse-graphs-2411.074992024-12-16 https://scifaro.com/en/abs/subsetwise-and-multi-level-additive-spanners-with-lightness-guarantees-2411.075052025-02-18 https://scifaro.com/en/abs/qr-sort-a-novel-non-comparative-sorting-algorithm-2411.075262024-11-13 https://scifaro.com/en/abs/a-simple-algorithm-for-dynamic-carpooling-with-recourse-2411.075532024-11-26 https://scifaro.com/en/abs/elastic-degenerate-string-comparison-2411.077822024-11-13 https://scifaro.com/en/abs/new-separations-and-reductions-for-directed-preservers-and-hopsets-2411.081512025-04-17 https://scifaro.com/en/abs/improved-approximations-for-stationary-bipartite-matching-beyond-probabilistic-independence-2411.082182024-11-14 https://scifaro.com/en/abs/learning-augmented-algorithms-for-online-concave-packing-and-convex-covering-problems-2411.083322024-11-14 https://scifaro.com/en/abs/theoretical-analysis-of-byte-pair-encoding-2411.086712024-11-14 https://scifaro.com/en/abs/optimal-oblivious-subspace-embeddings-with-near-optimal-sparsity-2411.087732025-04-30 https://scifaro.com/en/abs/an-alignment-problem-2411.087922024-11-14 https://scifaro.com/en/abs/stochastic-matching-via-in-n-out-local-computation-algorithms-2411.088052025-06-25 https://scifaro.com/en/abs/sublinear-metric-steiner-tree-via-improved-bounds-for-set-cover-2411.090592024-11-15 https://scifaro.com/en/abs/comparative-genomics-with-succinct-colored-de-bruijn-graphs-2411.091142024-11-15 https://scifaro.com/en/abs/flexflood-efficiently-updatable-learned-multi-dimensional-index-2411.092052024-11-18 https://scifaro.com/en/abs/parallel-k-d-tree-with-batch-updates-2411.092752025-01-08 https://scifaro.com/en/abs/an-algorithm-for-the-longest-common-subsequence-and-substring-problem-for-multiple-strings-2411.094722024-11-26 https://scifaro.com/en/abs/efficient-top-down-updates-in-avl-trees-2411.095312024-11-15 https://scifaro.com/en/abs/fully-dynamic-adversarially-robust-correlation-clustering-in-polylogarithmic-update-time-2411.099792026-02-10 https://scifaro.com/en/abs/optimal-capacity-modification-for-stable-matchings-with-ties-2411.102842026-04-15 https://scifaro.com/en/abs/hardness-results-on-characteristics-for-elastic-degenerated-strings-2411.106532024-11-19 https://scifaro.com/en/abs/differentiable-extensions-with-rounding-guarantees-for-combinatorial-optimization-over-permutations-2411.107072025-11-13 https://scifaro.com/en/abs/maximization-of-approximately-submodular-functions-2411.109492024-11-19 https://scifaro.com/en/abs/fault-equivalent-lowest-common-ancestors-2411.110492024-11-26 https://scifaro.com/en/abs/amortized-analysis-of-leftist-heaps-2411.110512024-11-19 https://scifaro.com/en/abs/connectivity-certificate-against-bounded-degree-faults-simpler-better-and-supporting-vertex-faults-2411.110542024-11-19 https://scifaro.com/en/abs/approximation-algorithms-for-non-sequential-star-packing-problems-2411.111362024-11-19 https://scifaro.com/en/abs/massively-parallel-maximum-coverage-revisited-2411.112772024-11-26 https://scifaro.com/en/abs/spiderdan-matching-augmentation-in-demand-aware-networks-2411.114262024-11-19 https://scifaro.com/en/abs/the-complexity-landscape-of-dynamic-distributed-subgraph-finding-2411.115442025-08-25 https://scifaro.com/en/abs/a-bicriterion-concentration-inequality-and-prophet-inequalities-for-k-fold-matroid-unions-2411.117412024-11-21 https://scifaro.com/en/abs/towards-scalable-and-practical-batch-dynamic-connectivity-2411.117812024-11-19 https://scifaro.com/en/abs/parsing-millions-of-dns-records-per-second-2411.120352024-12-13 https://scifaro.com/en/abs/matroid-secretary-via-labeling-schemes-2411.120692025-06-03 https://scifaro.com/en/abs/data-structures-for-range-sorted-consecutive-occurrence-queries-2411.120992025-09-03 https://scifaro.com/en/abs/space-efficient-online-computation-of-string-net-occurrences-2411.121602024-11-20 https://scifaro.com/en/abs/extending-the-burrows-wheeler-transform-for-cartesian-tree-matching-and-constructing-it-2411.122412024-11-20 https://scifaro.com/en/abs/brief-announcement-parallel-construction-of-bumped-ribbon-retrieval-2411.123652024-11-20 https://scifaro.com/en/abs/dimension-reduction-via-sum-of-squares-and-improved-clustering-algorithms-for-non-spherical-mixtures-2411.124382024-11-20 https://scifaro.com/en/abs/efficient-terabyte-scale-text-compression-via-stable-local-consistency-and-parallel-grammar-processing-2411.124392025-02-26 https://scifaro.com/en/abs/local-density-and-its-distributed-approximation-2411.126942024-11-22 https://scifaro.com/en/abs/oblivious-algorithms-for-maximum-directed-cut-new-upper-and-lower-bounds-2411.129762024-11-21 https://scifaro.com/en/abs/on-the-structure-of-normalized-models-of-circular-arc-graphs-hsu-s-approach-revisited-2411.133742024-11-28 https://scifaro.com/en/abs/sampling-and-integration-of-logconcave-functions-by-algorithmic-diffusion-2411.134622024-11-21 https://scifaro.com/en/abs/comments-on-mathcal-o-m-cdot-n-algorithms-for-the-recognition-and-isomorphism-problems-on-circular-arc-graphs-2411.137082024-11-27 https://scifaro.com/en/abs/distributed-distance-sensitivity-oracles-2411.137282025-11-14 https://scifaro.com/en/abs/dynamic-structural-clustering-unleashed-flexible-similarities-versatile-updates-and-for-all-parameters-2411.138172024-11-22 https://scifaro.com/en/abs/experimental-comparison-of-graph-based-approximate-nearest-neighbor-search-algorithms-on-edge-devices-2411.140062024-11-22 https://scifaro.com/en/abs/outlier-robust-mean-estimation-near-the-breakdown-point-via-sum-of-squares-2411.143052024-11-22 https://scifaro.com/en/abs/overcomplete-tensor-decomposition-via-koszul-young-flattenings-2411.143442025-10-27 https://scifaro.com/en/abs/hardness-amplification-for-dynamic-binary-search-trees-2411.143872024-11-22 https://scifaro.com/en/abs/construction-and-preliminary-validation-of-a-dynamic-programming-concept-inventory-2411.146552024-11-25 https://scifaro.com/en/abs/approximating-the-held-karp-bound-for-metric-tsp-in-nearly-linear-work-and-polylogarithmic-depth-2411.147452025-06-24 https://scifaro.com/en/abs/what-can-be-computed-locally-revisited-first-order-logic-on-sparse-graphs-in-distributed-computing-2411.148252026-02-05 https://scifaro.com/en/abs/approximating-prize-collecting-variants-of-tsp-2411.149942024-11-25 https://scifaro.com/en/abs/totally-delta-modular-ips-with-two-non-zeros-in-most-rows-2411.152822025-03-19 https://scifaro.com/en/abs/tag-arrays-2411.152912024-11-26 https://scifaro.com/en/abs/exploring-facets-of-language-generation-in-the-limit-2411.153642024-12-25 https://scifaro.com/en/abs/implicit-high-order-moment-tensor-estimation-and-learning-latent-variable-models-2411.156692025-04-15 https://scifaro.com/en/abs/directed-token-sliding-2411.161492026-03-26 https://scifaro.com/en/abs/dynamic-range-minimum-queries-on-the-ultra-wide-word-ram-2411.162812025-03-10 https://scifaro.com/en/abs/forest-covers-and-bounded-forest-covers-2411.165782024-11-26 https://scifaro.com/en/abs/approximation-algorithms-for-combinatorial-optimization-with-predictions-2411.166002024-11-26 https://scifaro.com/en/abs/a-new-0-klog-n-algorithm-for-josephus-problem-2411.166962024-11-27 https://scifaro.com/en/abs/optimized-2-approximation-of-treewidth-2411.169182025-07-08 https://scifaro.com/en/abs/online-b-matching-with-stochastic-rewards-2411.169472024-11-27 https://scifaro.com/en/abs/smoothed-analysis-of-the-k-swap-neighborhood-for-makespan-scheduling-2411.172452024-11-27 https://scifaro.com/en/abs/broadcasting-in-heterogeneous-tree-networks-with-edge-weight-uncertainty-2411.172712024-11-27 https://scifaro.com/en/abs/arcee-an-ocm-solver-2411.175962024-11-28 https://scifaro.com/en/abs/structural-parameterization-of-locating-dominating-set-and-test-cover-2411.179482024-11-28 https://scifaro.com/en/abs/improved-parallel-derandomization-via-finite-automata-with-applications-2411.180282026-01-27 https://scifaro.com/en/abs/a-faster-deterministic-algorithm-for-mader-s-mathcal-s-path-packing-2411.182922024-11-28 https://scifaro.com/en/abs/undirected-3-fault-replacement-path-in-nearly-cubic-time-2411.183122024-11-28 https://scifaro.com/en/abs/parallel-token-swapping-for-qubit-routing-2411.185812026-03-13 https://scifaro.com/en/abs/optimal-root-recovery-for-uniform-attachment-trees-and-d-regular-growing-trees-2411.186142024-11-28 https://scifaro.com/en/abs/online-versus-offline-adversaries-in-property-testing-2411.186172024-12-23 https://scifaro.com/en/abs/near-optimal-trace-reconstruction-for-mildly-separated-strings-2411.187652024-12-02 https://scifaro.com/en/abs/fast-schulze-voting-using-quickselect-2411.187902024-12-02 https://scifaro.com/en/abs/improved-approximation-algorithms-for-capacitated-network-design-and-flexible-graph-connectivity-2411.188092026-04-07 https://scifaro.com/en/abs/streaming-algorithms-via-local-algorithms-for-maximum-directed-cut-2411.188292024-12-02 https://scifaro.com/en/abs/a-simple-and-fast-algorithm-for-fair-cuts-2411.190982024-12-02 https://scifaro.com/en/abs/better-approximation-for-weighted-k-matroid-intersection-2411.193662024-12-10 https://scifaro.com/en/abs/hashing-for-sampling-based-estimation-2411.193942024-12-02 https://scifaro.com/en/abs/a-bottom-up-algorithm-for-negative-weight-sssp-with-integrated-negative-cycle-finding-2411.194492024-12-02 https://scifaro.com/en/abs/complexity-of-paired-domination-problems-on-circle-and-k-polygon-graphs-2411.194732025-02-25 https://scifaro.com/en/abs/optimal-algorithm-for-paired-domination-in-distance-hereditary-graphs-2411.194762024-12-02 https://scifaro.com/en/abs/scalable-order-preserving-pattern-mining-2411.195112024-12-02 https://scifaro.com/en/abs/a-rounding-and-clustering-based-exact-algorithm-for-the-p-center-problem-2411.197242024-12-02 https://scifaro.com/en/abs/algorithms-for-parameterized-string-matching-with-mismatches-2412.002222024-12-03 https://scifaro.com/en/abs/enumeration-algorithms-for-combinatorial-problems-using-ising-machines-when-should-we-stop-exploring-energy-landscapes-2412.002842025-11-10 https://scifaro.com/en/abs/pace-solver-description-exact-solution-of-the-one-sided-crossing-minimization-problem-by-the-mppeg-team-2412.002922024-12-03 https://scifaro.com/en/abs/a-generalized-trace-reconstruction-problem-recovering-a-string-of-probabilities-2412.006742024-12-03 https://scifaro.com/en/abs/efficient-kernelization-algorithm-for-bipartite-graph-matching-2412.007042024-12-03 https://scifaro.com/en/abs/data-driven-solution-portfolios-2412.007172024-12-03 https://scifaro.com/en/abs/space-complexity-of-minimum-cut-problems-in-single-pass-streams-2412.011432024-12-09 https://scifaro.com/en/abs/edge-minimum-walk-of-modular-length-in-polynomial-time-2412.016142024-12-03 https://scifaro.com/en/abs/near-optimal-resilient-labeling-schemes-2412.016282024-12-03 https://scifaro.com/en/abs/you-almost-can-t-beat-brute-force-for-3-matroid-intersection-2412.022172025-08-22 https://scifaro.com/en/abs/testing-vs-estimation-for-index-invariant-properties-in-the-huge-object-model-2412.022352024-12-04 https://scifaro.com/en/abs/unify-unified-index-for-range-filtered-approximate-nearest-neighbors-search-2412.024482025-06-18 https://scifaro.com/en/abs/the-cost-of-consistency-submodular-maximization-with-constant-recourse-2412.024922024-12-04 https://scifaro.com/en/abs/the-two-center-problem-of-uncertain-points-on-cactus-graphs-2412.025592025-01-22 https://scifaro.com/en/abs/the-two-center-problem-of-uncertain-points-on-trees-2412.025802024-12-04 https://scifaro.com/en/abs/the-space-complexity-of-approximating-logistic-loss-2412.026392024-12-04 https://scifaro.com/en/abs/efficient-graph-matching-for-correlated-stochastic-block-models-2412.026612024-12-04 https://scifaro.com/en/abs/computing-the-center-of-uncertain-points-on-cactus-graphs-2412.028282024-12-05 https://scifaro.com/en/abs/improved-differentially-private-continual-observation-using-group-algebra-2412.028402025-02-18 https://scifaro.com/en/abs/sinkhorn-algorithm-for-sequentially-composed-optimal-transports-2412.031202025-01-14 https://scifaro.com/en/abs/optimal-bounds-on-a-tree-inference-algorithm-2412.031382024-12-05 https://scifaro.com/en/abs/dynamic-consistent-k-center-clustering-with-optimal-recourse-2412.032382025-06-04 https://scifaro.com/en/abs/on-approximability-of-ell-2-2-min-sum-clustering-2412.033322025-04-14 https://scifaro.com/en/abs/classic-round-up-variant-of-fast-unsigned-division-by-constants-algorithm-and-full-proof-2412.036802024-12-06 https://scifaro.com/en/abs/the-online-submodular-assignment-problem-2412.038262024-12-24 https://scifaro.com/en/abs/combinatorial-selection-with-costly-information-2412.038602025-07-25 https://scifaro.com/en/abs/computing-diverse-pair-of-solutions-for-tractable-sat-2412.040162024-12-06 https://scifaro.com/en/abs/recognizing-2-layer-and-outer-k-planar-graphs-2412.040422025-04-14 https://scifaro.com/en/abs/robust-contraction-decomposition-for-minor-free-graphs-and-its-applications-2412.041452024-12-06 https://scifaro.com/en/abs/a-subquadratic-time-approximation-algorithm-for-individually-fair-k-center-2412.049432025-03-26 https://scifaro.com/en/abs/succinct-data-structures-for-segments-2412.049652024-12-09 https://scifaro.com/en/abs/routing-controlled-spanners-2412.055262025-09-17 https://scifaro.com/en/abs/trapp-an-efficient-point-to-point-path-planning-algorithm-for-road-networks-with-restrictions-2412.058042024-12-10 https://scifaro.com/en/abs/adversarially-robust-dense-sparse-tradeoffs-via-heavy-hitters-2412.058072024-12-10 https://scifaro.com/en/abs/verifying-shortest-paths-in-linear-time-2412.061212024-12-10 https://scifaro.com/en/abs/weberknecht-a-one-sided-crossing-minimization-solver-2412.063612024-12-10 https://scifaro.com/en/abs/on-the-bidirected-cut-relaxation-for-steiner-forest-2412.065182024-12-10 https://scifaro.com/en/abs/massively-parallel-algorithms-for-approximate-shortest-paths-2412.069522025-05-20 https://scifaro.com/en/abs/parallel-simulation-for-log-concave-sampling-and-score-based-diffusion-models-2412.074352025-09-23 https://scifaro.com/en/abs/geometry-helps-in-routing-scalability-2412.079642024-12-18 https://scifaro.com/en/abs/differentially-private-release-of-hierarchical-origin-destination-data-with-a-topdown-approach-2412.092562025-03-11 https://scifaro.com/en/abs/a-comprehensive-survey-of-data-reduction-rules-for-the-maximum-weighted-independent-set-problem-2412.093032026-03-20 https://scifaro.com/en/abs/temporal-triadic-closure-finding-dense-structures-in-social-networks-that-evolve-2412.095672025-04-04 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-diverse-sat-2412.097172024-12-16 https://scifaro.com/en/abs/learning-augmented-streaming-algorithms-for-approximating-max-cut-2412.097732025-01-07 https://scifaro.com/en/abs/fast-fpt-algorithms-for-grundy-number-on-dense-graphs-2412.100822024-12-16 https://scifaro.com/en/abs/optimal-bounds-for-private-minimum-spanning-trees-via-input-perturbation-2412.101302024-12-16 https://scifaro.com/en/abs/fast-and-lightweight-distributed-suffix-array-construction-first-results-2412.101602024-12-16 https://scifaro.com/en/abs/single-source-regular-path-querying-in-terms-of-linear-algebra-2412.102872025-06-17 https://scifaro.com/en/abs/the-correlated-gaussian-sparse-histogram-mechanism-2412.103572024-12-16 https://scifaro.com/en/abs/computational-explorations-of-total-variation-distance-2412.103702024-12-16 https://scifaro.com/en/abs/optimal-static-dictionary-with-worst-case-constant-query-time-2412.106552025-03-28 https://scifaro.com/en/abs/on-the-integrality-gap-of-directed-steiner-tree-lps-with-relatively-integral-solutions-2412.107442025-10-13 https://scifaro.com/en/abs/fixed-order-scheduling-with-deadlines-2412.107602025-05-16 https://scifaro.com/en/abs/catch-me-if-you-can-finding-the-source-of-infections-in-temporal-networks-2412.108772025-08-14 https://scifaro.com/en/abs/dynamic-network-discovery-via-infection-tracing-2412.108812026-01-08 https://scifaro.com/en/abs/sequential-diversification-with-provable-guarantees-2412.109442026-02-05 https://scifaro.com/en/abs/new-approximation-guarantees-for-the-economic-warehouse-lot-scheduling-problem-2412.111842026-01-23 https://scifaro.com/en/abs/new-results-for-the-detection-of-bicliques-2412.112342024-12-17 https://scifaro.com/en/abs/logarithmic-positional-partition-interval-encoding-2412.112362025-01-22 https://scifaro.com/en/abs/proportionally-fair-matching-via-randomized-rounding-2412.112382024-12-17 https://scifaro.com/en/abs/regularized-dikin-walks-for-sampling-truncated-logconcave-measures-mixed-isoperimetry-and-beyond-worst-case-analysis-2412.113032024-12-17 https://scifaro.com/en/abs/counting-butterflies-over-streaming-bipartite-graphs-with-duplicate-edges-2412.114882026-04-28 https://scifaro.com/en/abs/adaptive-manipulation-for-coalitions-in-knockout-tournaments-2412.117992024-12-17 https://scifaro.com/en/abs/witty-an-efficient-solver-for-computing-minimum-size-decision-trees-2412.119542024-12-17 https://scifaro.com/en/abs/approximating-the-top-eigenvector-in-random-order-streams-2412.119632024-12-17 https://scifaro.com/en/abs/parallel-greedy-best-first-search-with-a-bound-on-expansions-relative-to-sequential-search-2412.122212025-06-18 https://scifaro.com/en/abs/cluster-editing-on-cographs-and-related-classes-2412.124542024-12-18 https://scifaro.com/en/abs/round-and-communication-efficient-graph-coloring-2412.125892025-05-12 https://scifaro.com/en/abs/cuckoo-heavy-keeper-and-the-balancing-act-of-maintaining-heavy-hitters-in-stream-processing-2412.128732025-11-24 https://scifaro.com/en/abs/stable-approximation-algorithms-for-dominating-set-and-independent-set-2412.133582025-11-07 https://scifaro.com/en/abs/differentially-private-substring-and-document-counting-with-near-optimal-error-2412.138132026-03-27 https://scifaro.com/en/abs/fingerprinting-codes-meet-geometry-improved-lower-bounds-for-private-query-release-and-adaptive-data-analysis-2412.143962024-12-20 https://scifaro.com/en/abs/fine-grained-computation-in-3-space-matrix-multiplication-and-graph-problems-2412.144412024-12-20 https://scifaro.com/en/abs/loss-minimization-for-electrical-flows-over-spanning-trees-on-grids-2412.145832024-12-20 https://scifaro.com/en/abs/sparse-induced-subgraphs-in-p-7-free-graphs-of-bounded-clique-number-2412.148362026-05-19 https://scifaro.com/en/abs/fully-dynamic-approximate-minimum-cut-in-subpolynomial-time-per-operation-2412.150692025-01-07 https://scifaro.com/en/abs/solving-the-all-pairs-shortest-path-problem-after-minor-update-of-a-large-dense-graph-2412.151222025-02-06 https://scifaro.com/en/abs/tokenisation-is-np-complete-2412.152102024-12-20 https://scifaro.com/en/abs/log-time-k-means-clustering-for-1d-data-novel-approaches-with-proof-and-implementation-2412.152952024-12-25 https://scifaro.com/en/abs/approximation-algorithms-for-clustering-with-minimum-sum-of-radii-diameters-and-squared-radii-2412.163272024-12-24 https://scifaro.com/en/abs/faster-positional-population-counts-for-avx2-avx-512-and-asimd-2412.163702026-03-09 https://scifaro.com/en/abs/chorba-a-novel-crc32-implementation-2412.163982024-12-24 https://scifaro.com/en/abs/fast-biclique-counting-on-bipartite-graphs-a-node-pivot-based-approach-2412.164852024-12-24 https://scifaro.com/en/abs/carbonyl4-a-sketch-for-set-increment-mixed-updates-2412.165662024-12-24 https://scifaro.com/en/abs/sparsest-cut-and-eigenvalue-multiplicities-on-low-degree-abelian-cayley-graphs-2412.171152025-10-01 https://scifaro.com/en/abs/online-coloring-of-short-interval-graphs-and-two-count-interval-graphs-2412.171932026-05-01 https://scifaro.com/en/abs/on-the-complexity-of-finding-a-spanning-even-tree-in-a-graph-2412.173072024-12-24 https://scifaro.com/en/abs/on-the-number-of-k-mers-admitting-a-given-lexicographical-minimizer-2412.174922024-12-25 https://scifaro.com/en/abs/efficient-fault-tolerant-search-by-fast-indexing-of-subnetworks-2412.177762024-12-30 https://scifaro.com/en/abs/the-connected-k-vertex-one-center-problem-on-graphs-2412.180012025-01-22 https://scifaro.com/en/abs/parallel-contraction-hierarchies-can-be-efficient-and-scalable-2412.180082025-04-24 https://scifaro.com/en/abs/algorithmic-universality-low-degree-polynomials-and-max-cut-in-sparse-random-graphs-2412.180142025-12-25 https://scifaro.com/en/abs/faster-semi-streaming-matchings-via-alternating-trees-2412.190572025-04-23 https://scifaro.com/en/abs/a-space-lower-bound-for-approximate-membership-with-duplicate-insertions-or-deletions-of-nonelements-2412.192492024-12-30 https://scifaro.com/en/abs/highway-dimension-a-metric-view-2412.204902026-03-05 https://scifaro.com/en/abs/optimal-rolling-of-fair-dice-using-fair-coins-2412.207002024-12-31 https://scifaro.com/en/abs/the-restricted-inverse-optimal-value-problem-under-weighted-bottle-neck-hamming-distance-on-trees-2412.207032025-01-07 https://scifaro.com/en/abs/how-to-balance-the-load-online-when-jobs-and-machines-are-both-selfish-2412.207112024-12-31 https://scifaro.com/en/abs/on-the-complexity-of-the-bilevel-shortest-path-problem-2412.211342026-02-19 https://scifaro.com/en/abs/sos-certificates-for-sparse-singular-values-and-their-applications-robust-statistics-subspace-distortion-and-more-2412.212032024-12-31 https://scifaro.com/en/abs/binary-jumbled-indexing-suffix-tree-histogram-2501.001112025-01-03 https://scifaro.com/en/abs/induced-minor-models-ii-sufficient-conditions-for-polynomial-time-detection-of-induced-minors-2501.001612025-10-29 https://scifaro.com/en/abs/differentially-private-matchings-2501.009262026-02-18 https://scifaro.com/en/abs/submodular-maximization-subject-to-uniform-and-partition-matroids-from-theory-to-practical-applications-and-distributed-solutions-2501.010712025-01-03 https://scifaro.com/en/abs/a-fast-algorithm-for-the-frobenius-problem-in-three-variables-2501.010992025-01-03 https://scifaro.com/en/abs/john-ellipsoids-via-lazy-updates-2501.018012025-01-06 https://scifaro.com/en/abs/locally-computing-edge-orientations-2501.021362025-01-07 https://scifaro.com/en/abs/optimal-bounds-for-open-addressing-without-reordering-2501.023052025-03-03 https://scifaro.com/en/abs/efficient-d-ary-cuckoo-hashing-at-high-load-factors-by-bubbling-up-2501.023122025-01-07 https://scifaro.com/en/abs/a-faster-algorithm-for-constrained-correlation-clustering-2501.031542025-01-07 https://scifaro.com/en/abs/on-the-non-submodularity-of-the-problem-of-adding-links-to-minimize-the-effective-graph-resistance-2501.033632025-01-08 https://scifaro.com/en/abs/a-simple-and-combinatorial-approach-to-proving-chernoff-bounds-and-their-generalizations-2501.034882026-02-10 https://scifaro.com/en/abs/on-the-locality-of-hall-s-theorem-2501.036492025-01-08 https://scifaro.com/en/abs/dimension-free-parameterized-approximation-schemes-for-hybrid-clustering-2501.036632025-01-08 https://scifaro.com/en/abs/on-beating-2-n-for-the-closest-vector-problem-2501.036882025-01-08 https://scifaro.com/en/abs/multi-armed-bandit-and-backbone-boost-lin-kernighan-helsgaun-algorithm-for-the-traveling-salesman-problems-2501.040722025-01-09 https://scifaro.com/en/abs/protecting-the-connectivity-of-a-graph-under-non-uniform-edge-failures-2501.045402025-01-09 https://scifaro.com/en/abs/improved-approximation-algorithms-for-1-2-tsp-and-max-tsp-using-path-covers-in-the-semi-streaming-model-2501.048132025-01-30 https://scifaro.com/en/abs/eth-tight-fpt-algorithm-for-makespan-minimization-on-uniform-machines-2501.048592025-01-10 https://scifaro.com/en/abs/sampling-unlabeled-chordal-graphs-in-expected-polynomial-time-2501.050242025-01-15 https://scifaro.com/en/abs/approximate-minimum-tree-cover-in-all-symmetric-monotone-norms-simultaneously-2501.050482025-01-10 https://scifaro.com/en/abs/entangled-mean-estimation-in-high-dimensions-2501.054252025-01-10 https://scifaro.com/en/abs/faster-edge-coloring-by-partition-sieving-2501.055702025-01-13 https://scifaro.com/en/abs/colorful-vertex-recoloring-of-bipartite-graphs-2501.057962025-01-13 https://scifaro.com/en/abs/a-survey-on-algorithmic-developments-in-optimal-transport-problem-with-applications-2501.062472025-01-14 https://scifaro.com/en/abs/faster-parameterized-algorithm-for-3-hitting-set-2501.064522025-01-14 https://scifaro.com/en/abs/tucket-a-tensor-time-series-data-structure-for-efficient-and-accurate-factor-analysis-over-time-ranges-2501.066472025-01-14 https://scifaro.com/en/abs/algorithmical-aspects-of-some-bio-inspired-operations-2501.069492025-09-30 https://scifaro.com/en/abs/dynhac-fully-dynamic-approximate-hierarchical-agglomerative-clustering-2501.077452025-01-15 https://scifaro.com/en/abs/tile-reconfiguration-by-a-finite-automaton-2501.086632025-11-18 https://scifaro.com/en/abs/adaptive-approximation-schemes-for-matching-queues-2501.087752025-06-03 https://scifaro.com/en/abs/beating-competitive-ratio-4-for-graphic-matroid-secretary-2501.088462025-01-16 https://scifaro.com/en/abs/a-simpler-qptas-for-scheduling-jobs-with-precedence-constraints-2501.090912025-01-17 https://scifaro.com/en/abs/scheduling-coflows-for-minimizing-the-maximum-completion-time-in-heterogeneous-parallel-networks-2501.092932026-05-26 https://scifaro.com/en/abs/an-efficient-algorithm-for-permutation-iteration-using-a-singly-linked-list-2501.101022025-09-16 https://scifaro.com/en/abs/cutwidth-and-crossings-2501.101832025-01-20 https://scifaro.com/en/abs/streaming-graph-algorithms-in-the-massively-parallel-computation-model-2501.102302025-01-20 https://scifaro.com/en/abs/local-sherman-s-algorithm-for-multi-commodity-flow-2501.106322025-02-10 https://scifaro.com/en/abs/answering-related-questions-2501.106332026-04-23 https://scifaro.com/en/abs/convergence-and-running-time-of-time-dependent-ant-colony-algorithms-2501.108102025-01-22 https://scifaro.com/en/abs/on-the-thinness-of-trees-2501.111572025-01-23 https://scifaro.com/en/abs/complexity-gaps-between-point-and-interval-temporal-graphs-for-some-reachability-problems-2501.113802026-01-26 https://scifaro.com/en/abs/an-algorithmic-vizing-s-theorem-toward-efficient-edge-coloring-sampling-with-an-optimal-number-of-colors-2501.115412025-01-22 https://scifaro.com/en/abs/tight-analyses-of-ordered-and-unordered-linear-probing-2501.115822025-01-22 https://scifaro.com/en/abs/o-1-round-mpc-algorithms-for-multi-dimensional-grid-graph-connectivity-emst-and-dbscan-2501.120442025-01-22 https://scifaro.com/en/abs/on-the-complexity-of-telephone-broadcasting-from-cacti-to-bounded-pathwidth-graphs-2501.123162025-02-12 https://scifaro.com/en/abs/a-fast-counting-free-algorithm-for-computing-atomic-sets-in-feature-models-2501.124902025-01-23 https://scifaro.com/en/abs/stable-matching-with-interviews-2501.125032025-01-23 https://scifaro.com/en/abs/making-temporal-betweenness-computation-faster-and-restless-2501.127082025-01-23 https://scifaro.com/en/abs/on-tradeoffs-in-learning-augmented-algorithms-2501.127702025-01-23 https://scifaro.com/en/abs/a-note-on-deterministic-fptas-for-partition-2501.128482025-01-23 https://scifaro.com/en/abs/quars-a-transform-for-better-lossless-compression-of-integers-2501.129292025-01-23 https://scifaro.com/en/abs/complexity-and-algorithm-for-the-matching-vertex-cutset-problem-2501.132172025-01-24 https://scifaro.com/en/abs/markovian-search-with-ex-ante-constraints-theory-and-applications-to-socially-aware-algorithmic-hiring-2501.133462025-11-03 https://scifaro.com/en/abs/new-oracles-and-labeling-schemes-for-vertex-cut-queries-2501.135962026-05-01 https://scifaro.com/en/abs/on-extended-concentration-inequalities-for-fast-jl-embeddings-of-infinite-sets-2501.140102025-01-27 https://scifaro.com/en/abs/radik-scalable-and-optimized-gpu-parallel-radix-top-k-selection-2501.143362025-01-28 https://scifaro.com/en/abs/changing-induced-subgraph-isomorphisms-under-extended-reconfiguration-rules-2501.144502025-01-27 https://scifaro.com/en/abs/efficient-parameterized-approximation-2501.144612025-01-27 https://scifaro.com/en/abs/forbidden-subgraph-problems-with-predictions-2501.145372025-01-27 https://scifaro.com/en/abs/polynomial-kernel-and-incompressibility-for-prison-free-edge-deletion-and-completion-2501.159522025-01-28 https://scifaro.com/en/abs/complexity-of-constructing-minimal-faithful-permutation-representations-for-fitting-free-groups-2501.160392026-05-07 https://scifaro.com/en/abs/latency-guarantees-for-caching-with-delayed-hits-2501.165352025-01-29 https://scifaro.com/en/abs/hardness-and-approximation-algorithms-for-balanced-districting-problems-2501.172772025-06-03 https://scifaro.com/en/abs/stable-tree-labelling-for-accelerating-distance-queries-on-dynamic-road-networks-2501.173792025-01-30 https://scifaro.com/en/abs/search-trees-on-trees-via-lp-2501.175632025-08-04 https://scifaro.com/en/abs/polytope-scheduling-with-groups-unified-models-and-optimal-guarantees-2501.176822026-02-12 https://scifaro.com/en/abs/decision-theoretic-approaches-for-improved-learning-augmented-algorithms-2501.177012025-09-16 https://scifaro.com/en/abs/improved-fixed-parameter-bounds-for-min-sum-radii-and-diameters-k-clustering-and-their-fair-variants-2501.177082025-02-05 https://scifaro.com/en/abs/matrix-product-sketching-via-coordinated-sampling-2501.178362025-01-30 https://scifaro.com/en/abs/sequential-testing-with-subadditive-costs-2501.180102025-01-31 https://scifaro.com/en/abs/facility-location-on-high-dimensional-euclidean-spaces-2501.181052025-01-31 https://scifaro.com/en/abs/graph-exploration-with-edge-weight-estimates-2501.184962025-01-31 https://scifaro.com/en/abs/better-late-then-the-hardness-of-choosing-delays-to-meet-passenger-demands-in-temporal-graphs-2501.189872025-04-11 https://scifaro.com/en/abs/the-kernighan-lin-search-algorithm-2502.003162025-02-04 https://scifaro.com/en/abs/polynomial-time-learning-augmented-algorithms-for-np-hard-permutation-problems-2502.008412025-02-04 https://scifaro.com/en/abs/minimum-riesz-s-energy-subset-selection-in-ordered-point-sets-via-dynamic-programming-2502.011632025-02-11 https://scifaro.com/en/abs/ibb-fast-burrows-wheeler-transform-construction-for-length-diverse-dna-data-2502.013272025-02-04 https://scifaro.com/en/abs/fair-densest-subgraph-across-multiple-graphs-2502.013812025-02-04 https://scifaro.com/en/abs/fair-vertex-problems-parameterized-by-cluster-vertex-deletion-2502.014002026-04-28 https://scifaro.com/en/abs/node-ranking-in-labeled-networks-2502.014082025-02-04 https://scifaro.com/en/abs/fully-dynamic-spectral-sparsification-of-hypergraphs-2502.014212025-02-04 https://scifaro.com/en/abs/dense-subgraph-discovery-meets-strong-triadic-closure-2502.014352025-02-04 https://scifaro.com/en/abs/southwest-tree-a-low-memory-data-structure-for-partial-accumulations-by-non-commutative-invertible-operations-2502.016032025-02-12 https://scifaro.com/en/abs/a-new-rejection-sampling-approach-to-k-mathtt-means-with-improved-trade-offs-2502.020852025-02-05 https://scifaro.com/en/abs/efficient-and-practical-approximation-algorithms-for-advertising-in-content-feeds-2502.021152025-02-05 https://scifaro.com/en/abs/extending-the-applicability-of-bloom-filters-by-relaxing-their-parameter-constraints-2502.021932025-12-16 https://scifaro.com/en/abs/a-note-on-ordered-ruzsa-szemer-edi-graphs-2502.024552025-02-05 https://scifaro.com/en/abs/speeding-up-graph-algorithms-via-clique-partitioning-2502.024772026-04-14 https://scifaro.com/en/abs/max-min-diversification-with-asymmetric-distances-2502.025302025-02-05 https://scifaro.com/en/abs/algorithms-and-hardness-results-for-the-k-ell-cover-problem-2502.025722025-11-12 https://scifaro.com/en/abs/improving-polynomial-bounds-for-the-graphical-traveling-salesman-problem-with-release-dates-on-paths-2502.026802025-02-07 https://scifaro.com/en/abs/near-optimal-linear-sketches-and-fully-dynamic-algorithms-for-hypergraph-spectral-sparsification-2502.033132025-02-07 https://scifaro.com/en/abs/pandora-with-inaccurate-priors-2502.035742025-02-07 https://scifaro.com/en/abs/fast-geographic-routing-in-fixed-growth-graphs-2502.036632025-05-29 https://scifaro.com/en/abs/cascaded-learned-bloom-filter-for-optimal-model-filter-size-balance-and-fast-rejection-2502.036962025-02-07 https://scifaro.com/en/abs/tensor-decomposition-meets-knowledge-compilation-a-study-comparing-tensor-trains-with-obdds-2502.037022025-02-07 https://scifaro.com/en/abs/knowing-when-to-stop-matters-a-unified-algorithm-for-online-conversion-under-horizon-uncertainty-2502.038172025-02-07 https://scifaro.com/en/abs/fast-in-spectrum-graph-watermarks-2502.041822025-08-05 https://scifaro.com/en/abs/tight-bounds-for-noisy-computation-of-high-influence-functions-connectivity-and-threshold-2502.046322025-02-17 https://scifaro.com/en/abs/llm-query-scheduling-with-prefix-reuse-and-latency-constraints-2502.046772026-01-05 https://scifaro.com/en/abs/exact-algorithms-for-distance-to-unique-vertex-cover-2502.050592025-02-10 https://scifaro.com/en/abs/a-randomised-approach-to-distributed-sorting-2502.050822025-02-10 https://scifaro.com/en/abs/algorithmic-problems-in-categories-of-partitions-2502.053732025-02-11 https://scifaro.com/en/abs/approximating-the-total-variation-distance-between-spin-systems-2502.054372025-06-16 https://scifaro.com/en/abs/new-and-improved-bounds-for-markov-paging-2502.055112026-05-26 https://scifaro.com/en/abs/combined-search-and-encoding-for-seeds-with-an-application-to-minimal-perfect-hashing-2502.056132025-07-03 https://scifaro.com/en/abs/near-optimal-directed-low-diameter-decompositions-2502.056872025-02-11 https://scifaro.com/en/abs/pareto-optimality-smoothness-and-stochasticity-in-learning-augmented-one-max-search-2502.057202025-02-11 https://scifaro.com/en/abs/breaking-the-quadratic-barrier-robust-cardinality-sketches-for-adaptive-queries-2502.057232025-02-11 https://scifaro.com/en/abs/sink-free-orientations-a-local-sampler-with-applications-2502.058772025-02-17 https://scifaro.com/en/abs/faster-approximation-algorithms-for-k-center-via-data-reduction-2502.058882025-02-11 https://scifaro.com/en/abs/constant-sensitivity-on-the-cdawgs-2502.059152025-02-11 https://scifaro.com/en/abs/improved-sublinear-algorithms-for-classical-and-quantum-graph-coloring-2502.060242025-02-11 https://scifaro.com/en/abs/on-the-query-complexity-of-sampling-from-non-log-concave-distributions-2502.062002025-06-04 https://scifaro.com/en/abs/maximum-coverage-k-antichains-and-chains-a-greedy-approach-2502.064592025-02-11 https://scifaro.com/en/abs/new-simple-and-fast-quicksort-algorithm-for-equal-keys-2502.064612025-03-12 https://scifaro.com/en/abs/arrival-recursive-framework-ell-1-contraction-2502.064772025-07-04 https://scifaro.com/en/abs/approximation-algorithms-for-optimal-hopsets-2502.065222025-05-08 https://scifaro.com/en/abs/on-the-firstfit-algorithm-for-online-unit-interval-coloring-2502.065582025-02-11 https://scifaro.com/en/abs/nearly-optimal-robust-covariance-and-scatter-matrix-estimation-beyond-gaussians-2502.065642025-04-15 https://scifaro.com/en/abs/decay-of-correlation-for-edge-colorings-when-q-3-delta-2502.065862025-06-03 https://scifaro.com/en/abs/engineering-insights-into-biclique-partitions-and-fractional-binary-ranks-of-matrices-2502.067302025-02-11 https://scifaro.com/en/abs/breaking-barriers-combinatorial-algorithms-for-non-monotone-submodular-maximization-with-sublinear-adaptivity-and-1-e-approximation-2502.070622025-10-07 https://scifaro.com/en/abs/one-shot-learning-for-k-sat-2502.071352025-12-01 https://scifaro.com/en/abs/exploring-word-representable-temporal-graphs-2502.074962025-02-12 https://scifaro.com/en/abs/faster-diameter-computation-in-graphs-of-bounded-euler-genus-2502.075012025-02-12 https://scifaro.com/en/abs/robust-sorting-and-applications-to-ulam-median-2502.076532025-05-06 https://scifaro.com/en/abs/private-low-rank-approximation-for-covariance-matrices-dyson-brownian-motion-and-eigenvalue-gap-bounds-for-gaussian-perturbations-2502.076572025-02-12 https://scifaro.com/en/abs/coresets-for-robust-clustering-via-black-box-reductions-to-vanilla-case-2502.076692025-02-12 https://scifaro.com/en/abs/online-matching-and-market-imbalance-2502.077312025-02-12 https://scifaro.com/en/abs/polynomial-time-approximability-of-constrained-reinforcement-learning-2502.077642025-02-12 https://scifaro.com/en/abs/understanding-the-kronecker-matrix-vector-complexity-of-linear-algebra-2502.080292025-02-14 https://scifaro.com/en/abs/shortcuts-and-transitive-closure-spanners-approximation-2502.080322025-10-21 https://scifaro.com/en/abs/parallel-k-core-decomposition-theory-and-practice-2502.080422025-03-25 https://scifaro.com/en/abs/incremental-approximate-single-source-shortest-paths-with-predictions-2502.081252025-02-13 https://scifaro.com/en/abs/cost-preserving-dependent-rounding-for-allocation-problems-2502.082672025-04-29 https://scifaro.com/en/abs/the-planted-spanning-tree-problem-2502.087902025-07-08 https://scifaro.com/en/abs/scalable-private-partition-selection-via-adaptive-weighting-2502.088782025-08-12 https://scifaro.com/en/abs/incremental-approximate-maximum-flow-via-residual-graph-sparsification-2502.091052026-05-22 https://scifaro.com/en/abs/a-lp-rounding-based-algorithm-for-soft-capacitated-facility-location-problem-with-submodular-penalties-2502.094122025-02-18 https://scifaro.com/en/abs/deterministic-independent-sets-in-the-semi-streaming-model-2502.094402025-02-14 https://scifaro.com/en/abs/forward-backward-contention-resolution-schemes-for-fair-rationing-2502.095212025-02-14 https://scifaro.com/en/abs/fast-tensor-completion-via-approximate-richardson-iteration-2502.095342025-08-13 https://scifaro.com/en/abs/optimal-k-secretary-with-logarithmic-memory-2502.098342026-05-11 https://scifaro.com/en/abs/emit-as-you-go-enumerating-edges-of-a-spanning-tree-2502.102792025-02-17 https://scifaro.com/en/abs/interval-selection-with-binary-predictions-2502.103142025-02-17 https://scifaro.com/en/abs/on-incremental-approximate-shortest-paths-in-directed-graphs-2502.103482025-02-17 https://scifaro.com/en/abs/customizable-contraction-hierarchies-a-survey-2502.105192025-02-18 https://scifaro.com/en/abs/algorithms-and-hardness-for-estimating-statistical-similarity-2502.105272025-06-03 https://scifaro.com/en/abs/local-gibbs-sampling-beyond-local-uniformity-2502.107952025-10-14 https://scifaro.com/en/abs/light-edge-fault-tolerant-graph-spanners-2502.108902025-04-28 https://scifaro.com/en/abs/exponential-time-approximation-schemes-for-vertex-ordering-problems-2502.109092025-02-18 https://scifaro.com/en/abs/probabilistic-analysis-of-arithmetic-coding-showing-its-robustness-2502.109352025-02-18 https://scifaro.com/en/abs/the-bathroom-model-a-realistic-approach-to-hash-table-algorithm-optimization-2502.109772025-03-24 https://scifaro.com/en/abs/resident-fitness-computation-in-linear-time-and-other-algorithmic-aspects-of-interacting-trajectories-2502.115612026-04-15 https://scifaro.com/en/abs/cheesemap-a-high-performance-point-indexing-data-structure-for-neighbor-search-in-lidar-data-2502.116022025-02-19 https://scifaro.com/en/abs/on-the-locality-of-the-lov-asz-local-lemma-2502.116902025-02-18 https://scifaro.com/en/abs/parameterised-algorithms-for-temporally-satisfying-reconfiguration-problems-2502.119612025-09-22 https://scifaro.com/en/abs/logarithmic-approximation-for-road-pricing-on-grids-2502.119792025-02-18 https://scifaro.com/en/abs/algorithm-engineering-of-sssp-with-negative-edge-weights-2502.119992025-02-18 https://scifaro.com/en/abs/the-complexity-of-dynamic-lz77-is-tilde-theta-n-2-3-2502.120002025-10-28 https://scifaro.com/en/abs/min-max-correlation-clustering-via-neighborhood-similarity-2502.125192025-02-19 https://scifaro.com/en/abs/maximizing-value-in-challenge-the-champ-tournaments-2502.125692025-02-19 https://scifaro.com/en/abs/revisiting-token-sliding-on-chordal-graphs-2502.127492025-02-19 https://scifaro.com/en/abs/finding-maximum-weight-2-packing-sets-on-arbitrary-graphs-2502.128562025-02-21 https://scifaro.com/en/abs/on-the-complexity-of-minimising-the-moving-distance-for-dispersing-objects-2502.129032025-02-19 https://scifaro.com/en/abs/approximate-tree-completion-and-learning-augmented-algorithms-for-metric-minimum-spanning-trees-2502.129932025-02-19 https://scifaro.com/en/abs/edge-colored-clustering-in-hypergraphs-beyond-minimizing-unsatisfied-edges-2502.130002025-02-19 https://scifaro.com/en/abs/smoothed-analysis-of-dynamic-graph-algorithms-2502.130072025-02-19 https://scifaro.com/en/abs/sum-of-squares-to-approximate-knapsack-2502.132922025-02-20 https://scifaro.com/en/abs/graph-based-algorithms-for-diverse-similarity-search-2502.133362025-02-20 https://scifaro.com/en/abs/faster-minimization-of-total-weighted-completion-time-on-parallel-machines-2502.136312025-02-20 https://scifaro.com/en/abs/semi-streaming-algorithms-for-hypergraph-matching-2502.136362025-07-09 https://scifaro.com/en/abs/a-query-driven-approach-to-space-efficient-range-searching-2502.136532025-02-20 https://scifaro.com/en/abs/fpt-algorithms-over-linear-delta-matroids-with-applications-2502.136542025-02-20 https://scifaro.com/en/abs/structural-parameterizations-for-induced-and-acyclic-matching-2502.141612025-09-15 https://scifaro.com/en/abs/momenti-scalable-motif-mining-in-multidimensional-time-series-2502.144462026-03-20 https://scifaro.com/en/abs/u-index-a-universal-indexing-framework-for-matching-long-patterns-2502.144882026-02-05 https://scifaro.com/en/abs/optirefine-densest-subgraphs-and-maximum-cuts-with-k-refinements-2502.145322025-08-11 https://scifaro.com/en/abs/enumerating-minimal-dominating-sets-and-variants-in-chordal-bipartite-graphs-2502.146112025-08-05 https://scifaro.com/en/abs/efficient-multivariate-robust-mean-estimation-under-mean-shift-contamination-2502.147722025-02-21 https://scifaro.com/en/abs/adversarially-robust-gossip-algorithms-for-approximate-quantile-and-mean-computations-2502.153202025-08-19 https://scifaro.com/en/abs/streaming-maximal-matching-with-bounded-deletions-2502.153302025-02-24 https://scifaro.com/en/abs/improved-sublinear-time-moment-estimation-using-weighted-sampling-2502.153332025-02-24 https://scifaro.com/en/abs/optimal-distributed-replacement-paths-2502.153782025-08-28 https://scifaro.com/en/abs/arboricity-and-random-edge-queries-matter-for-triangle-counting-using-sublinear-queries-2502.153792025-02-24 https://scifaro.com/en/abs/ptrhash-minimal-perfect-hashing-at-ram-throughput-2502.155392026-02-05 https://scifaro.com/en/abs/tight-bounds-for-some-classical-problems-parameterized-by-cutwidth-2502.158842025-02-25 https://scifaro.com/en/abs/compression-barriers-for-autoregressive-transformers-2502.159552025-02-25 https://scifaro.com/en/abs/learning-neural-networks-with-distribution-shift-efficiently-certifiable-guarantees-2502.160212025-02-25 https://scifaro.com/en/abs/the-parameterized-landscape-of-labeled-graph-contractions-2502.160962025-07-01 https://scifaro.com/en/abs/testing-whether-a-subgraph-is-convex-or-isometric-2502.161932026-04-14 https://scifaro.com/en/abs/planar-network-diversion-2502.167142025-02-25 https://scifaro.com/en/abs/a-parameterized-complexity-analysis-of-bounded-height-depth-first-search-trees-2502.167232025-02-25 https://scifaro.com/en/abs/potential-based-greedy-matching-for-dynamic-delivery-pooling-2502.168622026-01-13 https://scifaro.com/en/abs/minimizers-in-semi-dynamic-strings-2502.171992025-02-25 https://scifaro.com/en/abs/simple-sublinear-algorithms-for-delta-1-vertex-coloring-via-asymmetric-palette-sparsification-2502.176292026-03-11 https://scifaro.com/en/abs/optimal-approximate-matrix-multiplication-over-sliding-window-2502.179402025-02-26 https://scifaro.com/en/abs/near-optimal-active-regression-of-single-index-models-2502.182132025-02-26 https://scifaro.com/en/abs/graph-inference-with-effective-resistance-queries-2502.183502025-02-26 https://scifaro.com/en/abs/from-chinese-postman-to-salesman-and-beyond-ii-inapproximability-and-parameterized-complexity-2502.185412025-02-27 https://scifaro.com/en/abs/on-efficient-approximate-aggregate-nearest-neighbor-queries-over-learned-representations-2502.188032026-01-06 https://scifaro.com/en/abs/optimal-approximate-matrix-multiplication-over-sliding-windows-2502.188302025-02-27 https://scifaro.com/en/abs/approximate-2-hop-neighborhoods-on-incremental-graphs-an-efficient-lazy-approach-2502.192052025-07-08 https://scifaro.com/en/abs/beyond-worst-case-dimensionality-reduction-for-sparse-vectors-2502.198652025-02-28 https://scifaro.com/en/abs/space-efficient-private-estimation-of-quantiles-2502.202072025-06-13 https://scifaro.com/en/abs/kebab-k-mer-based-breaking-for-finding-long-mems-2502.203382025-06-10 https://scifaro.com/en/abs/a-fast-and-slightly-robust-covariance-estimator-2502.207082025-03-03 https://scifaro.com/en/abs/optimizing-quotient-filters-using-graveyard-hashing-2502.207252025-03-03 https://scifaro.com/en/abs/a-faster-algorithm-for-maximum-weight-matching-on-unrestricted-bipartite-graphs-2502.208892025-04-07 https://scifaro.com/en/abs/layered-graph-drawing-with-few-gaps-and-few-crossings-2502.208962025-03-03 https://scifaro.com/en/abs/gridot-a-discrete-optimal-transport-solver-on-grids-2502.209052025-03-03 https://scifaro.com/en/abs/3-415-approximation-for-coflow-scheduling-via-iterated-rounding-2502.211972025-03-03 https://scifaro.com/en/abs/the-structural-complexity-of-matrix-vector-multiplication-2502.212402026-02-10 https://scifaro.com/en/abs/on-the-time-complexity-of-finding-a-well-spread-perfect-matching-in-bridgeless-cubic-graphs-2503.002632025-07-03 https://scifaro.com/en/abs/an-fpt-constant-factor-approximation-algorithm-for-correlation-clustering-2503.002812025-03-04 https://scifaro.com/en/abs/streaming-algorithms-for-network-design-2503.007122025-04-17 https://scifaro.com/en/abs/a-framework-for-boosting-matching-approximation-parallel-distributed-and-dynamic-2503.011472025-08-19 https://scifaro.com/en/abs/faster-ed-string-matching-with-k-mismatches-2503.013882025-03-04 https://scifaro.com/en/abs/binary-k-center-with-missing-entries-structure-leads-to-tractability-2503.014452025-03-04 https://scifaro.com/en/abs/scanning-html-at-tens-of-gigabytes-per-second-on-arm-processors-2503.016622025-06-05 https://scifaro.com/en/abs/optimal-differentially-private-sampling-of-unbounded-gaussians-2503.017662025-03-04 https://scifaro.com/en/abs/boosting-rectilinear-steiner-minimum-tree-algorithms-with-augmented-bounding-volume-hierarchy-2503.023192025-03-05 https://scifaro.com/en/abs/on-the-sensitivity-of-cdawg-grammars-2503.024152026-05-29 https://scifaro.com/en/abs/sublinear-data-structures-for-nearest-neighbor-in-ultra-high-dimensions-2503.030792025-04-07 https://scifaro.com/en/abs/logarithmic-time-internal-pattern-matching-queries-in-compressed-and-dynamic-texts-2503.034882025-03-06 https://scifaro.com/en/abs/novel-complexity-results-for-temporal-separators-with-deadlines-2503.035682025-03-06 https://scifaro.com/en/abs/parameterized-approximation-algorithms-for-tsp-on-non-metric-graphs-2503.036422025-12-02 https://scifaro.com/en/abs/improved-robust-estimation-for-erd-h-o-s-r-enyi-graphs-the-sparse-regime-and-optimal-breakdown-point-2503.039232025-03-07 https://scifaro.com/en/abs/image-computation-for-quantum-transition-systems-2503.041462025-03-07 https://scifaro.com/en/abs/revisiting-ranking-for-online-bipartite-matching-with-random-arrivals-the-primal-dual-analysis-2503.041962025-03-07 https://scifaro.com/en/abs/cost-distance-steiner-trees-for-timing-constrained-global-routing-2503.044192025-03-07 https://scifaro.com/en/abs/source-oblivious-broadcast-2503.045112025-03-07 https://scifaro.com/en/abs/quickly-avoiding-a-random-catastrophe-2503.046332025-03-07 https://scifaro.com/en/abs/efficient-algorithms-for-verifying-kruskal-rank-in-sparse-linear-regression-and-related-applications-2503.049862025-03-10 https://scifaro.com/en/abs/faster-global-minimum-cut-with-predictions-2503.050042025-03-10 https://scifaro.com/en/abs/fair-clustering-in-the-sliding-window-model-2503.051732025-03-10 https://scifaro.com/en/abs/fair-center-clustering-in-sliding-windows-2503.052602025-03-10 https://scifaro.com/en/abs/on-the-parameterized-complexity-of-odd-coloring-2503.053122025-03-10 https://scifaro.com/en/abs/strassen-s-algorithm-via-orbit-flip-graphs-2503.054672025-03-10 https://scifaro.com/en/abs/time-optimal-k-server-2503.055892025-03-10 https://scifaro.com/en/abs/bridging-classical-and-quantum-string-matching-a-computational-reformulation-of-bit-parallelism-2503.055962025-03-10 https://scifaro.com/en/abs/improving-merge-sort-and-quick-sort-performance-by-utilizing-alphadev-s-sorting-networks-as-base-cases-2503.059342026-04-29 https://scifaro.com/en/abs/the-connectivity-carcass-of-a-vertex-subset-in-a-graph-both-odd-and-even-case-2503.062662026-03-26 https://scifaro.com/en/abs/detecting-correlation-efficiently-in-stochastic-block-models-breaking-otter-s-threshold-in-the-entire-supercritical-regime-2503.064642025-09-25 https://scifaro.com/en/abs/faster-and-space-efficient-indexing-for-locality-sensitive-hashing-2503.067372025-07-18 https://scifaro.com/en/abs/inverting-parameterized-burrows-wheeler-transform-2503.069702025-05-12 https://scifaro.com/en/abs/encoding-schemes-for-parallel-in-place-algorithms-2503.069992025-03-11 https://scifaro.com/en/abs/encoding-co-lex-orders-of-finite-state-automata-in-linear-space-2503.070612025-03-11 https://scifaro.com/en/abs/buffered-partially-persistent-external-memory-search-trees-2503.082112025-03-12 https://scifaro.com/en/abs/cost-driven-prunings-for-iterative-solving-of-constrained-routing-problem-with-srlg-disjoint-protection-2503.082622025-08-05 https://scifaro.com/en/abs/on-deleting-vertices-to-reduce-density-in-graphs-and-supermodular-functions-2503.088282025-03-13 https://scifaro.com/en/abs/beyond-2-approximation-for-k-center-in-graphs-2503.094682025-03-13 https://scifaro.com/en/abs/bounding-the-optimal-performance-of-online-randomized-primal-dual-methods-2503.095082025-12-16 https://scifaro.com/en/abs/correcting-the-foundational-analysis-of-karp-vazirani-vazirani-stoc-1990-a-rigorous-revision-of-the-1-1-e-upper-bound-2503.095302025-11-25 https://scifaro.com/en/abs/availability-is-all-you-need-achieving-optimal-regret-with-minimal-information-for-dynamic-matching-2503.097622026-02-19 https://scifaro.com/en/abs/approximately-counting-and-sampling-hamiltonian-motifs-in-sublinear-time-2503.098102025-03-14 https://scifaro.com/en/abs/parallel-batch-dynamic-maximal-matching-with-constant-work-per-update-2503.099082025-10-24 https://scifaro.com/en/abs/morphishash-improving-space-efficiency-of-shockhash-for-minimal-perfect-hashing-2503.101612025-07-03 https://scifaro.com/en/abs/an-almost-quadratic-vertex-kernel-for-subset-feedback-arc-set-in-tournaments-2503.104472025-03-14 https://scifaro.com/en/abs/matrix-scaling-a-new-heuristic-for-the-feedback-vertex-set-problem-2503.107802025-03-17 https://scifaro.com/en/abs/a-2-varepsilon-approximation-algorithm-for-metric-k-median-2503.109722026-05-21 https://scifaro.com/en/abs/approximating-the-total-variation-distance-between-gaussians-2503.110992025-03-17 https://scifaro.com/en/abs/discrete-effort-distribution-via-regret-enabled-greedy-algorithm-2503.111072025-09-10 https://scifaro.com/en/abs/sum-of-max-chain-partition-of-a-tree-2503.115262025-03-17 https://scifaro.com/en/abs/enhanced-approximation-algorithms-for-the-capacitated-location-routing-problem-2503.125022025-03-18 https://scifaro.com/en/abs/optimal-mass-estimation-in-the-conditional-sampling-model-2503.125182025-10-22 https://scifaro.com/en/abs/impact-of-knowledge-on-the-cost-of-treasure-hunt-in-trees-2503.131002025-03-18 https://scifaro.com/en/abs/parallel-minimum-cost-flow-in-near-linear-work-and-square-root-depth-for-dense-instances-2503.132742025-03-18 https://scifaro.com/en/abs/hierarchical-multicriteria-shortest-path-search-2503.133142025-03-18 https://scifaro.com/en/abs/a-1-epsilon-approximation-for-ultrametric-embedding-in-subquadratic-time-2503.134092025-03-18 https://scifaro.com/en/abs/graph-discovery-and-source-detection-in-temporal-graphs-2503.135672025-03-19 https://scifaro.com/en/abs/optimal-non-oblivious-open-addressing-2503.136282025-03-19 https://scifaro.com/en/abs/branch-prediction-analysis-of-morris-pratt-and-knuth-morris-pratt-algorithms-2503.136942025-03-19 https://scifaro.com/en/abs/color-constrained-arborescences-in-edge-colored-digraphs-2503.139842025-03-19 https://scifaro.com/en/abs/streaming-and-massively-parallel-algorithms-for-euclidean-max-cut-2503.143622025-03-19 https://scifaro.com/en/abs/a-variational-calculus-approach-to-online-algorithm-design-and-analysis-2503.148202025-03-20 https://scifaro.com/en/abs/on-g-p-unimodality-of-radius-functions-in-graphs-structure-and-algorithms-2503.150112025-03-20 https://scifaro.com/en/abs/fine-grained-complexity-of-computing-degree-constrained-spanning-trees-2503.152262026-05-05 https://scifaro.com/en/abs/online-matching-under-kiid-enhanced-competitive-analysis-through-ordinary-differential-equation-systems-2503.153992025-03-20 https://scifaro.com/en/abs/a-space-efficient-algorithm-for-longest-common-almost-increasing-subsequence-of-two-sequences-2503.154422025-05-08 https://scifaro.com/en/abs/a-parallel-algorithm-for-the-odd-two-face-shortest-k-disjoint-path-problem-2503.163362025-03-21 https://scifaro.com/en/abs/fast-online-node-labeling-with-graph-subsampling-2503.167552025-07-08 https://scifaro.com/en/abs/a-3-3904-competitive-online-algorithm-for-list-update-with-uniform-costs-2503.172642025-08-11 https://scifaro.com/en/abs/on-the-approximability-of-unsplittable-flow-on-a-path-with-time-windows-2503.178022025-03-25 https://scifaro.com/en/abs/approximation-schemes-for-k-subset-sum-ratio-and-k-way-number-partitioning-ratio-2503.182412025-09-05 https://scifaro.com/en/abs/epsilon-cost-sharding-scaling-hypergraph-based-static-functions-and-filters-to-trillions-of-keys-2503.183972025-04-08 https://scifaro.com/en/abs/faster-construction-of-a-planar-distance-oracle-with-o-1-query-time-2503.184252025-03-25 https://scifaro.com/en/abs/optimal-fault-tolerant-labeling-for-reachability-and-approximate-distances-in-directed-planar-graphs-2503.184742025-03-25 https://scifaro.com/en/abs/bernstein-vazirani-algorithm-with-a-ccnot-based-oracle-2503.189512025-03-26 https://scifaro.com/en/abs/an-efficient-frequency-based-approach-for-maximal-square-detection-in-binary-matrices-2503.189742025-07-22 https://scifaro.com/en/abs/privately-evaluating-untrusted-black-box-functions-2503.192682025-04-25 https://scifaro.com/en/abs/long-arithmetic-progressions-in-sumsets-and-subset-sums-constructive-proofs-and-efficient-witnesses-2503.192992025-04-08 https://scifaro.com/en/abs/improved-approximation-algorithms-for-three-dimensional-knapsack-2503.193652025-03-26 https://scifaro.com/en/abs/online-stochastic-matching-with-unknown-arrival-order-beating-0-5-against-the-online-optimum-2503.194562025-03-26 https://scifaro.com/en/abs/approximating-q-rightarrow-p-norms-of-non-negative-matrices-in-nearly-linear-time-2503.195532025-03-26 https://scifaro.com/en/abs/lifting-linear-sketches-optimal-bounds-and-adversarial-robustness-2503.196292025-03-26 https://scifaro.com/en/abs/multiplication-of-0-1-matrices-via-clustering-2503.196312025-12-30 https://scifaro.com/en/abs/online-disjoint-spanning-trees-and-polymatroid-bases-2503.199992025-03-27 https://scifaro.com/en/abs/beyond-worst-case-subset-sum-an-adaptive-structure-aware-solver-with-sub-2-n-2-enumeration-2503.201622025-12-04 https://scifaro.com/en/abs/global-vs-s-t-vertex-connectivity-beyond-sequential-almost-perfect-reductions-near-optimal-separations-2503.203662025-03-27 https://scifaro.com/en/abs/solving-the-correlation-cluster-lp-in-sublinear-time-2503.208832025-11-05 https://scifaro.com/en/abs/deterministic-vertex-connectivity-via-common-neighborhood-clustering-and-pseudorandomness-2503.209852025-03-28 https://scifaro.com/en/abs/on-the-hardness-hierarchy-for-the-o-n-sqrt-log-n-complexity-in-the-word-ram-2503.210492025-06-19 https://scifaro.com/en/abs/a-quantum-constraint-generation-framework-for-binary-linear-programs-2503.212222026-02-13 https://scifaro.com/en/abs/a-tolerant-independent-set-tester-2503.214412025-03-28 https://scifaro.com/en/abs/output-sensitive-approximate-counting-via-a-measure-bounded-hyperedge-oracle-or-how-asymmetry-helps-estimate-k-clique-counts-faster-2503.216552025-03-28 https://scifaro.com/en/abs/fully-dynamic-biconnectivity-in-tilde-mathcal-o-log-2-n-time-2503.217332025-03-28 https://scifaro.com/en/abs/on-finding-all-connected-maximum-sized-common-subgraphs-in-multiple-labeled-graphs-2503.223682025-04-03 https://scifaro.com/en/abs/distributed-freeze-tag-a-sustainable-solution-to-discover-and-wake-up-a-robot-swarm-2503.225212025-03-31 https://scifaro.com/en/abs/randomized-tilde-o-m-sqrt-n-bellman-ford-from-fineman-and-the-boilermakers-2503.226132025-04-11 https://scifaro.com/en/abs/light-tree-covers-routing-and-path-reporting-oracles-via-spanning-tree-covers-in-doubling-graphs-2503.226692025-03-31 https://scifaro.com/en/abs/length-constrained-directed-expander-decomposition-and-length-constrained-vertex-capacitated-flow-shortcuts-2503.232172025-04-01 https://scifaro.com/en/abs/improved-algorithms-for-single-machine-serial-batch-scheduling-to-minimize-makespan-and-maximum-cost-2503.232732025-04-01 https://scifaro.com/en/abs/generalized-capacity-planning-for-the-hospital-residents-problem-2503.233282025-04-01 https://scifaro.com/en/abs/multi-pass-streaming-lower-bounds-for-approximating-max-cut-2503.234042025-09-08 https://scifaro.com/en/abs/network-unreliability-in-almost-linear-time-2503.235262025-04-01 https://scifaro.com/en/abs/space-of-data-through-the-lens-of-multilevel-graph-2503.236022025-04-01 https://scifaro.com/en/abs/word-break-on-slp-compressed-texts-2503.237592025-06-19 https://scifaro.com/en/abs/sample-optimal-private-regression-in-polynomial-time-2503.243212025-04-01 https://scifaro.com/en/abs/accelerated-approximate-optimization-of-multi-commodity-flows-on-directed-graphs-2503.243732025-04-01 https://scifaro.com/en/abs/how-to-protect-yourself-from-threatening-skeletons-optimal-padded-decompositions-for-minor-free-graphs-2504.002782025-04-02 https://scifaro.com/en/abs/expander-pruning-with-polylogarithmic-worst-case-recourse-and-update-time-2504.005442025-04-02 https://scifaro.com/en/abs/limtdd-a-compact-decision-diagram-integrating-tensor-and-local-invertible-map-representations-2504.011682025-10-21 https://scifaro.com/en/abs/splinesketch-even-more-accurate-quantiles-with-error-guarantees-2504.012062025-09-12 https://scifaro.com/en/abs/computing-time-varying-network-reliability-using-binary-decision-diagrams-2504.013392025-04-03 https://scifaro.com/en/abs/diameter-shortcut-sets-on-temporal-graphs-2504.014852025-04-03 https://scifaro.com/en/abs/generalized-assignment-and-knapsack-problems-in-the-random-order-model-2504.014862025-04-03 https://scifaro.com/en/abs/local-computation-algorithms-for-knapsack-impossibility-results-and-how-to-avoid-them-2504.015432025-04-03 https://scifaro.com/en/abs/cutwidth-bounds-via-vertex-partitions-2504.015742025-04-04 https://scifaro.com/en/abs/distributed-triangle-detection-is-hard-in-few-rounds-2504.018022025-08-14 https://scifaro.com/en/abs/a-ptas-for-travelling-salesman-problem-with-neighbourhoods-over-parallel-line-segments-of-similar-length-2504.021902025-04-17 https://scifaro.com/en/abs/efficient-computation-of-hyper-triangles-on-hypergraphs-2504.022712025-04-04 https://scifaro.com/en/abs/finding-diverse-solutions-in-combinatorial-problems-with-a-distributive-lattice-structure-2504.023692025-04-04 https://scifaro.com/en/abs/balanced-connected-partitions-of-edge-weighted-graphs-hardness-and-solving-methods-2504.024212025-08-21 https://scifaro.com/en/abs/computing-high-dimensional-confidence-sets-for-arbitrary-distributions-2504.027232025-05-14 https://scifaro.com/en/abs/faster-mixing-of-the-jerrum-sinclair-chain-2504.027402025-04-04 https://scifaro.com/en/abs/dynamic-treewidth-in-logarithmic-time-2504.027902025-04-14 https://scifaro.com/en/abs/an-extended-symbolic-arithmetic-model-for-teaching-double-black-removal-with-rotation-in-red-black-trees-2504.032592025-04-07 https://scifaro.com/en/abs/a-generalized-binary-tree-mechanism-for-differentially-private-approximation-of-all-pair-distances-2504.033542025-04-07 https://scifaro.com/en/abs/improved-circular-dictionary-matching-2504.033942025-04-07 https://scifaro.com/en/abs/rapid-mixing-on-random-regular-graphs-beyond-uniqueness-2504.034062025-11-13 https://scifaro.com/en/abs/local-search-for-clustering-in-almost-linear-time-2504.035132025-04-07 https://scifaro.com/en/abs/tight-analysis-of-the-primal-dual-method-for-edge-covering-pliable-set-families-2504.039102025-05-27 https://scifaro.com/en/abs/operational-research-approaches-and-mathematical-models-for-kidney-exchange-a-literature-survey-and-empirical-evaluation-2504.040912025-09-03 https://scifaro.com/en/abs/optimal-smoothed-analysis-of-the-simplex-method-2504.041972026-05-26 https://scifaro.com/en/abs/correlation-clustering-and-de-sparsification-graph-sketches-can-match-classical-algorithms-2504.042582025-04-08 https://scifaro.com/en/abs/efficient-rejection-sampling-in-the-entropy-optimal-range-2504.042672026-04-28 https://scifaro.com/en/abs/binned-group-algebra-factorization-for-differentially-private-continual-counting-2504.043982025-04-08 https://scifaro.com/en/abs/online-facility-assignments-on-polygons-2504.045562025-04-08 https://scifaro.com/en/abs/new-algorithms-for-incremental-minimum-spanning-trees-and-temporal-graph-applications-2504.046192025-05-13 https://scifaro.com/en/abs/automating-the-search-for-small-hard-examples-to-approximation-algorithms-2504.047382025-04-29 https://scifaro.com/en/abs/the-complexity-of-maximal-common-subsequence-enumeration-2504.047572025-04-08 https://scifaro.com/en/abs/radial-isotropic-position-via-an-implicit-newton-s-method-2504.056872025-04-09 https://scifaro.com/en/abs/linear-space-lcs-enumeration-with-quadratic-time-delay-for-two-strings-2504.057422025-05-23 https://scifaro.com/en/abs/kronecker-scaling-of-tensors-with-applications-to-arithmetic-circuits-and-algorithms-2504.057722025-04-09 https://scifaro.com/en/abs/a-method-for-generating-connected-erdos-renyi-random-graphs-2504.059072025-10-21 https://scifaro.com/en/abs/indexing-strings-with-utilities-2504.059172025-04-09 https://scifaro.com/en/abs/parallel-small-vertex-connectivity-in-near-linear-work-and-polylogarithmic-depth-2504.060332025-04-09 https://scifaro.com/en/abs/faster-algorithms-for-reverse-shortest-path-in-unit-disk-graphs-and-related-geometric-optimization-problems-improving-the-shrink-and-bifurcate-technique-2504.064342025-04-10 https://scifaro.com/en/abs/single-source-shortest-path-problem-in-weighted-disk-graphs-2504.065342025-04-10 https://scifaro.com/en/abs/handling-lp-rounding-for-hierarchical-clustering-and-fitting-distances-by-ultrametrics-2504.067002025-04-10 https://scifaro.com/en/abs/matching-and-edge-cover-in-temporal-graphs-2504.067622025-04-10 https://scifaro.com/en/abs/grouping-strategies-on-two-phase-methods-for-bi-objective-combinatorial-optimization-2504.068692025-04-10 https://scifaro.com/en/abs/clustering-under-constraints-efficient-parameterized-approximation-schemes-2504.069802026-02-10 https://scifaro.com/en/abs/perfect-sampling-in-turnstile-streams-beyond-small-moments-2504.072372025-04-11 https://scifaro.com/en/abs/fast-algorithms-for-complex-valued-discrete-fourier-transform-with-separate-real-and-imaginary-inputs-outputs-2504.072642025-04-11 https://scifaro.com/en/abs/incremental-planar-nearest-neighbor-queries-with-optimal-query-time-2504.073662025-04-11 https://scifaro.com/en/abs/multiplicative-assignment-with-upgrades-2504.076632025-04-11 https://scifaro.com/en/abs/approximation-algorithms-for-connected-maximum-coverage-minimum-connected-set-cover-and-node-weighted-group-steiner-tree-2504.077252025-04-11 https://scifaro.com/en/abs/directed-temporal-tree-realization-for-periodic-public-transport-easy-and-hard-cases-2504.079202025-09-15 https://scifaro.com/en/abs/string-problems-in-the-congested-clique-model-2504.083762025-04-14 https://scifaro.com/en/abs/faster-shortest-path-algorithms-using-the-acyclic-connected-tree-2504.086672026-03-12 https://scifaro.com/en/abs/the-trie-measure-revisited-2504.107032025-04-16 https://scifaro.com/en/abs/robust-gittins-for-stochastic-scheduling-2504.107432025-04-16 https://scifaro.com/en/abs/an-improved-fully-dynamic-algorithm-for-counting-4-cycles-in-general-graphs-using-fast-matrix-multiplication-2504.107482025-04-16 https://scifaro.com/en/abs/tighter-bounds-on-non-clairvoyant-parallel-machine-scheduling-with-prediction-to-minimize-makespan-2504.109452025-04-16 https://scifaro.com/en/abs/beacon-a-benchmark-for-efficient-and-accurate-counting-of-subgraphs-2504.109482025-04-16 https://scifaro.com/en/abs/covering-approximate-shortest-paths-with-dags-2504.112562025-04-16 https://scifaro.com/en/abs/breaking-a-long-standing-barrier-2-varepsilon-approximation-for-steiner-forest-2504.113982025-04-16 https://scifaro.com/en/abs/optimal-hardness-of-online-algorithms-for-large-independent-sets-2504.114502026-02-03 https://scifaro.com/en/abs/engineering-multiqueues-fast-relaxed-concurrent-priority-queues-2504.116522025-04-17 https://scifaro.com/en/abs/enumeration-of-bases-in-matroid-with-exponentially-large-ground-set-2504.117282025-09-15 https://scifaro.com/en/abs/static-to-dynamic-correlation-clustering-2504.120602026-05-12 https://scifaro.com/en/abs/kernels-for-storage-capacity-and-dual-index-coding-2504.122742025-04-17 https://scifaro.com/en/abs/a-near-optimal-kernel-for-a-coloring-problem-2504.122812025-04-17 https://scifaro.com/en/abs/trading-prophets-how-to-trade-multiple-stocks-optimally-2504.128232025-04-21 https://scifaro.com/en/abs/towards-optimal-distributed-edge-coloring-with-fewer-colors-2504.130032025-05-27 https://scifaro.com/en/abs/a-bad-example-for-jain-s-iterative-rounding-theorem-for-the-cover-small-cuts-problem-2504.131052025-04-18 https://scifaro.com/en/abs/new-results-on-a-general-class-of-minimum-norm-optimization-problems-2504.134892025-05-01 https://scifaro.com/en/abs/broadcasting-under-structural-restrictions-2504.136692025-04-21 https://scifaro.com/en/abs/robust-distributed-arrays-provably-secure-networking-for-data-availability-sampling-2504.137572025-04-24 https://scifaro.com/en/abs/a-new-impossibility-result-for-online-bipartite-matching-problems-2504.142512025-04-29 https://scifaro.com/en/abs/temporal-graph-realization-with-bounded-stretch-2504.142582025-04-22 https://scifaro.com/en/abs/polynomial-time-constant-approximation-for-fair-sum-of-radii-clustering-2504.146832025-08-04 https://scifaro.com/en/abs/approximate-all-pairs-hamming-distances-and-0-1-matrix-multiplication-2504.147232025-04-22 https://scifaro.com/en/abs/the-k-center-problem-of-uncertain-points-on-graphs-2504.148032025-12-22 https://scifaro.com/en/abs/weakly-approximating-knapsack-in-subquadratic-time-2504.150012025-04-23 https://scifaro.com/en/abs/deterministic-k-median-clustering-in-near-optimal-time-2504.151152026-03-31 https://scifaro.com/en/abs/distribution-testing-meets-sum-estimation-2504.151532025-04-22 https://scifaro.com/en/abs/determining-implication-of-fixed-matrix-prenex-normal-forms-can-be-decided-in-linear-time-2504.152942025-04-23 https://scifaro.com/en/abs/prize-collecting-forest-with-submodular-penalties-improved-approximation-2504.154452025-04-23 https://scifaro.com/en/abs/adaptivity-gaps-for-stochastic-probing-with-subadditive-functions-2504.155472025-10-17 https://scifaro.com/en/abs/on-the-price-of-differential-privacy-for-hierarchical-clustering-2504.155802025-04-23 https://scifaro.com/en/abs/towards-true-work-efficiency-in-parallel-derandomization-mis-maximal-matching-and-hitting-set-2504.157002025-04-23 https://scifaro.com/en/abs/branch-and-bound-algorithms-as-polynomial-time-approximation-schemes-2504.158852026-04-03 https://scifaro.com/en/abs/a-mysterious-connection-between-tolerant-junta-testing-and-agnostically-learning-conjunctions-2504.160652025-04-23 https://scifaro.com/en/abs/updating-lower-and-upper-bounds-for-the-job-shop-scheduling-problem-test-instances-2504.161062025-04-24 https://scifaro.com/en/abs/a-theory-of-spectral-csp-sparsification-2504.162062025-04-24 https://scifaro.com/en/abs/fast-space-optimal-streaming-algorithms-for-clustering-and-subspace-embeddings-2504.162292025-04-24 https://scifaro.com/en/abs/linear-time-subsequence-and-supersequence-regex-matching-2504.162882025-08-21 https://scifaro.com/en/abs/near-optimal-hypergraph-sparsification-in-insertion-only-and-bounded-deletion-streams-2504.163212025-04-24 https://scifaro.com/en/abs/universal-online-contention-resolution-with-preselected-order-2504.163272025-04-24 https://scifaro.com/en/abs/fully-scalable-mpc-algorithms-for-euclidean-k-center-2504.163822025-04-28 https://scifaro.com/en/abs/an-explicit-and-efficient-o-n-2-time-algorithm-for-sorting-sumsets-2504.163932025-04-24 https://scifaro.com/en/abs/hardness-of-median-and-center-in-the-ulam-metric-2504.164372025-04-28 https://scifaro.com/en/abs/multiplicative-spanners-in-minor-free-graphs-2504.164632025-04-24 https://scifaro.com/en/abs/improved-streaming-edge-coloring-2504.164702025-04-24 https://scifaro.com/en/abs/estimating-random-walk-probabilities-in-directed-graphs-2504.164812026-05-19 https://scifaro.com/en/abs/streaming-algorithms-for-products-of-probabilities-2504.165072025-10-02 https://scifaro.com/en/abs/sorting-as-gradient-flow-on-the-permutohedron-2504.167062025-04-24 https://scifaro.com/en/abs/from-theory-to-practice-engineering-approximation-algorithms-for-dynamic-orientation-2504.167202025-07-03 https://scifaro.com/en/abs/traffic-oblivious-multi-commodity-flow-network-design-2504.167442025-09-17 https://scifaro.com/en/abs/graph-modification-of-bounded-size-to-minor-closed-classes-as-fast-as-vertex-deletion-2504.168032025-10-16 https://scifaro.com/en/abs/approximating-optimal-labelings-for-temporal-connectivity-2504.168372025-04-24 https://scifaro.com/en/abs/identifying-approximate-minimizers-under-stochastic-uncertainty-2504.170192025-04-25 https://scifaro.com/en/abs/breaking-the-sorting-barrier-for-directed-single-source-shortest-paths-2504.170332025-07-31 https://scifaro.com/en/abs/knapsack-on-graphs-with-relaxed-neighborhood-constraints-2504.172972025-04-25 https://scifaro.com/en/abs/simpler-universally-optimal-dijkstra-2504.173272026-03-13 https://scifaro.com/en/abs/edge-weighted-online-stochastic-matching-under-jaillet-lu-lp-2504.173922026-05-12 https://scifaro.com/en/abs/the-case-for-external-graph-sketching-2504.175632025-04-25 https://scifaro.com/en/abs/linear-time-multilevel-graph-partitioning-via-edge-sparsification-2504.176152025-04-25 https://scifaro.com/en/abs/a-general-framework-for-finding-diverse-solutions-via-network-flow-and-its-applications-2504.176332025-04-25 https://scifaro.com/en/abs/pushing-the-frontiers-of-subexponential-fpt-time-for-feedback-vertex-set-2504.177082026-01-16 https://scifaro.com/en/abs/online-metric-tsp-2504.177162025-07-08 https://scifaro.com/en/abs/realization-of-temporally-connected-graphs-based-on-degree-sequences-2504.177432026-05-06 https://scifaro.com/en/abs/fitting-tree-metrics-and-ultrametrics-in-data-streams-2504.177762025-04-25 https://scifaro.com/en/abs/geodetic-set-on-graphs-of-constant-pathwidth-and-feedback-vertex-set-number-2504.178622025-04-28 https://scifaro.com/en/abs/color-fault-tolerant-distance-preservers-o-ptimal-size-in-conditionally-o-ptimal-time-2504.178682026-05-01 https://scifaro.com/en/abs/searching-in-trees-with-k-up-modular-cost-functions-2504.178872025-10-01 https://scifaro.com/en/abs/phast-perfect-hashing-made-fast-2504.179182025-10-23 https://scifaro.com/en/abs/an-optimal-3-fault-tolerant-connectivity-oracle-2504.179372025-04-28 https://scifaro.com/en/abs/improving-the-threshold-for-finding-rank-1-matrices-in-a-subspace-2504.179472025-04-28 https://scifaro.com/en/abs/complexity-and-approximation-algorithms-for-fixed-charge-transportation-problems-2504.180372025-04-28 https://scifaro.com/en/abs/fully-dynamic-algorithms-for-transitive-reduction-2504.181612025-04-28 https://scifaro.com/en/abs/solving-partial-dominating-set-and-related-problems-using-twin-width-2504.182182025-07-01 https://scifaro.com/en/abs/treewidth-parameterized-by-feedback-vertex-number-2504.183022026-05-19 https://scifaro.com/en/abs/computing-distances-is-fpt-on-graph-associahedra-and-w-2-hard-on-hypergraphic-polytopes-2504.183382026-03-24 https://scifaro.com/en/abs/maximum-coverage-in-turnstile-streams-with-applications-to-fingerprinting-measures-2504.183942025-05-08 https://scifaro.com/en/abs/subexponential-and-parameterized-mixing-times-of-glauber-dynamics-on-independent-sets-2504.184272025-11-24 https://scifaro.com/en/abs/boundaried-kernelization-2504.184762025-04-28 https://scifaro.com/en/abs/online-distributed-queue-length-estimation-2504.185032025-04-28 https://scifaro.com/en/abs/minimum-cost-nowhere-zero-flows-and-cut-balanced-orientations-2504.187672025-04-29 https://scifaro.com/en/abs/min-csps-on-complete-instances-ii-polylogarithmic-approximation-for-min-nae-3-sat-2504.190512025-04-29 https://scifaro.com/en/abs/entrywise-approximation-for-matrix-inversion-and-linear-systems-2504.190542025-10-23 https://scifaro.com/en/abs/fast-and-memory-efficient-bwt-construction-of-repetitive-texts-using-lyndon-grammars-2504.191232025-09-24 https://scifaro.com/en/abs/the-trichotomy-of-regular-property-testing-2504.191522025-04-29 https://scifaro.com/en/abs/almost-optimal-fpt-algorithm-and-kernel-for-t-cycle-on-planar-graphs-2504.193012025-04-29 https://scifaro.com/en/abs/optimal-static-fully-indexable-dictionaries-2504.193502025-04-29 https://scifaro.com/en/abs/dynamic-r-index-an-updatable-self-index-in-lcp-bounded-time-2504.194822025-10-30 https://scifaro.com/en/abs/space-efficient-depth-first-search-via-augmented-succinct-graph-encodings-2504.195472025-04-29 https://scifaro.com/en/abs/faster-dynamic-delta-1-coloring-against-adaptive-adversaries-2504.197292025-07-08 https://scifaro.com/en/abs/near-optimal-minimum-cuts-in-hypergraphs-at-scale-2504.198422025-05-01 https://scifaro.com/en/abs/revisiting-directed-disjoint-paths-on-tournaments-and-relatives-2504.199572025-04-29 https://scifaro.com/en/abs/engineering-minimal-k-perfect-hash-functions-2504.200012025-07-03 https://scifaro.com/en/abs/all-subsets-important-separators-with-applications-to-sample-sets-balanced-separators-and-vertex-sparsifiers-in-directed-graphs-2504.200272025-04-29 https://scifaro.com/en/abs/list-decoding-expander-based-codes-up-to-capacity-in-near-linear-time-2504.203332025-07-18 https://scifaro.com/en/abs/breaking-the-barrier-of-self-concordant-barriers-faster-interior-point-methods-for-m-matrices-2504.206192025-04-30 https://scifaro.com/en/abs/deterministic-dynamic-maximal-matching-in-sublinear-update-time-2504.207802025-09-01 https://scifaro.com/en/abs/effective-index-construction-algorithm-for-optimal-k-eta-cores-computation-2504.207952025-04-30 https://scifaro.com/en/abs/online-general-knapsack-with-reservation-costs-2504.208552025-04-30 https://scifaro.com/en/abs/guessing-efficiently-for-constrained-subspace-approximation-2504.208832025-04-30 https://scifaro.com/en/abs/tight-bounds-for-heavy-hitters-and-moment-estimation-in-the-sliding-window-model-2504.211752025-05-01 https://scifaro.com/en/abs/efficiently-finding-all-minimal-and-shortest-absent-subsequences-in-a-string-2504.214712025-05-01 https://scifaro.com/en/abs/online-knapsack-problems-with-estimates-2504.217502025-05-01 https://scifaro.com/en/abs/near-optimal-distributed-ruling-sets-for-trees-and-high-girth-graphs-2504.217772026-04-03 https://scifaro.com/en/abs/minimizing-envy-and-maximizing-happiness-in-graphical-house-allocation-2505.002962026-02-10 https://scifaro.com/en/abs/new-distributed-interactive-proofs-for-planarity-a-matter-of-left-and-right-2505.003382025-07-10 https://scifaro.com/en/abs/faster-all-pairs-optimal-electric-car-routing-2505.007282025-05-05 https://scifaro.com/en/abs/lower-bounds-for-non-adaptive-local-computation-algorithms-2505.009152025-05-05 https://scifaro.com/en/abs/cluster-deletion-and-clique-partitioning-in-graphs-with-bounded-clique-number-2505.009222025-09-26 https://scifaro.com/en/abs/lzd-style-compression-scheme-with-truncation-and-repetitions-2505.009702025-05-05 https://scifaro.com/en/abs/shuffling-cards-when-you-are-of-very-little-brain-low-memory-generation-of-permutations-2505.012872025-06-10 https://scifaro.com/en/abs/a-matrix-product-state-representation-of-boolean-functions-2505.019302025-05-13 https://scifaro.com/en/abs/faster-logconcave-sampling-from-a-cold-start-in-high-dimension-2505.019372025-05-06 https://scifaro.com/en/abs/exact-set-packing-in-multimodal-transportation-with-ridesharing-system-for-first-last-mile-2505.019892025-05-06 https://scifaro.com/en/abs/unifying-laplace-mechanism-with-instance-optimality-in-differential-privacy-2505.027982025-05-06 https://scifaro.com/en/abs/single-sample-and-robust-online-resource-allocation-2505.029632025-05-07 https://scifaro.com/en/abs/stochastic-scheduling-with-bernoulli-type-jobs-through-policy-stratification-2505.033492025-05-07 https://scifaro.com/en/abs/planar-disjoint-shortest-paths-is-fixed-parameter-tractable-2505.033532025-05-07 https://scifaro.com/en/abs/gpu-implementation-of-the-wavelet-tree-2505.033722025-05-07 https://scifaro.com/en/abs/a-practical-algorithm-for-2-admissibility-2505.034192025-05-08 https://scifaro.com/en/abs/location-restricted-stable-matching-2505.036802025-08-05 https://scifaro.com/en/abs/differentially-private-and-scalable-estimation-of-the-network-principal-component-2505.038582026-03-06 https://scifaro.com/en/abs/bicluster-editing-with-overlaps-a-vertex-splitting-approach-2505.039592025-11-18 https://scifaro.com/en/abs/the-kinetic-hourglass-data-structure-for-computing-the-bottleneck-distance-of-dynamic-data-2505.040482026-05-25 https://scifaro.com/en/abs/light-spanners-with-small-hop-diameter-2505.045362025-05-08 https://scifaro.com/en/abs/fast-pattern-matching-with-epsilon-transitions-2505.045492025-08-05 https://scifaro.com/en/abs/pssketch-finding-persistent-and-sparse-flow-with-high-accuracy-and-efficiency-2505.048922025-05-09 https://scifaro.com/en/abs/with-a-little-help-from-my-friends-exploiting-probability-distribution-advice-in-algorithm-design-2505.049492025-09-09 https://scifaro.com/en/abs/zip-tries-simple-dynamic-data-structures-for-strings-2505.049532025-08-21 https://scifaro.com/en/abs/learning-partitions-with-optimal-query-and-round-complexities-2505.050092025-06-24 https://scifaro.com/en/abs/efficient-parallel-ising-samplers-via-localization-schemes-2505.051852025-05-09 https://scifaro.com/en/abs/overlapping-biclustering-2505.052132025-12-02 https://scifaro.com/en/abs/inftda-a-simple-topdown-mechanism-for-hierarchical-differentially-private-counting-queries-2505.053472025-05-09 https://scifaro.com/en/abs/all-to-all-communication-with-mobile-edge-adversary-almost-linearly-more-faults-for-free-2505.057352025-05-12 https://scifaro.com/en/abs/persiansort-an-alternative-to-mergesort-inspired-by-persian-rug-2505.057752026-03-02 https://scifaro.com/en/abs/smaller-and-more-flexible-cuckoo-filters-2505.058472025-09-10 https://scifaro.com/en/abs/a-polynomial-time-approximation-algorithm-for-complete-interval-minors-2505.059972025-05-12 https://scifaro.com/en/abs/second-price-matching-with-complete-allocation-and-degree-constraints-2505.060052025-05-12 https://scifaro.com/en/abs/learning-augmented-algorithms-for-boolean-satisfiability-2505.061462025-06-03 https://scifaro.com/en/abs/equalizing-closeness-centralities-via-edge-additions-2505.062222025-05-12 https://scifaro.com/en/abs/an-improved-algorithm-for-a-bipartite-traveling-tournament-in-interleague-sports-scheduling-2505.068282025-05-13 https://scifaro.com/en/abs/reconfiguring-multiple-connected-components-with-size-multiset-constraints-2505.072682025-05-13 https://scifaro.com/en/abs/improved-mixing-of-critical-hardcore-model-2505.075152026-01-08 https://scifaro.com/en/abs/tensor-sketch-fast-and-scalable-polynomial-kernel-approximation-2505.081462025-05-20 https://scifaro.com/en/abs/uniform-universal-sets-splitters-and-bisectors-2505.083082025-05-14 https://scifaro.com/en/abs/fully-dynamic-euclidean-bi-chromatic-matching-in-sublinear-update-time-2505.090102025-05-15 https://scifaro.com/en/abs/approximate-cartesian-tree-matching-with-one-difference-2505.092362025-05-15 https://scifaro.com/en/abs/structural-parameterization-of-steiner-tree-packing-2505.092502025-05-15 https://scifaro.com/en/abs/online-bin-packing-with-item-size-estimates-2505.093212025-05-15 https://scifaro.com/en/abs/a-dynamic-working-set-method-for-compressed-sensing-2505.093702025-06-09 https://scifaro.com/en/abs/an-asymptotically-optimal-approximation-algorithm-for-multiobjective-submodular-maximization-at-scale-2505.095252025-05-16 https://scifaro.com/en/abs/a-lossless-a-priori-splitting-rule-for-split-delivery-routing-problems-2505.096182025-05-16 https://scifaro.com/en/abs/experimental-algorithms-for-the-dualization-problem-2505.096422025-05-16 https://scifaro.com/en/abs/on-unbiased-low-rank-approximation-with-minimum-distortion-2505.096472026-03-18 https://scifaro.com/en/abs/xx-t-can-be-faster-2505.098142025-05-19 https://scifaro.com/en/abs/improved-rank-aggregation-under-fairness-constraint-2505.100062026-02-25 https://scifaro.com/en/abs/simpler-and-faster-directed-low-diameter-decompositions-2505.102442025-05-27 https://scifaro.com/en/abs/generalization-of-repetitiveness-measures-for-two-dimensional-strings-2505.106802025-05-19 https://scifaro.com/en/abs/bandwidth-vs-bfs-width-in-matrix-reordering-graph-reconstruction-and-graph-drawing-2505.107892025-07-10 https://scifaro.com/en/abs/locally-differentially-private-graph-clustering-via-the-power-iteration-method-2505.111692025-05-19 https://scifaro.com/en/abs/symbolic-model-checking-in-external-memory-2505.112292025-05-19 https://scifaro.com/en/abs/depth-first-representations-of-k-2-trees-2505.113022025-05-19 https://scifaro.com/en/abs/computing-in-a-faulty-congested-clique-2505.114302025-09-10 https://scifaro.com/en/abs/unsolvability-and-beyond-in-many-to-many-non-bipartite-stable-matching-2505.114562025-07-08 https://scifaro.com/en/abs/xisort-deterministic-sorting-via-ieee-754-total-ordering-and-entropy-minimization-2505.119272025-05-20