Zespół Katedr i Zakładów Informatyki Matematycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-200 z 259.
2018
259.
Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
258.
Satisfiability in multi-valued circuits, (2018), "Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS'18)", Association for Computing Machinery (ACM)
257.
Combinatorics of explicit substitutions vol. PPDP '18 (2018), "Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming", Association for Computing Machinery (ACM)
256.
A note on two-colorability of nonuniform hypergraphs, LIPICS–LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS vol. 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (2018), 46:1--46:13
255.
A Tight Bound for Shortest Augmenting Paths on Trees vol. 10870 (2018), "LATIN 2018: Theoretical Informatics", Springer
254.
Counting Environments and Closures vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
253.
Sparse Kneser graphs are Hamiltonian, (2018), "Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC’18)", Association for Computing Machinery (ACM)
252.
251.
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
250.
Defective 3-Paintability of Planar Graphs, ELECTRON J COMB vol. 25 (2) (2018), 20
249.
Dimension and cut vertices: an application of Ramsey theory, (2018), "Connections in Discrete Mathematics: A Celebration of the Work of Ron Graham", Cambridge University Press
248.
An Easy Subexponential Bound for Online Chain Partitioning, ELECTRON J COMB vol. 25(2) (2018), #P2.28
247.
Deferred On-Line Bipartite Matching, ELECTRON J COMB vol. 25 (2) (2018), 19
246.
Every Plane Graph is Facially-Non-Repetitively C-choosable, ELECTRON J COMB vol. 25 (1) (2018), 13
245.
A new lower bound for the on-line coloring of intervals with bandwidth, THEOR COMPUT SCI vol. 708 (2018), 96-100
244.
Shortest Augmenting Paths for Online Matchings on Trees, THEOR COMPUT SYST vol. 62(2) (2018), 337-348
243.
242.
Polynomial tuning of multiparametric combinatorial samplers, (2018), "2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)", Society for Industrial and Applied Mathematics (SIAM)
241.
240.
239.
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence, 12TH INTERNATIONAL SYMPOSIUM ON PARAMETERIZED AND EXACT COMPUTATION (IPEC 2017) (2018), 15:1-15:13
2017
238.
On the Dimension of Posets with Cover Graphs of Treewidth 2, ORDER vol. 34.2 (2017), 185-234
237.
Topological minors of cover graphs and dimension, J GRAPH THEOR vol. 86.3 (2017), 295–314
236.
Burling graphs, chromatic number, and orthogonal tree-decompositions, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 61 (2017), 415-420
235.
Planar posets have dimension at most linear in their height, SIAM J DISCRETE MATH vol. 31 (4) (2017), 2754–2790
234.
233.
Asymptotic density in logic and computability, PROCEEDINGS OF THE TENTH WORKSHOP ON INFORMATION THEORETIC METHODS IN SCIENCE AND ENGINEERING, PARIS, FRANCE, SEPTEMBER 11-13, 2017 vol. Publication series B, Report B-2017-3 (Editors: Jacquet Philippe, Leppä-Aho Janne, Roos Teemu (2017), 43
232.
231.
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
230.
229.
Majority Choosability of Digraphs, ELECTRON J COMB vol. 24(3) (2017), #P3.57
228.
Boolean dimension and local dimension, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 61 (2017), 1047-1053
227.
Coloring curves that cross a fixed curve vol. 77 of Leibniz International Proceedings in Informatics (2017), "33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
226.
Combinatorics of λ-terms: a natural approach, J LOGIC COMPUT vol. Volume 27, Issue 8 (2017), 2611–2630
225.
Universal targets for homomorphisms of edge-colored graphs, J COMB THEORY B vol. 127 (2017), 53-64
224.
The Partial Visibility Representation Extension Problem, ALGORITHMICA vol. 80 (8) (2017), 2286-2323
223.
Uniform Cross-entropy Clustering, SCHEDAE INFORMATICAE vol. 25 (2017), 117-126
222.
221.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages, PROCEEDINGS OF THE ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) (2017),
220.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity, PROCEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR) (2017),
219.
The Complexity of Counting Quantifiers on Equality Languages, THEOR COMPUT SCI vol. 670 (2017), 56–67
218.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
217.
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
216.
215.
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
214.
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 10137 (2017), 120-135
213.
On the Beer index of convexity and its variants, DISCRETE COMPUT GEOM vol. 57 (2017), 179-214
212.
Minors and dimension, J COMB THEORY B vol. 122 (2017), 668-689
211.
On the likelihood of normalisation in combinatory logic, J LOGIC COMPUT vol. Volume 27, Issue 7 (2017), 2251–2269
2016
210.
Criteria for regularity of Mahler power series and Becker's conjecture, J NUMBER THEORY vol. 174 (2016), 456-486
209.
Nonrepetitive colouring via entropy compression, COMBINATORICA vol. Volume 36, Issue 6 (2016), 661-686
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
206.
The Complexity of Counting Quantifiers on Equality Languages, LECTURE NOTES IN COMPUTER SCIENCE vol. 9709 (2016), 333--342
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)
204.
A note on concurrent graph sharing games, INTEGERS vol. Volume 16, G1 (2016), 5
203.
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
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
201.
The subpower membership problem for semigroups, INT J ALGEBR COMPUT vol. 26 (2016), 1435-1451
200.
Chip Games and Paintability, ELECTRON J COMB vol. 23 (3) (2016), 12
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
198.
Distributed Tasks: Introducing Distributed Computing to Programming Competitions, OLYMPIADS IN INFORMATICS vol. 10 (2016), 177-194
197.
Counting Triangles in Large Graphs on GPU, 2016 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) (2016), 740-746
196.
Harmonious coloring of uniform hypergraphs, APPL ANAL DISCR MATH vol. 10(1) (2016), 73-87
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
194.
Robustly Solvable Constraint Satisfaction Problems, SIAM J COMPUT vol. 45(4) (2016), 1646–1669
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
192.
Improved algorithms for colorings of simple hypergraphs and applications, J COMB THEORY B vol. Volume 116 (2016), 312-332
191.
Multipass greedy coloring of simple uniform hypergraphs, RANDOM STRUCT ALGOR vol. Volume 48, Issue 1 (2016), 125-146
190.
Decomposition of multiple packings with subquadratic union complexity, COMB PROBAB COMPUT vol. 25 (2016), 145-153
189.
A natural counting of lambda terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 9587 (2016), 183-194
188.
187.
Tree-width and dimension, COMBINATORICA vol. 36 (2016), 431-450
186.
Nonrepetitive colorings of line arrangements, EUR J COMBIN vol. 51 (2016), 275-279
185.
On the Duality of Semiantichains and Unichain Coverings, ORDER vol. 33(1) (2016), 29-38
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
182.
181.
Asymmetric coloring games on incomparability graphs, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 49 (2015), 803-811
180.
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
178.
A note on random greedy coloring of uniform hypergraphs, RANDOM STRUCT ALGOR vol. 47 (2015), 407-413
177.
Mal’tsev conditions, lack of absorption, and solvability, ALGEBR UNIV vol. 74 (2015), 185-206
176.
Characterizations of several Maltsev conditions, ALGEBR UNIV vol. 73 (2015), 205-224
175.
How to Play Thue Games, THEOR COMPUT SCI vol. 582 (2015), 83-88
174.
A note on locality of algebras, J ALGEBRA vol. 433 (2015), 231-242
173.
172.
Avoider-Enforcer star games, DISCRETE MATH THEOR vol. 17(1) (2015), 145-160
171.
The strong chromatic index of sparse graphs, INFORM PROCESS LETT vol. 115 (2015), 326–330
170.
169.
168.
Asymptotic properties of combinatory logic, LECTURE NOTES IN COMPUTER SCIENCE vol. 9076 (2015), 62-72
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)
166.
165.
164.
Finitely forcible graphons and permutons, J COMB THEORY B vol. 110 (2015), 112-135
2014
163.
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, LECTURE NOTES IN COMPUTER SCIENCE vol. 8634 (Springer) (2014), 535--546
162.
Local-to-Global Consistency Implies Tractability of Abduction, PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE (2014), 1128--1134
161.
Tractability of quantified temporal constraints to the max, INT J ALGEBR COMPUT vol. 24 (2014), 1141--1156
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
159.
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)
155.
Making octants colorful, and related covering decomposition problems, SIAM J DISCRETE MATH vol. 28-4 (2014), 1948-1959
154.
Constraint Satisfaction Problems Solvable by Local Consistency Methods, J ACM vol. 61 (2014), article no. 3
153.
A note on blocks of skeleton tolerances, ACTA MATH HUNG vol. 143(1) (2014), 176-184
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)
151.
Interval edge-colorings of K_{1,m,n}, DISCRETE APPL MATH vol. 174 (2014), 140-145
150.
149.
An extremal problem on crossing vectors, J COMB THEORY A vol. 128 (2014), 41-55
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)
146.
145.
Outerplanar graph drawings with few slopes, COMP GEOM-THEOR APPL vol. 47 (2014), 614-624
144.
Towards an on-line version of Ohba’s conjecture, EUR J COMBIN vol. 36 (2014), 110-121
143.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki, Sebastian Czerwiński, Tomasz Bartnicki, Wiktor Żelazny
Additive Coloring of Planar Graphs, GRAPH COMBINATOR vol. 30(5) (2014), 1087-1098
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
140.
139.
Polynomial-time locality tests for finite rings, J ALGEBRA vol. 379 (2013), 441-452
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
134.
133.
Counting and generating lambda terms, J FUNCT PROGRAM vol. 23(5) (2013), 594-628
132.
Distributive lattices determined by weighted double skeletons, ALGEBR UNIV vol. 69(4) (2013), 313-326
131.
On-Line Dimension of Semi-Orders, ORDER vol. 30(2) (2013), 593-615
130.
Online version of the theorem of Thue, INFORM PROCESS LETT vol. 113 (2013), 193-195
129.
New approach to nonrepetitive sequences, RANDOM STRUCT ALGOR vol. 42 (2013), 214-225
128.
Nonrepetitive choice number of trees, SIAM J DISCRETE MATH vol. 27-1 (2013), 436-446
127.
On-line dimension for posets excluding two long incomparable chains, ORDER vol. 30(1) (2013), 1-12
126.
On-line Chain Partitions of Up-growing Semi-orders, ORDER vol. 30(1) (2013), 85-101
125.
First-Fit Coloring of Incomparability Graphs, SIAM J DISCRETE MATH vol. 27(1) (2013), 126-140
124.
123.
f-vectors implying vertex decomposability, DISCRETE COMPUT GEOM vol. 49 (2013), 296-301
122.
Asymptotically almost all λ-terms are strongly normalizing, LOG METH COMPUT SCI vol. 9 (1:02) (2013), 1-30
121.
How big is BCI fragment of BCK logic, J LOGIC COMPUT vol. 23(3) (2013), 673-691
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
118.
Syntactically Characterizing Local-to-Global Consistency in ORD-Horn, LECTURE NOTES IN COMPUTER SCIENCE vol. 7514 (2012), 704--719
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
112.
Absorbing subalgebra, cyclic terms and the Constraint Satisfaction Problem, LOG METH COMPUT SCI vol. 20 (2012), paper no. 7
111.
On the maximum number of five-cycles in a triangle-free graph, J COMB THEORY B vol. 102 (2012), 1061-1066
110.
Indicated colorings of graphs, DISCRETE MATH vol. 312 (2012), 3467-3472
109.
A duality of quantale-enriched categories, J PURE APPL ALGEBRA vol. 216 (2012), 1866-1878
108.
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
105.
Parity in graph sharing games, DISCRETE MATH vol. 312 (2012), 1788-1795
104.
103.
On-line version of Rabinovitch theorem for proper intervals, DISCRETE MATH vol. 312(23) (2012), 3426-3436
102.
On-Line Chain Partitions of Orders: A Survey, ORDER vol. 29(1) (2012), 49-73
2011
101.
Nonrepetitive list colourings of paths, RANDOM STRUCT ALGOR vol. 38 (2011), 162-173
100.
99.
Approximation in quantale-enriched categories., TOPOL APPL vol. 158 (2011), 963-977
98.
The duality of generalized metric spaces., TOPOL APPL vol. 158 (2011), 2371-2381
97.
The formal ball model for Q-categories., MATH STRUCT COMP SCI vol. 21 (2011), 41-64
96.
95.
How to eat 4/9 of a pizza, DISCRETE MATH vol. 311 (2011), 1635-1645
94.
A graph-grabbing game, COMB PROBAB COMPUT vol. 20 (2011), 623-629
93.
Forbidden structures for efficient First-Fit chain partitioning (extended abstract), ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 38 (2011), 173-179
92.
Mr. Paint and Mrs. Correct go fractional, ELECTRON J COMB vol. 18 (1) (2011), 8
2010
91.
Term equation satisfiability over finite algebras, INT J ALGEBR COMPUT vol. 20(8) (2010), 1001-1020
90.
Cyclic terms for SD(V) varieties revisited, ALGEBR UNIV vol. 64 (2010), 137-142
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
88.
Tractability and learnabilty arising from algebras with few subpowers, SIAM J COMPUT vol. 39 (2010), 3023-3037
87.
Varieties with few subalgebras of powers, T AM MATH SOC vol. 362 (2010), 1445-1473
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
85.
The limit-colimit coincidence theorem for Q-categories, MATH STRUCT COMP SCI vol. 158 (2010), 267-284
84.
Dynamic Threshold Strategy for Universal Best Choice Problem, DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE PROCEEDINGS vol. AM (2010), 439–452
83.
A simple representation of subwords of the Fibonacci word, INFORM PROCESS LETT vol. 110 (2010), 956-960
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)
81.
First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM J DISCRETE MATH vol. 23(4) (2010), 1992-1999
80.
Tautologies over implication with negative literals, MATH LOGIC QUART vol. 56 (2010), 388-396
2009
79.
Periodic solutions of scalar differential equations without uniqueness, BOLL. UNIONE MAT. ITAL. (9) vol. 2(2) (2009), 445–448
78.
A 2EXPTIME Complete Varietal Membership Problem, SIAM J COMPUT vol. 6 (2009), 2443-2467
77.
76.
Congruence distributivity implies bounded width, SIAM J COMPUT vol. 39 (2009), 1531-1542
75.
CSP dichotomy for special triads, P AM MATH SOC vol. 137 (2009), 2921-2934
74.
Constraint Satisfaction Problems of Bounded Width, PROCEEDINGS OF THE 50TH SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS'09 (2009), 595-603
73.
Congruence modularity implies cyclic terms for finite algebras, ALGEBR UNIV vol. 61 (2009), 365-380
72.
Lucky labelings of graphs, INFORM PROCESS LETT vol. 109 (2009), 1078-1081
71.
Weight choosability of graphs, J GRAPH THEOR vol. 60 (2009), 242-256
70.
69.
Definable principal congruences and solvability, ANN PURE APPL LOGIC vol. 157 (2009), 30-49
68.
Fregean Varieties, INT J ALGEBR COMPUT vol. 19 (2009), 595–645
67.
Splitting necklaces and measurable colorings of the real line, P AM MATH SOC vol. 137 (2009), 1593-1599
66.
On Domain Theory over Girard Quantales, FUND INFORM vol. 92 (2009), 169-192
65.
64.
Counting proofs in propositional logic, ARCH MATH LOGIC vol. 48 (2009), 185-199
2008
63.
62.
Quantified Positive Temporal Constraints, LECTURE NOTES IN COMPUTER SCIENCE vol. 5213 (2008), 94--108
61.
A finite set of functions with an EXPTIME-complete composition problem, THEOR COMPUT SCI vol. 407 (2008), 330-341
60.
The subdirectly irreducible algebras in the variety generated by graph algebras, ALGEBR UNIV vol. 58 (2008), 229-242
Przejdź do strony: