D-Index & Metrics Best Publications

Eugene C. Freuder

University College Cork
Ireland

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 36 Citations 9,812 178 World Ranking 7000 National Ranking 22

Research.com Recognitions

Awards & Achievements

2007 - Member of the Royal Irish Academy

2005 - Fellow of the American Association for the Advancement of Science (AAAS)

1995 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For fundamental and sustained contributions to the field of constraint-based reasoning.

Overview

What is he best known for?

The fields of study he is best known for:

Artificial intelligence
Algorithm
Programming language

His primary areas of investigation include Mathematical optimization, Constraint satisfaction problem, Constraint satisfaction, Local consistency and Constraint logic programming. Eugene C. Freuder has included themes like Stability, Set, Selection and Hybrid algorithm in his Mathematical optimization study. His Constraint satisfaction problem research is multidisciplinary, incorporating elements of Time complexity, Service, Data mining and Feature.

The concepts of his Local consistency study are interwoven with issues in Algorithm and Backtracking. His study explores the link between Backtracking and topics such as Constraint learning that cross with problems in Discrete mathematics. Constraint logic programming is a subfield of Constraint programming that Eugene C. Freuder tackles.

His most cited work include:

A Sufficient Condition for Backtrack-Free Search (607 citations)
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems (605 citations)
Partial constraint satisfaction (597 citations)

What are the main themes of his work throughout his whole career to date?

Eugene C. Freuder mainly investigates Constraint satisfaction, Constraint satisfaction problem, Mathematical optimization, Local consistency and Constraint programming. His study in Constraint satisfaction is interdisciplinary in nature, drawing from both Heuristics and Artificial intelligence. The various areas that Eugene C. Freuder examines in his Constraint satisfaction problem study include Algorithm, Backtracking and Theoretical computer science.

His Mathematical optimization research incorporates themes from Domain, Interchangeability, Variable and Hybrid algorithm. His Constraint programming study combines topics from a wide range of disciplines, such as Field, Discrete optimization, Combinatorial optimization and Holy Grail. His Constraint satisfaction dual problem research is multidisciplinary, relying on both Decomposition method and Constraint.

He most often published in these fields:

Constraint satisfaction (49.19%)
Constraint satisfaction problem (48.11%)
Mathematical optimization (46.49%)

What were the highlights of his more recent work (between 2003-2019)?

Constraint satisfaction problem (48.11%)
Mathematical optimization (46.49%)
Constraint programming (28.65%)

In recent papers he was focusing on the following fields of study:

His main research concerns Constraint satisfaction problem, Mathematical optimization, Constraint programming, Constraint satisfaction and Artificial intelligence. Eugene C. Freuder has researched Constraint satisfaction problem in several fields, including Heuristics and Backtracking. His Mathematical optimization study combines topics in areas such as Domain, Algorithm and Variable.

His Constraint programming research integrates issues from Theoretical computer science, Constraint, Holy Grail, Software engineering and Combinatorial optimization. His work on Local consistency and Constraint logic programming as part of general Constraint satisfaction research is often related to Bottleneck, thus linking different fields of science. Complexity of constraint satisfaction is closely connected to Decomposition method in his research, which is encompassed under the umbrella topic of Constraint satisfaction dual problem.

Between 2003 and 2019, his most popular works were:

Constraints and AI planning (61 citations)
Constraint Satisfaction: An Emerging Paradigm (51 citations)
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving (45 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Partial constraint satisfaction

Eugene C. Freuder;Richard J. Wallace.
Artificial Intelligence (1992)

1156 Citations

Partial constraint satisfaction

Eugene C. Freuder;Richard J. Wallace.
Artificial Intelligence (1992)

1144 Citations

A Sufficient Condition for Backtrack-Free Search

Eugene C. Freuder.
Journal of the ACM (1982)

1066 Citations

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Alan K. Mackworth;Eugene C. Freuder.
Artificial Intelligence (1985)

940 Citations

Synthesizing constraint expressions

Eugene C. Freuder.
Communications of The ACM (1978)

890 Citations

Contradicting Conventional Wisdom in Constraint Satisfaction

Daniel Sabin;Eugene C. Freuder.
principles and practice of constraint programming (1994)

694 Citations

A sufficient condition for backtrack-bounded search

Eugene C. Freuder.
Journal of the ACM (1985)

395 Citations

Eliminating interchangeable values in constraint satisfaction problems

Eugene C. Freuder.
national conference on artificial intelligence (1991)

348 Citations

Configuration as Composite Constraint Satisfaction

Daniel Sabin;Eugene C. Freuder.
(1996)

314 Citations

Complexity of K-tree structured constraint satisfaction problems

Eugene C. Freuder.
national conference on artificial intelligence (1990)

251 Citations

If you think any of the details on this page are incorrect, let us know.