Instytut Informatyki Analitycznej - lista publikacji

201-400 z 426.

2017

226.
Martin Balko, Vít Jelínek, Pavel Valtr, Bartosz Walczak

2016

223.
Lossless compression of binary trees with correlated vertex names, IEEE International Symposium on Information Theory [ISIT], (2016), 1217-1221
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
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
212.
Steven Chaplick, Grzegorz Guśpiel, Grzegorz Gutowski, Tomasz Krawczyk, Giuseppe Liotta
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
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
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
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
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
198.
Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych
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
195.
Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki

2015

190.
Tomasz Krawczyk, Bartosz Walczak
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
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
183.
Libor Barto, Marcin Kozik, David Stanovský
182.
Marcin Kozik, Andrei Krokhin, Matthew Valeriote, Ross Willard
181.
178.
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman
177.
Michał Dębski, Jarosław Grytczuk, Małgorzata Śleszyńska-Nowak
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)
171.
Roman Glebov, Andrzej Grzesik, Tereza Klimošová, Daniel Král

2014

169.
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
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
160.
Anetta Górnicka, Joanna Grygiel, Katarzyna Grygiel
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.
155.
Tomasz Krawczyk, Bartosz Walczak
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)
150.
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki, Sebastian Czerwiński, Tomasz Bartnicki, Wiktor Żelazny

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
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.
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
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
139.
138.
Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek
On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615
134.
Stefan Felsner, Tomasz Krawczyk, William T. Trotter
133.
Stefan Felsner, Kamil Kloch, Grzegorz Matecki, Piotr Micek
129.
Rene David, Katarzyna Grygiel, Jakub Kozik, Christophe Raffalli, Guillaume Theyssier,

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
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
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
110.
109.
Bartłomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek

2011

108.
Jarosław Grytczuk, Jakub Przybyło, Xuding Zhu
107.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska, Andrzej Wroński
103.
102.
Kolja Knauer, Piotr Micek, Torsten Ueckerdt
How to eat 4/9 of a pizza, Discrete Mathematics vol. 311 (2011), 1635-1645
100.
Forbidden structures for efficient First-Fit chain partitioning (extended abstract), Electronic Notes in Discrete Mathematics vol. 38 (2011), 173-179

2010

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
94.
Joel Berman, Paweł Idziak, Petar Marković, Ralph McKenzie, Matthew Valeriote, Ross Willard
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
91.
Dynamic Threshold Strategy for Universal Best Choice Problem, Discrete Mathematics and Theoretical Computer Science Proceedings vol. AM (2010), 439–452
89.
Bartłomiej Bosek, Tomasz Krawczyk
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)
87.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc

2009

86.
Periodic solutions of scalar differential equations without uniqueness, Boll. Unione Mat. Ital. (9) vol. 2(2) (2009), 445–448
82.
Libor Barto, Marcin Kozik, Miklós Maróti, Todd Niven
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
79.
Jarosław Grytczuk, Sebastian Czerwiński, Wiktor Żelazny
78.
Jarosław Grytczuk, Stanisław Niwczyk, Tomasz Bartnicki
76.
Paweł Idziak, Keith Kearnes, Emil Kiss, Matthew Valeriote
75.
Paweł Idziak, Irena Katarzyna Korwin-Słomczyńska
74.
Noga Alon, Jarosław Grytczuk, Michał Lasoń, Mateusz Michałek

2008

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
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
62.
Noga Alon, Jarosław Grytczuk
61.
Bostjan Bresar, Jarosław Grytczuk, Iztok Peterin, Matijaz Kovse, Tomasz Bartnicki, Zofia Miechowicz
60.
Jarosław Grytczuk
59.
Jarosław Grytczuk
58.
Jarosław Grytczuk, Hal Kierstead, Paweł Prałat
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

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
48.
Daniele Gardy, Herve Fournier, Antoine Genitrini, Marek Zaionc

2006

46.
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
41.
On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48

2005

40.
Wit Foryś, Tomasz Krawczyk
An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247
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
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

30.

2003

29.
An optimal competitive algorithm for the minimal clique covering in circular arc graphs, European Workshop on Computational Geometry [EuroCG], (2003), 48-51
27.
Wit Foryś, Tomasz Krawczyk