Automated application processing

[1]  Q. Lin,et al.  A Scheduling Optimization Algorithm based on Graph Theory and Simulated Annealing , 2021, 2021 6th International Conference on Inventive Computation Technologies (ICICT).

[2]  Lijun Chang,et al.  Effective and Efficient Dynamic Graph Coloring , 2017, Proc. VLDB Endow..

[3]  Shibamouli Lahiri,et al.  Matching Graduate Applicants with Faculty Members , 2017, SocInfo.

[4]  Manar I. Hosny,et al.  Time efficient demon algorithm for graph coloring with search cut-off property , 2014, 2014 Science and Information Conference.

[5]  Ammar Elhassan,et al.  Graph-coloring for course scheduling — A comparative analysis based on course selection order , 2014, The Third International Conference on e-Technologies and Networks for Development (ICeND2014).

[6]  R. Sproull,et al.  Subsection , 2012, Definitions.

[7]  Fangzhen Ge,et al.  Chaotic ant swarm for graph coloring , 2010, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[8]  Karthik Visweswariah,et al.  PROSPECT: a system for screening candidates for recruitment , 2010, CIKM.

[9]  Amal Dandashi,et al.  Graph Coloring for class scheduling , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.

[10]  Sikun Li,et al.  Extending Traditional Graph-Coloring Register Allocation Exploiting Meta-heuristics for Embedded Systems , 2007, Third International Conference on Natural Computation (ICNC 2007).

[11]  Fabrice Rastello,et al.  Register Allocation: What does Chaitin's NP-completeness Proof Really Prove? , 2006 .

[12]  Habiba Drias,et al.  Ant Colony System for Graph Coloring Problem , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[13]  TaeChoong Chung,et al.  Modified ant colony system for coloring graphs , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.

[14]  Saeid Nahavandi,et al.  Simulation optimization for process scheduling through simulated annealing , 2002, Proceedings of the Winter Simulation Conference.

[15]  Tad Hogg,et al.  Graph coloring with quantum heuristics , 2002, AAAI/IAAI.

[16]  Hinrich Schütze,et al.  Book Reviews: Foundations of Statistical Natural Language Processing , 1999, CL.

[17]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[18]  Andrew V. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1989, JACM.

[19]  Éva Tardos,et al.  An O(n2(m + Nlog n)log n) min-cost flow algorithm , 1988, JACM.

[20]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[21]  Éva Tardos,et al.  An O(n2(m + n log n) log n) min-cost flow algorithm , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[22]  Gregory J. Chaitin,et al.  Register allocation & spilling via graph coloring , 1982, SIGPLAN '82.

[23]  Nirbhay K. Mehta.  The Application of a Graph Coloring Method to an Examination Scheduling Problem , 1981 .

[24]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[25]  Roman V. Yampolskiy,et al.  Genetic Algorithm Applied to the Graph Coloring Problem , 2012, MAICS.

[26]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[27]  Yves Robert,et al.  Laboratoire de l'Informatique du Parallélisme , 2005 .

[28]  Elearn Limited,et al.  Information and knowledge management , 2005 .

[29]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[30]  A. Goldberg,et al.  Finding minimum-cost circulations by canceling negative cycles , 1988, STOC '88.