Zespół Katedr i Zakładów Informatyki Matematycznej - lista publikacji

1-200 z 222.

2017

220.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages, Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017),
219.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity, Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) (2017),
217.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
216.
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
214.
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints vol. 10139 (Lecture Notes in Computer Science) (2017), "SOFSEM 2017: Current Trends in Theory and Practice of Computer Science, 43rd International Conference, Limerick, Ireland, January 16-20, 2017, Proceedings", Springer
211.

2016

208.
Building Code with Dynamic Staging, The Computing Research Repository (2016), 11
207.
ManyDSL: A Host for Many Languages, The Computing Research Repository (2016), 14
205.
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)
202.
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
199.
Outer common tangents and nesting of convex hulls in linear time and constant workspace vol. 57 of Leibniz International Proceedings in Informatics (2016), "24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
197.
Counting Triangles in Large Graphs on GPU, 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2016), 740-746
195.
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
193.
Graph drawings with one bend and few slopes vol. 9644 of Lecture Notes in Computer Science (2016), "LATIN 2016: Theoretical Informatics, 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings", Springer

2015

184.
Algebraic Properties of Valued Constraint Satisfaction Problem, Proceedings of 42nd International Colloquium, ICALP 2015 (2015), 846-858
183.
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
181.
Asymmetric coloring games on incomparability graphs, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 49 (2015), 803-811
179.
On the Beer index of convexity and its variants 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
167.
Minors and dimension, (2015), "26th Annual ACM-SIAM Symposium on Discrete Algorithms, January 4-6, 2015, San Diego, California, USA", Society for Industrial and Applied Mathematics (SIAM)

2014

162.
Local-to-Global Consistency Implies Tractability of Abduction, Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (2014), 1128--1134
160.
Counting Terms in the Binary Lambda Calculus, DMTCS Proceedings - 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms vol. DMTCS-HAL Proceedings Series (2014), 13
158.
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
157.
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
156.
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)
152.
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)
148.
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
147.
Outerstring graphs are χ-bounded, (2014), "30th Annual Symposium on Computational Geometry, SoCG 2014, June 8-11, 2014, Kyoto, Japan", Association for Computing Machinery (ACM)

2013

142.
The Complexity of Abduction for Equality Constraint Languages, LIPIcs–Leibniz International Proceedings in Informatics vol. 23 (2013), 615--633
141.
Making triangles colorful, JOURNAL OF COMPUTATIONAL GEOMETRY vol. 4 (2013), 240-246
138.
On interval edge-colorings of complete tripartite graphs, Computer Science and Information Technologies (CSIT) (2013), 1-3
137.
New bounds on the maximum number of edges in k-quasi-planar graphs vol. 8242 of Lecture Notes in Computer Science (2013), "Graph Drawing, 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers", Springer
136.
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
135.
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

120.
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction, 19th International Symposium on Temporal Representation and Reasoning (2012), 99--106
119.
Equivalence Constraint Satisfaction Problems, LIPICS - Leibniz International Proceedings in Informatics (2012), 122--136
117.
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
116.
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)
115.
Real Time Object Tracking on GPGPU, Proceedings of the International Conference on Computer Vision Theory and Applications vol. 2 (2012), 303-310
114.
Robust Satisfiability of Constraint Satisfaction Problems, Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'12 (2012), 931-940
113.
Near unanimity constraints have bounded pathwidth duality, Proceedings of the 27th IEEE/ACM Symposium on Logic in Computer Science LICS'12 (2012), 125-134
107.
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
106.
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

89.
New conditions for Taylor varieties and CSP, Proceedings of the 25th IEEE/ACM Symposium on Logic in Computer Science LICS'10 (2010), 100-109
86.
Common patterns for metric and ordered fixed point theorems, In Proceedings of the 7th Workshop on Fixed Points in Computer Science (2010), 83-87
84.
Dynamic Threshold Strategy for Universal Best Choice Problem, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AM (2010), 439–452
82.
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

79.
Periodic solutions of scalar differential equations without uniqueness, Boll. Unione Mat. Ital. (9) vol. 2(2) (2009), 445–448
74.
Constraint Satisfaction Problems of Bounded Width, Proceedings of the 50th Symposium on Foundations of Computer Science, FOCS'09 (2009), 595-603

2008

59.
Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th ACM Symposium on Theory of Computing, STOC'08 (2008), 789-796
49.
On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474
48.
Subcritical pattern languages for and/or trees, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 437–448

2007

44.
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

37.
Undecidable problems concerning densities of languages, Discrete Mathematics and Theoretical Computer Science Proceedings (2006), 69-76
36.
On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68
34.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48

2005

33.
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference on Words (2005), 235-247
29.
Approximation Simply Characterized., Electronic Notes in Theoretical Computer Science vol. 140 (2005), 113-117
28.
Conditional Densities of Regular Languages, Electronic Notes in Theoretical Computer Science (2005), 67-79
26.
Probabilistic approach to the lambda definability for fourth order types, Electronic Notes in Theoretical Computer Science (2005), 41-54
25.
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13

2004