litceysel.ru
добавить свой файл
1 2
2. melléklet


Benczúr András tudományos közleményei és idézettsége


A kutatócsoport - témavezető tudománymetriai mutatói és publikációs jellemzői


A pályázó publikációinak száma:

60

A pályázó publikációinak összesített impaktfaktora: n/a

n/a

A pályázó hivatkozásainak száma: n/a

n/a

A pályázó független hivatkozásainak száma:

kb. 250

A pályázó H-indexe:

10

A pályázó által témavezetőként elnyert kutatási pályázatok száma

3


A pályázó 3 legfontosabbnak tartott publikációja


A pályázó publikációinak szerkezete:

• önálló (egyszerzős) publikációk száma

5

• elsőszerzős publikációk száma

32

• kevesebb, mint ötszerzős publikációk száma

43

• az elmúlt öt évben megjelent publikációk száma

39



A tudományterület folyóiratainak 1,5xIF-értékét meghaladó hivatkozottságú cikkek száma

A több, mint 5 hivatkozással rendelkező publikációk darabszám táblázata:


független hivatkozások száma

az ennyi független hivatkozással rendelkező publikációk száma

75

1

32

1

18

1

16

2

15

1

13

1

12

2

11

1

10

1

9

1

7

1

6

3



• legtöbbet hivatkozott cikke, az arra kapott hivatkozások száma, valamint adat arra vonatkozóan, hogy ez a szám milyen mértékben haladja meg a tudományterületi átlagot


A.A. Benczúr, K. Csalogány, T. Sarlós, SpamRank: Fully automatic link spam detection. In Proc. AIRWeb 2005. Information Retrieval, accepted for publication.

Független hivatkozások száma: 75


• a második legtöbbet hivatkozott cikke, az arra kapott hivatkozások száma, valamint hogy ez a szám milyen mértékben haladja meg a tudományterületi átlagot

Benczúr, A. A., Karger, D. R. Approximating s-t minimum cuts in O(n2) time. In Proc. 28th Annual ACM Symp. on Theory of Comp., pp. 47-55. (1996)


Független hivatkozások száma: 34


• a harmadik legtöbbet hivatkozott cikke, az arra kapott hivatkozások száma, valamint hogy ez a szám milyen mértékben haladja meg a tudományterületi átlagot


Benczúr, A. A., Frank, A. Covering symmetric supermodular functions by graphs Math. Prog. B 84(3): 483-503 (1999)

Független hivatkozások száma: 18


Folyóiratcikkek/Journal papers

Geographically Organized Small Communities and the Hardness of Clustering Social Networks, Miklós Kurucz and András A. Benczúr, Data Mining for Social Network Data, Annals of Information Systems, 2010, Volume 12, 177-199

B. Daróczy, Z. Fekete, M. Brendel, S. Rácz, A. A. Benczúr, D. Siklósi and A. Pereszlényi. SZTAKI @ ImageCLEF 2008: visual feature analysis in segmented images. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 9th Workshop of the Cross-Language Evaluation Forum, CLEF 2008, Revised Selected Papers. Springer LNCS

Miklós Kurucz, Dávid Siklósi, L Lukács, András A. Benczúr, K. Csalogány, András Lukács. Telephone Call Network Data Mining: A Survey with Experiments. Handbook of Large-Scale Random Networks. Springer Verlag in conjunction with the Bolyai Mathematical Society of Budapest, 2009.

András A. Benczúr and Michel X. Goemans. Deformable Polygon Representation and Near-Mincuts. M. Grötschel, Konrad-Zuse-Zentrum, Berlin, Germany; G.O.H. Katona, Hungarian Academy of Sciences, Budapest, Hungary (Eds.) Building Bridges Between Mathematics and Computer Science. Springer Verlag in conjunction with the Bolyai Mathematical Society of Budapest, 2008.

A. A. Benczúr, I. Bíró, M. Brendel, K. Csalogány, B. Daróczy, and D. Siklósi. Multimodal Retrieval by Text--Segment Biclustering. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers. Series: Lecture Notes in Computer Science , Vol. 5152


P. Schönhofen, A. A. Benczúr, I. Bíró, and K. Csalogány. Cross-language retrieval with Wikipedia. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers. Series: Lecture Notes in Computer Science , Vol. 5152

is cited by (13)

Maike Erdmann, Kotaro Nakayama, Takahiro Hara, and Shojiro Nishio. 2009. Improving the extraction of bilingual terminology from Wikipedia. ACM Trans. Multimedia Comput. Commun. Appl. 5, 4, Article 31 (November 2009), 17 pages.

and by

Tugba Bodrumlu, Kevin Knight, and Sujith Ravi. 2009. A new objective function for word alignment. In Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing (ILP '09). Association for Computational Linguistics, Stroudsburg, PA, USA, 28-35.

and by

Christof Müller and Iryna Gurevych. 2009. A study on the semantic relatedness of query and document terms in information retrieval. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3 (EMNLP '09), Vol. 3. Association for Computational Linguistics, Stroudsburg, PA, USA, 1338-1347.

and by

Nie, J.Y: Cross-language information retrieval, Synthesis Lectures on Human Language Technologies 3(1), pp. 1-125, 2010

and by

Filatova, E.: Multilingual wikipedia, summarization, and information trustworthiness. SIGIR Workshop on Information Access in a Multilingual World,, Boston, Massachusetts, 2009

and by

Filatova, E. Directions for exploiting asymmetries in multilingual Wikipedia, In Proceedings of the Third International Workshop on Cross Lingual Information Access: Addressing the Information Need of Multilingual Societies, pp 30-37, 2009, Association for Computational Linguistics


and by

Bodrumlu, T. and Knight, K. and Ravi, S., A new objective function for word alignment, In Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing, pp 28-35, 2009, Association for Computational Linguistics

and by

Erdmann, M. and Nakayama, K. and Hara, T. and Nishio, S., Improving the extraction of bilingual terminology from Wikipedia, ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP) 5(4), pp 1-17, 2009

and by

CLEF 2007: Ad hoc track overview
GM Di Nunzio, N Ferro, T Mandl, C Peters - 8 thWorkshop of the Cross-Language Evaluation Forum, CLEF, 2007

and by

Enriching the Crosslingual Link Structure of Wikipedia-A Classification-Based Approach
P Sorg, P Cimiano - Proceedings of the AAAI 2008 Workshop on Wikipedia and and Artificial Intelligence, 2008

and by

Cross-lingual Information Retrieval with Explicit Semantic Analysis
P Sorg, P Cimiano. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007

and by

WikiTranslate: Query Translation for Cross-lingual Information Retrieval using only Wikipedia
D Nguyen, A Overwijk, C Hauff, RB Trieschnigg, D. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007

and by

Christof M\&\#252;ller and Iryna Gurevych. 2008. Using Wikipedia and Wiktionary in domain-specific information retrieval. In Proceedings of the 9th Cross-language evaluation forum conference on Evaluating systems for multilingual and multimodal information access (CLEF'08), Carol Peters, Thomas Deselaers, Nicola Ferro, Julio Gonzalo, Anselmo Pe\&\#241;as, Gareth J. F. Jones, Mikko Kurimo, Thomas Mandl, and Vivien Petras (Eds.). Springer-Verlag, Berlin, Heidelberg, 219-226.



Deselaers, T. and Hanbury, A. and Viitaniemi, V. and Benczur, A. and Brendel, M. and Daroczy, B. and Hoi, S.C.H. and Laaksonen, J. and Li, M. and Castro, H.M.M. and others. Overview of the ImageCLEF 2007 object retrieval task. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL. 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers. Series: Lecture Notes in Computer Science , Vol. 5152

is cited by

The visual concept detection task in ImageCLEF 2008, Deselaers, T. and Hanbury, A., Evaluating Systems for Multilingual and Multimodal Information Access, pages 531-538, Springer, 2009

and by

Hernándeza, Jesus A. Gonzaleza, A. López-Lópeza, Manuel Montesa, Eduardo F. Moralesa, L. Enrique Sucara, Luis Villaseñora and Michael Grubinge. The segmented and annotated IAPR TC-12 benchmark. Computer Vision and Image Understanding Volume 114, Issue 4 Special issue on Image and Video Retrieval Evaluation, April 2010, Pages 419-428

and by

Stefanie Nowak, Allan Hanbury and Thomas Deselaers. ImageCLEF: The Information Retrieval Series, 2010, Volume 32, Part 2, 199-219, Object and Concept Recognition for Image Retrieval


Miklós Kurucz, András A. Benczúr, Tamás Kiss, István Nagy, Adrienn Szabó and Balázs Torma: KDD Cup 2007 task 1 winner report. KDD Explorations 2007. ACM New York, NY, USA.

is cited by: see conference version


A.A. Benczúr, K. Csalogány, T. Sarlós, SpamRank: Fully automatic link spam detection. Information Retrieval, accepted for publication

the conference version is cited by (75)

Flavio Chierichetti, Ravi Kumar, and Andrew Tomkins. 2010. Stochastic models for tabbed browsing. In Proceedings of the 19th international conference on World wide web (WWW '10). ACM, New York, NY, USA, 241-250


and by

Young-joo Chung, Masashi Toyoda, and Masaru Kitsuregawa. 2010. Identifying spam link generators for monitoring emerging web spam. In Proceedings of the 4th workshop on Information credibility (WICOW '10). ACM, New York, NY, USA, 51-58.

and by

Lourdes Araujo and Juan Martinez-Romo. 2010. Web spam detection: new classification features based on qualified link analysis and language models. Trans. Info. For. Sec. 5, 3 (September 2010), 581-590.

and by

Jöran Beel, Bela Gipp, Erik Wilde: Academic Search Engine Optimization (ASEO). Journal of Scholarly Publishing, Vol. 41, No. 2. (1 January 2010), pp. 176-190.

and by

Jöran Beel and Bela Gipp. 2010. On the robustness of google scholar against spam. In Proceedings of the 21st ACM conference on Hypertext and hypermedia (HT '10). ACM, New York, NY, USA, 297-298.

and by

Du, Y, Essays on the computation of economic equilibria and its applications, Ph.D. Thesis, University of Michigan, 2009.

and by

Dai, N. and Davison, B.D. and Qi, X., Looking into the past to better classify web spam, Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web, pp 1-8, 2009, ACM New York, NY, USA

and by

Metaxas, P.T., Web Spam, Social Propaganda and the Evolution of Search Engine Rankings, Web Information Systems and Technologies, 2010

and by

Mining the hyperlinks of the Web graph by Nie, Lan, Ph.D., LEHIGH UNIVERSITY, 2009, 218 pages

and by

M Louta. Blog Rating as an Iterative Collaborative Process. Semantics in Adaptive and Personalized Services, 2010

and by

Olston, C. and Najork, M . Web Crawling. Information Retrieval 4(3), 175-246, 2010

Andersen, R. and Borgs, C. and Chayes, J. and Hopcroft, J. and Mirrokni, V. and Teng, S.H. Local computation of PageRank contributions, Internet Mathematics 5(1), pp 23-45, 2009


and by

Metaxas, P.T., On the evolution of search engine rankings, Proceedings of the 5th WEBIST Conference, Lisbon, Portugal, 2009

and by

Uemura, T. and Ikeda, D. and Arimura, H., Unsupervised Spam Detection by Document Complexity Estimation, Proceedings of the 11th International Conference on Discovery Science, pp 331-338, 2008

and by

Zhang, X. and Han, B. and Liang, W., Automatic seed set expansion for trust propagation based anti-spamming algorithms, Proceeding of the eleventh international workshop on Web information and data management, pp 31-38, 2009

and by

Chung, Y. and Toyoda, M. and Kitsuregawa, M., Detecting Link Hijacking by Web Spammers, Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp 339-350, 2009

and by

Martinez-Romo, J., Web spam identification through language model analysis

Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web, pp 21-28, 2009, ACM New York, NY, USA

and by

Chung, Y. and Toyoda, M. and Kitsuregawa, M., A study of link farm distribution and evolution using a time series of web snapshots, Proceedings of the 5th International Workshop on Adversarial Information Retrieval on the Web, 9-16, ACM New York, NY, USA

and by


Yu, H. and Liu, Y. and Zhang, M. and Ru, L. and Ma, S., Web Spam Identification with User Browsing Graph, Information Retrieval Technology: 5th Asia Information Retrieval Symposium, AIRS 2009, Sapporo, Japan, October 21-23, 2009

and by

Pera, M.S. and Ng, Y.K.A structural, content-similarity measure for detecting spam documents on the web, International Journal of Web Information Systems 5(4), pp 431-464, 2009, Emerald Group Publishing Limited

and by

Zhou, B. and Pei, J., Link spam target detection using page farms, ACM Transactions on Knowledge Discovery from Data (TKDD) 3(3), pp 13-26, 2009


and by

Spam double-funnel: connecting web spammers with advertisers
YM Wang, M Ma, Y Niu, H Chen - Proc of the 16th WWW, 2007

and by

A Quantitative Study of Forum Spamming Using Context-based Analysis
Y Niu, YM Wang, H Chen, M Ma, F Hsu - Proc. Network and Distributed System Security (NDSS), 2007

and by

Using spam farm to boost PageRank
Y Du, Y Shi, X Zhao - Proc of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

Boosting the Performance of Web Spam Detection with Ensemble Under-Sampling Classification
GG Geng, CH Wang, QD Li, L Xu, XB Jin - Fuzzy Systems and Knowledge Discovery, 2007

and by

Countering web spam with credibility-based link analysis
J Caverlee, L Liu - Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, 2007

and by

Extracting link spam using biased random walks from spam seed sets
B Wu, K Chellapilla - Proc of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

A taxonomy of JavaScript redirection spam - ►www2007.org [PDF] 
K Chellapilla, A Maykov - Proc of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

Spam-resilient web rankings via influence throttling


Caverlee, J. and Webb, S. and Liu, L., Proc 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2007

and by

Local Computation of PageRank Contributions, Andersen, R. and Borgs, C. and Chayes, J. and Hopcraft, J. and Mirrokni, V.S. and Teng, S., LECTURE NOTES IN COMPUTER SCIENCE Volume 4863, 2007.

and by

A large-scale study of link spam detection by graph algorithms
H Saito, M Toyoda, M Kitsuregawa, K Aihara - Proc of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

Using Access Data for Paper Recommendations on ArXiv. org
S Pohl - Arxiv preprint arXiv:0704.2963, 2007

and by

Strider Search Ranger: Towards an Autonomic Anti-Spam Search Engine

Wang, Y.M. and Ma, M., Proc Fourth IEEE International Conference on Autonomic Computing, 2007

and by

Fighting Link Spam with a Two-Stage Ranking Strategy

Geng, G. and Wang, C. and Li, Q. and Zhu, Y., LECTURE NOTES IN COMPUTER SCIENCE volume 4425, 2007

and by

Combating Spamdexing: Incorporating Heuristics in Link-Based Ranking,

Abou-Assaleh, T. and Das, T., LECTURE NOTES IN COMPUTER SCIENCE, Volume 4936, 2008

and by

Robust PageRank and Locally Computable Spam Detection Features
R Andersen, C Borgs, J Chayes, J Hopcroft, K Jain, Proc of the AIRWeb'08 workshop in conjunction with WWW2008, 2008

and by

Maria Soledad Pera1 and Yiu-Kai Ng

Identifying Spam Web Pages Based on Content Similarity, Lecture Notes in Computer Science Volume 5073/2008, Computational Science and Its Applications – ICCSA 2008


and by

Fighting WebSpam: Detecting Spam on the Graph Via Content and Link Features,

Yang, Y. and Yang, S. and Hu, B., LECTURE NOTES IN COMPUTER SCIENCE volume 5012, 2008.

and by

Formalization of Link Farm Structure Using Graph Grammar
K Chobtham, A Surarerks, A Rungsawang - Advanced Information Networking and Applications, 2008

and by

The JXP Method for Robust PageRank Approximation in a Peer-to-Peer Web Search Network

Xavier-Parreira, J.; Castillo, C.; Donato, D.; Michel, S.; Weikum, G. VLDB Journal, Volume 16 (2007)

and by

Un-biasing the Link Farm Effect in PageRank Computation,

Rungsawang, A. and Puntumapon, K. and Manaskasemsak, B., Proc 21st IEEE International Conference on Advanced Networking and Applications, Pages 924-931, 2007

and by

Bin Zhou, Jian Pei and Zhaohui Tang. A Spamicity Approach to Web Spam Detection. In Proceedings of the 2008 SIAM International Conference on Data Mining

and by

Cleaning Search Results using Term Distance Features
J Attenberg, T Suel, Proc of the AIRWeb'08 workshop in conjunction with WWW2008, 2008

and by

Predicting web spam with HTTP session information


S Webb, J Caverlee, C Pu, Proceeding of the 17th ACM conference on Information and knowledge management, 2008

and by

Improving Spamdexing Detection Via a Two-Stage Classification Strategy

Geng, G.G. and Wang, C.H. and Li, Q.D., Information Retrieval Technology: 4th Asia Information Retrieval Symposium, 2008

and by

Link analysis for Web spam detection
L Becchetti, C Castillo, D Donato, R Baeza-YATES, ACM Transactions on the Web (TWEB) 2008

and by

Computing trusted authority scores in peer-to-peer web search networks - ►ethz.ch [PDF] 
JX Parreira, D Donato, C Castillo, G Weikum Proceedings of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

DirichletRank: Solving the zero-one gap problem of PageRank
X Wang, T Tao, JT Sun, A Shakery, C Zhai, ACM Transactions on Information Systems (TOIS) Volume 26 ,  Issue 2  (March 2008)

and by

New Metrics for Reputation Management in P2P Networks
C Castillo, G Cortese, D Donato, S Leonardi, Proceedings of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

Detecting splogs via temporal dynamics using self-similarity analysis
YR Lin, H Sundaram, Y Chi, J Tatemura, BL Tseng, ACM Transactions on the Web (TWEB) 2008

and by

The Juxtaposed approximate PageRank method for robust PageRank approximation in a peer-to-peer web search network, Parreira, J.X. and Castillo, C. and Donato, D. and Michel, S. and Weikum, G., The VLDB Journal The International Journal on Very Large Data Bases, 291-313}, 2008


and by

Improving web spam classifiers using link structure

Q Gan, T Suel - Proceedings of the AIRWeb'07 workshop in conjunction with WWW2007, 2007

and by

B. Wu, V. Goel, and B. D. Davison

Topical TrustRank: Using Topicality to Combat Web Spam.

In Proceedings of the 15th International World Wide Web Conference (WWW2006),

pages 63-72, Edinburgh, UK, 2006.

and by

B. Wu and B. D. Davison.

Propagating Trust and Distrust to Demote Web Spam

Workshop on Models of Trust for the Web (MTW '06) held in conjunction with

WWW2006, Edinburgh, UK, 2006.

and by

B. Wu and B. D. Davison

Undue Influence: Eliminating the Impact of Link Plagiarism on Web Search

Rankings.

Technical Report LU-CSE-05-014, Dept. of Computer Science and Engineering,

Lehigh University, 2005.

and by

L. Nie, B. Wu and B. D. Davison

Incorporating Trust into Web Search

Technical Report LU-CSE-06-034, Dept. of Computer Science and Engineering,

Lehigh University, December, 2006.

and by

A Carvalho, P-A Chirita, E de Moura, P Calado, and Wolfgang Nejdl

Site Level Noise Removal for Search Engines

In Proceedings of the 15th International World Wide Web Conference (WWW2006),

pages 73-82, Edinburgh, UK, 2006.

and by

A Ntoulas, M Najork, M Manasse, and D Fetterly

Detecting Spam Web Pages Through Content Analysis.

In Proceedings of the 15th International World Wide Web Conference (WWW2006),

pages 83-92, Edinburgh, UK, 2006.

and by

L Becchetti, C Castillo, D Donato, S Leonardi, R Baeza-Yates

Using Rank Propagation and Probabilistic Counting for Link-Based Spam Detection


In Proceedings of the Workshop on Web Mining and Web Usage Analysis (WebKDD)

held in conjunction with KDD-2006, Philadelphia, USA, August 2006. ACM Press

and by

L Becchetti, C Castillo, D Donato, S Leonardi, R Baeza-Yates

Link-Based Characterization and Detection of Web Spam

In Proceedings of the 2nd Workshop on Adversarial Information Retrieval

on the Web (AIRWeb) held in conjunction with SIGIR2006, Seattle, USA,

August 2006.

and by

Vijay Krishnan and Rashmi Raj

Web Spam Detection with Anti-Trust Rank

In Proceedings of the 2nd Workshop on Adversarial Information Retrieval

on the Web (AIRWeb) held in conjunction with SIGIR2006, Seattle, USA,

August 2006.

and by

K Chellapilla, DM Chickering

Improving Cloaking Detection Using Search Query Popularity and Monetizability

In Proceedings of the 2nd Workshop on Adversarial Information Retrieval

on the Web (AIRWeb) held in conjunction with SIGIR2006, Seattle, USA,

August 2006.

and by

Z Gyöngyi, P Berkhin, H Garcia-Molina, J Pedersen

Link Spam Detection Based on Mass Estimation

To appear in Proceedings of the 32nd International Conference on Very Large Data Bases

(VLDB), Seoul, Korea, 2006.

and by

Z Gyöngyi, H Garcia-Molina

Spam: It's Not Just for Inboxes Anymore

IEEE Computer Magazine, vol. 38, no. 10, pages 28-34, October 2005.

and by

K Narisawa, Y Yamada, D Ikeda, M Takeda

Detecting Blog Spams using the Vocabulary Size of All Substrings in Their Copies

In Proceedings of the 3rd Annual Workshop on the Weblogging Ecosystem

held in conjuction with WWW2006, Edinburgh UK, 23 May 2006.

and by

S Webb, J Caverlee, C Pu

Introducing the Webb Spam Corpus: Using Email Spam to Identify Web Spam

Automatically

In Proceedings of the Third Conference on Email and Anti-Spam (CEAS)

Mountain View, CA, USA, July 27-28, 2006

and by

G Shen, B Gao, T-Y Liu, S Song, and H Li, Microsoft Research Asia

Detecting Link Spam from Temporal Statistics of Websites,

In Proceedings of th 6th IEEE International Conference on Data Mining (ICDM),

Hong Kong, China, December 18-22, 2006

and by

Y Du, X Zhao

Boosting Strategies of Link Spamming

Technical Report, University of Michigan, 2006

and by

C Castillo, D Donato, A Gionis, V Murdock, F Silvestri

Know your Neighbors: Web Spam Detection using the Web Topology

SIGIR 2007

and by

C Castillo, D Donato, L Becchetti, P Boldi, M Santini, S Vigna

A Reference Collection for Web Spam

ACM SIGIR Forum, Volume 40, Issue 2, Pages 11-24, December 2006

and by

J-X Parreira, D Donato, C Castillo, G Weikum

Computing Trusted Authority Scores in Peer-to-Peer Networks

Submitted for publication, November 2006.

and by

Y Niu, Y-M Wang, H Chen, M Ma, and F Hsu

A Quantitative Study of Forum Spamming Using Context-based Analysis.

To appear in Proceedings of the 14th Annual Network and Distributed System

Security Symposium (NDSS), San Diego, CA, February, 2007.

and by

The Microsoft Research Strider Team

Strider Search Defender: Automatic and Systematic Discovery of Search

Spammers through Non-Content Analysis

Microsoft Research Technical Report MSR-TR-2006-97, 2006.

http://research.microsoft.com/searchdefender/


and by

I Drost

Developing Intelligent Search Engines

Invited talk & paper at the Science Track of the

22nd Chaos Communication Congress

Berlin, Germany, 27 December 2005

http://events.ccc.de/congress/2005/fahrplan/events/415.en.html

"Europe's biggest hacker congress" see http://en.wikipedia.org/wiki/Chaos_Computer_Club

and by

F Salvetti, N Nicolov

Spam Classification of Weblogs: A Language Model URLs Segmentation Approach,

Presentation at the HLT-NAACL 2006: Human Language Technology Conference,

New York City, NY, USA, 2006.


L. A. Végh, A. A. Benczúr

Primal-dual approach for directed vertex-connectivity augmentation and generalizations

ACM Transactions on Algorithms, 2007


is cited by

Cheriyan, J. and Cheriyan, J., Combinatorial optimization on k-connected graphs, Proc. ICRTGC--ICM satellite conference, 2010

and by

Bérczi, K. and Kobayashi, Y., An algorithm for (n-3)-connectivity augmentation problem: Jump system approach, METR 12, 2009

and by


A Weighted Kt, t-Free t-Factor Algorithm for Bipartite Graphs
K Takazawa - LECTURE NOTES IN COMPUTER SCIENCE, IPCO 2008

and by

Combinatorial algorithms for matchings, even factors and square-free 2-factors

G Pap

Mathematical Programming, 2007

András A. Benczúr, István Bíro, Károly Csalogány, Balázs Rácz, Tamás Sarlós, and Máté Uher: PageRank és azon túl: Hiperhivatkozások szerepe a keresésben (PageRank and Beyond: The Role of Hyperlinks in Search, in Hungarian). Magyar Tudomany, pp. 1325-1331, November 2006.


Benczúr, A. A.
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems,
Discrete Applied Mathematics, Elsevier Science Publishers BV Amsterdam, The Netherlands, Volume 129, Issue 2-3 (August 2003) Pages: 233 - 262, 2003
IF: 0,36/ 0.625

is cited by

Certificate Recommendations to Improve the Robustness of Web of Trust
Q Jiang, DS Reeves, P Ning - International Security Conference, 2004


Benczúr, A. A., Karger, D.R.
Augmenting undirected edge-connectivity in O(n2) time.
J. Alg 37(1):. 2-36 (2000)
IF: 0,468

is cited by (16)

Gaol, F.L. and Widjaja, B.H. Min Cut Contraction: Solving Edge Connectivity Problem using Graph Contraction, International Journal of Computational and Applied Mathematics 4(1), 59—73, 2009

and by

Hiroshi Nagamochi, Minimum Degree Orderings, Algorithmica Volume 56, Number 1, 17-34, , From the issue entitled "Special Issue: Algorithms and Computation; Guest Editor: Takeshi Tokuyama"

and by

Kong Yung, Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities, Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 2010, Volume 6080/2010, 96-109

and by

Cordone, R. and RIGHINI, G., Bounds and solutions for strategic, tactical and operational ambulance location, 8. Cologne-Twente workshop on graphs and combinatorial optimization: CTW 09: Paris, France, june 2-4, 2009

and by

CORDONE, R. and CESELLI, A. and CREMONINI, M., Balanced clustering for efficient detection of scientific plagiarism. 8. Cologne-Twente workshop on graphs and combinatorial optimization: CTW 09: Paris, France, june 2-4, 2009

and by

Sakashita, M. and Makino, K. and Fujishige, S., Minimizing a monotone concave function with laminar covering constraints, Discrete Applied Mathematics 156(11), pp 2004-2019, 2008, Elsevier


and by

Nagamochi, H., Minimum Degree Orderings, Algorithms and computation: 18th international symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007:

and by

Brinkmeier, M. and Fischer, M. and Grau, S. and Sch{\\"a}fer, G. and Strufe, T., Methods for Improving Resilience in Communication Networks and P2P Overlays, PIK-Praxis der Informationsverarbeitung und Kommunikation}, 32(1), pp 64-78, 2009

and by

H NAGAMOCHI, A Fast Edge-Splitting Algorithm in Edge-Weighted Graphs
IEICE Transactions on Fundamentals of Electronics, 2006

and by

CC Aggarwal, JB Orlin, On multiroute maximum flows in networks Networks (2002)

and by

H Nagamochi, T Ibaraki, Graph connectivity and its augmentation: applications of MA orderings Discrete Applied Mathematics (2002)

and by

K Arata, S Iwata, K Makino, S Fujishige, Locating sources to meet flow demands in undirected networks Journal of Algorithms (2002)


and the conference version is cited by

G. Even, J. Feldman, G. Kortsarz and Z. Nutov, A 3/2-approximation for augmenting a connected graph into a two-connected graph, Approx 2001, pages 90--101


and by

Fleischer L, Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time J ALGORITHM 33: (1) 51-72 OCT 1999


and by

Schwarz S, Krumke SO On budget-constrained flow improvement INFORM PROCESS LETT 66: (6) 291-297 JUN 30 1998


and by

Nagamochi H Recent development of graph connectivity augmentation algorithms IEICE T INF SYST E83D: (3) 372-383 MAR 2000


Benczúr, A. A.
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
Math. Prog. B 84(3):595-640 (1999)
IF: 1,052

is cited by

Jorgen Bang-Jensen and Tibor Jord\'an. Edge-connectivity augmentation preserving simplicity. In 38th Annual Symposium on Foundations of Computer Science, pages 486-495, Miami Beach, Florida, 20-22 October 1997.



Benczúr, A. A., Frank, A.
Covering symmetric supermodular functions by graphs
Math. Prog. B 84(3): 483-503 (1999)
IF: 1,052

is cited by (18)

Partition constrained covering of a symmetric crossing supermodular function by a graph, Bernáth, A. and Grappe, R. and Szigeti, Z.,Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA10).

and by

Zoltán Király, Ben Cosh, and Bill Jackson. 2010. Note: Local edge-connectivity augmentation in hypergraphs is NP-complete. Discrete Appl. Math. 158, 6 (March 2010), 723-727.

and by

Toshimasa Ishii, Yoko Akiyama and Hiroshi Nagamochi, Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs, Algorithmica Volume 56, Number 4, 413-436, 2010.

and by

Szigeti, Z., Edge-connectivity augmentations of graphs and hypergraphs, Research Trends in Combinatorial Optimization, Springer, Berlin, 2009

and by

Bernáth,A and Király Z, A new approach to splitting-off, Lecture Notes in Computer Science volume 5035, 2008

and by

Ishii, T., Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs, Discrete Optimization 6(1), pp 23-36, 2009, Elsevier

and by

Ishii, T. and Makino, K., Augmenting edge-connectivity between vertex subsets, Proceedings of Computing Theory: The Australian Theory Symposium, 2008

and by

Covering symmetric semi-monotone functions
R Grappe, Z Szigeti - Discrete Applied Mathematics, 2008

and by

Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs

T Ishii - Proceedings of the thirteenth Australasian symposium on Theory of computing


and by

Tight approximation algorithm for connectivity augmentation problems 
G Kortsarz, Z Nutov - Journal of Computer and System Sciences, 2008

and by

Approximating minimum cost connectivity problems

G Kortsarz, Z Nutov - Handbook of Approximation Algorithms and Metaheuristics, 2007

and by

Kiraly, T.: Overing symmetric supermodular functions by uniform hypergraphs Egervary Research Group on Combinatorial Optimization. Technical reports. TR-2002-02. submitted (Journal of Combinatorial Theory Series B)


and by

Kiraly, T.: Edge-connectivity of undirected and directed hypergraphs Ph. D. Thesis, Eotvos University, Budapest (2003)


and by

Z Kiraly, B Cosh, B Jackson, Q Mary Local Connectivity Augmentation in Hypergraphs is NP-complete, submitted for publication to Discrete Applied Mathematics


and by

B. Cosh, Vertex Splitting and Connectivity Augmentation in Hypergraphs A thesis submitted for the degree of. Doctor of Philosophy. Goldsmiths' College (2004)


and by

Nagamochi H, Shiraki T, Ibaraki T Augmenting a submodular and posi-modular set function by a multigraph J COMB OPTIM 5 (2): 175-212 JUN 2001


and by

Nagamochi H Recent development of graph connectivity augmentation algorithms IEICE T INF SYST E83D: (3) 372-383 MAR 2000


and by

Fleiner, Tam\'as and Tibor Jord\'an, Coverings and structure of crossing families, Math. Prog. B 84(3):505--518 (1999)


Benczúr, A.
Counterexamples for directed and node capacitated cut-trees

Siam Journal on Computing 24 (3):505-510 (1995)

IF: 0,65

Is cited by (9)

Barth, D. and Berthome, P. and Diallo, M. and Ferreira, A.Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations, Discrete Optimization 3(3), pp 195—205, 2006.

and by

Algorithms for the minimum partitioning problems in graphs
H Nagamochi - Electronics and Communications in Japan. Part 3, Fundamental Electronic Science, 2007

and by

Liang Zhao, Hiroshi Nagamochi and Toshihide Ibaraki

Greedy splitting algorithms for approximating multiway partition problems

Journal Mathematical Programming

Issue Volume 102, Number 1 / January, 2005

Pages 167-183


and by

Shape from color consistency using node cut
N Xu, T Yu, N Ahuja - Proc. of Asian Conference on Computer Vision, Jan, 2004

and by


Greedy splitting algorithms for approximating multiway partition problems

L Zhao, H Nagamochi, T Ibaraki

Mathematical Programming, 2005 - Springer

and by

Excluding a Simple Good Pair Approach to Directed Cuts
R Rizzi - Graphs and Combinatorics, 2001


and by

An Õ (mn) Gomory-Hu tree construction algorithm for unweighted graphs
R Hariharan, T Kavitha, D Panigrahi, A Bhalgat

Proceedings of the thirty-ninth annual ACM STOC, 2007


and by

Note: Flow trees for vertex-capacitated networks
R Hassin, A Levin - Discrete Applied Mathematics, 2007

and by

Flow equivalent trees in undirected node-edge-capacitated planar graphs
X Zhang, W Liang, H Jiang - Information Processing Letters, 2006




следующая страница >>