default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDusan Knop
Person information
- affiliation: Czech Technical University in Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate algorithmics for eliminating envy by donating goods. Auton. Agents Multi Agent Syst. 38(2): 43 (2024)- [c48]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology. AAAI 2024: 17380-17388 - [c47]Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich
:
Equitable Connected Partition and Structural Parameters Revisited: N-Fold Beats Lenstra. MFCS 2024: 29:1-29:16 - [i44]Argyrios Deligkas, Eduard Eiben, Dusan Knop, Simon Schierreich:
Individual Rationality in Topological Distance Games is Surprisingly Hard. CoRR abs/2404.14128 (2024) - [i43]Václav Blazej, Dusan Knop, Jan Pokorný, Simon Schierreich:
Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra. CoRR abs/2404.18968 (2024) - 2023
- [j27]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-grained view on bribery for group identification. Auton. Agents Multi Agent Syst. 37(1): 21 (2023) - [j26]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic diversity games: A complexity picture with more than two colors. Artif. Intell. 325: 104017 (2023) - [j25]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant factor approximation for tracking paths and fault tolerant feedback vertex set. Discret. Optim. 47: 100756 (2023) - [j24]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial kernels for tracking shortest paths. Inf. Process. Lett. 179: 106315 (2023) - [j23]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
High-multiplicity N-fold IP via configuration LP. Math. Program. 200(1): 199-227 (2023) - [c46]Václav Blazej, Robert Ganian, Dusan Knop, Jan Pokorný, Simon Schierreich, Kirill Simonov:
The Parameterized Complexity of Network Microaggregation. AAAI 2023: 6262-6270 - [c45]Dusan Knop, Simon Schierreich:
Host Community Respecting Refugee Housing. AAMAS 2023: 966-975 - [c44]Bartosz Kusek, Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop:
Bribery Can Get Harder in Structured Multiwinner Approval Election. AAMAS 2023: 1725-1733 - [c43]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. ECAI 2023: 303-310 - [c42]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth Is NP-Complete on Cubic Graphs. IPEC 2023: 7:1-7:13 - [c41]Michal Dvorák, Dusan Knop, Simon Schierreich:
Establishing Herd Immunity is Hard Even in Simple Geometric Networks. WAW 2023: 68-82 - [c40]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. TARK 2023: 272-286 - [i42]Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý:
Treewidth is NP-Complete on Cubic Graphs (and related results). CoRR abs/2301.10031 (2023) - [i41]Dusan Knop, Simon Schierreich:
Host Community Respecting Refugee Housing. CoRR abs/2302.13997 (2023) - [i40]Michal Dvorák, Dusan Knop, Simon Schierreich:
Establishing Herd Immunity is Hard Even in Simple Geometric Networks. CoRR abs/2307.06976 (2023) - [i39]Robert Ganian, Thekla Hamm, Dusan Knop, Sanjukta Roy, Simon Schierreich, Ondrej Suchý:
Maximizing Social Welfare in Score-Based Social Distance Games. CoRR abs/2312.07632 (2023) - [i38]Foivos Fioravantes, Dusan Knop, Jan Matyás Kristan, Nikolaos Melissinos, Michal Opler:
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology. CoRR abs/2312.09646 (2023) - 2022
- [j22]Tomas Gavenciak, Martin Koutecký, Dusan Knop:
Integer programming in parameterized complexity: Five miniatures. Discret. Optim. 44(Part): 100596 (2022) - [j21]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters. Inf. Comput. 289(Part): 104943 (2022) - [j20]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-bounded cuts: Proper interval graphs and structural parameters. J. Comput. Syst. Sci. 126: 21-43 (2022) - [j19]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. SIAM J. Discret. Math. 36(1): 536-572 (2022) - [c39]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. AAAI 2022: 5034-5042 - [c38]Václav Blazej, Dusan Knop, Simon Schierreich:
Controlling the Spread of Two Secrets in Diverse Social Networks (Student Abstract). AAAI 2022: 12919-12920 - [c37]Dusan Knop, Simon Schierreich, Ondrej Suchý:
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract). AAAI 2022: 12987-12988 - [c36]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. AAMAS 2022: 127-135 - [c35]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations. ESA 2022: 22:1-22:16 - [c34]Dusan Knop, Martin Koutecký:
Scheduling Kernels via Configuration LP. ESA 2022: 73:1-73:15 - [i37]Niclas Boehmer, Robert Bredereck, Klaus Heeger, Dusan Knop, Junjie Luo:
Multivariate Algorithmics for Eliminating Envy by Donating Goods. CoRR abs/2202.01716 (2022) - [i36]Robert Ganian, Thekla Hamm, Dusan Knop, Simon Schierreich, Ondrej Suchý:
Hedonic Diversity Games: A Complexity Picture with More than Two Colors. CoRR abs/2202.09210 (2022) - [i35]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Polynomial Kernels for Tracking Shortest Paths. CoRR abs/2202.11927 (2022) - [i34]Václav Blazej, Pratibha Choudhary, Dusan Knop, Simon Schierreich, Ondrej Suchý, Tomás Valla:
On Polynomial Kernels for Traveling Salesperson Problem and its Generalizations. CoRR abs/2207.01109 (2022) - 2021
- [j18]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
The complexity landscape of decompositional parameters for ILP: Programs with few global variables and constraints. Artif. Intell. 300: 103561 (2021) - [j17]Dusan Knop:
Local linear set on graphs with bounded twin cover number. Inf. Process. Lett. 170: 106118 (2021) - [j16]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Parameterized complexity of configuration integer programs. Oper. Res. Lett. 49(6): 908-913 (2021) - [j15]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. SIAM J. Discret. Math. 35(1): 546-574 (2021) - [j14]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. SIAM J. Discret. Math. 35(2): 840-892 (2021) - [j13]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph isomorphism restricted by lists. Theor. Comput. Sci. 860: 51-71 (2021) - [c33]Robert Bredereck, Aleksander Figiel, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Made More Practical. AAMAS 2021: 260-268 - [c32]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. WAOA 2021: 23-38 - [i33]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Finding Small Multi-Demand Set Covers with Ubiquitous Elements and Large Sets is Fixed-Parameter Tractable. CoRR abs/2104.10124 (2021) - [i32]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. CoRR abs/2105.08376 (2021) - [i31]Dusan Knop, Simon Schierreich, Ondrej Suchý:
Balancing the Spread of Two Opinions in Sparse Social Networks. CoRR abs/2105.10184 (2021) - [i30]Václav Blazej, Pratibha Choudhary, Dusan Knop, Jan Matyás Kristan, Ondrej Suchý, Tomás Valla:
Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set. CoRR abs/2108.01430 (2021) - 2020
- [j12]Dusan Knop:
Partitioning graphs into induced subgraphs. Discret. Appl. Math. 272: 31-42 (2020) - [j11]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold integer programming and applications. Math. Program. 184(1): 1-34 (2020) - [j10]Laurent Bulteau, Danny Hermelin, Dusan Knop, Anthony Labarre, Stéphane Vialette:
The Clever Shopper Problem. Theory Comput. Syst. 64(1): 17-34 (2020) - [j9]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. ACM Trans. Economics and Comput. 8(3): 12:1-12:28 (2020) - [j8]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. ACM Trans. Comput. Theory 12(3): 19:1-19:19 (2020) - [c31]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. AAAI 2020: 1830-1837 - [c30]Robert Bredereck, Piotr Faliszewski, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
Parameterized Algorithms for Finding a Collective Set of Items. AAAI 2020: 1838-1845 - [c29]Niclas Boehmer, Robert Bredereck, Dusan Knop, Junjie Luo:
Fine-Grained View on Bribery for Group Identification. IJCAI 2020: 67-73 - [c28]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. ISAAC 2020: 36:1-36:14 - [c27]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. IPEC 2020: 8:1-8:15 - [c26]Radek Husek, Dusan Knop, Tomás Masarík:
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. IPEC 2020: 16:1-16:18 - [c25]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph Isomorphism Restricted by Lists. WG 2020: 106-118 - [c24]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. WINE 2020: 59-73 - [i29]Radek Husek, Dusan Knop, Tomás Masarík:
Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View. CoRR abs/2002.03583 (2020) - [i28]Dusan Knop, Martin Koutecký:
Scheduling Kernels via Configuration LP. CoRR abs/2003.02187 (2020) - [i27]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming. CoRR abs/2005.04907 (2020) - [i26]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Multidimensional Stable Roommates with Master List. CoRR abs/2009.14191 (2020) - [i25]Steven Chaplick, Petr A. Golovach, Tim A. Hartmann, Dusan Knop:
Recognizing Proper Tree-Graphs. CoRR abs/2011.11670 (2020) - [i24]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. CoRR abs/2012.00079 (2020)
2010 – 2019
- 2019
- [j7]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. ACM J. Exp. Algorithmics 24(1): 2.2:1-2.2:22 (2019) - [j6]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. Log. Methods Comput. Sci. 15(4) (2019) - [c23]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Quadratic Programming via Explicit and Structural Restrictions. AAAI 2019: 1477-1484 - [c22]Robert Bredereck, Andrzej Kaczmarczyk, Dusan Knop, Rolf Niedermeier:
High-Multiplicity Fair Allocation: Lenstra Empowered by N-fold Integer Programming. EC 2019: 505-523 - [c21]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak, Michal Pilipczuk, Marcin Wrochna:
Integer Programming and Incidence Treedepth. IPCO 2019: 194-204 - [c20]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. ISAAC 2019: 44:1-44:14 - [c19]Dusan Knop, Tomás Masarík, Tomás Toufar:
Parameterized Complexity of Fair Vertex Evaluation Problems. MFCS 2019: 33:1-33:16 - [c18]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. STACS 2019: 25:1-25:17 - [c17]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints. STACS 2019: 44:1-44:15 - [c16]Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman:
Kernelization of Graph Hamiltonicity: Proper H-Graphs. WADS 2019: 296-310 - [i23]Robert Bredereck, Jiehua Chen, Dusan Knop, Junjie Luo, Rolf Niedermeier:
Adapting Stable Matchings to Evolving Preferences. CoRR abs/1907.01375 (2019) - [i22]Dusan Knop, Martin Koutecký, Asaf Levin, Matthias Mnich, Shmuel Onn:
Multitype Integer Monoid Optimization and Applications. CoRR abs/1909.07326 (2019) - [i21]Matthias Bentert, Klaus Heeger, Dusan Knop:
Length-Bounded Cuts: Proper Interval Graphs and Structural Parameters. CoRR abs/1910.03409 (2019) - [i20]Robert Bredereck, Klaus Heeger, Dusan Knop, Rolf Niedermeier:
Parameterized Complexity of Stable Roommates with Ties and Incomplete Lists Through the Lens of Graph Parameters. CoRR abs/1911.09379 (2019) - 2018
- [j5]Pavel Dvorák, Dusan Knop:
Parameterized Complexity of Length-bounded Cuts and Multicuts. Algorithmica 80(12): 3597-3617 (2018) - [j4]Dusan Knop, Tomás Masarík:
Computational complexity of distance edge labeling. Discret. Appl. Math. 246: 80-98 (2018) - [j3]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Parameterized complexity of distance labeling and uniform channel assignment problems. Discret. Appl. Math. 248: 46-55 (2018) - [j2]Dusan Knop, Martin Koutecký:
Scheduling meets n-fold integer programming. J. Sched. 21(5): 493-503 (2018) - [c15]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. AAMAS 2018: 256-264 - [c14]Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Unary Integer Linear Programming with Structural Restrictions. IJCAI 2018: 1284-1290 - [c13]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. ISAAC 2018: 18:1-18:13 - [c12]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Integer Programming in Parameterized Complexity: Three Miniatures. IPEC 2018: 21:1-21:16 - [c11]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. STACS 2018: 26:1-26:15 - [c10]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. SEA 2018: 10:1-10:14 - [i19]Dusan Knop, Martin Koutecký, Matthias Mnich:
A Unifying Framework for Manipulation Problems. CoRR abs/1801.09584 (2018) - [i18]Eduard Eiben, Dusan Knop, Fahad Panolan, Ondrej Suchý:
Complexity of the Steiner Network Problem with Respect to the Number of Terminals. CoRR abs/1802.08189 (2018) - [i17]Katerina Altmanová, Dusan Knop, Martin Koutecký:
Evaluating and Tuning n-fold Integer Programming. CoRR abs/1802.09007 (2018) - [i16]Dusan Knop, Tomás Masarík, Tomás Toufar:
Parameterized complexity of fair deletion problems II. CoRR abs/1803.06878 (2018) - [i15]Dusan Knop, Michal Pilipczuk, Marcin Wrochna:
Tight complexity lower bounds for integer linear programming with few constraints. CoRR abs/1811.01296 (2018) - [i14]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. CoRR abs/1812.01852 (2018) - 2017
- [j1]Lukás Folwarczný, Dusan Knop:
IV-matching is strongly NP-hard. Inf. Process. Lett. 125: 5-8 (2017) - [c9]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. ESA 2017: 54:1-54:14 - [c8]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. IJCAI 2017: 607-613 - [c7]Dusan Knop:
Partitioning Graphs into Induced Subgraphs. LATA 2017: 338-350 - [c6]Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. STACS 2017: 46:1-46:14 - [c5]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. WG 2017: 344-357 - [i13]Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar:
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. CoRR abs/1703.00544 (2017) - [i12]Dusan Knop, Martin Koutecký, Matthias Mnich:
Combinatorial n-fold Integer Programming and Applications. CoRR abs/1705.08657 (2017) - [i11]Pavel Dvorák, Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak:
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints. CoRR abs/1706.06084 (2017) - [i10]Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý:
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. CoRR abs/1710.00668 (2017) - [i9]Tomas Gavenciak, Dusan Knop, Martin Koutecký:
Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity. CoRR abs/1711.02032 (2017) - 2016
- [c4]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract). COCOON 2016: 67-78 - [c3]Pavel Dvorák, Dusan Knop, Tomás Masarík:
Anti-Path Cover on Sparse Graph Classes. MEMICS 2016: 82-86 - [i8]Dusan Knop, Martin Koutecký:
Scheduling meets n-fold Integer Programming. CoRR abs/1603.02611 (2016) - [i7]Pavel Klavík, Dusan Knop, Peter Zeman:
Graph Isomorphism Restricted by Lists. CoRR abs/1607.03918 (2016) - [i6]Pavel Dvorák, Dusan Knop, Tomás Toufar:
Target Set Selection in Dense Graph Classes. CoRR abs/1610.07530 (2016) - 2015
- [c2]Dusan Knop, Tomás Masarík:
Computational Complexity of Distance Edge Labeling. IWOCA 2015: 287-298 - [c1]Pavel Dvorak, Dusan Knop:
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. TAMC 2015: 441-452 - [i5]Lukás Folwarczný, Dusan Knop:
IV-matching is strongly NP-hard. CoRR abs/1506.08388 (2015) - [i4]Jirí Fiala, Tomas Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl:
Distance constrained labeling on graphs with bounded neighborhood diversity. CoRR abs/1507.00640 (2015) - [i3]Dusan Knop, Tomás Masarík:
Computational complexity of distance edge labeling. CoRR abs/1508.01014 (2015) - [i2]Dusan Knop:
A note on partition into triangles parametrized by tree-width. CoRR abs/1508.04725 (2015) - [i1]Dusan Knop, Pavel Dvorak:
Parameterized complexity of length-bounded cuts and multi-cuts. CoRR abs/1511.02801 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
