Computer Science
1 – 100 of 183
- show: 100
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2016
-
Mark
Minimum Geometric Spanning Trees
2016) p.1315-1318(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
A lightweight data interchange format for internet of things with applications in the PalCom middleware framework
(
- Contribution to journal › Article
- 2015
-
Mark
Detecting monomials with k distinct variables
(
- Contribution to journal › Article
-
Mark
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- Contribution to journal › Article
- 2014
-
Mark
A note on a QPTAS for maximum weight triangulation of planar point sets
(
- Contribution to journal › Article
-
Mark
Clearing Connections by Few Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
- 2013
-
Mark
Optimal cuts and partitions in tree metrics in polynomial time
(
- Contribution to journal › Article
-
Mark
Counting and Detecting Small Subgraphs via Equations
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article
-
Mark
Towards more efficient infection and fire fighting
(
- Contribution to journal › Article
-
Mark
Efficient broadcasting in radio networks with long-range interference
(
- Contribution to journal › Article
- 2012
-
Mark
The complexity of inferring a minimally resolved phylogenetic supertree
(
- Contribution to journal › Article
-
Mark
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact and approximation algorithms for geometric and capacitated set cover problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
-
Mark
An Approximation Algorithm for Directed Shallow Steiner Trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
(
- Contribution to journal › Article
- 2010
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Contribution to journal › Article
-
Mark
Exponential time complexity of the permanent and the Tutte polynomial
2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximability of edge matching puzzles
2010) 36th International Conference on Current Trends in Theory and Practice of Computer Science 5901. p.153-164(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
Restricted mesh simplification using edge contractions
(
- Contribution to journal › Article
-
Mark
A fast output-sensitive algorithm for Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
On the complexity of approximating the Hadwiger number
(
- Contribution to journal › Article
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
2009)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Contribution to journal › Article
-
Mark
Constraint Programming Methods for Optimization of Single Shortest Path Routing
2009)(
- Thesis › Doctoral thesis (monograph)
-
Mark
An exact algorithm for subgraph homeomorphism
(
- Contribution to journal › Article
-
Mark
Exact and approximation algorithms for graph problems with some biological applications
2009)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Efficient broadcasting in known toplogy radio networks with long-range interference
2009) p.230-239(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fixed parameter algorithms for the minimum weight triangulation problem
(
- Contribution to journal › Article
-
Mark
Approximate clustering of incomplete fingerprints
(
- Contribution to journal › Article
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate distance oracles for geometric spanners
(
- Contribution to journal › Article
-
Mark
Max-stretch reduction for tree spanners
(
- Contribution to journal › Article
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A path cover technique for LCAs in dags
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Contribution to journal › Article
-
Mark
The travelling salesman problem in bounded degree graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Reporting leaders and followers among trajectories of moving point objects
(
- Contribution to journal › Article
-
Mark
Minimum k-connected geometric networks
2008) p.536-538(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Minimum weight triangulation
2008)(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Trimmed moebius inversion and graphs of bounded degree
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Conditional Partial Plans for Rational Situated Agents Capable of Deductive Reasoning and Inductive Learning
2008)(
- Thesis › Doctoral thesis (monograph)
-
Mark
Three methods for optimizing single-shortest path routing
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Contribution to journal › Article
-
Mark
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
-
Mark
Inductive logic programming algorithm for estimating quality of partial plans
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A New Necessary Condition for Shortest Path Routing
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Contribution to journal › Article
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article
-
Mark
Approximation Algorithms for Geometric Networks
2007)(
- Thesis › Doctoral thesis (monograph)
-
Mark
An Architecture for Resource Bounded Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Reporting leadership patterns among trajectories
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Learning to evaluate conditional partial plans
2007) Sixth International Conference on Machine Learning and Applications, 2007. ICMLA 2007. p.235-240(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A CP-LP approach to network management in OSPF routing
2007) ACM Symposium on Applied Computing(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On exact complexity of subgraph homeomorphism
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate distance oracles for graphs with dense clusters
(
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
-
Mark
Knowledge Representation for Learning How to Evaluate Partial Plans
2007) The 24th Annual Workshop of the Swedish Artificial Intelligence Society, SAIS 2007(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Generalizing the Gap Theorem for Constructing a t-Spanner of Low Weight Fast and Simple
2007)(
- Book/Report › Report
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
(
- Contribution to journal › Article
-
Mark
Minimum weight pseudo-triangulations
(
- Contribution to journal › Article
-
Mark
Approximating the maximum independent set and minimum vertex coloring on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Knowledge-based reconfiguration of automation systems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fourier meets Möbius: fast subset convolution
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
CP-LP Hybrid Method for Unique Shortest Path Routing Optimization
2007) International Network Optimization Conference INOC 2007(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Exact algorithms for exact satisfiability and number of perfect matchings
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Performing work in broadcast networks
(
- Contribution to journal › Article
-
Mark
Partitioning based algorithms for some colouring problems
2006) Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005 3978. p.44-58(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The online freeze-tag problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Restricted mesh simplification using edge contractions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Covering a set of points with a minimum number of lines
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Learning of agents with limited resources
2006) 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 2. p.1893-1894(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Inclusion-exclusion algorithms for counting set partitions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry
2006)(
- Thesis › Doctoral thesis (compilation)
-
Mark
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
(
- Contribution to journal › Article
-
Mark
Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results
2006)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Learning and Planning of Situated Resource Bounded Agents
2006) 23rd Annual Workshop of the Swedish Artificial Intelligence Society(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is no harder than matrix multiplication
2006) In Electronic Colloquium on Computational Complexity(
- Book/Report › Report
-
Mark
Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2005
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
LCA queries in directed acyclic graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A haptic system for the LUCS Haptic Hand I
(
- Contribution to journal › Article
-
Mark
Black box for constant-time insertion in priority queues
(
- Contribution to journal › Article
-
Mark
Max-stretch reduction for tree spanners
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
TSP with neighborhoods of varying size
(
- Contribution to journal › Article
-
Mark
Minimum weight triangulation by cutting out triangles
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Chips on wafers, or packing rectangles into grids
(
- Contribution to journal › Article
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
(
- Contribution to journal › Article
-
Mark
Approximate clustering of fingerprint vectors with missing values
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding