Dallas J. Fraser

According to our database, Dallas J. Fraser authored at least 9 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Dowsing for Answers to Math Questions: Ongoing Viability of Traditional MathIR.

Yin Ki Ng, Dallas J. Fraser, Besat Kassaie, Frank Wm. Tompa

Proceedings of the Working Notes of CLEF 2021 - Conference and Labs of the Evaluation Forum, Bucharest, Romania, September 21st - to, 2021

Dowsing for Math Answers.

Yin Ki Ng, Dallas J. Fraser, Besat Kassaie, Frank Wm. Tompa

Proceedings of the Experimental IR Meets Multilinguality, Multimodality, and Interaction, 2021

2020

The Intersection of Two Vertex Coloring Problems.

Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia

Graphs Comb., 2020

Dowsing for Math Answers with Tangent-L.

Yin Ki Ng, Dallas J. Fraser, Besat Kassaie, George Labahn, Mirette S. Marzouk, Frank Wm. Tompa, Kevin Wang

Proceedings of the Working Notes of CLEF 2020, 2020

2018

On the Structure of (Even Hole, Kite)-Free Graphs.

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng

Graphs Comb., 2018

A coloring algorithm for -free line graphs.

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray

Discret. Appl. Math., 2018

Choosing Math Features for BM25 Ranking with Tangent-L.

Dallas J. Fraser, Andrew Kane, Frank Wm. Tompa

Proceedings of the ACM Symposium on Document Engineering 2018, 2018

2017

Characterizations of (4K1, C4, C5)-free graphs.

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia

Discret. Appl. Math., 2017

2015

A Coloring Algorithm for $4K_1$-free line graphs.

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng

CoRR, 2015