Katedra Algorytmiki - lista publikacji

1-149 z 149.

2017

147.
Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer
146.
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence, 12TH INTERNATIONAL SYMPOSIUM ON PARAMETERIZED AND EXACT COMPUTATION (IPEC 2017) (2017),
140.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages, PROCEEDINGS OF THE ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) (2017),
139.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity, PROCEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR) (2017),
137.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
136.
Robust algorithms with polynomial loss for near-unanimity CSPs, PROCEEDINGS OF THE 28TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS SODA'17 (2017), 340-357

2016

133.
Sparsity and dimension, (2016), "27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2016), January 10-12, 2016, Arlington, VA, USA", Society for Industrial and Applied Mathematics (SIAM)
130.
The Partial Visibility Representation Extension Problem vol. 9801 (Lecture Notes in Computer Science) (2016), "Graph Drawing and Network Visualization, 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers", Springer
126.
Counting Triangles in Large Graphs on GPU, 2016 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) (2016), 740-746
124.
Weak consistency notions for all CSPs of bounded width, PROCEEDINGS OF THE 31ST ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS'16) (2016), 633-641

2015

118.
Algebraic Properties of Valued Constraint Satisfaction Problem, PROCEEDINGS OF 42ND INTERNATIONAL COLLOQUIUM, ICALP 2015 (2015), 846-858
117.
On-line coloring between two lines vol. 34 of Leibniz International Proceedings in Informatics (2015), "31st International Symposium on Computational Geometry, SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
116.
Asymmetric coloring games on incomparability graphs, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 49 (2015), 803-811

2014

103.
Local-to-Global Consistency Implies Tractability of Abduction, PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (2014), 1128--1134
100.
An on-line competitive algorithm for coloring P_8-free bipartite graphs, (2014), "Algorithms and Computation -- 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
99.
Lower bounds for on-line graph colorings vol. 8889 (Lecture Notes in Computer Science) (2014), "Algorithms and Computation, 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings", Springer
98.
Making octants colorful, and related covering decomposition problems, (2014), "Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014)", Society for Industrial and Applied Mathematics (SIAM)
95.
Online bipartite matching in offline time, (2014), "55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, October 18-21, 2014, Philadelphia, PA, USA", Institute of Electrical and Electronics Engineers (IEEE)
91.
Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer

2013

86.
The Complexity of Abduction for Equality Constraint Languages, LIPICS–LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS vol. 23 (2013), 615--633
85.
Making triangles colorful, JOURNAL OF COMPUTATIONAL GEOMETRY vol. 4 (2013), 240-246
82.
On interval edge-colorings of complete tripartite graphs, COMPUTER SCIENCE AND INFORMATION TECHNOLOGIES (CSIT) (2013), 1-3
81.
Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer
80.
Coloring intersection graphs of arcwise connected sets in the plane vol. 16 of CRM Series (2013), "The Seventh European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2013", Springer

2012

68.
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction, 19TH INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING (2012), 99--106
67.
Equivalence Constraint Satisfaction Problems, LIPICS - LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS (2012), 122--136
65.
High performance automatic number plate recognition in video streams, PROCEEDINGS OF 3RD INTERNATIONAL CONFERENCE ON IMAGE PROCESSING THEORY, TOOLS AND APPLICATIONS (IEEE-IPTA 2012) (2012), 68-73
64.
High performance GPGPU based system for matching people in a live video feed, (2012), "Proceedings of 3rd International Conference on Image Processing Theory, Tools and Applications (IEEE-IPTA 2012)", Institute of Electrical and Electronics Engineers (IEEE)
63.
Real Time Object Tracking on GPGPU, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER VISION THEORY AND APPLICATIONS vol. 2 (2012), 303-310
62.
Robust Satisfiability of Constraint Satisfaction Problems, PROCEEDINGS OF THE 44TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'12 (2012), 931-940
61.
Near unanimity constraints have bounded pathwidth duality, PROCEEDINGS OF THE 27TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'12 (2012), 125-134
57.
Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer
56.
Outerplanar graph drawings with few slopes vol. 7434 of Lecture Notes in Computer Science (2012), "Computing and Combinatorics, 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012, Proceedings", Springer

2011

2010

44.
New conditions for Taylor varieties and CSP, PROCEEDINGS OF THE 25TH IEEE/ACM SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE LICS'10 (2010), 100-109
41.
The Sub-exponential Upper Bound for On-Line Chain Partitioning, (2010), "51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA", Institute of Electrical and Electronics Engineers (IEEE)

2009

35.
Constraint Satisfaction Problems of Bounded Width, PROCEEDINGS OF THE 50TH SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS'09 (2009), 595-603

2008

23.
Graphs, polymorphisms and the complexity of homomorphism problems, PROCEEDINGS OF THE 40TH ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC'08 (2008), 789-796
13.
On the density and the structure of the Peirce-like formulae, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS (2008), 461-474

2007

11.
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices, 37TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, ISMVL 2007 vol. IEEE Computer Society (2007), 21

2006

7.
On-line Coloring of I_s-free graphs and co-planar graphs, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AF (2006), 61-68
6.
On-line adaptive chain covering of upgrowing posets, DISCRETE MATHEMATICS & THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AF (2006), 37-48

2005

5.
An automaton that recognizes the base of a semiretract, WORDS 2005, 5-TH INTERNATIONAL CONFERENCE ON WORDS (2005), 235-247
2.
Variants of Online Chain Partition Problem of Posets, ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE vol. 140 (2005), 3-13

2003