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

• 2012
• 
  Encarnación Abajo, Camino Balbuena, Ana Diánez:
  Girth of {C₃, ..., C_s}-free extremal graphs. Discret. Appl. Math. 160(9): 1311-1318 (2012)
• 
  Hosam Abdo, Darko Dimitrov, Ivan Gutman:
  On the Zagreb indices equality. Discret. Appl. Math. 160(1-2): 1-8 (2012)
• 
  Sarah Spence Adams, Paul Booth, Harold Jaffe, Denise Sakai Troxell, S. Luke Zinnen:
  Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. Discret. Appl. Math. 160(4-5): 436-447 (2012)
• 
  Sarah Spence Adams, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen:
  Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids. Discret. Appl. Math. 160(10-11): 1624-1633 (2012)
• 
  Tatsuya Akutsu, Daiji Fukagawa, Jesper Jansson, Kunihiko Sadakane:
  Inferring a graph from path frequency. Discret. Appl. Math. 160(10-11): 1416-1428 (2012)
• 
  Robert E. L. Aldred, Michael D. Plummer:
  Proximity thresholds for matching extension in the torus and Klein bottle. Discret. Appl. Math. 160(7-8): 985-991 (2012)
• 
  Abbas Alhakim:
  Spans of preference functions for de Bruijn sequences. Discret. Appl. Math. 160(7-8): 992-998 (2012)
• 
  Patrick Ali, Peter Dankelmann, Simon Mukwembi:
  Upper bounds on the Steiner diameter of a graph. Discret. Appl. Math. 160(12): 1845-1850 (2012)
• 
  Meysam Alishahi:
  Dynamic chromatic number of regular graphs. Discret. Appl. Math. 160(15): 2098-2103 (2012)
• 
  Madjid Alizadeh, A. K. Das, Hamid Reza Maimani, Mohammad Reza Pournaki, S. Yassemi:
  On the diameter and girth of zero-divisor graphs of posets. Discret. Appl. Math. 160(9): 1319-1324 (2012)
• 
  Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh:
  On the approximability of some degree-constrained subgraph problems. Discret. Appl. Math. 160(12): 1661-1679 (2012)
• 
  Milica Andelic, Carlos M. da Fonseca, Slobodan K. Simic, Dejan V. Tosic:
  Connected graphs of fixed order and size with maximal Q-index: Some spectral bounds. Discret. Appl. Math. 160(4-5): 448-459 (2012)
• 
  Martin Anthony:
  Generalization error bounds for the logical analysis of data. Discret. Appl. Math. 160(10-11): 1407-1415 (2012)
• 
  Martin Anthony, Joel Ratsaby:
  Robust cutpoints in the logical analysis of numerical data. Discret. Appl. Math. 160(4-5): 355-364 (2012)
• 
  Martin Anthony, Joel Ratsaby:
  Analysis of a multi-category classifier. Discret. Appl. Math. 160(16-17): 2329-2338 (2012)
• 
  Yoshikazu Aoshima, David Avis, Theresa Deering, Yoshitake Matsumoto, Sonoko Moriyama:
  On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes. Discret. Appl. Math. 160(15): 2104-2115 (2012)
• 
  Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
  Good edge-labelling of graphs. Discret. Appl. Math. 160(18): 2502-2513 (2012)
• 
  Júlio Araújo, Cláudia Linhares Sales:
  On the Grundy number of graphs with few P₄'s. Discret. Appl. Math. 160(18): 2514-2522 (2012)
• 
  C. Araúz:
  The Kirchhoff indexes of some composite networks. Discret. Appl. Math. 160(10-11): 1429-1440 (2012)
• 
  Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia:
  Minimizing the error of linear separators on linearly inseparable data. Discret. Appl. Math. 160(10-11): 1441-1452 (2012)
• 
  Yuichi Asahiro, Kenichi Kawahara, Eiji Miyano:
  NP-hardness of the sorting buffer problem on the uniform metric. Discret. Appl. Math. 160(10-11): 1453-1464 (2012)
• 
  Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
  Online maximum k-coverage. Discret. Appl. Math. 160(13-14): 1901-1913 (2012)
• 
  Laura Bahiense, Gordana Manic, Breno Piva, Cid C. de Souza:
  The maximum common edge subgraph problem: A polyhedral investigation. Discret. Appl. Math. 160(18): 2523-2541 (2012)
• 
  Patrick Bahls, Nicole A. Gin:
  Clawfreeness of the powers of a graph. Discret. Appl. Math. 160(9): 1390-1393 (2012)
• 
  Rangaswami Balakrishnan, T. Kavaskar:
  b-coloring of Kneser graphs. Discret. Appl. Math. 160(1-2): 9-14 (2012)
• 
  Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
  Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160(9): 1325-1332 (2012)
• 
  Cyril Banderier, Pawel Hitczenko:
  Enumeration and asymptotics of restricted compositions having the same number of parts. Discret. Appl. Math. 160(18): 2542-2554 (2012)
• 
  Manu Basavaraju, L. Sunil Chandran, T. Karthick:
  Maximum weight independent sets in hole- and dart-free graphs. Discret. Appl. Math. 160(16-17): 2364-2369 (2012)
• 
  Bojan Basic:
  Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words. Discret. Appl. Math. 160(1-2): 181-186 (2012)
• 
  Sylvain Béal, Eric Rémila, Philippe Solal:
  On the number of blocks required to access the core. Discret. Appl. Math. 160(7-8): 925-932 (2012)

skipping 250 more matches