![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 67 matches
- 2024
- Hooman Reisi Dehkordi, Graham Farr:
Thrackles, Superthrackles and the Hanani-Tutte Theorem. J. Graph Algorithms Appl. 28(1): 95-127 (2024) - Kashif Naseer Qureshi, Garret O'Keeffe, Shane O'Farrell, Graham Costelloe:
Cybersecurity Standards and Policies for CPS in IoE. Cybersecurity Vigilance and Security Engineering of Internet of Everything 2024: 177-192 - Graham Farr, Kerri Morgan:
Graph polynomials: some questions on the edge. CoRR abs/2406.15746 (2024) - 2023
- Jinqiang Yu, Graham Farr, Alexey Ignatiev
, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. CoRR abs/2312.06973 (2023) - 2021
- Hooman Reisi Dehkordi, Graham Farr:
Non-Separating Planar Graphs. Electron. J. Comb. 28(1): 1 (2021) - Hooman Reisi Dehkordi, Graham Farr:
On the Strong Hanani-Tutte Theorem. Electron. J. Comb. 28(1): 1 (2021) - Kai Siong Yow
, Kerri Morgan
, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. Graphs Comb. 37(6): 2245-2264 (2021) - 2020
- Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan:
A survey of repositories in graph theory. CoRR abs/2006.12741 (2020) - 2019
- Zoë Bukovac, Graham Farr, Kerri Morgan
:
Short certificates for chromatic equivalence. J. Graph Algorithms Appl. 23(2): 227-269 (2019) - Graham Farr:
Using Go in teaching the theory of computation. SIGACT News 50(1): 65-78 (2019) - Aditi Chaudhary, Siddharth Dalmia, Junjie Hu, Xinjian Li, Austin Matthews, Aldrian Obaja Muis, Naoki Otani, Shruti Rijhwani, Zaid Sheikh, Nidhi Vyas, Xinyi Wang, Jiateng Xie, Ruochen Xu, Chunting Zhou, Peter J. Jansen, Yiming Yang, Lori S. Levin, Florian Metze, Teruko Mitamura, David R. Mortensen, Graham Neubig, Eduard H. Hovy, Alan W. Black, Jaime G. Carbonell, Graham Horwood, Shabnam Tafreshi, Mona T. Diab, Efsun Sarioglu Kayi, Noura Farra, Kathleen R. McKeown:
The ARIEL-CMU Systems for LoReHLT18. CoRR abs/1902.08899 (2019) - 2018
- Graham E. Farr, Andrew Y. Z. Wang:
Powerful Sets: a Generalisation of Binary Matroids. Electron. J. Comb. 25(3): 3 (2018) - Graham Farr, Nhan Bao Ho
:
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games. Theor. Comput. Sci. 732: 46-59 (2018) - Kai Siong Yow, Graham Farr, Kerri Morgan:
Tutte Invariants for Alternating Dimaps. CoRR abs/1803.05539 (2018) - Kai Siong Yow, Kerri Morgan, Graham Farr:
Factorisation of Greedoid Polynomials of Rooted Digraphs. CoRR abs/1809.02924 (2018) - 2017
- Rebecca Robinson, Graham Farr:
Topological containment of the 5-clique minus an edge in 4-connected graphs. CoRR abs/1705.01224 (2017) - 2016
- Leonard Hoon
, Milica Stojmenovic, Rajesh Vasa
, Graham Farrell:
Spreading word: author frequency of app user reviews. OZCHI 2016: 643-645 - Graham Farr, A. Barbara Ainsworth, Chris Avram, Judy Sheard:
Computer History on the Move. SIGCSE 2016: 528-533 - 2015
- Graham Farr:
Cost-effectiveness of algorithms. Discret. Math. Theor. Comput. Sci. 17(1): 201-218 (2015) - Graham Farrell, Robert T. Tipping, Vivienne Farrell, Clinton J. Woodward:
Trialling the use of Tablets in Australian Courts: The Jury is Still Out... OZCHI 2015: 483-491 - 2014
- Ranjie Mo, Graham Farr, Kerri Morgan:
Certificates for Properties of Stability Polynomials of Graphs. Electron. J. Comb. 21(1): 1 (2014) - Rebecca Robinson
, Graham Farr:
Graphs with no 7-wheel subdivision. Discret. Math. 327: 9-28 (2014) - Robert T. Tipping, Graham Farrell, Vivienne Farrell, Clinton J. Woodward:
From collection to courtroom: perceptions and realities of how the data flows. OZCHI 2014: 107-110 - 2013
- Morteza Farrokhsiar, Graham Pavlik, Homayoun Najjaran
:
An integrated robust probing motion planning and control scheme: A tube-based MPC approach. Robotics Auton. Syst. 61(12): 1379-1391 (2013) - Vivienne Farrell, Graham Farrell, Paul Kindler, Gilbert Ravalli, David Hall:
Capstone project online assessment tool without the paper work. ITiCSE 2013: 201-206 - Graham Farrell, Robert T. Tipping, Vivienne Farrell, Clinton J. Woodward:
Trial by tablet: user evaluation of the digital courtroom. OZCHI 2013: 325-328 - Rebecca Robinson, Graham Farr:
Graphs with no 7-wheel subdivision. CoRR abs/1311.0573 (2013) - Rebecca Robinson, Graham Farr:
Search strategies for developing characterizations of graphs without small wheel subdivisions. CoRR abs/1311.0574 (2013) - 2012
- Keith Edwards, Graham Farr:
Improved Upper Bounds for Planarization and Series-Parallelization of Degree-Bounded Graphs. Electron. J. Comb. 19(2): 25 (2012) - Kerri Morgan
, Graham Farr:
Non-bipartite chromatic factors. Discret. Math. 312(6): 1166-1170 (2012)
skipping 37 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-08-06 07:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint