Cristian Frasinaru

According to our database1, Cristian Frasinaru authored at least 16 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Graph4J - A computationally efficient Java library for graph algorithms.
CoRR, 2023

2022
Improving lower bounds for equitable chromatic number.
Comput. Oper. Res., 2022

2021
Generating multi depot vehicle scheduling problems with known optimal tours.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, 2021

A Branch and Price Algorithm for Coalition Structure Generation over Graphs.
Proceedings of the 13th International Conference on Agents and Artificial Intelligence, 2021

2020
A Branch and Bound Algorithm for Coalition Structure Generation over Graphs.
CoRR, 2020

Multiple-Depot Vehicle Scheduling Problem Heuristics.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

A Case Study on Performance Optimization Techniques in Java Programming.
Proceedings of the 15th International Conference on Software Technologies, 2020

2019
Greedy Best-First Search for the Optimal-Size Sorting Network Problem.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES-2019, 2019

An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

2018
New Evolutionary Approaches for SAT Solving.
Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

2014
A Lowest Level Rule Push-Relabel Algorithm for Submodular Flows and Matroid Optimization.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

Efficient Representation of Extensional Constraints.
Proceedings of the Graph-Based Representation and Reasoning, 2014

2013
Reducing the Number of Useless Revisions Performed by Constraint Solvers Based on AC-3.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

2007
Basic Techniques for Creating an Efficient CSP Solver.
Sci. Ann. Comput. Sci., 2007

2004
Hardly perfect graphs.
Sci. Ann. Cuza Univ., 2004

1998
Exploring Unknown Undirected Graphs.
Sci. Ann. Cuza Univ., 1998


  Loading...