• 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 102 matches

• 2022
• 
  Mahdi Belbasi, Martin Fürer:
  An Improvement of Reed's Treewidth Approximation. J. Graph Algorithms Appl. 26(2): 257-282 (2022)
• 2021
• 
  Mahdi Belbasi, Martin Fürer:
  Finding All Leftmost Separators of Size $\le k$. COCOA 2021: 273-287
• 
  Mahdi Belbasi, Martin Fürer:
  An Improvement of Reed's Treewidth Approximation. WALCOM 2021: 166-181
• 
  Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
  Efficient diagonalization of symmetric matrices associated with graphs of small treewidth. CoRR abs/2109.02515 (2021)
• 
  Mahdi Belbasi, Martin Fürer:
  Finding All Leftmost Separators of Size ≤k. CoRR abs/2111.02614 (2021)
• 2020
• 
  Martin Fürer, Carlos Hoppen, Vilmar Trevisan:
  Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ICALP 2020: 52:1-52:18
• 
  Mahdi Belbasi, Martin Fürer:
  An Improvement of Reed's Treewidth Approximation. CoRR abs/2010.03105 (2020)
• 2019
• 
  Mahdi Belbasi, Martin Fürer:
  A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. CSR 2019: 38-49
• 
  Mahdi Belbasi, Martin Fürer:
  A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraziation. CoRR abs/1901.07118 (2019)
• 2018
• 
  Martin Fürer, Carlos Hoppen, David Pokrass Jacobs, Vilmar Trevisan:
  Locating the Eigenvalues for Graphs of Small Clique-Width. LATIN 2018: 475-489
• 2017
• 
  Martin Fürer, Huiwen Yu:
  Space Saving by Dynamic Algebraization Based on Tree-Depth. Theory Comput. Syst. 61(2): 283-304 (2017)
• 
  Martin Fürer:
  Efficient computation of the characteristic polynomial of a threshold graph. Theor. Comput. Sci. 657: 3-10 (2017)
• 
  Eleni Bakali, Panagiotis Cheilaris, Dimitris Fotakis, Martin Fürer, Costas D. Koutras, Euripides Markou, Christos Nomikos, Aris Pagourtzis, Christos H. Papadimitriou, Nikolaos S. Papaspyrou, Katerina Potika:
  Stathis Zachos at 70! CIAC 2017: 469-484
• 
  Martin Fürer:
  On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CIAC 2017: 260-271
• 
  Martin Fürer:
  Multi-Clique-Width. ITCS 2017: 14:1-14:13
• 
  Martin Fürer:
  On the Combinatorial Power of the Weisfeiler-Lehman Algorithm. CoRR abs/1704.01023 (2017)
• 
  Mahdi Belbasi, Martin Fürer:
  Saving Space by Dynamic Algebraization Based on Tree Decomposition: Minimum Dominating Set. CoRR abs/1711.10088 (2017)
• 2016
• 
  Martin Fürer:
  Faster Computation of Path-Width. IWOCA 2016: 385-396
• 
  Martin Fürer:
  Degree-Bounded Trees. Encyclopedia of Algorithms 2016: 516-519
• 
  Martin Fürer:
  Faster Computation of Path-Width. CoRR abs/1606.06566 (2016)
• 2015
• 
  Martin Fürer:
  Efficient Computation of the Characteristic Polynomial of a Threshold Graph. FAW 2015: 45-51
• 
  Martin Fürer:
  Efficient Computation of the Characteristic Polynomial of a Threshold Graph. CoRR abs/1503.00617 (2015)
• 
  Martin Fürer:
  Multi-Clique-Width. CoRR abs/1511.04479 (2015)
• 2014
• 
  Martin Fürer:
  Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. Algorithmica 68(3): 626-642 (2014)
• 
  Martin Fürer, Shiva Prasad Kasiviswanathan:
  Approximately Counting Embeddings into Random Graphs. Comb. Probab. Comput. 23(6): 1028-1056 (2014)
• 
  Martin Fürer, Huiwen Yu:
  Space Saving by Dynamic Algebraization. CSR 2014: 375-388
• 
  Martin Fürer, Huiwen Yu:
  Approximating the k -Set Packing Problem by Local Improvements. ISCO 2014: 408-420
• 
  Martin Fürer:
  A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. LATIN 2014: 72-83
• 
  Martin Fürer:
  How Fast Can We Multiply Large Integers on an Actual Computer? LATIN 2014: 660-670
• 
  Kashyap Dixit, Martin Fürer:
  Counting cliques and clique covers in random graphs. CoRR abs/1411.6673 (2014)

skipping 72 more matches