Showing 21 - 40 of 362

21

Approximating Multidimensional Subset Sum and the Minkowski Decomposition of Polygons
Emiris, Ioannis, Z. ; Karasoulou, Anna ; Tzovas, Charilaos ; et al.
Mathematics in Computer Science. 11:35-48

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics
Journal
Save to List
22

Some mathematical remarks on the polynomial selection in NFS
Barbulescu, Razvan ; Lachand, Armand ; Cryptology, arithmetic : algebraic methods for better algorithms (CARAMBA) ; et al.
Mathematics of Computation. 86:397-418

ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo... [INFO.INFO-CR]Computer S... Cryptography and Securit... [MATH.MATH-NT]Mathematic...
Journal
Save to List
23

Accurate self-correction of errors in long reads using de Bruijn graphs
Salmela, Leena ; Walve, Riku ; Rivals, Eric ; et al.
Bioinformatics. 33(6):799-806

substitution Sequence analysis PacBio DNA NGS de Bruijn
Journal
Save to List
24

A Penalized Best-Response Algorithm for Non-Linear Single-Path Routing Problems
Brun, Olivier ; Prabhu, Balakrishna ; Vallet, Josselin ; et al.
Networks. 69(1):52-66

Approximation algorithms best response single-path routing game theory non-linear programming Nash equilibrium
Journal
Save to List
25

Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots
Sheikh, Saad ; Backofen, Rolf ; Ponty, Yann ; et al.
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012. :321-333

Helsinki, Finland RNA folding General pseudoknots Hardness Inapproximability ACM: J.: Computer Applic...
Conference
Save to List
26

Large-girth roots of graphs
Adamaszek, Anna ; Adamaszek, Michal ; Department of Computer Science and DIMAP ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :35-46

Nancy, France Graph roots Graph powers NP-completeness Recognition algorithms ACM: G.: Mathematics of...
Conference
Save to List
27

The Traveling Salesman Problem Under Squared Euclidean Distances
de Berg, Mark ; van Nijnatten, Fred ; Sitters, Rene ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :239-250

Nancy, France APX-hard NP-hard distance-power gradient power-assignment in wire... Geometric traveling sale...
Conference
Save to List
28

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :251-262

Nancy, France Parameterized Subexponen... Directed Graphs Out-Branching Internal Out-Branching ACM: G.: Mathematics of...
Conference
Save to List
29

Planar Subgraph Isomorphism Revisited
Dorn, Frédéric ; Department of Informatics [Bergen] (UiB) ; University of Bergen (UiB) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :263-274

Nancy, France Graph algorithms Subgraph Isomorphism NP-hard problems Dynamic programming Topological graph theory
Conference
Save to List
30

Dispersion in unit disks
Dumitrescu, Adrian ; Jiang, Minghui ; Department of Computer Sciences [Madison] (CS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :299-310

Nancy, France Dispersion problem linear programming approximation algorithm ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
31

Long non-crossing configurations in the plane
Dumitrescu, Adrian ; Tóth, Csaba D. ; Department of Computer Sciences [Madison] (CS) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :311-322

Nancy, France Longest non-crossing Ham... longest non-crossing Ham... longest non-crossing spa... approximation algorithm ACM: F.: Theory of Compu...
Conference
Save to List
32

Evasiveness and the Distribution of Prime Numbers
Babai, Laszlo ; Banerjee, Anandam ; Kulkarni, Raghav ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :71-82

Nancy, France decision tree complexity evasiveness graph property group action Dirichlet primes
Conference
Save to List
33

The Complexity of Approximating Bounded-Degree Boolean #CSP
Dyer, Martin ; Ann Goldberg, Leslie ; Jalsenius, Markus ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :323-334

Nancy, France Boolean constraint satis... generalized satisfiabili... counting approximation algorithms ACM: F.: Theory of Compu...
Conference
Save to List
34

The k-in-a-path problem for claw-free graphs
Fiala, Jiří ; Kamiński, Marcin ; Lidický, Bernard ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :371-382

Nancy, France induced path claw-free graph polynomial-time algorith... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Conference
Save to List
35

Exact Covers via Determinants
Björklund, Andreas ; Department of Computer Science [Lund] ; Skane University Hospital [Lund] ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :95-106

Nancy, France moderately exponential t... exact set cover k-dimensional matching ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Conference
Save to List
36

On Iterated Dominance, Matrix Elimination, and Matched Paths
Brandt, Felix ; Fischer, Felix ; Holzer, Markus ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :107-118

Nancy, France Algorithmic Game Theory Computational Complexity Iterated Dominance Matching ACM: F.: Theory of Compu...
Conference
Save to List
37

A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
Jeż, Łukasz ; Institute of Computer Science ; University of Wrocław [Poland] (UWr) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :489-500

Nancy, France online algorithms scheduling buffer management ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
38

The Recognition of Tolerance and Bounded Tolerance Graphs
Mertzios, George B. ; Sau, Ignasi ; Zaks, Shmuel ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :585-596

Nancy, France Tolerance graphs bounded tolerance graphs recognition vertex splitting NPcomplete
Conference
Save to List
39

Construction Sequences and Certifying 3-Connectedness
Schmidt, Jens M. ; Dept. of Computer Science ; Freie Universität Berlin = Free University of Berlin ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :633-644

Nancy, France removable edges Tutte contraction certifying algorithm 3-connected construction sequence
Conference
Save to List
40

Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
Chan, Ho-Leung ; Lam, Tak-Wah ; Lee, Lap-Kei ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :179-190

Nancy, France Algorithms distributed data streams communication efficiency frequent items ACM: F.: Theory of Compu...
Conference
Save to List

Filter