Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
201-400 z 424.
2017
224.
On the likelihood of normalisation in combinatory logic, Journal of Logic and Computation vol. Volume 27, Issue 7 (2017), 2251–2269
2016
223.
Abram Magner, Wojciech Szpankowski, Krzysztof Turowski
Lossless compression of binary trees with correlated vertex names, IEEE International Symposium on Information Theory [ISIT], (2016), 1217-1221
222.
Robert Janczewski, Krzysztof Turowski
An O(n log n) algorithm for finding edge span of cacti, Journal of Combinatorial Optimization vol. 31(4) (2016), 1373-1382
221.
Robert Janczewski, Krzysztof Turowski
On the hardness of computing span of subcubic graphs, Information Processing Letters vol. 116(1) (2016), 26-32
220.
Criteria for regularity of Mahler power series and Becker's conjecture, Journal of Number Theory vol. 174 (2016), 456-486
219.
Vida Dujmović, Gwenaël Joret, Jakub Kozik, David R. Wood
Nonrepetitive colouring via entropy compression, Combinatorica vol. Volume 36, Issue 6 (2016), 661-686
218.
Piotr Danilewski, Philipp Slusallek
Building Code with Dynamic Staging, the Computing Research Repository (2016), 11
217.
Piotr Danilewski, Philipp Slusallek
ManyDSL: A Host for Many Languages, the Computing Research Repository (2016), 14
216.
Barnaby Martin, Andras Pongracz, Michał Wrona
The Complexity of Counting Quantifiers on Equality Languages, Lecture Notes in Computer Science vol. 9709 (2016), 333-342
215.
Gwenaël Joret, Piotr Micek, Veit Wiechert
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)
214.
Steven Chaplick, Piotr Micek, Torsten Ueckerdt, Veit Wiechert
A note on concurrent graph sharing games, Integers vol. Volume 16, G1 (2016), 5
213.
Pathwidth and nonrepetitive list colorings, Electronic Journal of Combinatorics vol. Volume 23, Issue 4 (2016), 19
212.
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
211.
Andrei Bulatov, Marcin Kozik, Peter Mayr, Markus Steindl
The subpower membership problem for semigroups, International Journal of Algebra and Computation vol. 26 (2016), 1435-1451
210.
Chip Games and Paintability, Electronic Journal of Combinatorics vol. 23 (3) (2016), 12
209.
Mikkel Abrahamsen, Bartosz Walczak
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
208.
Adam Karczmarz, Jakub Łącki, Adam Polak, Jakub Radoszewski, Jakub Onufry Wojtaszczyk
Distributed Tasks: Introducing Distributed Computing to Programming Competitions, Olympiads in Informatics vol. 10 (2016), 177-194
207.
Counting Triangles in Large Graphs on GPU, 2016 Ieee International Parallel and Distributed Processing Symposium Workshops (ipdpsw) (2016), 740-746
206.
Bartłomiej Bosek, Jarosław Grytczuk, Paweł Rzążewski, Sebastian Czerwiński
Harmonious coloring of uniform hypergraphs, Applicable Analysis and Discrete Mathematics vol. 10(1) (2016), 73-87
205.
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
204.
Libor Barto, Marcin Kozik
Robustly Solvable Constraint Satisfaction Problems, SIAM Journal on Computing vol. 45(4) (2016), 1646–1669
203.
Kolja Knauer, Bartosz Walczak
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
202.
Jakub Kozik, Dmitry A. Shabanov
Improved algorithms for colorings of simple hypergraphs and applications, Journal of Combinatorial Theory. Series B vol. Volume 116 (2016), 312-332
201.
Multipass greedy coloring of simple uniform hypergraphs, Random Structures and Algorithms vol. Volume 48, Issue 1 (2016), 125-146
200.
János Pach, Bartosz Walczak
199.
A natural counting of lambda terms, Lecture Notes in Computer Science vol. 9587 (2016), 183-194
198.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
Shortest Augmenting Paths for Online Matchings on Trees, Lecture Notes in Computer Science vol. 9499 (2016), 59-71
197.
Gwenaël Joret, Piotr Micek, Kevin G. Milans, William T. Trotter, Bartosz Walczak, Ruidong Wang
Tree-width and dimension, Combinatorica vol. 36 (2016), 431-450
196.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
Nonrepetitive colorings of line arrangements, European Journal of Combinatorics vol. 51 (2016), 275-279
195.
Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki
On the Duality of Semiantichains and Unichain Coverings, Order vol. 33(1) (2016), 29-38
2015
194.
193.
Robert Janczewski, Krzysztof Turowski
192.
Robert Janczewski, Krzysztof Turowski
The Backbone Coloring Problem for Bipartite Backbones, Graphs and Combinatorics vol. 31(5) (2015), 1487-1496
191.
Robert Janczewski, Krzysztof Turowski
190.
Asymmetric coloring games on incomparability graphs vol. 49 of Electronic Notes in Discrete Mathematics (2015), "The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015", Elsevier Science
189.
Marcin Kozik, Joanna Ochremiak
Algebraic Properties of Valued Constraint Satisfaction Problem, Proceedings of 42nd International Colloquium, Icalp 2015 (2015), 846-858
188.
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
187.
Katarzyna Grygiel, Pierre Lescanne
186.
Andrew Suk, Bartosz Walczak
185.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak
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
184.
Danila D. Cherkashin, Jakub Kozik
A note on random greedy coloring of uniform hypergraphs, Random Structures and Algorithms vol. 47 (2015), 407-413
183.
Libor Barto, Marcin Kozik, David Stanovský
Mal’tsev conditions, lack of absorption, and solvability, Algebra Universalis vol. 74 (2015), 185-206
182.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
Characterizations of several Maltsev conditions, Algebra Universalis vol. 73 (2015), 205-224
181.
Jarosław Grytczuk, Karol Kosiński, Michał Zmarz
How to Play Thue Games, Theoretical Computer Science vol. 582 (2015), 83-88
180.
A note on locality of algebras, Journal of Algebra vol. 433 (2015), 231-242
179.
Andrzej Grzesik, Michał Morayne, Małgorzata Sulkowska
178.
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
Avoider-Enforcer star games, Discrete Mathematics and Theoretical Computer Science vol. 17(1) (2015), 145-160
177.
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
The strong chromatic index of sparse graphs, Information Processing Letters vol. 115 (2015), 326–330
176.
Jarosław Grytczuk, Wojciech Lubawski
175.
174.
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)
173.
172.
171.
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král
Finitely forcible graphons and permutons, Journal of Combinatorial Theory. Series B vol. 110 (2015), 112-135
2014
170.
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, Lecture Notes in Computer Science vol. 8634 (Springer) (2014), 535-546
169.
Local-to-Global Consistency Implies Tractability of Abduction. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence., Proceedings of the Twenty-eighth Aaai Conference On Artificial Intelligence (2014), 1128-1134
168.
Manuel Bodirsky, Hubie Chen, Michał Wrona
Tractability of quantified temporal constraints to the max, International Journal of Algebra and Computation vol. 24 (2014), 1141-1156
167.
Katarzyna Grygiel, Pierre Lescanne
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
166.
165.
Piotr Micek, Veit Wiechert
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
164.
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
163.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
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)
162.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making octants colorful, and related covering decomposition problems, SIAM Journal on Discrete Mathematics vol. 28-4 (2014), 1948-1959
161.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems Solvable by Local Consistency Methods, Journal of the ACM vol. 61 (2014), article no. 3
160.
Anetta Górnicka, Joanna Grygiel, Katarzyna Grygiel
A note on blocks of skeleton tolerances, Acta Mathematica Hungarica vol. 143(1) (2014), 176-184
159.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
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)
158.
Andrzej Grzesik, Hrant Khachatrian
Interval edge-colorings of K_{1,m,n}, Discrete Applied Mathematics vol. 174 (2014), 140-145
157.
156.
An extremal problem on crossing vectors, Journal of Combinatorial Theory - Series A vol. 128 (2014), 41-55
155.
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
154.
Alexandre Rok, Bartosz Walczak
Outerstring graphs are χ-bounded, (2014), "30th Annual Symposium on Computational Geometry, SoCG 2014, June 8-11, 2014, Kyoto, Japan", Association for Computing Machinery (ACM)
153.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
152.
Kolja Knauer, Piotr Micek, Bartosz Walczak
Outerplanar graph drawings with few slopes, Computational Geometry: Theory and Applications vol. 47 (2014), 614-624
151.
Jakub Kozik, Piotr Micek, Xuding Zhu
Towards an on-line version of Ohba’s conjecture, European Journal of Combinatorics vol. 36 (2014), 110-121
150.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki, Sebastian Czerwiński, Tomasz Bartnicki, Wiktor Żelazny
Additive Coloring of Planar Graphs, Graphs and Combinatorics vol. 30(5) (2014), 1087-1098
2013
149.
Johannes Schmidt, Michał Wrona
The Complexity of Abduction for Equality Constraint Languages, Lipics–leibniz International Proceedings in Informatics vol. 23 (2013), 615-633
148.
Jean Cardinal, Kolja Knauer, Piotr Micek, Torsten Ueckerdt
Making triangles colorful, Journal of Computational Geometry vol. 4 (2013), 240-246
147.
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Günter Rote, Thomas Hackl, Michael Hoffman, Kolja Knauer, Stefan Langerman, Michał Lasoń, Piotr Micek, Torsten Ueckerdt
146.
Asymptotic properties of combinatory logic, Lecture Notes in Computer Science vol. 9076 (2013), 62-72
145.
Polynomial-time locality tests for finite rings, Journal of Algebra vol. 379 (2013), 441-452
144.
Andrew Suk, Bartosz Walczak
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
143.
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
142.
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
141.
Arkadiusz Pawlik, Jakub Kozik, Tomasz Krawczyk, Michał Lasoń, Piotr Micek, William T. Trotter, Bartosz Walczak
140.
Katarzyna Grygiel, Pierre Lescanne
Counting and generating lambda terms, Journal of Functional Programming vol. 23(5) (2013), 594-628
139.
Gábor Czédli, Joanna Grygiel, Katarzyna Grygiel
Distributive lattices determined by weighted double skeletons, Algebra Universalis vol. 69(4) (2013), 313-326
138.
On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615
137.
Jarosław Grytczuk, Piotr Szafruga, Michał Zmarz
Online version of the theorem of Thue, Information Processing Letters vol. 113 (2013), 193-195
136.
Jarosław Grytczuk, Jakub Kozik, Piotr Micek
New approach to nonrepetitive sequences, Random Structures and Algorithms vol. 42 (2013), 214-225
135.
Nonrepetitive choice number of trees, SIAM Journal on Discrete Mathematics vol. 27-1 (2013), 436-446
134.
Stefan Felsner, Tomasz Krawczyk, William T. Trotter
On-line dimension for posets excluding two long incomparable chains, Order vol. 30(1) (2013), 1-12
133.
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
On-line Chain Partitions of Up-growing Semi-orders, Order vol. 30(1) (2013), 85-101
132.
First-Fit Coloring of Incomparability Graphs, SIAM Journal on Discrete Mathematics vol. 27(1) (2013), 126-140
131.
130.
f-vectors implying vertex decomposability, Discrete and Computational Geometry vol. 49 (2013), 296-301
129.
Asymptotically almost all λ-terms are strongly normalizing, Logical Methods in Computer Science vol. 9 (1:02) (2013), 1-30
128.
How big is BCI fragment of BCK logic, Journal of Logic and Computation vol. 23(3) (2013), 673-691
2012
127.
Hubie Chen, Michał Wrona
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction, 19th International Symposium On Temporal Representation and Reasoning (2012), 99-106
126.
Manuel Bodirsky, Michał Wrona
Equivalence Constraint Satisfaction Problems, Lipics - Leibniz International Proceedings in Informatics (2012), 122-136
125.
Syntactically Characterizing Local-to-Global Consistency in ORD-Horn, Lecture Notes in Computer Science vol. 7514 (2012), 704-719
124.
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
123.
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)
122.
Real Time Object Tracking on GPGPU, Proceedings of the International Conference On Computer Vision Theory and Applications vol. 2 (2012), 303-310
121.
Libor Barto, Marcin Kozik
Robust Satisfiability of Constraint Satisfaction Problems, Proceedings of the 44th Acm Symposium On Theory of Computing, Stoc'12 (2012), 931-940
120.
Libor Barto, Marcin Kozik, Ross Willard
Near unanimity constraints have bounded pathwidth duality, Proceedings of the 27th Ieee/acm Symposium On Logic in Computer Science Lics'12 (2012), 125-134
119.
Libor Barto, Marcin Kozik
Absorbing subalgebra, cyclic terms and the Constraint Satisfaction Problem, Logical Methods in Computer Science vol. 20 (2012), paper no. 7
118.
On the maximum number of five-cycles in a triangle-free graph, Journal of Combinatorial Theory. Series B vol. 102 (2012), 1061-1066
117.
Indicated colorings of graphs, Discrete Mathematics vol. 312 (2012), 3467-3472
116.
Dirk Hofmann, Paweł Waszkiewicz
A duality of quantale-enriched categories, Journal of Pure and Applied Algebra vol. 216 (2012), 1866-1878
115.
Antoine Genitrini, Jakub Kozik
114.
Pavel Klavík, Jan Kratochvíl, Tomasz Krawczyk, Bartosz Walczak
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
113.
Kolja Knauer, Piotr Micek, Bartosz Walczak
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
112.
Parity in graph sharing games, Discrete Mathematics vol. 312 (2012), 1788-1795
111.
Bartłomiej Bosek, Stefan Felsner, Kolja Knaur, Grzegorz Matecki
News about Semiantichains and Unichain Coverings, Lecture Notes in Computer Science vol. 7353 (2012), 43-51
110.
On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436
109.
On-Line Chain Partitions of Orders: A Survey, Order vol. 29(1) (2012), 49-73
2011
108.
Jarosław Grytczuk, Jakub Przybyło, Xuding Zhu
Nonrepetitive list colourings of paths, Random Structures and Algorithms vol. 38 (2011), 162-173
107.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska, Andrzej Wroński
The commutator in equivalential algebras and Fregean varieties, Algebra Universalis vol. 65 (2011), 331-340
106.
Dirk Hofmann, Paweł Waszkiewicz
Approximation in quantale-enriched categories., Topology and its Applications vol. 158 (2011), 963-977
105.
Sylwia Antoniuk, Paweł Waszkiewicz
The duality of generalized metric spaces., Topology and its Applications vol. 158 (2011), 2371-2381
104.
103.
Jarosław Grytczuk, Jakub Kozik, Marcin Witkowski
Nonrepetitive sequences on arithmetic progressions, Electronic Journal of Combinatorics vol. 18 (2011), 1-9
102.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
101.
A graph-grabbing game, Combinatorics Probability and Computing vol. 20 (2011), 623-629
100.
Forbidden structures for efficient First-Fit chain partitioning (extended abstract), Electronic Notes in Discrete Mathematics vol. 38 (2011), 173-179
99.
Mr. Paint and Mrs. Correct Go Fractional, Electronic Journal of Combinatorics vol. 18 (1) (2011), 8
2010
98.
Term equation satisfiability over finite algebras, International Journal of Algebra and Computation vol. 20(8) (2010), 1001-1020
97.
Libor Barto, Marcin Kozik
Cyclic terms for SD(V) varieties revisited, Algebra Universalis vol. 64 (2010), 137-142
96.
Libor Barto, Marcin Kozik
New conditions for Taylor varieties and CSP, Proceedings of the 25th Ieee/acm Symposium On Logic in Computer Science Lics'10 (2010), 100-109
95.
Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
Tractability and learnabilty arising from algebras with few subpowers, SIAM Journal on Computing vol. 39 (2010), 3023-3037
94.
Joel Berman, Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
Varieties with few subalgebras of powers, Transactions of the American Mathematical Society vol. 362 (2010), 1445-1473
93.
Common patterns for metric and ordered fixed point theorems, in Proceedings of the 7th Workshop On Fixed Points in Computer Science (2010), 83-87
92.
91.
Dynamic Threshold Strategy for Universal Best Choice Problem, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AM (2010), 439–452
90.
A simple representation of subwords of the Fibonacci word, Information Processing Letters vol. 110 (2010), 956-960
89.
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)
88.
First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999
87.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
Tautologies over implication with negative literals, Mathematical Logic Quarterly vol. 56 (2010), 388-396
2009
86.
Periodic solutions of scalar differential equations without uniqueness, Boll. Unione Mat. Ital. (9) vol. 2(2) (2009), 445–448
85.
A 2EXPTIME Complete Varietal Membership Problem, SIAM Journal on Computing vol. 6 (2009), 2443-2467
84.
Libor Barto, Marcin Kozik, Todd Niven
83.
Libor Barto, Marcin Kozik
Congruence distributivity implies bounded width, SIAM Journal on Computing vol. 39 (2009), 1531-1542
82.
Libor Barto, Marcin Kozik, Miklós Maróti, Todd Niven
CSP dichotomy for special triads, Proceedings of the American Mathematical Society vol. 137 (2009), 2921-2934
81.
Libor Barto, Marcin Kozik
Constraint Satisfaction Problems of Bounded Width, Proceedings of the 50th Symposium On Foundations of Computer Science, Focs'09 (2009), 595-603
80.
Libor Barto, Marcin Kozik, Miklós Maróti, Ralph McKenzie, Todd Niven
Congruence modularity implies cyclic terms for finite algebras, Algebra Universalis vol. 61 (2009), 365-380
79.
Jarosław Grytczuk, Sebastian Czerwiński, Wiktor Żelazny
Lucky labelings of graphs, Information Processing Letters vol. 109 (2009), 1078-1081
78.
Jarosław Grytczuk, Stanisław Niwczyk, Tomasz Bartnicki
Weight choosability of graphs, Journal of Graph Theory vol. 60 (2009), 242-256
77.
Paweł Idziak, Ralph McKenzie, Matthew Valeriote
76.
Paweł Idziak, Keith Kearnes, Emil Kiss, Matthew Valeriote
Definable principal congruences and solvability, Annals of Pure and Applied Logic vol. 157 (2009), 30-49
75.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska
Fregean Varieties, International Journal of Algebra and Computation vol. 19 (2009), 595–645
74.
Noga Alon, Jarosław Grytczuk, Michał Lasoń, Mateusz Michałek
Splitting necklaces and measurable colorings of the real line, Proceedings of the American Mathematical Society vol. 137 (2009), 1593-1599
73.
On Domain Theory over Girard Quantales, Fundamenta Informaticae vol. 92 (2009), 169-192
72.
Antoine Genitrini, Jakub Kozik
71.
Rene David, Marek Zaionc
Counting proofs in propositional logic, Archive for Mathematical Logic vol. 48 (2009), 185-199
2008
70.
Witold Charatonik, Michał Wrona
69.
Witold Charatonik, Michał Wrona
Quantified Positive Temporal Constraints, Lecture Notes in Computer Science vol. 5213 (2008), 94-108
68.
A finite set of functions with an EXPTIME-complete composition problem, Theoretical Computer Science vol. 407 (2008), 330-341
67.
Marcin Kozik, Gábor Kun
The subdirectly irreducible algebras in the variety generated by graph algebras, Algebra Universalis vol. 58 (2008), 229-242
66.
Libor Barto, Marcin Kozik, Todd Niven
Graphs, polymorphisms and the complexity of homomorphism problems, Proceedings of the 40th Acm Symposium On Theory of Computing, Stoc'08 (2008), 789-796
65.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Sandi Klavzar, Stanisław Niwczyk
Nonrepetitive colorings of trees, Discrete Mathematics vol. 307 (2008), 163-172
64.
Jarosław Grytczuk, Hal Kierstead, Tomasz Bartnicki
The game of arboricity, Discrete Mathematics vol. 308 (2008), 1388-1393
63.
Jarosław Grytczuk, Tomasz Bartnicki
A note on the game chromatic index of graphs, Graphs and Combinatorics vol. 24 (2008), 1-4
62.
Noga Alon, Jarosław Grytczuk
Breaking the rhythm on graphs, Discrete Mathematics vol. 308 (2008), 1375-1380
61.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Matijaz Kovse, Tomasz Bartnicki, Zofia Miechowicz
Game chromatic number of Cartesian product graphs, Electronic Journal of Combinatorics vol. 15 (2008), 13
60.
Jarosław Grytczuk
Thue type problems for graphs, points, and numbers, Discrete Mathematics vol. 308 (2008), 4419-4429
59.
Jarosław Grytczuk
Invisible runners in finite fields, Information Processing Letters vol. 108 (2008), 64-67
58.
Jarosław Grytczuk, Hal Kierstead, Paweł Prałat
On-line Ramsey numbers for paths and stars, Discrete Mathematics and Theoretical Computer Science vol. 10 (2008), 63-74
57.
On-line coloring of P_5-free graphs, Acta Informatica vol. 45 (2008), 79-91
56.
Antoine Genitrini, Jakub Kozik, Grzegorz Matecki
On the density and the structure of the Peirce-like formulae, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 461-474
55.
Subcritical pattern languages for and/or trees, Discrete Mathematics and Theoretical Computer Science Proceedings (2008), 437–448
54.
Zofia Kostrzycka, Marek Zaionc
Asymptotic densities in logic and type theory, Studia Logica vol. 88 (2008), 385-403
53.
Antoine Genitrini, Jakub Kozik, Marek Zaionc
Intuitionistic vs. Classical Tautologies, Quantitative Comparison, Lecture Notes in Computer Science vol. 4941 (2008), 100-109
52.
Optimal Orientation On-Line, Lecture Notes in Computer Science vol. 4910 (2008), 271-279
2007
51.
Witold Charatonik, Michał Wrona
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
50.
49.
Lidia Badura, Marek Zaionc
Parametrizability by regular expressions for equations on words, Bulletin of the Section of Logic vol. 36 (2007), 79-93
48.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc
Classical and intuitionistic logic are asymptotically identical, Lecture Notes in Computer Science vol. 4646 (2007), 177-193
47.
Patrick Baier, Bartłomiej Bosek, Piotr Micek
On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13
2006
46.
An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322
45.
Partial metrisability of continuous posets, Mathematical Structures in Computer Science vol. 16 (2006), 359-372
44.
Undecidable problems concerning densities of languages, Discrete Mathematics and Theoretical Computer Science Proceedings (2006), 69-76
43.
On-line Coloring of I_s-free graphs and co-planar graphs, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AF (2006), 61-68
42.
Probability distribution for simple tautologies, Theoretical Computer Science vol. 355 (2006), 243-260
41.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48
2005
40.
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247
39.
Joel Berman, Paweł Idziak
Generative Complexity in Algebra, Memoirs of the American Mathematical Society vol. 175 (2005), 1-168
38.
On-line coloring and cliques covering for K_st-free graphs, Acta Informatica vol. 42 (2005), 1-20
37.
Completeness and Compactness of Quantitative Domains, Lecture Notes in Computer Science vol. 3623 (2005), 341-351
36.
Approximation Simply Characterized., Electronic Notes in Theoretical Computer Science vol. 140 (2005), 113-117
35.
Conditional Densities of Regular Languages, Electronic Notes in Theoretical Computer Science (2005), 67-79
34.
33.
Probabilistic approach to the lambda definability for fourth order types, Electronic Notes in Theoretical Computer Science (2005), 41-54
32.
Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13
2004
31.
Fredholm lternative and boundary value problems, Proceedings of the American Mathematical Society vol. 132(6) (2004), 1779-1784
30.
Zofia Kostrzycka, Marek Zaionc
Statistics of intuitionistic versus classical logics, Studia Logica vol. 76 (2004), 307 - 328
2003
29.
Jerzy Jaromczyk, Andrzej Pezarski, Maciej Ślusarek
An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51
28.
27.
Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127
26.
Asymptotic properties of logics, Schedae Informaticae vol. 12 (2003), 129-138
25.
Zofia Kostrzycka, Marek Zaionc
On the density of truth in Dummet logic, Bulletin of the Section of Logic vol. 32 (2003), 43-55
Przejdź do strony: