Computer Science
1 – 50 of 183
- show: 50
- |
- 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
Induced subgraph isomorphism: Are some patterns substantially easier than others?
(
- 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
- 2014
-
Mark
A note on a QPTAS for maximum weight triangulation of planar point sets
(
- Contribution to journal › Article
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
-
Mark
Clearing Connections by Few Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 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
Towards more efficient infection and fire fighting
(
- Contribution to journal › Article
-
Mark
Unique subgraphs are not easier to find
(
- 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
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
-
Mark
Exact and approximation algorithms for geometric and capacitated set cover problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
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
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
-
Mark
On the complexity of approximating the Hadwiger number
(
- 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
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Contribution to journal › Article
-
Mark
Exact and approximation algorithms for graph problems with some biological applications
2009)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
2009)(
- Thesis › Doctoral thesis (compilation)
-
Mark
An exact algorithm for subgraph homeomorphism
(
- 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
Constraint Programming Methods for Optimization of Single Shortest Path Routing
2009)(
- Thesis › Doctoral thesis (monograph)
-
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
Reporting leaders and followers among trajectories of moving point objects
(
- Contribution to journal › Article
-
Mark
The travelling salesman problem in bounded degree graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- 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
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Max-stretch reduction for tree spanners
(
- Contribution to journal › Article
-
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
Approximate distance oracles for geometric spanners
(
- Contribution to journal › Article
-
Mark
A path cover technique for LCAs in dags
(
- 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
Trimmed moebius inversion and graphs of bounded degree
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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