• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 89 matches

• 2024
• 
  Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
  The Treewidth and Pathwidth of Graph Unions. SIAM J. Discret. Math. 38(1): 261-276 (2024)
• 
  Matthias Lanzinger, Igor Razgon:
  FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS 2024: 48:1-48:17
• 
  Igor Razgon:
  The splitting power of branching programs of bounded repetition and CNFs of bounded width. Electron. Colloquium Comput. Complex. TR24 (2024)
• 2023
• 
  Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
  Fractional covers of hypergraphs with bounded multi-intersection. Theor. Comput. Sci. 979: 114204 (2023)
• 
  Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon:
  New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth. WG 2023: 72-85
• 
  Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon:
  New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth. CoRR abs/2302.10643 (2023)
• 
  Matthias Lanzinger, Igor Razgon:
  FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. CoRR abs/2309.17049 (2023)
• 2022
• 
  Vadim V. Lozin, Igor Razgon:
  Tree-width dichotomy. Eur. J. Comb. 103: 103517 (2022)
• 
  Igor Razgon:
  The splitting power of branching programs of bounded repetition and CNFs of bounded width. CoRR abs/2201.02173 (2022)
• 
  Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, Viktor Zamaraev:
  The treewidth and pathwidth of graph unions. CoRR abs/2202.07752 (2022)
• 
  Igor Razgon:
  FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank. CoRR abs/2212.13423 (2022)
• 2021
• 
  Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
  Complexity Analysis of Generalized and Fractional Hypertree Decompositions. J. ACM 68(5): 38:1-38:50 (2021)
• 
  Igor Razgon:
  Classification of OBDD Size for Monotone 2-CNFs. IPEC 2021: 25:1-25:15
• 
  Igor Razgon:
  Classification of OBDD size for monotone 2-CNFs. CoRR abs/2103.09115 (2021)
• 
  Igor Razgon:
  Classification of OBDD size for monotone 2-CNFs. Electron. Colloquium Comput. Complex. TR21 (2021)
• 2020
• 
  Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
  Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS 2020: 41:1-41:14
• 
  Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
  Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR abs/2002.05239 (2020)
• 
  Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon:
  Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR abs/2007.01830 (2020)
• 
  Vadim V. Lozin, Igor Razgon:
  Tree-width dichotomy. CoRR abs/2012.01115 (2020)
• 2019
• 
  Andrea Calì, Igor Razgon:
  Regular resolution for CNF of bounded incidence treewidth with few long clauses. CoRR abs/1905.10867 (2019)
• 2018
• 
  Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
  Linear read-once and related Boolean functions. Discret. Appl. Math. 250: 16-27 (2018)
• 
  Vadim V. Lozin, Igor Razgon, Viktor Zamaraev:
  Well-quasi-ordering versus clique-width. J. Comb. Theory B 130: 1-18 (2018)
• 
  Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
  Linear read-once and related Boolean functions. CoRR abs/1805.10159 (2018)
• 2017
• 
  Igor Razgon:
  On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. Theory Comput. Syst. 61(3): 755-776 (2017)
• 
  Vadim V. Lozin, Igor Razgon, Viktor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
  Specifying a positive threshold function via extremal points. ALT 2017: 208-222
• 
  Andrea Calì, Davide Martinenghi, Igor Razgon, Martín Ugarte:
  Querying the Deep Web: Back to the Foundations. AMW 2017
• 
  Vadim V. Lozin, Igor Razgon, Victor Zamaraev, Elena Zamaraeva, Nikolai Yu. Zolotykh:
  Specifying a positive threshold function via extremal points. CoRR abs/1706.01747 (2017)
• 
  Andrea Calì, Florent Capelli, Igor Razgon:
  Non-FPT lower bounds for structural restrictions of decision DNNF. CoRR abs/1708.07767 (2017)
• 
  Igor Razgon:
  Partial matching width and its application to lower bounds for branching programs. CoRR abs/1709.08890 (2017)
• 2016
• 
  Igor Razgon:
  On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. Algorithmica 75(2): 277-294 (2016)

skipping 59 more matches