default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Woldar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j21]Vasyl Ustimenko, Andrew J. Woldar:
A geometric approach to orbital recognition in Chevalley-type coherent configurations and association schemes. Australas. J Comb. 67: 166-202 (2017)- 2010
- [j20]Mikhail H. Klin, Christian Pech
, Sven Reichard, Andrew J. Woldar, Matan Ziv-Av:
Examples of computer experimentation in algebraic combinatorics. Ars Math. Contemp. 3(2): 237-258 (2010)
2000 – 2009
- 2009
- [p1]Mikhail H. Klin, Sven Reichard, Andrew J. Woldar:
Siamese Combinatorial Objects via Computer Algebra Experimentation. Algorithmic Algebraic Combinatorics and Gröbner Bases 2009: 67-112 - 2007
- [j19]Mikhail H. Klin, Mikhail E. Muzychuk, Christian Pech, Andrew J. Woldar, Paul-Hermann Zieschang:
Association schemes on 28 points as mergings of a half-homogeneous coherent configuration. Eur. J. Comb. 28(7): 1994-2025 (2007) - [j18]Felix Lazebnik, Oleg Pikhurko, Andrew J. Woldar:
Maximum number of colorings of (2k, k2)-graphs. J. Graph Theory 56(2): 135-148 (2007) - 2003
- [j17]Vasiliy A. Ustimenko, Andrew J. Woldar:
Extremal properties of regular and affine generalized m-gons as tactical configurations. Eur. J. Comb. 24(1): 99-111 (2003) - 2001
- [j16]Felix Lazebnik, Andrew J. Woldar:
General properties of some families of graphs defined by systems of equations. J. Graph Theory 38(2): 65-86 (2001) - 2000
- [j15]Felix Lazebnik, Andrew J. Woldar:
General Properties of Some Graphs Defined by Systems of Equations. Electron. Notes Discret. Math. 5: 206-209 (2000) - [j14]Felix Lazebnik, Andrew J. Woldar:
New Lower Bounds on the Multicolor Ramsey Numbers rk(C4). J. Comb. Theory B 79(2): 172-176 (2000)
1990 – 1999
- 1999
- [j13]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Polarities and 2k-cycle-free graphs. Discret. Math. 197-198: 503-513 (1999) - [j12]Joe Hemmeter, Andrew J. Woldar:
The Complete List of Maximal Cliques of Quad(n, q), q Even. Eur. J. Comb. 20(1): 81-85 (1999) - 1998
- [j11]Joe Hemmeter, Vasya J. Ustimenko, Andrew J. Woldar:
Orbital Schemes of B3(q) Acting on 2-Dimensional Totally Isotropic Subspaces. Eur. J. Comb. 19(4): 487-498 (1998) - 1997
- [j10]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New upper bounds on the order of cages. Electron. J. Comb. 4(2) (1997) - 1996
- [j9]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
A characterization of the components of the graphs D(k, q). Discret. Math. 157(1-3): 271-283 (1996) - 1995
- [j8]Andries E. Brouwer, Joe Hemmeter, Andrew J. Woldar:
The complete list of maximal cliques of Quad(n, q), q odd. Eur. J. Comb. 16(2): 107-110 (1995) - [j7]Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory B 64(2): 228-239 (1995) - 1994
- [j6]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
Properties of Certain Families of 2k-Cycle-Free Graphs. J. Comb. Theory B 60(2): 293-298 (1994) - [j5]Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar:
New Constructions of Bipartite Graphs on m, n Vertices with Many Edges and Without Small Cycles. J. Comb. Theory B 61(1): 111-117 (1994) - 1991
- [j4]Gary L. Ebert, Joe Hemmeter, Felix Lazebnik, Andrew J. Woldar:
On the number of irregular assignments on a graph. Discret. Math. 93(2-3): 131-142 (1991) - 1990
- [j3]Joe Hemmeter, Andrew J. Woldar:
On the Maximal Cliques of the Quadratic Forms Graph in Even Characteristic. Eur. J. Comb. 11(2): 119-126 (1990) - [j2]Joe Hemmeter, Andrew J. Woldar:
Classification of the Maximal Cliques of Size ⩾q + 4 m the Quadratic Forms Graph in Odd Characteristic. Eur. J. Comb. 11(5): 433-449 (1990)
1980 – 1989
- 1989
- [j1]Andrew J. Woldar:
A combinatorial approach to the character theory of split metabelian groups. J. Comb. Theory A 50(1): 100-109 (1989)
Coauthor Index
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 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
