Andrzej Lingas
41 – 60 of 131
- show: 20
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2017
-
Mark
A fast deterministic detection of small pattern graphs in graphs without large cliques
2017) 11th International Conference and Workshops on Algorithms and Computation, WALCOM 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10167 LNCS. p.217-227(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
The snow team problem : (Clearing Directed subgraphs by mobile agents)
2017) 21th International Symposium on Fundamentals of Computation Theory, FCT 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10472 LNCS. p.190-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Contribution to journal › Article
- 2016
-
Mark
Efficiently Correcting Matrix Products (arXiv 2016)
2016)(
- Book/Report › Report
- 2015
-
Mark
Detecting monomials with k distinct variables
(
- Contribution to journal › Article
-
Mark
Detecting and Counting Small Pattern Graphs
(
- 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
-
Mark
A Fast Parallel Algorithm for Minimum-Cost Small Integral Flows
(
- 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
Simple Iterative Heuristics for Correlation Clustering
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficiently Correcting Matrix Products
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
-
Mark
3D Rectangulations and Geometric Matrix Multiplication
(
- 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
Detecting and Counting Small Pattern Graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Unique subgraphs are not easier to find
(
- Contribution to journal › Article