Instytut Informatyki Analitycznej - lista publikacji
Nadjednostka:
Podjednostki:
1-200 z 302.
2020
302.
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width, 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958--971
301.
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width, 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2020 vol. 154 (LIPIcs) (2020), 39:1--39:16
300.
Online Coloring of Short Intervals, INTERNATIONAL WORKSHOP ON APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS (APPROX) (2020),
299.
Online metric algorithms with untrusted predictions, INTERNATIONAL CONFERENCE ON MACHINE LEARNING (ICML) (2020),
298.
Planar graphs have bounded nonrepetitive chromatic number, ADVANCES IN COMBINATORICS (2020),
297.
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem, LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS (LIPICS) vol. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (2020), 41:1-41:18
296.
Solving CSPs using weak local consistency, SIAM J COMPUT (2020), to appear
295.
294.
Monochromatic Triangles, Intermediate Matrix Products, and Convolutions, 11TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE CONFERENCE (ITCS 2020) vol. 151 (Leibniz International Proceedings in Informatics (LIPIcs)) (2020), 53:1-53:18
293.
Equivalences between triangle and range query problems, ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS 2020 (SODA'20) (2020), 30-47
2019
292.
2-Coloring number revisited, THEOR COMPUT SCI vol. 796 (2019), 187-195
291.
Preface, COMB PROBAB COMPUT vol. 28(4) (2019), 483-484
290.
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs, SIAM J COMPUT vol. 48(6) (2019), 1763–1795
289.
Jana Novotná, Karolina Okrasa, Michał Pilipczuk, Paweł Rzążewski, Erik Jan van Leeuwen, Bartosz Walczak
Subexponential-time algorithms for finding large induced sparse subgraphs vol. 148 of Leibniz International Proceedings in Informatics (2019), "14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
288.
Outerstring graphs are χ-bounded, SIAM J DISCRETE MATH vol. 33 (2019), 2181-2199
287.
Coloring triangle-free L-graphs with O(log log n) colors, AMUC vol. 88 (2019), 1063-1069
286.
Majority coloring of infinite digraphs, ACTA MATHEMATICA UNIVERSITATIS COMENIANAE vol. 88 (3) (2019), 371-376
285.
On the enumeration of closures and environments with an application to random generation, LOG METH COMPUT SCI vol. 15, Issue 4 (2019), 3:1–3:21
284.
Statistical Properties of Lambda Terms, ELECTRON J COMB vol. 26, Issue 4 (2019), 70
283.
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs, COMPUTING AND COMBINATORICS, 25TH INTERNATIONAL CONFERENCE, COCOON 2019, XI'AN, CHINA, JULY 29–31, 2019, PROCEEDINGS vol. 11653 (2019), 232-239
282.
Connecting the Dots (with Minimum Crossings), 35TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY vol. 129 (2019), 7:1-7:17
281.
Towards the average-case analysis of substitution resolution in λ-calculus vol. Leibniz International Proceedings in Informatics (LIPIcs) (2019), "4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
280.
279.
Coloring curves that cross a fixed curve, DISCRETE COMPUT GEOM vol. 61 (2019), 830-851
278.
277.
Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk, Sebastian Czerwiński, Tomasz Bartnicki, Zofia Miechowicz
Generalized arboricity of graphs with large girth, DISCRETE MATH vol. 342(5) (2019), 1343-1350
276.
275.
Weight choosability of oriented hypergraphs, ARS MATH CONTEMP vol. 16 (1) (2019), 111-117
274.
Majority coloring game, DISCRETE APPL MATH vol. 255 (2019), 15-20
2018
273.
Compression of Dynamic Graphs Generated by a Duplication Model, 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON 2018) (2018), 1089-1096
272.
Lossless Compression of Binary Trees With Correlated Vertex Names, IEEE T INFORM THEORY vol. 64 (9) (2018), 6070-6080
271.
270.
269.
Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak
Centroidal Localization Game, ELECTRON J COMB vol. 25 (4) (2018), 1-19
268.
Common tangents of two disjoint polygons in linear time and constant workspace, ACM T ALGORITHMS vol. 15 (2018), 12:1-12:21
267.
266.
265.
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
264.
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)
263.
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)
262.
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
261.
A Tight Bound for Shortest Augmenting Paths on Trees vol. 10870 (2018), "LATIN 2018: Theoretical Informatics", Springer
260.
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
259.
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)
258.
257.
Absorption and directed Jónsson terms, (2018), "Don Pigozzi on Abstract Algebraic Logic", Springer
256.
Defective 3-Paintability of Planar Graphs, ELECTRON J COMB vol. 25 (2) (2018), 20
255.
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
254.
An Easy Subexponential Bound for Online Chain Partitioning, ELECTRON J COMB vol. 25(2) (2018), #P2.28
253.
Deferred On-Line Bipartite Matching, ELECTRON J COMB vol. 25 (2) (2018), 19
252.
Every Plane Graph is Facially-Non-Repetitively C-choosable, ELECTRON J COMB vol. 25 (1) (2018), 13
251.
A new lower bound for the on-line coloring of intervals with bandwidth, THEOR COMPUT SCI vol. 708 (2018), 96-100
250.
Shortest Augmenting Paths for Online Matchings on Trees, THEOR COMPUT SYST vol. 62(2) (2018), 337-348
249.
248.
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)
247.
246.
245.
On an Extremal Problem for Poset Dimension, ORDER vol. 35(3) (2018), 489-493
244.
243.
The Partial Visibility Representation Extension Problem, ALGORITHMICA vol. 80 (8) (2018), 2286-2323
2017
242.
On Symmetries of Non-Plane Trees in a Non-Uniform Model, 14TH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS (ANALCO 2017) (2017), 156-163
241.
Boolean dimension and local dimension vol. 61 of Electronic Notes in Discrete Mathematics (2017), "The Ninth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2017", Elsevier Science
240.
On the Dimension of Posets with Cover Graphs of Treewidth 2, ORDER vol. 34.2 (2017), 185-234
239.
Topological minors of cover graphs and dimension, J GRAPH THEOR vol. 86.3 (2017), 295–314
238.
Burling graphs, chromatic number, and orthogonal tree-decompositions, ELECTRONIC NOTES IN DISCRETE MATHEMATICS vol. 61 (2017), 415-420
237.
Planar posets have dimension at most linear in their height, SIAM J DISCRETE MATH vol. 31 (4) (2017), 2754–2790
236.
235.
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
234.
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
233.
Majority Choosability of Digraphs, ELECTRON J COMB vol. 24(3) (2017), #P3.57
232.
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
231.
Combinatorics of λ-terms: a natural approach, J LOGIC COMPUT vol. Volume 27, Issue 8 (2017), 2611–2630
230.
Universal targets for homomorphisms of edge-colored graphs, J COMB THEORY B vol. 127 (2017), 53-64
229.
Uniform Cross-entropy Clustering, SCHEDAE INFORMATICAE vol. 25 (2017), 117-126
228.
227.
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., PROCEEDINGS OF THE ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS) (2017),
226.
Minimal Inference Problem over Finite Domains: The Landscape of Complexity. Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)., PROCEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR) (2017),
225.
The Complexity of Counting Quantifiers on Equality Languages, THEOR COMPUT SCI vol. 670 (2017), 56–67
224.
Absorption in Universal Algebra and CSP, (2017), "The Constraint Satisfaction Problem: Complexity and Approximability", Schloss Dagstuhl – Leibniz-Zentrum für Informatik
223.
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
222.
221.
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
220.
Boltzmann Samplers for Closed Simply-Typed Lambda Terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 10137 (2017), 120-135
219.
On the Beer index of convexity and its variants, DISCRETE COMPUT GEOM vol. 57 (2017), 179-214
218.
Minors and dimension, J COMB THEORY B vol. 122 (2017), 668-689
217.
On the likelihood of normalisation in combinatory logic, J LOGIC COMPUT vol. Volume 27, Issue 7 (2017), 2251–2269
2016
216.
Lossless compression of binary trees with correlated vertex names, IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT 2016) (2016), 1217-1221
215.
An O(n log n) algorithm for finding edge span of cacti, J COMB OPTIM vol. 31(4) (2016), 1373-1382
214.
On the hardness of computing span of subcubic graphs, INFORM PROCESS LETT vol. 116(1) (2016), 26-32
213.
Criteria for regularity of Mahler power series and Becker's conjecture, J NUMBER THEORY vol. 174 (2016), 456-486
212.
Nonrepetitive colouring via entropy compression, COMBINATORICA vol. Volume 36, Issue 6 (2016), 661-686
211.
Building Code with Dynamic Staging, THE COMPUTING RESEARCH REPOSITORY (2016), 11
210.
ManyDSL: A Host for Many Languages, THE COMPUTING RESEARCH REPOSITORY (2016), 14
209.
The Complexity of Counting Quantifiers on Equality Languages, LECTURE NOTES IN COMPUTER SCIENCE vol. 9709 (2016), 333--342
208.
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)
207.
A note on concurrent graph sharing games, INTEGERS vol. Volume 16, G1 (2016), 5
206.
Pathwidth and nonrepetitive list colorings, ELECTRON J COMB vol. Volume 23, Issue 4 (2016), 19
205.
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
204.
The subpower membership problem for semigroups, INT J ALGEBR COMPUT vol. 26 (2016), 1435-1451
203.
Chip Games and Paintability, ELECTRON J COMB vol. 23 (3) (2016), 12
202.
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
201.
Distributed Tasks: Introducing Distributed Computing to Programming Competitions, OLYMPIADS IN INFORMATICS vol. 10 (2016), 177-194
200.
Counting Triangles in Large Graphs on GPU, 2016 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW) (2016), 740-746
199.
Harmonious coloring of uniform hypergraphs, APPL ANAL DISCR MATH vol. 10(1) (2016), 73-87
198.
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
197.
Robustly Solvable Constraint Satisfaction Problems, SIAM J COMPUT vol. 45(4) (2016), 1646–1669
196.
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
195.
Improved algorithms for colorings of simple hypergraphs and applications, J COMB THEORY B vol. Volume 116 (2016), 312-332
194.
Multipass greedy coloring of simple uniform hypergraphs, RANDOM STRUCT ALGOR vol. Volume 48, Issue 1 (2016), 125-146
193.
Decomposition of multiple packings with subquadratic union complexity, COMB PROBAB COMPUT vol. 25 (2016), 145-153
192.
A natural counting of lambda terms, LECTURE NOTES IN COMPUTER SCIENCE vol. 9587 (2016), 183-194
191.
190.
Tree-width and dimension, COMBINATORICA vol. 36 (2016), 431-450
189.
Nonrepetitive colorings of line arrangements, EUR J COMBIN vol. 51 (2016), 275-279
188.
On the Duality of Semiantichains and Unichain Coverings, ORDER vol. 33(1) (2016), 29-38
2015
187.
186.
The Backbone Coloring Problem for Bipartite Backbones, GRAPH COMBINATOR vol. 31(5) (2015), 1487-1496
185.
184.
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
183.
Algebraic Properties of Valued Constraint Satisfaction Problem, PROCEEDINGS OF 42ND INTERNATIONAL COLLOQUIUM, ICALP 2015 (2015), 846-858
182.
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.
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., 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
Przejdź do strony: