![](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
David Forge
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Rigoberto Flórez
, David Forge:
Activity from matroids to rooted trees and beyond. J. Comb. Theory A 198: 105755 (2023)
2010 – 2019
- 2016
- [j19]David Forge, Thomas Zaslavsky:
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs. J. Comb. Theory B 118: 186-227 (2016) - 2015
- [j18]Sylvie Corteel, David Forge, Véronique Ventos:
Bijections between affine hyperplane arrangements and valued graphs. Eur. J. Comb. 50: 30-37 (2015) - 2010
- [c1]Henry Soldano, Véronique Ventos, Marc Champesme, David Forge:
Incremental Construction of Alpha Lattices and Association Rules. KES (2) 2010: 351-360
2000 – 2009
- 2009
- [j17]Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky:
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. Electron. J. Comb. 16(1) (2009) - [j16]Siham Bekkai, David Forge, Mekkia Kouider:
Covering the vertices of a graph with cycles of bounded length. Discret. Math. 309(8): 1963-1966 (2009) - [j15]David Forge, Adrien Vieilleribière:
The directed switching game on Lawrence oriented matroids. Eur. J. Comb. 30(8): 1833-1834 (2009) - [j14]David Forge, Thomas Zaslavsky
:
On the division of space by topological hyperplanes. Eur. J. Comb. 30(8): 1835-1845 (2009) - 2007
- [j13]David Forge, Mekkia Kouider:
Coverings of the Vertices of a Graph by Small Cycles. Graphs Comb. 23(2): 135-143 (2007) - [j12]David Forge, Thomas Zaslavsky
:
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements. J. Comb. Theory A 114(1): 97-109 (2007) - [j11]Rigoberto Flórez, David Forge:
Minimal non-orientable matroids in a projective plane. J. Comb. Theory A 114(1): 175-183 (2007) - 2004
- [j10]Raul Cordovil, David Forge, Sulamita Klein:
How is a chordal graph like a supersolvable binary matroid? Discret. Math. 288(1-3): 167-172 (2004) - 2003
- [j9]Raul Cordovil, David Forge:
A note on Tutte polynomials and Orlik-Solomon algebras. Eur. J. Comb. 24(8): 1081-1087 (2003) - 2002
- [j8]David Forge, Jorge L. Ramírez Alfonsín, H. Yeun:
Disconnected coverings for oriented matroids via simultaneous mutations. Discret. Math. 258(1-3): 353-359 (2002) - [j7]David Forge:
Bases in Orlik-Solomon Type Algebras. Eur. J. Comb. 23(5): 567-572 (2002) - 2001
- [j6]David Forge, Jorge L. Ramírez Alfonsín:
On reconstructing arrangements from their sets of simplices. Discret. Math. 226(1-3): 175-190 (2001) - [j5]David Forge, Jorge L. Ramírez Alfonsín:
On Counting the k-face Cells of Cyclic Arrangements. Eur. J. Comb. 22(3): 307-312 (2001) - [j4]David Forge, Michel Las Vergnas:
Orlik-Solomon Type Algebras. Eur. J. Comb. 22(5): 699-704 (2001) - [j3]David Forge, Michel Las Vergnas, Peter Schuchert:
10 Points in Dimension 4 not Projectively Equivalent to the Vertices of a Convex Polytope. Eur. J. Comb. 22(5): 705-708 (2001)
1990 – 1999
- 1998
- [j2]David Forge, Jorge L. Ramírez Alfonsín:
Straight Line Arrangements in the Real Projective Plane. Discret. Comput. Geom. 20(2): 155-161 (1998) - [j1]David Forge, Jorge L. Ramírez Alfonsín:
Connected coverings and an application to oriented matroids. Discret. Math. 187(1-3): 109-121 (1998)
Coauthor Index
![](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.
last updated on 2024-06-10 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