Showing 41 - 60 of 3,807

41

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
42

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
43

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
44

Sponsored Search, Market Equilibria, and the Hungarian Method
Dütting, Paul ; Henzinger, Monika ; Weber, Ingmar ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :287-298

Nancy, France stablematching envy-free allocation general auction mechanis... general position ACM: F.: Theory of Compu...
Conference
Save to List
45

Dynamic sharing of a multiple access channel
Bienkowski, Marcin ; Klonowski, Marek ; Korzeniowski, Miroslaw ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :83-94

Nancy, France distributed algorithms multiple access channel mutual exclusion ACM: C.: Computer System... C.1: PROCESSOR ARCHITECT...
Conference
Save to List
46

An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem
Le Gall, François ; Department of Computer Science ; University of Tokyo [Tokyo] = Tōkyō teikoku daigaku (UTokyo) ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :549-560

Nancy, France Quantum Algorithms Group Isomorphism Proble... Black-box Groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
47

Online Correlation Clustering
Mathieu, Claire ; Sankur, Ocan ; Schudy, Warren ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :573-584

Nancy, France correlation clustering online algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Conference
Save to List
48

The tropical double description method
Allamigeon, Xavier ; Gaubert, Stéphane ; Goubault, Eric ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :47-58

Nancy, France convexity in tropical al... algorithmics and combina... computational geometry discrete event systems static analysis
Conference
Save to List
49

Towards distance-based phylogenetic inference in average-case linear-time
Crochemore, Maxime ; Francisco, Alexandre ; Pissis, Solon ; et al.
International Workshop on Algorithms in Bioinformatics, Aug 2017, Boston, MA, United States. ⟨10.4230/LIPIcs.WABI.2017.00⟩

Boston, MA, United State... F22 Nonnumerical Algorit... computational biology phylogenetic inference Hamming distance 1998 ACM Subject Classif...
Conference
Save to List
50

Separability of Reachability Sets of Vector Addition Systems
Clemente, Lorenzo ; Czerwiński, Wojciech ; Lasota, Sławomir ; et al.
STACS Symposium on Theoretical Aspects of Computer Science, 2017, Hannovre, Germany. ⟨10.4230/LIPIcs.STACS.2017.24⟩

Hannovre, Germany Vector Addition Systems... and for sections thereof F11 [Theory F22 [Nonnumerical Algori... F31 [Specifying and Veri...
Conference
Save to List
51

Minimum delay Data Gathering in Radio Networks
Bermond, Jean-Claude ; Nisse, Nicolas ; Reyes, Patricio ; et al.
ADHOC-NOW 2009 - 8th international conference on Ad Hoc Networks and Wireless. :69-82

Murcia, Spain ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... C.2.2: Network Protocols C.2.2.3: Routing protoco... ACM: G.: Mathematics of...
Conference
Save to List
52

Appearance-guided Synthesis of Element Arrangements by Example
Hurtut, Thomas ; Landes, Pierre-Edouard ; Thollot, Joëlle ; et al.
NPAR 2009 - 7th International Symposium on Non-Photorealistic Animation and Rendering. :51-60

New Orleans, LA, United... NPR by-example synthesis Vector texture synthesis ACM: I.: Computing Metho... I.3: COMPUTER GRAPHICS
Conference
Save to List
53

Approximating Acyclicity Parameters of Sparse Hypergraphs
Fomin, Fedor V. ; Golovach, Petr A. ; Thilikos, Dimitrios M. ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :445-456

Freiburg, Germany Graph hypergraph hypertree width treewidth ACM: F.: Theory of Compu...
Conference
Save to List
54

Shortest Paths Avoiding Forbidden Subpaths
Ahmed, Mustaq ; Lubiw, Anna ; David R. Cheriton School of Computer Science ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :63-74

Freiburg, Germany Algorithms and data stru... Graph algorithms Optical networks ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Conference
Save to List
55

Lower Bounds for Multi-Pass Processing of Multiple Data Streams
Schweikardt, Nicole ; Institut für Informatik ; Goethe University Frankfurt = Goethe-Universität Frankfurt am Main ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :51-62

Freiburg, Germany data streams lower bounds machine models automata the set disjointness pro...
Conference
Save to List
56

Generating Shorter Bases for Hard Random Lattices
Alwen, Joël ; Peikert, Chris ; New York University ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :75-86

Freiburg, Germany lattices random short basis average-case hardness Hermite normal form
Conference
Save to List
57

Economical Caching
Englert, Matthias ; Röglin, Heiko ; Spönemann, Jacob ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :385-396

Freiburg, Germany Online Algorithms Competitive Analysis Storage Management ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST...
Conference
Save to List
58

A Generalization of Nemhauser and Trotter's Local Optimization Theorem
Fellows, Michael R. ; Guo, Jiong ; Moser, Hannes ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :409-420

Freiburg, Germany graph problems kernelization combinatorial optimizati... fixed-parameter tractabi... W[2]-completeness
Conference
Save to List
59

Efficient Isomorphism Testing for a Class of Group Extensions
Le Gall, François ; ERATO-SORST Quantum Computation and Information Project ; Japan Science and Technology Agency ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :625-636

Freiburg, Germany polynomial-time algorith... group isomorphism black-box groups ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List
60

Polynomial Kernelizations for MIN F+PI 1 and MAX NP
Kratsch, Stefan ; Max-Planck-Institut für Informatik (MPII) ; Max-Planck-Gesellschaft ; et al.
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009. :601-612

Freiburg, Germany parameterized complexity kernelization approximation algorithms ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT...
Conference
Save to List

Filter