Andrzej Lingas
31 – 40 of 132
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2018
-
Mark
Are unique subgraphs not easier to find?
(
- Contribution to journal › Article
-
Mark
A QPTAS for the base of the number of crossing-free structures on a planar point set
(
- Contribution to journal › Article
- 2017
-
Mark
Bounds for semi-disjoint bilinear forms in a unit-cost computational model
2017) 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 LNCS. p.412-424(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Towards an almost quadratic lower bound on the monotone circuit complexity of the Boolean convolution
2017) 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10185 LNCS. p.401-411(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Determining the consistency of resolved triplets and fan triplets
2017) 21st Annual International Conference on Research in Computational Molecular Biology, RECOMB 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10229 LNCS. p.82-98(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors)
2017) 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2017 10139. p.229-240(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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